In linked list each node contain minimum of two fields. One field is data field to store the data second field is ________
A. Pointer to character
B. Pointer to integer
C. Pointer to node
D. None of these
A linear collection of data elements where the linear node is given by means of pointer is called________
A. Linked list
B. Node list
C. Primitive list
D. All of these
Which of the following is not the type of queue?
A. Ordinary queue
B. Single ended queue
C. Circular queue
D. None of These
If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
A. ABCD
B. DCBA
C. DCAB
D. None of These
In Breadth First Search of Graph, which of the following data structure is used ________
A. Stack
B. Queue
C. Linked list
D. All of These
A queue is a ________
A. FIFO (First In First Out) list
B. LIFO (Last In First Out) list
C. Ordered array
D. Linear tree
The data structure required for Breadth First Traversal on a graph is ______ .
a) Stack
b) Array
C. Queue
D. None of these
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 ?
A. Queue
B. Stack
C. Tree
D. Linked list
What is the value of the postfix expression 6 3 2 4 + – *:
A. Something between -5 and -15
B. Something between 5 and -5
C. Something between 15 and 100
D. None of These
Which of the following applications may use a stack?
A. A parentheses balancing program
B. Tracking of local variables at run time
C. Compiler Syntax Analyzer
D. All of the mentioned