Finding the location of the element with a given value is:

Related MCQs

• Finding the location of a given item in a collection of items is called ……
• 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 ?
• 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?
• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• What is the average case time complexity for finding the height of the binary tree?
• ____________ is finding a path/tour through the graph such that every vertex is visited exactly once.
• When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.
• The worst case complexity of deleting any arbitrary node value element from heap is
• Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found?
• A _______________ is a reference to a memory location, which is used to store data that is described in a data type.