Question - 1
Which is not an area of applications of Data Structure?
Compiler Design
Operating System
Database Management System
Networking
Answer- D
Question - 2
A procedure that calls itself is called
illegal call
Reverse Polish
Recursive
None of above
Answer- C
Question - 3
On which principle does stack work?
FILO
FIFO
LILO
LIFO or FILO
Answer- D
Question - 4
Which one of the below mentioned is a linear data structure
Queue
Stacks
Arrays
All the Above
Answer- D
Question - 5
Removing an element from the stack is called?
Answer- A
Question - 6
removing an element from the empty stack called as
Underflow of Stack
Stack Removal
Overflow of Stack
Empty Collection
Answer- A
Question - 7
Inserting an element in the stack is called as
Answer- A
Question - 8
The minimum number of edges required to create a cyclic graph of n vertices is
Answer- A
Question - 9
What differentiates a circular linked list from a normal linked list?
You may or may not have the ‘next’ pointer point to null in a circular linked list
You cannot have the ‘next’ pointer point to null in a circular linked list
Head node is known in circular linked list
It is faster to traverse the circular linked list
Answer- A
Question - 10
Which of the below given sorting techniques has highest best-case runtime complexity
Quick sort
Bubble Sort
Insertion Sort
Selection Sort
Answer- D
Question - 11
Expression in which Operator is written after Operand is called as
Infix Expression
Postfix Expression
Prefix Expression
None
Answer- B
Question - 12
Tower of hanoi is a classic example of
divide and conquer
recursive approach
B but not A
Both A and B
Answer- D
Question - 13
If we choose Prim‘s Algorithm for uniquely weighted spanning tree instead of Kruskal‘s Algorithm, then
we'll get a different spanning tree
we'll get the same spanning tree.
spanning will have less edges.
spanning will not cover all vertices.
Answer- B
Question - 14
Consider the following operation performed on a stack of size 5.
Answer- A
Question - 15
An adaptive sorting algorithm
adapts to new computers.
takes advantage of already sorted elements.
takes input which is already sorted.
None of these
Answer- B
Question - 16
The type of expression in which operator succeeds its operands is?
Postfix Expression
Infix Expression
Prefix Expression
Both Prefix and Postfix Expressions
Answer- A
Question - 17
What is the space complexity of the above recursive implementation to find the factorial of a number?
Answer- A
Question - 18
Which of the following is not an advantage of trees?
Faster search
Hierarchical structure
Router algorithms
Undo/Redo operations in a notepad
Answer- D
Question - 19
Which of the following is non-linear data structure?
Trees
Stacks
Strings
None of the above
Answer- A
Question - 20
Which is not the operation that can be performed on queue.
Traversal
Insertion
Deletion
Retireval
Answer- A
Practice more set questions
