Back to the 2024 paper
Similar questions
Design and Analysis of Algorithms A FIFO Branch-and-Bound strategy is typically implemented using which data structure? (i) Stack (ii) Queue (iii) Priority Queue (iv) Array20252mFORMAL LANGUAGE & AUTOMATA THEORYA Turing Machine has: (i) A finite tape (ii) An infinite tape (iii) A stack (iv) A queue20242mFORMAL LANGUAGE & AUTOMATA THEORYWhich of the following is a PDA? (i) Finite automaton with a stack (ii) Turing machine with a stack (iii) Finite automaton with a queue (iv) Turing machine with a queue20242mOperating SystemTo avoid race condition the maximum number of processes that may simultaneously be inside the critical section is: (i) No Limit (ii) Two (iii) Three (iv) One20232m
PreviousThe minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is - (i) O(n) - (ii) O(\log n) - (iii) O(n \log n) - (iv) O(1)NextDijkstra's algorithm is used to solve ______ problems? - (i) Single source shortest path - (ii) All pair shortest path - (iii) Sorting - (iv) Searching