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

• MINIMIZATION PROBLEM

• Back Tracking

• MERGE SORT

• Greedy

• DFS

• Dynamic programming

• Optimization Problem

• Divide conquer

• Job Sequencing With deadLines

• Branch& Bound

Organize these options into the right categories

Groups:

(a) TREES

,

(b) GRAPHS

,

(c) CHARACTERSTICS OF ALGORITHM

,

(d) ASYMPTITIC NOTATIONS

• UNDIRECTED
• STATE SPACE TREE

• BINARY SEARCH TREE
• THETA

• BIG-0

• UN -AMBIGUIOUS

• LITTLE-O
• AVL

• HEAP
• FINITENESS

• ISOMORPHIC

• WEIGHTED
• COMPLETENESS
• DIRECTED
• BIG-OMEGA
• LITTLE-OMEGA
• EULER

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