1) Which of the following data structures works on the principle of LIFO (Last In, First Out)? a) Queue b) Stack 2) What is the time complexity of push and pop operations in a stack implemented using an array? a) O(1) b) O(n) 3) In a queue, insertion takes place at the ______ and deletion takes place at the ______. a) Front, Rear b) Rear, Front 4) Which of the following applications is not typically implemented using a stack? a) Undo mechanism in text editors b) Job scheduling in CPU 5) In a circular queue, when the rear pointer is just before the front pointer, the queue is considered: a) Overflowed (Full) b) Underflowed 6) What will be the output after performing the following operations on a stack?Push(5), Push(10), Pop(), Push(20), Pop() a) 5 b) 10 7) Which data structure is best suited to implement a breadth-first search (BFS) in graphs? a) Queue b) stack 8) Which of the following is true about Double-Ended Queue (Deque)? a) Insertion and deletion are possible at both ends b) Insertion and deletion are possible only at the front end 9) If the elements 1, 2, 3, 4 are pushed in order into a stack and then popped one by one, what is the output sequence? a) 4, 3, 2, 1 b) 1, 2, 3, 4 10) Which operation cannot be performed if a queue is empty? a) Dequeue b) Increase size dynamically

DSA- QUIZ

印刷
埋め込み

リーダーボード

表示スタイル

オプション

テンプレートを切り替える

自動保存: を復元しますか?