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

• Divide conquer

• Optimization Problem

• Branch& Bound

• MERGE SORT

• Dynamic programming

• Job Sequencing With deadLines

• Greedy

• MINIMIZATION PROBLEM

• Back Tracking

Organize these options into the right categories

Groups:

(a) TREES

,

(b) GRAPHS

,

(c) CHARACTERSTICS OF ALGORITHM

,

(d) ASYMPTITIC NOTATIONS

• LITTLE-OMEGA
• THETA

• SPANNING

• UN -AMBIGUIOUS

• ISOMORPHIC

• COMPLETENESS
• HEAP
• UNDIRECTED
• BINARY SEARCH TREE
• WEIGHTED
• STATE SPACE TREE

• BIG-OMEGA
• AVL

• DIRECTED
• BIG-0

• EULER

• FINITENESS

• LITTLE-O

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