Linked Lists Mcqs

Our collections of Multiple choice questions and answers focuses on study of ” Linked Lists ” in Data Structures. These questions are chosen from a collection of most authoritative and best reference books on Data Structures. Our aim is to prepare an individual for competitive exams like NTS | GAT | ECAT | Data Warehouse jobs | Data Mining | DB administration jobs Software House and Computer Programmer jobs | University and College entrance exams and various tests and job interviews. One should practice our Mcqs to assimilate knowledge on Linked Lists comprehensively.

  1. Home
  2. »
  3. Computer Science Mcqs
  4. »
  5. Data Structures Mcqs
  6. »
  7. Linked Lists Mcqs

Computer MCQS

Sciences MCQS

1.
A circular linked list can be used for

Stack

Queue

Both Stack & Queue

Neither Stack or Queue

Answer Discus (0)

2.
A collection of data items of similar type arranged in a sequence is termed as?

Memory space

Static data structure

Data structure

List

Answer Discus (0)

3.
A doubly linked list performs traversal in _________.

Any direction

Circular direction

Either direction

None of the above

Answer Discus (0)

4.
A linear collection of data element given by mean of pointer is called ______________.

Linked List

Queue

Stack

Graph

Answer Discus (0)

5.
A linear collection of data elements where the linear node is given by means of pointer is called

Linked list

Node list

Primitive list

None of these

Answer Discus (0)

6.
A linear collection of data elements where the linear node is given by means of pointer is called?

Linked list

Node list

Primitive list

None of the above

Answer Discus (0)

7.
A linear list in which each node has pointers to point to the predecessor and successors nodes is called as

Singly Linked List

Circular Linked List

Doubly Linked List

Linear Linked List

Answer Discus (0)

8.
A linked list contains a list pointer variable _____that stores the address of the first node of the list.

Start

NULL

Next

Empty list

Answer Discus (0)

9.
A linked list in which the last node of Linked list points to the first is called a _________.

Doubly Linked List

Circular Linked List

Singly Linked List

None of these

Answer Discus (0)

10.
A linked list is a linear collection of homogeneous elements called______.

Runtime

Nodes

Pointers

None of the above

Answer Discus (0)

11.
A situation where the user tries to delete a node from an empty linked list is termed as___________.

Underflow

Overflow

Pointers

None of the above

Answer Discus (0)

12.
A variant of linked list in which last node of the list points to the first node of the list is?

Singly linked list

Doubly linked list

Circular linked list

Multiply linked list

Answer Discus (0)

13.
A variant of the linked list in which none of the node contains NULL pointer is?

Singly linked list

Doubly linked list

Circular linked list

None of the above

Answer Discus (0)

14.
A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?

It waste memory space since the pointer head already points to the first node and thus the list node does not need to point to the first node.

It is not possible to add a node at the end of the list.

It is difficult to traverse the list as the pointer of the last node is now not NULL

All of above

Answer Discus (0)

15.
Accessing free list very frequently for wide range of addresses can lead to

Paging

Segmentation fault

Memory errors

Cache problems

Answer Discus (0)

Engineering MCQS

General Subjects MCQS

error: You are not allowed to do so.....
0Shares
0
Scroll to Top