Each array declaration need not give, implicitly or explicitly, the information about

Related Questions

• 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?
• Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
• The elements of an array are stored successively in memory cells because
• 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.
• A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
• …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
• Each node in a linked list has two pairs of ………….. and ……………….
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
• The operation of processing each element in the list is known as
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as