DS QUIZ-1

1.     Which of the following is the correct way to initialize a 2D array of size 2x3 with all elements set to 0 in C?

• • A) int arr[2][3] = {0};

• B) int arr[2][3] = {1};

• int arr[2][3] = {0, 1, 2, 3, 4};

• • D) int arr[2][3] = {0, 0, 0};

2.    Given an array of integers, what is the best approach to find the largest element in the array?

• A) Use a binary search algorithm.

• B) Traverse the array once, keeping track of the largest element found.

• C) Sort the array and select the last element.

• D) Use a hash table to store and find the largest element.

3. 3.   You are given an array containing n integers, where each integer is between 1 and n+1. One integer is missing. What is the time complexity to find the missing integer?

4. 
   
   

• • A) O(n)

• • B) O(n log n)

• • C) O(1)

• • D) O(n^2)

4.     Which advantage does a linked list have over an array when dealing with dynamic data sizes?

• • A) Linked lists have better cache performance.

• • B) Linked lists use less memory per element.

• • C) Linked lists can grow and shrink in size more efficiently without resizing or reallocating.

• • D) Linked lists offer constant time access to elements.

5.     What is the time complexity of merging two sorted singly linked lists into a single sorted linked list?

• • A) O(n + m)

• • B) O(n * m)

• • C) O(n)

• • D) O(m)

6.    What is the optimal approach to swap every two adjacent nodes in a singly linked list?

• 
  
  

• • A) Use a stack to store nodes and swap adjacent nodes.

• • B) Use a dummy node and swap pairs iteratively.

• • C) Reverse the entire list and then swap adjacent nodes.

• • D) Use a recursive function to swap nodes in pairs.

7.     Inserting a new node before a given node temp in a doubly linked list involves which of the following steps?

• • A) Update temp->prev->next to point to the new node, set newNode->prev to temp->prev, and newNode->next to temp.

• • B) Update temp->prev->next to point to the new node, set newNode->prev to temp, and newNode->next to temp->next.

• • C) Set newNode->prev to temp->prev, newNode->next to temp, and update temp->prev and temp->next.

• • D) Set newNode->prev to temp->prev, newNode->next to temp, and update temp->prev and temp->next

8.     In a circular linked list, how does the termination condition differ from that of a standard singly linked list?

• • A) The termination condition is the same; it checks for a NULL pointer.

• • B) The termination condition is that the pointer returns to the head node.

• • C) The termination condition is determined by a counter that keeps track of nodes.

• • D) The termination condition is that the list is empty.

9.     In a singly linked list, what is the time complexity of inserting a new node at the end of the list if you don’t maintain a pointer to the tail?

• • A) O(1)

• • B) O(log n)

• • C) O(n)

• • D) O(n^2)

10.     What happens if you access an element outside the bounds of a 2D array in C?

• • A) The program will throw a runtime exception.

• • B) The program will produce a compile-time error.

• • C) The program will access memory outside the allocated space, leading to undefined behavior.

• • D) The program will ignore the out-of-bounds access.