A normal queue, if implemented using an array of size MAX_SIZE, gets full when
a) Rear=MAX_SIZE-1 b) Front=(rear+1)mod MAX_SIZE c) Front=rear+1 d) Rear=front
In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?
a) Only front pointer b) Only rear pointer c) Both front and rear pointer d) None of the front and rear pointer
A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
a) Queue b) Circular queue c) Dequeue d) Priority queue
In the array implementation of circular queue, which of the following operation take worst case linear time?
a) Insertion b) Deletion c) To empty a queue d) None
In linked list implementation of a queue, where does a new element be inserted?
a) At the head of link list b) At the tail of the link list c) At the centre position in the link list d) None
A queue is a ?
a) FIFO (First In First Out) list b) LIFO (Last In First Out) list. c) Ordered array d) Linear tree
The data structure required for Breadth First Search on a graph is?
a) Stack b) Array c) Queue d) Tree
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?
a) Queue b) Stack c) Tree d) Linked list
Which of the following statement(s) about stack data structure is/are NOT correct?
(a) Stack data structure can be implemented using linked list (b) New node can only be added at the top of the stack (c) Stack is the FIFO data structure (d) The last node at the bottom of the stack …
Read more →
What is the type of the algorithm used in solving the 8 Queens problem?
(a)Greedy (b)Dynamic (c)Branch and Bound (d)Backtracking
What data structure is used to perform recursion?
(a) Queue (b) Linked list (c) Stack (d) Double Linked List
Instack,Insertion and deletion can be done only at the_____ element
A. Any B. Top C.(n-1) D. None of the above
Stack in data structure is _________.
a) FIFO b) None of these c) LILO d) LIFO
In the stack process of inserting an element in the stack is called as ___________.
A.Pop B.Push C.Evaluation D.Create
Process of removing element from the stack is called as _______.
A.Pop B. Delete C. Push D. Remove
In the stack, If user try to remove element from the empty stack then it called as _______
A.Garbage Collection B. Underflow of Stack C. Empty collection D. Overflow of stock.