When an operand is read, which of the following is done?

Related MCQs

• 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 ?
• The number of comparisons done by sequential search is ………………
• What should be done when a left parenthesis ‘(‘ is encountered?
• The topological sorting of any DAG can be done in time.
• Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found?
• The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
• The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?
• The average number of key comparisons done in a successful sequential search in a list of length n is___________.
• The average number of key comparisons done in a successful sequential search in a list of length n is ____________.
• Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?