Algorithm Analysis - Basics

This post is based on notes after attending Algorithms I classes at Coursera. Lecture on Analysis of Algorithms is very good. Couple of interesting snapshots/ questions captured during the course posted below

This can be computed to 1000000 / log (1000000) = 100000/6 = 1,66,6666. This should be the right answer I believe.

Another interesting slide - Order of Growth

• Big-O is an upper bound.
• Big-Theta is a tight bound, i.e. upper and lower bound.Link

Another Interesting Question

 

Good Explanation of Answer - Dropping Eggs from a Building - 100 Story Building Famous Google Puzzle

 

 

Happy Learning!!! 

Security Papers and Articles

Exploit Database has a huge repository of Security Papers and Articles.

Couple of interesting papers

• Distributed Denial of Service Attacks: Explain nation, classification and suggested Solutions
• Ragey’s Cross Site Scripting Worm Proof of Concept
• Buffer Overflows: Anatomy of an Exploit
• Microsoft Patch Analysis (Old but Good One)

Happy Learning!!!

SQL Server - Index Tuning Basics

SQL Server Query Tuning Session. - One more session to add to SQL Tuning list.

Useful pointers from the session. Couple of pointers are covered in previous posts as well.

Optimizer's choice of Join
Nested Loop Join

• Outer input is small
• Inner input has an index on the join key

Merge Join

• Medium to large inputs
• Sorted inputs and equality operator required

Hash Join

• Large inputs
• Requires equality operator, inputs need not be sorted

MAXDOP Option - 1 (Ensure single processor for execution)
Density - How many distinct values available in a particular column
Multi Column Index

• Index can be used to seek on second column if there is an equality operator on first column

Guildeline - Most Selective column should be first column where all other column predicates use the equality operator

Happy Learning!!!