This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Square Root Decomposition”. 1. What is the purpose of using square root decomposition? a) to reduce the time complexity of a code b) to increase the space complexity of a code c) to reduce the space complexity of a code … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Co-ordinate Compression”. 1. What is co-ordinate compression? a) process of reassigning co-ordinates to remove gaps b) inserting gaps in a co-ordinate system c) removing redundant co-ordinates d) adding extra gaps 2. What is the need for co-ordinate compression? a) for … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Quickselect”. 1. Which of the following is an alternative name of the quickselect algorithm? a) quick sort b) hoare’s selection algorithm c) tony’s selection algorithm d) kruskal’s algorithm 2. Quickselect is an example of ___________ a) sorting algorithm b) selection … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Topological Sort”. 1. Topological sort can be applied to which of the following graphs? a) Undirected Cyclic Graphs b) Directed Cyclic Graphs c) Undirected Acyclic Graphs d) Directed Acyclic Graphs 2. Most Efficient Time Complexity of Topological Sorting is? (V – number … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “First-in, First-out Algorithm (FIFO)”. 1. ________ is a typical online problem from the competitive analysis to determine the optimal solution. a) Page replacement algorithm b) Segmentation c) Paging d) Segmentation with paging 2. Which of the following is the simplest … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Optimal Page Replacement Algorithm”. 1. __________ has the lowest fault rate of all the page replacement algorithms. a) Optimal page replacement algorithm b) LRU replacement algorithm c) FIFO d) Counting based 2. Optimal page replacement algorithm is also called as … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Set Partition Problem”. 1. What is meant by the power set of a set? a) subset of all sets b) set of all subsets c) set of particular subsets d) an empty set 2. What is the set partition problem? … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Subset Sum Problem”. 1. Under what condition any set A will be a subset of B? a) if all elements of set B are also present in set A b) if all elements of set A are also present in … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Hamiltonian Path Problem”. 1. Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently? a) branch and bound b) iterative improvement c) divide and conquer d) greedy algorithm 2. The problem of finding a path … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “P, NP, NP-hard, NP-complete Complexity Classes”. 1. The worst-case efficiency of solving a problem in polynomial time is? a) O(p(n)) b) O(p( n log n)) c) O(p(n2)) d) O(p(m log n)) 2. Problems that can be solved in polynomial time … Read more
