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

• MERGE SORT

• Branch& Bound

• DFS

• Back Tracking

• MINIMIZATION PROBLEM

• Dynamic programming

• Optimization Problem

• Greedy

• Job Sequencing With deadLines

• Divide conquer

Organize these options into the right categories

Groups:

(a) TREES

,

(b) GRAPHS

,

(c) CHARACTERSTICS OF ALGORITHM

,

(d) ASYMPTITIC NOTATIONS

• SPANNING

• UNDIRECTED
• BIG-0

• DIRECTED
• LITTLE-OMEGA
• COMPLETENESS
• FINITENESS

• BIG-OMEGA
• EULER

• THETA

• HEAP
• STATE SPACE TREE

• LITTLE-O
• ISOMORPHIC

• AVL

• UN -AMBIGUIOUS

• BINARY SEARCH TREE
• WEIGHTED

0/1 KNAP SACK IS WHAT KIND OF PROBLEM

(a)  

Back Tracking Algorithm runs in _____________time complexity

• Exponential

• polynomial

• Linear

• Logarithamic

Branch and Bound Follows what Techniques to solve ?

(a)  

IN TRAVELLING SALES PERSON PROBLEM EVENTUALLY WE FIND (a)   ?