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:

a.

inserting

b.

traversal

c.

merging

d.

sorting

Clear my choice

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:

a.

None of these

b.

FIFO

c.

Both of these

d.

LIFO

Clear my choice

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:

a.

last

b.

middle

c.

first

d.

anywhere in between

Clear my choice

Question 4

Answer saved

Marked out of 1.00

Flag question

Question text

This indicates the end of the list.

Select one:

a.

Last pointer

b.

Guard

c.

Sentinel

d.

End pointer

Clear my choice

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:

a.

LINK

b.

INFO

c.

TOP

d.

NULL

Clear my choice

Question 6

Answer saved

Marked out of 1.00

Flag question

Question text

Stack follows the strategy of ________________.

Select one:

a.

FIFO

b.

LIFO

c.

LRU

d.

RANDOM

Clear my choice

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:

a.

Begin

b.

Avail

c.

Start

d.

Stop

Clear my choice

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:

a.

None of these

b.

LIFO, Last In First Out

c.

Both of these

d.

FIFO, First In First Out

Clear my choice

Question 9

Answer saved

Marked out of 1.00

Flag question

Question text

LINK is the pointer pointing to the ____________________.

Select one:

a.

predecessor node

b.

successor node

c.

head node

d.

last node

Clear my choice

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:

a.

Recycle bin

b.

Maintenance

c.

Memory management

d.

Garbage collection

Clear my choice

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:

a.

Three fields

b.

Five fields

c.

Two fields

d.

Four fields

Clear my choice

Question 12

Answer saved

Marked out of 1.00

Flag question

Question text

Value of first linked list index is _______________.

Select one:

a.

-1

b.

0

c.

1

d.

2

Clear my choice

Question 13

Answer saved

Marked out of 1.00

Flag question

Question text

Which is the pointer associated with the availability list?

Select one:

a.

FIRST

b.

REAR

c.

TOP

d.

AVAIL

Clear my choice

Question 14

Answer saved

Marked out of 1.00

Flag question

Question text

New nodes are added to the ________ of the queue.

Select one:

a.

Middle

b.

Front

c.

Back

d.

Front and Back

Clear my choice

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:

a.

singly linked list

b.

circular linked list

c.

doubly linked list

d.

none of these

Clear my choice

Question 16

Answer saved

Marked out of 1.00

Flag question

Question text

The retrieval of items in a stack is ___________ operation.

Select one:

a.

push

b.

retrieval

c.

access

d.

pop

Clear my choice

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:

a.

Overflow

b.

Houseful

c.

Underflow

d.

Saturated

Clear my choice

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:

a.

Pull

b.

Pop

c.

Pump

d.

Push

Clear my choice

Question 19

Answer saved

Marked out of 1.00

Flag question

Question text

Each node in singly linked list has _______ fields.

Select one:

a.

4

b.

1

c.

3

d.

2

Clear my choice

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:

a.

none of these

b.

circular linked list

c.

singly linked list

d.

doubly linked list

Clear my choice

Question 21

Answer saved

Marked out of 1.00

Flag question

Question text

Linked lists are best suited _____________________.

Select one:

a.

for the size of the structure and the data in the structure are constantly changing

b.

data structure

c.

for relatively permanent collections of data

d.

for none of these situations

Clear my choice

Question 22

Answer saved

Marked out of 1.00

Flag question

Question text

The dummy header in linked list contains ____________________.

Select one:

a.

first record of the actual data

b.

middle record of the actual data

c.

last record of the actual data

d.

pointer to the last record of the actual data

Clear my choice

Question 23

Answer saved

Marked out of 1.00

Flag question

Question text

The term used to insert an element into stack.

Select one:

a.

pump

b.

pop

c.

pull

d.

push

Clear my choice

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:

a.

Bottom of the stack

b.

Middle of the stack

c.

In between some value

d.

Beginning of the stack

Clear my choice

Question 25

Answer saved

Marked out of 1.00

Flag question

Question text

What is a run list?

Select one:

a.

small batches of records from a file

b.

number of files in external storage

c.

number of elements having same value

d.

number of records

Clear my choice

Question 26

Answer saved

Marked out of 1.00

Flag question

Question text

The elements are removal from a stack in _________ order.

Select one:

a.

Sequential

b.

Reverse

c.

Hierarchical

d.

Alternative

Clear my choice

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:

a.

Top

b.

Final

c.

End

d.

Last

Clear my choice

Question 28

Answer saved

Marked out of 1.00

Flag question

Question text

In linked lists, there are no NULL links in ______________

Select one:

a.

single linked list

b.

linear doubly linked list

c.

linked list

d.

circular linked list

Clear my choice

Question 29

Answer saved

Marked out of 1.00

Flag question

Question text

Which is the pointer associated with the stack?

Select one:

a.

FRONT

b.

FIRST

c.

TOP

d.

REAR

Clear my choice

Question 30

Answer saved

Marked out of 1.00

Flag question

Question text

Which of the following is an application of stack?

Select one:

a.

infix to postfix

b.

all of these

c.

finding factorial

d.

tower of Hanoi

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:

a.

Pump

b.

Pull

c.

Push

d.

Pop

Clear my choice

Question 2

