Data Structures Quiz :- 2 (IT-c)
-
Which of the following points is/are true about Linked List data structure when it is compared with array
-
Arrays have better cache locality that can make them better in terms of performance
-
It is easy to insert and delete elements in Linked List
-
Random access is not allowed in a typical implementation of Linked Lists
-
All of the mentioned
-
Data Structures Quiz :- 2 (IT-C) challenges learners with problems on linked lists, including node insertion, deletion, and traversal. It assesses understanding of pointers and linked list operations, crucial for efficient data handling and algorithm implementation in computer science.
(200).webp "Data Structures Quiz :- 2 (IT-c) - Quiz")
Quiz Preview
- 2.
Insertion of a node at the beginning of the singly linked list involves modification of
-
One pointer
-
Two pointer
-
Three pointer
-
Nothing
Correct Answer
A. Two pointerExplanation
When inserting a node at the beginning of a singly linked list, we need to modify two pointers. First, we need to update the "next" pointer of the new node to point to the current head of the list. This ensures that the new node is now the first node in the list. Second, we need to update the pointer of the head of the list to point to the new node. This ensures that the new node becomes the new head of the list and the rest of the list remains connected. Therefore, two pointers need to be modified in this operation.Rate this question:
-
- 3.
What is the change in linked list after execution of the following code?start:- points to first node of linkedstart->info=start->link->info;
-
The values of first node and second node will be same
-
The value of first node will be copied into second node
-
The value of three node will be copied into first node
-
No change
Correct Answer
A. The values of first node and second node will be sameExplanation
The code is assigning the value of the first node to the second node. Therefore, after executing the code, the values of the first and second nodes will be the same.Rate this question:
-
- 4.
Assume a linked list referred by start pointer. which of the following set of statements will result into deletion of a node at position pos
-
If(pos==1) start=start->link; else { t1=start; for(int i=2;ilink; } t1->link=t1->link->link; }
-
If(pos==1) start=start->link; else { t1=start; for(int i=1;ilink; } t1->link=t1->link->link; }
-
If(pos==1) start=start->link; else { t1=start; for(int i=1;ilink; } t1=t1->link; }
-
If(pos==1) start=start->link; else { t1=start; for(int i=1;ilink; } t1->link=t1; }
Correct Answer
A. If(pos==1) start=start->link; else { t1=start; for(int i=2;ilink; } t1->link=t1->link->link; }Explanation
This set of statements will result in the deletion of a node at position pos. If pos is equal to 1, it means that the node to be deleted is the first node. In this case, the start pointer is updated to point to the second node, effectively removing the first node from the linked list. If pos is not equal to 1, it means that the node to be deleted is not the first node. The t1 pointer is set to point to the start pointer, and a loop is executed until i is equal to pos-1. This loop moves the t1 pointer to the node just before the node to be deleted. Finally, the link of the t1 pointer is updated to skip over the node to be deleted, effectively removing it from the linked list.Rate this question:
-
- 5.
Assume a linked list has been created and start pointer is referring the first node of that linked list. select the following code that can add a new node that address hold by temp pointer, at beginning of that linked list
-
Temp->link=start; start=temp;
-
Start=temp; temp->link=start;
-
Start=temp->link; temp=start;
-
Temp=start; temp=start->link
Correct Answer
A. Temp->link=start; start=temp;Explanation
The correct answer is "temp->link=start; start=temp;". This code snippet first assigns the link of the new node to the start pointer, which ensures that the new node points to the previous first node in the linked list. Then, the start pointer is updated to point to the new node, effectively adding it to the beginning of the linked list.Rate this question:
-
- 6.
Linked is a ......
-
Linear data structure
-
Non linear data structure
-
Dynamic data structure
-
None
Correct Answer
A. Linear data structureExplanation
The given answer is "Linear data structure" because a linked list is a type of data structure where each element is connected to the next element through a pointer. It maintains a linear order of elements and allows sequential access to its elements. This makes it a linear data structure.Rate this question:
-
- 7.
Binary search is possible in Linked list
-
True
-
False
Correct Answer
A. FalseExplanation
Binary search is not possible in a linked list because in order to perform binary search, we need random access to elements, which is not possible in a linked list. In a linked list, we can only access elements one by one starting from the head node. Binary search requires accessing the middle element of a sorted list, which is not feasible in a linked list. Therefore, the correct answer is False.Rate this question:
-
- 8.
What is the output of following function for start pointing to first node of following linked list?1->2->3->4->5->6void fun(struct node* start){ if(start==NULL) return; while(start->link!=NULL) { printf("%d ",(start->link)->info); start=start->link; } }
-
1 2 3 4 5 6
-
2 3 4 5 6
-
2 3 4 5
-
1 2 3 4 5
Correct Answer
A. 2 3 4 5 6Explanation
The function starts by checking if the start node is NULL. If it is, the function returns. Otherwise, it enters a while loop that continues as long as the link of the current node is not NULL. Inside the loop, it prints the info of the next node and updates the start pointer to point to the next node. This process continues until the end of the linked list is reached. Therefore, the output of the function for the given linked list would be "2 3 4 5 6".Rate this question:
-
- 9.
You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?
-
Delete the first element
-
Insert a new element as a first element
-
Delete the last element of the list
-
Add a new element at the end of the list
Correct Answer
A. Delete the last element of the listExplanation
The operation of deleting the last element of the list is dependent on the length of the linked list. If the linked list has only one element, deleting the last element would result in an empty list. However, if the linked list has more than one element, deleting the last element would require traversing the entire list to reach the second-to-last element and update its next pointer. Therefore, the length of the linked list affects the complexity and feasibility of deleting the last element.Rate this question:
-
- 10.
Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list?
-
Possible if size of linked list is even
-
Possible if size of linked list is odd
-
Possible if X is not last node. Use following two steps (a) Copy the data of next of X to X. (b) Delete next of X.
-
Possible if X is not first node. Use following two steps (a) Copy the data of next of X to X. (b) Delete next of X.
Correct Answer
A. Possible if size of linked list is even -
Quiz Review Timeline (Updated): Apr 12, 2024 +
Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.
-
Current Version
-
Apr 12, 2024Quiz Edited by
ProProfs Editorial Team -
Aug 31, 2017Quiz Created by
Harish Sharma