- Computer Science Engineering (CSE)
- Data Structure (DS)
- The operation of processing each element...

Q. |
## The operation of processing each element in the list is known as |

A. | sorting |

B. | merging |

C. | inserting |

D. | traversal |

Answer» D. traversal |

View all MCQs in:
Data Structure (DS)

- The operation of processing each element in the list is known as ……
- Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
- In ……………, search start at the beginning of the list and check every element in the list.
- What differentiates a circular linked list from a normal linked list?
- There is an extra element at the head of the list called a ……….
- A …………………… does not keep track of address of every element in the list.
- What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?
- Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: i. isEmpty (Q) — returns true if the queue is empty, false otherwise. ii. delete (Q) — deletes the element at the front of the queue and returns its value. iii. insert (Q, i) — inserts the integer i at the rear of the queue. Consider the following function: void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); insert(Q, i); } }What operation is performed by the above function f ?
- Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
- Each node in a linked list has two pairs of ………….. and ……………….

Login to Continue

It will take less than 2 minutes

Report MCQ