Time Left - 05:00 mins
BARC CS 2018 Nuclear Quiz - 4(Algo)
Attempt now to get your rank among 704 students!
Question 1
Which of the following statements is true for Branch – and – Bound search?
Question 2
The worst case time complexity of AVL tree is better in comparison to binary search tree for
Question 3
Which one of the following statements is incorrect?
Question 4
A hash function f defined as f(key) = key mod 7, with linear probing used to resolve collisions. Insert the keys 37, 38, 72, 48, 98 and 11 into the table indexed from 0 to 6. What will be the location of 11
Question 5
Which of the following algorithms sort in integers, having the range 0 to 
in ascending order in 
time?
in ascending order in time? - 704 attempts
- 4 upvotes
- 12 comments
Tags :
GATE & PSU CSAlgorithmsApr 6GATE & PSU CS
