Lists Questions

MCQ bookmark_border

1.

In linked lists there are no NULL links in

A

Single linked list

B

Linear doubly linked list

C

circular linked list

D

None of the above

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

2.

Can we read a data item at any location of a list within a constant time (i.e. O(1))?

A

Yes

B

Yes, only if the list is implemented by pointers (i.e. linked-list)

C

Yes, only if the list is implemented by an array

D

No, we need O(n) computation steps no matter what kind of implementation is used

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

3.

node.next -> node.next.next; will make

A

node.next inaccessible

B

node.next.next inaccessible

C

this node inaccessible

D

none of the above

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

4.

A circular linked list can be used for

A

Stack

B

Queue

C

Both Stack & Queue

D

Neither Stack or Queue

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

5.

In doubly linked lists

A

a pointer is maintained to store both next and previous nodes.

B

two pointers are maintained to store next and previous nodes.

C

a pointer to self is maintained for each node.

D

none of the above.

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

6.

The advantage of

A

Lists

B

Linked Lists

C

Trees

D

Queues

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

7.

There is an extra element at the head of the list called a

A

Antinel

B

Sentinel

C

List header

D

List head

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

8.

Each node in a linked list has two pairs of

A

Link field and information field

B

Link field and avail field

C

Avail field and information field

D

Address field and link field

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

9.

The disadvantage in using a circular linked list is

A

It is possible to get into infinite loop

B

Last node points to first node.

C

Time consuming

D

Requires more memory space

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

10.

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

A

Singly Linked List

B

Circular Linked List

C

Doubly Linked List

D

Linear Linked List

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion