- Computer Science Engineering (CSE)
- Data Structure (DS)
- Finding the location of a given item in ...

Q. |
## Finding the location of a given item in a collection of items is called …… |

A. | Discovering |

B. | Finding |

C. | Searching |

D. | Mining |

Answer» C. Searching |

View all MCQs in:
Data Structure (DS)

- Finding the location of the element with a given value is:
- 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.
- A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
- ……………. Is a pile in which items are added at one end and removed from the other.
- 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 ?
- The total number of elements in a stack at a given point of time can be calculated from the value of______.
- A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
- Stack is also called as
- There is an extra element at the head of the list called a ……….
- Any node is the path from the root to the node is called

Login to Continue

It will take less than 2 minutes

Report MCQ