Answer saved

Marked out of 1.00

Flag question

Question text

Linked lists are best suited _____________________.

Select one:

a.

data structure

b.

for the size of the structure and the data in the structure are constantly changing

c.

for relatively permanent collections of data

d.

for none of these situations

Clear my choice

Question 3

Answer saved

Marked out of 1.00

Flag question

Question text

Stack follows the strategy of ________________.

Select one:

a.

LIFO

b.

RANDOM

c.

LRU

d.

FIFO

Clear my choice

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:

a.

singly linked list

b.

none of these

c.

circular linked list

d.

doubly linked list

Clear my choice

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:

a.

Avail

b.

Start

c.

Stop

d.

Begin

Clear my choice

Question 6

Answer saved

Marked out of 1.00

Flag question

Question text

This is the insertion operation in the stack.

Select one:

a.

pop

b.

top

c.

insert

d.

push

Clear my choice

Question 7

Answer saved

Marked out of 1.00

Flag question

Question text

Which of the following is an application of stack?

Select one:

a.

finding factorial

b.

tower of Hanoi

c.

infix to postfix

d.

all of these

Clear my choice

Question 8

Answer saved

Marked out of 1.00

Flag question

Question text

Which of the following is two way lists?

Select one:

a.

Linked list with header and trailer nodes

b.

List traversed in two directions

c.

Grounded header list

d.

Circular header list

Clear my choice

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:

a.

Four fields

b.

Two fields

c.

Three fields

d.

Five fields

Clear my choice

Question 10

Answer saved

Marked out of 1.00

Flag question

Question text

What is a queue?

Select one:

a.

FILO

b.

LIFO

c.

LOFI

d.

FIFO

Clear my choice

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:

a.

Random of queue

b.

Circular queue

c.

Priority

d.

Dequeue

Clear my choice

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:

a.

The new node is placed at the back of the linked list

b.

The new node is placed at the front of the linked list

c.

No changes happen

d.

The new node is placed at the middle of the linked list

Clear my choice

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:

a.

Underflow

b.

Saturated

c.

Overflow

d.

Houseful

Clear my choice

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:

a.

Bottom of the stack

b.

Middle of the stack

c.

Beginning of the stack

d.

In between some value

Clear my choice

Question 15

Answer saved

Marked out of 1.00

Flag question

Question text

The elements are removal from a stack in _________ order.

Select one:

a.

Alternative

b.

Hierarchical

c.

Reverse

d.

Sequential

Clear my choice

Question 16

Answer saved

Marked out of 1.00

Flag question

Question text

The term used to insert an element into stack.

Select one:

a.

pop

b.

pull

c.

pump

d.

push

Clear my choice

Question 17

Answer saved

Marked out of 1.00

Flag question

Question text

Value of first linked list index is _______________.

Select one:

a.

2

b.

0

c.

-1

d.

1

Clear my choice

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:

a.

circular linked list

b.

singly linked list

c.

none of these

d.

doubly linked list

Clear my choice

Question 19

Answer saved

Marked out of 1.00

Flag question

Question text

The term push and pop is related to _____________.

Select one:

a.

lists

b.

trees

c.

stacks

d.

array

Clear my choice

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:

a.

Start field

b.

Next element field

c.

Link field

d.

Info field

Clear my choice

Question 21

Answer saved

Marked out of 1.00

Flag question

Question text

The dummy header in linked list contains ____________________.

Select one:

a.

first record of the actual data

b.

last record of the actual data

c.

middle record of the actual data

d.

pointer to the last record of the actual data

Clear my choice

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:

a.

FIFO lists

b.

LIFO lists

c.

Piles

d.

Push down lists

Clear my choice

Question 23

Answer saved

Marked out of 1.00

Flag question

Question text

The retrieval of items in a stack is ___________ operation.

Select one:

a.

push

b.

retrieval

c.

access

d.

pop

Clear my choice

Question 24

Answer saved

Marked out of 1.00

Flag question

Question text

Which is the pointer associated with the availability list?

Select one:

a.

TOP

b.

AVAIL

c.

REAR

d.

FIRST

Clear my choice

Question 25

Answer saved

Marked out of 1.00

Flag question

Question text

Which is the pointer associated with the stack?

Select one:

a.

TOP

b.

FIRST

c.

FRONT

d.

REAR

Clear my choice

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:

a.

merging

b.

inserting

c.

traversal

d.

sorting

Clear my choice

Question 27

Answer saved

Marked out of 1.00

Flag question

Question text

In linked lists, there are no NULL links in ______________

Select one:

a.

single linked list

b.

circular linked list

c.

linked list

d.

linear doubly linked list

Clear my choice

Question 28

Answer saved

Marked out of 1.00

Flag question

Question text

New nodes are added to the ________ of the queue.

Select one:

a.

Front and Back

b.

Middle

c.

Front

d.

Back

Clear my choice

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:

a.

None of these

b.

LIFO, Last In First Out

c.

FIFO, First In First Out

d.

Both of these

Clear my choice

Question 30

Answer saved

Marked out of 1.00

Flag question

Question text

Each node in singly linked list has _______ fields.

Select one:

a.

1

b.

3

c.

2

d.

4