advanced data structures algorithm& anlaysis

TIME COMPLEXITY OF QUICK SORT

• O(N Log N)

• O(n)

• n^2

• n^3

BEST CASE TIME COMPLEXITY OF QUICK SORT

• O(N Log N)

• O(n)

• n^2

• O(1)

Match The following

• Optimization Problem

• Divide conquer

• MINIMIZATION PROBLEM

• Branch& Bound

• MERGE SORT

• Dynamic programming

• DFS

• Greedy

• Job Sequencing With deadLines

• Back Tracking

Organize these options into the right categories

Groups:

(a) TREES

,

(b) GRAPHS

,

(c) CHARACTERSTICS OF ALGORITHM

,

(d) ASYMPTITIC NOTATIONS

• THETA

• LITTLE-O
• COMPLETENESS
• AVL

• HEAP
• FINITENESS

• STATE SPACE TREE

• SPANNING

• UNDIRECTED
• ISOMORPHIC

• DIRECTED
• EULER

• UN -AMBIGUIOUS

• WEIGHTED
• BIG-0

• LITTLE-OMEGA
• BIG-OMEGA
• BINARY SEARCH TREE

0/1 KNAP SACK IS WHAT KIND OF PROBLEM

Back Tracking Algorithm runs in _____________time complexity

• Exponential

• polynomial

• Linear

• Logarithamic

Branch and Bound Follows what Techniques to solve ?

IN TRAVELLING SALES PERSON PROBLEM EVENTUALLY WE FIND ______?