Lists Questions

MCQ bookmark_border

161.

In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

A

Insertion

B

Deletion

C

To empty a queue

D

Both Insertion and To empty a queue

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

162.

In linked list implementation of a queue, where does a new element be inserted?

A

At the head of link list

B

At the centre position in the link list

C

At the tail of the link list

D

None of the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

163.

In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?

A

Only front pointer

B

Only rear pointer

C

Both front and rear pointer

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

164.

Disadvantages of linked list representation of binary trees over arrays?

A

Randomly accessing is not possible

B

Extra memory for a pointer is needed with every element in the list

C

Difficulty in deletion

D

Random access is not possible and extra memory with every element

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

165.

How to travel a tree in linkedlist representation?

A

using post order traversing

B

using pre order traversing

C

using post order traversing

D

all of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

166.

In simple chaining, what data structure is appropriate?

A

Singly linked list

B

Doubly linked list

C

Circular linked list

D

Binary trees

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion