WorksheetsData Structures
Total questions: 10
Worksheet time: 5mins
Arranging the books in order and removing from the topmost book is an example for________
Linked List
Queue
Stack
Structure
What is the result of pop(x) operation on the stack?
Add x to top of stack
Removes x from bottom of stack
Add x to the stack
Removes x from top of stack
What data structure can be used to check if a syntax has balanced paranthesis ?
Queue
Stack
List
Union
Queue uses ____________ for adding and deleting elements.
top
front
rear
2 and 3
If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
ABCD
DCBA
DCAB
BADC
The operations performed by Stack are_____________
insert,delete
push,pop
add,delete
enqueue and dequeue
_______________ is the data structure that has collection of nodes two fields named data and link.
Queue
Stack
Linked List
Circular queue
In ___________ type of linked lists we can traverse in both the directions.
Singly linked list
Circular linked list
One dimensional linked list
Doubly linked list
._____________ is a data structure in which every individual node consists of INFO to store data and LINK to store the address of the next node.
Queue
Stack
Singly Linked List
Circular queue
Which of the following principle does queue use?
LIFO
FIFO
Linear
Ordered
