Data Structures and Algorithms

ITE6201 Data Structures and Algorithms
(PreLim)


Question 1

Answer saved
Marked out of 1.00
Flag question

Question text

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

Select one:

Question 2

Answer saved
Marked out of 1.00
Flag question

Question text

This form of access is used to add/remove nodes from a stack.

Select one:

Question 3

Answer saved
Marked out of 1.00
Flag question

Question text

Indexing the ________________ element in the list is not possible in linked lists.

Select one:

Question 4

Answer saved
Marked out of 1.00
Flag question

Question text

This indicates the end of the list.

Select one:

Question 5

Answer saved
Marked out of 1.00
Flag question

Question text

In linked representation of stack, ___________ fields hold the elements of the stack.

Select one:

Question 6

Answer saved
Marked out of 1.00
Flag question

Question text

Stack follows the strategy of ________________.

Select one:

Question 7

Answer saved
Marked out of 1.00
Flag question

Question text

In the linked representation of the stack, __________ pointer behaves as the top pointer variable of stack.

Select one:

Question 8

Answer saved
Marked out of 1.00
Flag question

Question text

This form of access is used to add and remove nodes from a queue.

Select one:

Question 9

Answer saved
Marked out of 1.00
Flag question

Question text

LINK is the pointer pointing to the ____________________.

Select one:

Question 10

Answer saved
Marked out of 1.00
Flag question

Question text

This may take place only when there is some minimum amount or no space left in free storage list.

Select one:

Question 11

Answer saved
Marked out of 1.00
Flag question

Question text

Each node in a linked list must contain at least ___________________.

Select one:

Question 12

Answer saved
Marked out of 1.00
Flag question

Question text

Value of first linked list index is _______________.

Select one:

Question 13

Answer saved
Marked out of 1.00
Flag question

Question text

Which is the pointer associated with the availability list?

Select one:

Question 14

Answer saved
Marked out of 1.00
Flag question

Question text

New nodes are added to the ________ of the queue.

Select one:

Question 15

Answer saved
Marked out of 1.00
Flag question

Question text

A linear list in which the pointer points only to the successive node.

Select one:

Question 16

Answer saved
Marked out of 1.00
Flag question

Question text

The retrieval of items in a stack is ___________ operation.

Select one:

Question 17

Answer saved
Marked out of 1.00
Flag question

Question text

The situation when in a linked list START=NULL is ____________________.

Select one:

Question 18

Answer saved
Marked out of 1.00
Flag question

Question text

This is the term used to delete an element from the stack.

Select one:

Question 19

Answer saved
Marked out of 1.00
Flag question

Question text

Each node in singly linked list has _______ fields.

Select one:

Question 20

Answer saved
Marked out of 1.00
Flag question

Question text

A linear list in which the last node points to the first node.

Select one:

Question 21

Answer saved
Marked out of 1.00
Flag question

Question text

Linked lists are best suited _____________________.

Select one:

Question 22

Answer saved
Marked out of 1.00
Flag question

Question text

The dummy header in linked list contains ____________________.

Select one:

Question 23

Answer saved
Marked out of 1.00
Flag question

Question text

The term used to insert an element into stack.

Select one:

Question 24

Answer saved
Marked out of 1.00
Flag question

Question text

In linked representation of stack, the null pointer of the last node in the list signals _____________________.

Select one:

Question 25

Answer saved
Marked out of 1.00
Flag question

Question text

What is a run list?

Select one:

Question 26

Answer saved
Marked out of 1.00
Flag question

Question text

The elements are removal from a stack in _________ order.

Select one:

Question 27

Answer saved
Marked out of 1.00
Flag question

Question text

A pointer variable which contains the location at the top element of the stack.

Select one:

Question 28

Answer saved
Marked out of 1.00
Flag question

Question text

In linked lists, there are no NULL links in ______________

Select one:

Question 29

Answer saved
Marked out of 1.00
Flag question

Question text

Which is the pointer associated with the stack?

Select one:

Question 30

Answer saved
Marked out of 1.00
Flag question

