Skip to content

Quiz on Doubly Linked List in DSA

Quiz on Doubly Linked List in DSA

Time limit: 0

Quiz Summary

0 of 10 Questions completed

Questions:

Information

You have already completed the quiz before. Hence you can not start it again.

Quiz is loading…

You must sign in or sign up to start the quiz.

You must first complete the following:

Results

Quiz complete. Results are being recorded.

Results

0 of 10 Questions answered correctly

Your time:

Time has elapsed

You have reached 0 of 0 point(s), (0)

Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)

Categories

Not categorized 0%

Review / Skip
Answered
Correct
Incorrect

Question 1 of 10

1. Question

What makes a doubly linked list different from a singly linked list?

Each node stores two data items
Correct Incorrect Correct answer

Each node has two pointers: next and previous
Correct Incorrect Correct answer

It stores only integers
Correct Incorrect Correct answer

It uses arrays internally
Correct Incorrect Correct answer

Correct

Incorrect
Question 2 of 10

2. Question

Which of the following is an advantage of a doubly linked list?

Uses less memory than arrays
Correct Incorrect Correct answer

Easy to traverse backward and forward
Correct Incorrect Correct answer

Fixed memory allocation
Correct Incorrect Correct answer

All operations are O(1)
Correct Incorrect Correct answer

Correct

Incorrect
Question 3 of 10

3. Question

What is the time complexity to insert an element at the end of a doubly linked list (if the tail pointer is available)?

O(n)
Correct Incorrect Correct answer

O(log n)
Correct Incorrect Correct answer

O(1)
Correct Incorrect Correct answer

O(n²)
Correct Incorrect Correct answer

Correct

Incorrect
Question 4 of 10

4. Question

What is the initial value of the ‘prev’ pointer in the first node of a doubly linked list?

Head
Correct Incorrect Correct answer

Tail
Correct Incorrect Correct answer

Null
Correct Incorrect Correct answer

Itself
Correct Incorrect Correct answer

Correct

Incorrect
Question 5 of 10

5. Question

In a doubly linked list, which pointer helps to move to the previous node?

Next
Correct Incorrect Correct answer

Head
Correct Incorrect Correct answer

Prev
Correct Incorrect Correct answer

Tail
Correct Incorrect Correct answer

Correct

Incorrect
Question 6 of 10

6. Question

What happens when you delete a node in the middle of a doubly linked list?

Only the node is removed; pointers remain unchanged
Correct Incorrect Correct answer

The previous and next pointers are adjusted
Correct Incorrect Correct answer

All nodes are shifted
Correct Incorrect Correct answer

The list is reversed
Correct Incorrect Correct answer

Correct

Incorrect
Question 7 of 10

7. Question

Which of the following operations is easier in a doubly linked list than in a singly linked list?

Traversing forward
Correct Incorrect Correct answer

Searching from the front
Correct Incorrect Correct answer

Inserting after a given node
Correct Incorrect Correct answer

Deleting a given node without full traversal
Correct Incorrect Correct answer

Correct

Incorrect
Question 8 of 10

8. Question

Which condition is true when a doubly linked list is empty?

Head and tail are not null
Correct Incorrect Correct answer

Only tail is null
Correct Incorrect Correct answer

Head is null
Correct Incorrect Correct answer

Both head and tail point to the same node
Correct Incorrect Correct answer

Correct

Incorrect
Question 9 of 10

9. Question

Which of these is a real-world analogy of a doubly linked list?

A one-way street
Correct Incorrect Correct answer

A circular clock
Correct Incorrect Correct answer

A train where you can walk to the next and previous coach
Correct Incorrect Correct answer

A vending machine
Correct Incorrect Correct answer

Correct

Incorrect
Question 10 of 10

10. Question

Which pointer must be updated when inserting a node between two existing nodes in a doubly linked list?

Only the next pointer of previous node
Correct Incorrect Correct answer

Only the prev pointer of next node
Correct Incorrect Correct answer

Both next and prev pointers of surrounding nodes
Correct Incorrect Correct answer

Only the head pointer
Correct Incorrect Correct answer

Correct

Incorrect

Fill the form to proceed
Upskill & get ready for AI-era

Please leave this field empty.

Δ

Our executives will contact you shortly

Have Questions?
Talk directly to the Instructor

Please leave this field empty.

Δ

Our executives will arrange a call with the Instructor shortly

talk to the instructor

Career Counselling

Please leave this field empty.

Δ

Login

Accessing this course requires a login. Please enter your credentials below!

Username or Email Address

Password

Remember Me

Signup / Login with Google

Signup / Login with X

Lost Your Password?

Register

Don't have an account? Register one!

Register an Account