advanced data structures algorithm& anlaysis
Authored by Khaleel S
Information Technology (IT)
University
Used 5+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
8 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
TIME COMPLEXITY OF QUICK SORT
O(N Log N)
O(n)
n^2
n^3
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
BEST CASE TIME COMPLEXITY OF QUICK SORT
O(N Log N)
O(n)
n^2
O(1)
3.
MATCH QUESTION
1 min • 5 pts
Match The following
MINIMIZATION PROBLEM
Greedy
MERGE SORT
Back Tracking
Optimization Problem
Branch& Bound
DFS
Divide conquer
Job Sequencing With deadLines
Dynamic programming
4.
CATEGORIZE QUESTION
1 min • 4 pts
Organize these options into the right categories
Groups:
(a) TREES
,
(b) GRAPHS
,
(c) CHARACTERSTICS OF ALGORITHM
,
(d) ASYMPTITIC NOTATIONS
EULER
THETA
ISOMORPHIC
UN -AMBIGUIOUS
FINITENESS
SPANNING
BIG-0
AVL
STATE SPACE TREE
5.
FILL IN THE BLANKS QUESTION
45 sec • 1 pt
0/1 KNAP SACK IS WHAT KIND OF PROBLEM
(a)
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Back Tracking Algorithm runs in _____________time complexity
Exponential
polynomial
Linear
Logarithamic
7.
FILL IN THE BLANKS QUESTION
1 min • 1 pt
Branch and Bound Follows what Techniques to solve ?
(a)
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
