EXAMRADAR

Home
Tutorials
MCQ Sets
Online Tests
Que and Ans
Blogs
Write for us

Home
Tutorials
MCQ Sets
Online Tests
Que and Ans
Blogs
Write for us

Data Structure and Algorithms – Linked Lists (Single,Double,Circular,Array,Polynomials) Online Test 3

This online test section contains the next top best multiple-choice type questions answers (MCQs) based on Data Structure and Algorithms related to Linked Lists (Single,Double,Circular,Array,Polynomials). This online Quiz / Practice Test is suitable for various exams conducted by various educational organizations. These questions have been selected from previous years question papers of various competitive exams.

📝 Test Instructions

📌 Question Type Questions remain the same unless test is updated

📊 Total Questions 20

⏳ Time Limit 20 Minutes

🏆 Points 1 Point for each Question

TIME LEFT : 0

Test-summary

0 of 20 questions completed

Questions:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

Information

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

Test is loading...

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

You have to finish following Test, to start this Test:

Results

0 of 20 questions answered correctly

Time Taken by You:

Time has elapsed

You have reached 0 of 0 points, (0)

Categories

Not categorized 0%

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

Answered
Review

Question 1 of 20

Q-1. Which among the following segment of code inserts a new node pointed by X to be inserted at the beginning of the single linked list. The start pointer points to beginning of the list?

start -> next = X; X = start;

X -> next = start; start = X

X -> next = start -> next; start = X

X -> next = start; start = X -> next

Your Answer : Correct

Your Answer : Incorrect

Question 2 of 20

Q-2. Which among the following segments of inserts a new node pointed by X to be inserted at the end of the single linked list. The start and last pointer points to beginning and end of the list respectively?

last -> next = X; X -> next = start;

X -> next = last; last ->next = NULL;

last -> next = X; X -> next = NULL;

last -> next = X -> next; X -> next = NULL;

Your Answer : Correct

Your Answer : Incorrect

Question 3 of 20

Q-3. Which among the following segments of inserts a new node pointed by X to be inserted at any position (i.e neither first nor last) element of the single linked list? Assume prev pointer points to the previous position of new node.

X -> next = prev -> next; prev -> next = X -> next;

X = prev -> next; prev -> next = X -> next;

X -> next = prev; prev -> next = X;

X -> next = prev -> next; prev -> next = X;

Your Answer : Correct

Your Answer : Incorrect

Question 4 of 20

Q-4. A circular double linked list is declared as follows: struct cdllist { struct cdllist *fwd, *bwd; int data; } Where fwd and bwd represents forward and backward links to adjacent elements of the list. Which among the following segments of code deletes the element pointed to by X from the circular double linked list, if it is assumed that X points to neither the first nor last element of the list?

X -> bwd -> fwd = X -> fwd; X -> fwd -> bwd = X -> bwd;

X -> bwd -> fwd = X -> bwd; X -> fwd -> bwd = X -> fwd;

X -> bwd -> bwd = X -> fwd; X -> fwd -> fwd = X -> bwd;

X -> bwd -> bwd = X -> bwd; X -> fwd -> fwd = X -> fwd;

Your Answer : Correct

Your Answer : Incorrect

Question 5 of 20

Q-5. Which among the following segment of code deletes the element pointed to by X from the circular double linked list, if it is assumed that X points to the first element of the list and start pointer points to beginning of the list?

start = start -> bwd; X -> bwd -> bwd = start; start -> bwd = X -> bwd;

start = start -> fwd; X -> fwd -> fwd = start; start -> bwd = X -> fwd

start = start -> bwd; X -> bwd -> fwd = X; start -> bwd = X -> bwd

start = start -> fwd; X -> bwd -> fwd = start; start -> bwd = X -> bwd;

Your Answer : Correct

Your Answer : Incorrect

Question 6 of 20

Q-6. Which among the following segment of code deletes the element pointed to by X from the circular double linked list, if it is assumed that X points to the last element of the list and start pointer points to beginning of the list?

X -> bwd -> fwd = X -> fwd; X -> fwd -> fwd= X -> bwd;

X -> bwd -> fwd = X -> fwd; X -> fwd -> bwd = X -> bwd;

