Question 41 : Quickselect is an example of ___________
1. sorting algorithm
2. selection algorithm
3. greedy algorithm
4. searching algorithm
View Answer   Discuss with Members

Question 42 : Topological sort can be implemented by?
1. Using Depth First Search
2. Using Breadth First Search
3. Using Depth and Breadth First Search
4. None of the mentioned
View Answer   Discuss with Members

Question 43 : Topological sort of a Directed Acyclic graph is?
1. Always unique
2. Always Not unique
3. Sometimes unique and sometimes not unique
4. None of the mentioned
View Answer   Discuss with Members

Question 44 : What is the need for co-ordinate compression?
1. for improving time complexity
2. for improving space complexity
3. for improving both time and space complexity
4. for making code simpler
View Answer   Discuss with Members

Question 45 : Co-ordinate compression can only be applied in a co-ordinate system problem
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 46 : What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries when we apply MO's algorithm?
1. O(n*q)
2. O(n)
3. O((q+n)√n)
4. O(q*√n)
View Answer   Discuss with Members

Question 47 : Topological sort starts from a node which has?
1. Maximum Degree
2. Minimum Degree
3. Any degree
4. None of the mentioned
View Answer   Discuss with Members

Question 48 : Which of the following is a disadvantage of quickselect?
1. Poor space complexity
2. Poor best case time complexity
3. Poor average case time complexity
4. Poor worst case time complexity
View Answer   Discuss with Members

Question 49 : What will be the time complexity of update query operation in an array of size n when we use square root optimization?
1. O(√n)
2. O(n)
3. O(1)
4. O(n²)
View Answer   Discuss with Members