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 Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Flooding Algorithm”. 1. Which among the following is a property of the flooding algorithm? a) Robustness b) Complex c) Efficient d) Flexible 2. In which layer of the computer networks is the flooding algorithm implemented? a) Transport layer b) Network … 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 “Random Page Replacement Algorithm”. 1. Which among the following algorithms can be used to decide which page should be replaced when the new page comes in? a) Karatsuba algorithm b) DSW algorithm c) Page replacement algorithm d) Aging algorithm 2. … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Least Recently Used Algorithm (LRU)”. 1. Which of the following is a page replacement algorithm? a) Least recently used algorithm b) DSW algorithm c) Simplex algorithm d) Aging algorithm 2. Which type of exception is raised by computer hardware when … 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 “Not Recently Used Algorithm (NRU)”. 1. Which page replacement strategy uses referenced bits and modified bits to replace the page? a) First in first out b) Least recently used algorithm c) Not recently used algorithm d) Optimal page replacement algorithm … 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