Question text

Which of the following is an application of stack?

Select one:

Question 1

Answer saved
Marked out of 1.00
Flag question

Question text

This is the term used to delete an element from the stack.

Select one:

Question 2

Answer saved
Marked out of 1.00
Flag question

Question text

Linked lists are best suited _____________________.

Select one:

Question 3

Answer saved
Marked out of 1.00
Flag question

Question text

Stack follows the strategy of ________________.

Select one:

Question 4

Answer saved
Marked out of 1.00
Flag question

Question text

A linear list in which the last node points to the first node.

Select one:

Question 5

Answer saved
Marked out of 1.00
Flag question

Question text

In the linked representation of the stack, __________ pointer behaves as the top pointer variable of stack.

Select one:

Question 6

Answer saved
Marked out of 1.00
Flag question

Question text

This is the insertion operation in the stack.

Select one:

Question 7

Answer saved
Marked out of 1.00
Flag question

Question text

Which of the following is an application of stack?

Select one:

Question 8

Answer saved
Marked out of 1.00
Flag question

Question text

Which of the following is two way lists?

Select one:

Question 9

Answer saved
Marked out of 1.00
Flag question

Question text

Each node in a linked list must contain at least ___________________.

Select one:

Question 10

Answer saved
Marked out of 1.00
Flag question

Question text

What is a queue?

Select one:

Question 11

Answer saved
Marked out of 1.00
Flag question

Question text

This is a linear list in which insertions and deletions are made to form either end of the structure.

Select one:

Question 12

Answer saved
Marked out of 1.00
Flag question

Question text

What happens when you push a new node onto a stack?

Select one:

Question 13

Answer saved
Marked out of 1.00
Flag question

Question text

The situation when in a linked list START=NULL is ____________________.

Select one:

Question 14

Answer saved
Marked out of 1.00
Flag question

Question text

In linked representation of stack, the null pointer of the last node in the list signals _____________________.

Select one:

Question 15

Answer saved
Marked out of 1.00
Flag question

Question text

The elements are removal from a stack in _________ order.

Select one:

Question 16

Answer saved
Marked out of 1.00
Flag question

Question text

The term used to insert an element into stack.

Select one:

Question 17

Answer saved
Marked out of 1.00
Flag question

Question text

Value of first linked list index is _______________.

Select one:

Question 18

Answer saved
Marked out of 1.00
Flag question

Question text

A linear list in which the pointer points only to the successive node.

Select one:

Question 19

Answer saved
Marked out of 1.00
Flag question

Question text

The term push and pop is related to _____________.

Select one:

Question 20

Answer saved
Marked out of 1.00
Flag question

Question text

In a linked list, the ____________ contains the address of next element in the list.

Select one:

Question 21

Answer saved
Marked out of 1.00
Flag question

Question text

The dummy header in linked list contains ____________________.

Select one:

Question 22

Answer saved
Marked out of 1.00
Flag question

Question text

Which of the following names does not relate to stacks?

Select one:

Question 23

Answer saved
Marked out of 1.00
Flag question

Question text

The retrieval of items in a stack is ___________ operation.

Select one:

Question 24

Answer saved
Marked out of 1.00
Flag question

Question text

Which is the pointer associated with the availability list?

Select one:

Question 25

Answer saved
Marked out of 1.00
Flag question

Question text

Which is the pointer associated with the stack?

Select one:

Question 26

Answer saved
Marked out of 1.00
Flag question

Question text

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

Select one:

Question 27

Answer saved
Marked out of 1.00
Flag question

Question text

In linked lists, there are no NULL links in ______________

Select one:

Question 28

Answer saved
Marked out of 1.00
Flag question

Question text

New nodes are added to the ________ of the queue.

Select one:

Question 29

Answer saved
Marked out of 1.00
Flag question

Question text

This form of access is used to add and remove nodes from a queue.

Select one:

Question 30

Answer saved
Marked out of 1.00
Flag question

Question text

Each node in singly linked list has _______ fields.

Select one: