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

• DFS

• Back Tracking

• Optimization Problem

• Branch& Bound

• Job Sequencing With deadLines

• Dynamic programming

• MINIMIZATION PROBLEM

• Divide conquer

• MERGE SORT

• Greedy

Organize these options into the right categories

Groups:

(a) TREES

,

(b) GRAPHS

,

(c) CHARACTERSTICS OF ALGORITHM

,

(d) ASYMPTITIC NOTATIONS

• COMPLETENESS
• DIRECTED
• EULER

• WEIGHTED
• THETA

• UNDIRECTED
• UN -AMBIGUIOUS

• HEAP
• BIG-0

• STATE SPACE TREE

• LITTLE-O
• ISOMORPHIC

• BINARY SEARCH TREE
• BIG-OMEGA
• AVL

• LITTLE-OMEGA
• FINITENESS

• SPANNING

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 ______?