X -> fwd -> fwd = X -> bwd; X -> fwd -> bwd= X -> fwd;

X -> bwd -> bwd = X -> fwd; X -> bwd -> bwd = X -> bwd;

Your Answer : Correct

Your Answer : Incorrect

Question 7 of 20

Q-7. Which among the following segment of code counts the number of elements in the circular double linked list, if it is assumed that X and start points to the first element of the list and ctr is the variable which counts the number of elements in the list?

for (ctr=1; X->fwd != start; ctr++) X = X -> fwd;

for (ctr=1; X != NULL; ctr++) X = X -> bwd;

for (ctr=1; X -> fwd != NULL; ctr++) X = X -> fwd;

for (ctr=1; X -> bwd != NULL; ctr++) X = X -> bwd;

Your Answer : Correct

Your Answer : Incorrect

Question 8 of 20

Q-8. Which among the following segment of code inserts a new node pointed by X to be inserted at the beginning of the circular double linked list. The start pointer points to beginning of the list?

X -> bwd = start; X -> fwd = start -> fwd; start -> bwd-> fwd = X; start -> bwd = X; start = X

X -> bwd = start -> bwd; X -> fwd = start; start -> bwd-> fwd = X; start -> bwd = X; start = X

X -> fwd = start -> bwd; X -> bwd = start; start -> bwd-> fwd = X; start -> bwd = X; start = X

X -> bwd = start -> bwd; X -> fwd = start; start -> fwd-> fwd = X; start -> fwd = X; X = start;

Your Answer : Correct

Your Answer : Incorrect

Question 9 of 20

Q-9. Which among the following segment of code inserts a new node pointed by X to be inserted at the end of the circular double linked list. The start pointer points to beginning of the list?

X -> bwd = start; X -> fwd = start -> fwd; start -> bwd -> fwd = X; start -> bwd = X; start = X

X -> bwd = start -> bwd; X -> fwd = start; start -> bwd -> fwd = X; start -> bwd = X; start = X

X -> bwd= start -> bwd; X-> fwd = start; start -> bwd -> fwd = X; start -> bwd = X;

X -> bwd = start -> bwd; X -> fwd = start; start -> fwd-> fwd = X; start -> fwd = X; X = start;

Your Answer : Correct

Your Answer : Incorrect

Question 10 of 20

Q-10. Which among the following segments of inserts a new node pointed by X to be inserted at any position (i.e neither first nor last) element of the circular double linked list? Assume temp pointer points to the previous position of new node.

X -> bwd -> fwd = X -> fwd; X -> fwd -> bwd = X -> bwd;

X -> bwd -> fwd = X -> bwd; X -> fwd -> bwd = X -> fwd;

temp -> fwd = X; temp -> bwd = X -> fwd; X -> fwd = X; X -> fwd -> bwd = temp;

X -> bwd = temp; X -> fwd = temp -> fwd; temp -> fwd = X; X -> fwd -> bwd = X;

Your Answer : Correct

Your Answer : Incorrect

Question 11 of 20

Q-11. What is the time complexity for deleting a node with a given value in a doubly linked list?

O(1)

O(n)

O(log n)

O(n^2)

Your Answer : Correct

Your Answer : Incorrect

Question 12 of 20

Q-12. What is the main advantage of a circular linked list over a singly linked list?

It uses less memory

It has faster traversal

It avoids null references

It can be resized dynamically

Your Answer : Correct

Your Answer : Incorrect

Question 13 of 20

Q-13. In a circular linked list, how do you determine if you have reached the end of the list during traversal?

Check for a null reference

Check for a circular reference

Use a special end-of-list marker

Circular lists have no end

Your Answer : Correct

Your Answer : Incorrect

Question 14 of 20

Q-14. In a polynomial-linked list, what does a node with a coefficient of 0 represent?

An error

A missing value

A term that doesn't contribute to the polynomial

A placeholder

Your Answer : Correct

Your Answer : Incorrect

Question 15 of 20

Q-15. Which operation can be efficiently performed on a polynomial-linked list?

Finding the minimum value

Finding the maximum value

Evaluating the polynomial for a specific value of x

Sorting the elements

