# 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. A circular linked list can be used for

Stack

Queue

Both Stack & Queue

Neither Stack or Queue

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

Memory space

Static data structure

Data structure

List

## 3. A doubly linked list performs traversal in _________.

Any direction

Circular direction

Either direction

None of the above

Queue

Stack

Graph

Node list

Primitive list

None of these

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

Node list

Primitive list

None of the above

Start

NULL

Next

Empty list

None of these

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

Runtime

Nodes

Pointers

None of the above

## 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

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

None of the above

## 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

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

Paging

Segmentation fault

Memory errors

Cache problems

0Shares
Scroll to Top