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

Related Questions

• 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?
• 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 total number of elements in a stack at a given point of time can be calculated from the value of______.
• In ……………, search start at the beginning of the list and check every element in the 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.
• The operation of processing each element in the list is known as
• Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?