IT-B-DS Lab Quiz-3

What is the main advantage of using a singly linked list over an array?

• Random access is easier

• Insertion and deletion operations are easier

• It uses less memory

• It allows access to multiple elements at once

In a singly linked list, what does the next pointer of the last node point to?

• The first node of the list

• NULL

• The second node of the list

• A random node

Which of the following is true about the node structure in a singly linked list?

• It contains two fields: one for the data and one for the next node

• It contains three fields: one for the data, one for the next node, and one for the previous node

• It contains one field for the data

• It contains a single field to the next node

What will be the result of the following operation in a singly linked list?

"Insert a node at the beginning of the list."

• The new node points to the current first node

• The new node points to NULL

• The new node becomes the last node

• The new node points to the previous node

What is the default state of the next pointer of a newly created node in a singly linked list?

• Points to the previous node

• Points to the next node

• Points to NULL

• Points to an arbitrary memory location

If the singly linked list is empty, what does the head pointer point to?

• A random node

• NULL

• The first node in the list

• A special node indicating the list is empty

How do you find the length of a singly linked list?

• Use a recursive function to traverse the list

• Use a stack to store the nodes

• Directly access the size attribute of the list

• Traverse the list and count the nodes one by one

When does a singly linked list require additional memory?

• When a node has to store a pointer to the next node

• When performing operations like reversing the list

• When accessing elements by index

• When inserting nodes at the beginning

Which of the following is a requirement for binary search to work?

• The array should be unsorted

• The array should be sorted in ascending or descending order

• The array should have no duplicate elements

• The array should be of even length

Which of the following best describes the process of binary search?

• Compare an element with the middle element, eliminate half of the array, and repeat

• Compare an element with the first and last elements, eliminate half of the array, and repeat

• Compare an element with all other elements in the array

• Sort the array and search for the element sequentially