Lists Questions

MCQ bookmark_border

81.

First link node of list is accessed from a pointer named

A

Tail

B

Head

C

Terminator

D

Initiator

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

82.

A linked list is made up of a set of objects known as

A

Nodes

B

Arrays

C

Entities

D

Instances

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

83.

Definition of a list is to be

A

Finite

B

Inifinte

C

No-limit

D

Empty

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

84.

Beginnning of any list is called its

A

Pointer

B

Head

C

Initializer

D

Automator

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

85.

Key design decision embodied in this ADT is support for concept of a

A

Partition

B

Parameter

C

Current position

D

Current element

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

86.

A pointer that is used to keep last link of list is called

A

Head

B

Initiator

C

Tail

D

Terminator

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

87.

End of any list is called its

A

Tail

B

Terminator

C

Aborter

D

Committer

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

88.

Important concept related to lists is of

A

Location

B

Position

C

Arrays

D

Pointers

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

89.

Which of the following is false about a doubly linked list?

A

We can navigate in both the directions

B

It requires more space than a singly linked list

C

The insertion and deletion of a node take a bit longer

D

None of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

90.

What is a memory efficient double linked list?

A

Each node has only one pointer to traverse the list back and forth

B

The list has breakpoints for faster traversal

C

An auxiliary singly linked list acts as a helper list to traverse through the doubly linked list

D

None of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion