Data Structures (3130702) MCQs

MCQs of Linear Data Structure: Linked List

Showing 1 to 7 out of 7 Questions
1.

In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?

(a)

Only front pointer
(b)

Only rear pointer
(c)

Both front and rear pointer
(d)

None of the front and rear pointer
Answer:

Option (b)

2.

Which is invalid statement for array and linked list?

(a)

Array and linked list are both non-primitive data structure.
(b)

An array is a fixed size sequenced collection of elements of the same type. Linked list is an ordered set of a variable number of elements.
(c)

Array has homogenous values. And each element is independent of each other positions. Each node in the linked list is connected with its previous node which is a pointer to the node. 
(d)

Array and linked list have homogenous values. And each element is independent of each other positions.
Answer:

Option (d)

3.

The operation of processing each element in the list is known as ......

(a)

Sorting
(b)

Merging
(c)

Inserting
(d)

Traversal
Answer:

Option (d)

4.

In linked list implementation of a queue, where does a new element be inserted?

(a)

At the head of link list
(b)

At the tail of the link list
(c)

At the center position in the link list
(d)

None
Answer:

Option (b)

5.

In the linked list, each node contains a minimum of two fields. One field is the data field to store the data the second field is?

(a)

Pointer to character
(b)

Pointer to integer
(c)

Pointer to node
(d)

Node
Answer:

Option (c)

6.

In doubly linked lists, traversal can be performed?

(a)

Only in the forward direction
(b)

Only in the reverse direction
(c)

In both directions
(d)

None
Answer:

Option (c)

7.

A variant of the linked list in which none of the nodes contains the NULL pointer is?

(a)

Singly linked list
(b)

Doubly linked list
(c)

Circular linked list
(d)

None
Answer:

Option (c)

Showing 1 to 7 out of 7 Questions