Font size
S
M
L
XL
Worksheetsadvanced data structures algorithm& anlaysis
Total questions: 8
Worksheet time: 7mins
Name
Class
Date
1.
TIME COMPLEXITY OF QUICK SORT
a)
O(N Log N)
b)
O(n)
c)
n^2
d)
n^3
2.
BEST CASE TIME COMPLEXITY OF QUICK SORT
a)
O(N Log N)
b)
O(n)
c)
n^2
d)
O(1)
3.
Match The following
a)
Back Tracking
1.
DFS
b)
Dynamic programming
2.
Optimization Problem
c)
Divide conquer
3.
MERGE SORT
d)
Branch& Bound
4.
MINIMIZATION PROBLEM
e)
Greedy
5.
Job Sequencing With deadLines
4.
Organize these options into the right categories
Categorize the following
SPANNING
ISOMORPHIC
FINITENESS
THETA
AVL
EULER
STATE SPACE TREE
UN -AMBIGUIOUS
BIG-0
BINARY SEARCH TREE
HEAP
DIRECTED
UNDIRECTED
WEIGHTED
COMPLETENESS
BIG-OMEGA
LITTLE-O
LITTLE-OMEGA
TREES
GRAPHS
CHARACTERSTICS OF ALGORITHM
ASYMPTITIC NOTATIONS
5.
0/1 KNAP SACK IS WHAT KIND OF PROBLEM
(a)
6.
Back Tracking Algorithm runs in _____________time complexity
a)
Exponential
b)
polynomial
c)
Linear
d)
Logarithamic
7.
Branch and Bound Follows what Techniques to solve ?
(a)
8.
IN TRAVELLING SALES PERSON PROBLEM EVENTUALLY WE FIND (a) ?
Reset
