Professional Documents
Culture Documents
Structure and Algorithms – Linked ListsSingleDoubleCircular ArrayPolynomials MCQs Based
Online Test 1
Hello Friends This Data Structure and Algorithms – Linked ListsSingleDoubleCircular Array
Polynomials MCQs Based Online Test 1 Contain Multiple Choice type Questions and Answers (
MCQ ) Covered from the below topics of Data structure Like Single Linked List,Array based
linked lists,Double Linked List,Circular Single Linked List,Circular Double Linked
List,Polynomials etc.These Questions have been already asked in the various competitive
exams.
Time limit: 00:09:51
Question1.
Which among the following is a linear data structure
Queue
Linked List
Stack
all the above
Question2.
Which among the following is a dynamic data structure:
Double Linked List
Stack
Queue
all the above
all the above
Question3.
The link field in a node contains:
address of the next node
data of next node
data of previous node
data of current node
Question4.
Memory is allocated dynamically to a data structure during execution by —— function.
malloc()
realloc()
Calloc()
all the above
Question5.
How many null pointer/s exist in a circular double linked list?
Question6.
Suppose that p is a pointer variable that contains the NULL pointer.
What happens if your program tries to read or write *p?
A syntax error always occurs at compilation time.
A runtime error always occurs when *p is evaluated.
A runtime error always occurs when *p is evaluated.
A runtime error always occurs when the program finishes.
The results are unpredictable.
Question7.
What kind of list is best to answer questions such as: “What is the item at position n?”
Lists implemented with an array.
Doublylinked lists.
Singlylinked lists.
Doublylinked or singlylinked lists are equally best.
Question8.
In a single linked list which operation depends on the length of the list.
Delete the last element of the list
Add an element before the first element of the list
Delete the first element of the list
Interchange the first two elements of the list
Question9.
A double linked list is declared as follows:
struct dllist
{
struct dllist *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 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
Question10.
Which among the following segment of code deletes the element
pointed to by X from the 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?
X > bwd = X > fwd; X > fwd = X > bwd
start = X > fwd; start > bwd = NULL;
start = X > fwd; X > fwd = NUL
X > bwd > bwd = X > bwd; X > fwd > fwd = X > fwd
Finish Test
You may be interested in:
Data Structures and Algorithms – MCQs.
Data Structure and Algorithms Tutorials
Previous Next
Data Structure and Algorithms – Recursion Data Structure and Algorithms – Linked
MCQs Based Online Test ListsSingleDoubleCircular Array
Polynomials MCQs Based Online Test 2
TABLE OF CONTENTS
Data Structure and Algorithms – MCQs Based Online Test
Data Structure and Algorithms – Recursion MCQs Based Online Test
Data Structure and Algorithms – Linked ListsSingleDoubleCircular ArrayPolynomials
MCQs Based Online Test 1
Data Structure and Algorithms – Linked ListsSingleDoubleCircular ArrayPolynomials
MCQs Based Online Test 2
Data Structure and Algorithms – Linked ListsSingleDoubleCircular ArrayPolynomials
MCQs Based Online Test 3
Data Structure and Algorithms – Stack,Queue MCQs Based Online Test1
Data Structure and Algorithms – Stack,Queue MCQs Based Online Test2
Data Structure and Algorithms – Stack,Queue MCQs Based Online Test3
Data Structure and Algorithms – SearchingSorting MCQs Based Online Test
Data Structure and Algorithms – Binary Trees MCQs Based Online Test1
Data Structure and Algorithms – Binary Trees MCQs Based Online Test2
Data Structure and Algorithms – Binary Trees MCQs Based Online Test3
Data Structure and Algorithms – Bubble Sort,Quick Sort,Selection Sort MCQs Based
Online Test
Data Structure and Algorithms – Heap Sort,Internal Sort,External Sort MCQs Based Online
Test
Data Structure and Algorithms – Graph MCQs Based Online Test1
Data Structure and Algorithms – Graph MCQs Based Online Test2
Data Structure and Algorithms – GraphsMinimum Spanning TreeMatrix MCQs Based
Online Test
Team behind this platform
We Are Engineering Graduate ,Tutor and Technology lover, Our Primary
Main Area of interest is Computer Science And Electronics &
Communication Technology
We are trying to make all those topics more simple and easy to
understand,So that it will help students to learn it very quickly in limited
amount of time like Last Peak hours of their Extermination,its like last time revision Notes. we
also have provided the depth knowledge of some topics which really require more words to
explain.
Other Area of this online platform contains "Online MCQ based Tests / Multiple choice
Questions" ,Which can Helps readers to crack Various competitive Exams
Computer subject become necessary for all the students from various branches, and this
platform will provide them all the required knowledge to answer the Questions correctly in the
various competitive exams
If you have any Questions regarding this free Computer Science tutorials ,Short Questions and
Answers,Multiple choice Questions And AnswersMCQ sets,Online Test/Quiz,Short Study
Notes don’t hesitate to contact us via Facebook,or through our website.Email us @
examradar@Gmail.com We love to get feedback and we will do our best to make you happy.
Copyright © 2023 | ExamRadar. | Contact Us | Copyright || Terms of Use || Privacy Policy