Your Answer : Correct

Your Answer : Incorrect

Question 16 of 20

Q-16. What is the time complexity for adding two polynomials represented as linked lists?

O(1)

O(n)

O(log n)

O(n^2)

Your Answer : Correct

Your Answer : Incorrect

Question 17 of 20

Q-17. What is a disadvantage of an array-based list?

It allows for dynamic resizing

It cannot be used to store elements of different data types

It may lead to memory wastage or overflow

It is slower than linked lists

Your Answer : Correct

Your Answer : Incorrect

Question 18 of 20

Q-18. In a singly linked list, what is the time complexity for inserting an element at the beginning?

O(1)

O(n)

O(log n)

O(n^2)

Your Answer : Correct

Your Answer : Incorrect

Question 19 of 20

Q-19. What is the time complexity for deleting a node with a given value in a doubly linked list?

O(1)

O(n)

O(log n)

O(n^2)

Your Answer : Correct

Your Answer : Incorrect

Question 20 of 20

Q-20. What is the purpose of a header node in a linked list?

To store the data of the first element

To indicate the end of the list

To simplify insertion and deletion operations

To improve memory utilization

Your Answer : Correct

Your Answer : Incorrect

Practice More Online Tests

Data Structure and Algorithms – Basics Online Test

Data Structure and Algorithms – Recursion Online Test

Data Structure and Algorithms – Linked Lists (Single,Double,Circular,Array,Polynomials) Online Test 1

Data Structure and Algorithms – Linked Lists (Single,Double,Circular,Array,Polynomials) Online Test 2

Data Structure and Algorithms – Linked Lists (Single,Double,Circular,Array,Polynomials) Online Test 3

Data Structure and Algorithms – Stack,Queue Online Test-1

Data Structure and Algorithms – Stack,Queue Online Test-2

Data Structure and Algorithms – Stack,Queue Online Test-3

Data Structure and Algorithms – Searching,Sorting Online Test

Data Structure and Algorithms – Binary Trees Online Test-1

Data Structure and Algorithms – Binary Trees Online Test-2

Data Structure and Algorithms – Binary Trees Online Test-3

Data Structure and Algorithms – Bubble Sort,Quick Sort,Selection Sort Online Test

Data Structure and Algorithms – Heap Sort,Internal Sort,External Sort Online Test

Data Structure and Algorithms – Graphs Online Test-1

Data Structure and Algorithms – Graphs Online Test-2

Data Structure and Algorithms – Graphs,Minimum Spanning Tree,Matrix Online Test

Data Structure and Algorithms Online Test 1 – Randomized MCQs

Data Structure and Algorithms Online Test 2 – Randomized MCQs

Data Structure and Algorithms Online Test 3 – Randomized MCQs

You may be Interested In

Data Structures and Algorithms Multiple Choice Questions with Answers (MCQs)

Data Structure and Algorithms Tutorials

Programming In C Multiple Choice Questions with Answers (MCQs)

Programming In C++ Multiple Choice Questions with Answers (MCQs)

Programming In C++ Tutorials

Programming In C Tutorials

Object Oriented Programming using CPP Questions Answers for Written Exams and Interviews

Android Programming Questions Answers for Written Exams and Interviews

← Previous

Data Structure and Algorithms – Linked Lists (Single,Double,Circular,Array,Polynomials) Online Test 2

Next →

Data Structure and Algorithms – Stack,Queue Online Test-1

📢 Share This Post:

Facebook Twitter LinkedIn WhatsApp

About Us

Providing free educational resources for Computer Science students and enthusiasts.

Quick Links

Home
Tutorials
MCQs
Online Tests
Write For Us
Contact Us
Privacy Policy
Disclaimer

Follow Us

Facebook Twitter LinkedIn

🔥 Most Popular Blogs

Want to Clear IBPS RRB PO? Master These Mock Test Hacks!
Mar 10, 2025 42 views
Applying Algorithmic Trading Techniques to Forex: Insights for Programmers and Data Scientists
Nov 22, 2024 36 views
Quick Guide to SMS Marketing Campaigns
Nov 29, 2023 30 views

© 2025 Examradar Hub. All Rights Reserved.