(A) POP
(B) Peek
(C) Push
(D) All of the above
Category: Data Structures Mcqs
Data Structures Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Data Structures Mcqs section will help users to prepare mcqs of Data Structures for various exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Data Structures portion from here.
Process of removing an element from stack is called?
(A) Create
(B) Pop
(C) Evaluation
(D) Push
Stack follows the manner?
(A) FCLS
(B) FIFO
(C) LIFO
(D) Both LIFO and FIFO
Process of inserting an element in stack is called?
(A) Create
(B) Evaluation
(C) Push
(D) Pop
Complexity of linear search algorithm is?
(A) O(log n)
(B) O(n)
(C) O(n log n)
(D) None of the above
Search tables used by compilers for efficient searching generally use?
(A) Linear lists of records
(B) Hash tables
(C) Binary search tables
(D) Binary search trees
Queue can be used to implement?
(A) Radix Sort
(B) Quick Sort
(C) Depth First Search
(D) Recursion
Which among following data structure is linear data structure?
(A) Trees
(B) Graphs
(C) Arrays
(D) All of the above