GATE 2024 CSE Daily Practice Problems (DPP) and Questions 11 October 2023

GATE 2024 CSE Daily Practice Questions for 11 October 2023: The Daily Practice Problems (DPPs) are an excellent way to strengthen your knowledge and problem-solving skills for GATE 2024 CSE. Regularly practicing and applying this concept will help candidates develop a deeper understanding of concepts and improve their retention of important concepts. The Indian Institute of Science, Bangalore has revised GATE 2024 registration dates. Therefore, candidates planning to appear for the examination scheduled in February must apply online before the deadline. 

Also Check |GATE 2024 CSE Daily Practice Problems (DPPs) and Questions for 9 October 2023

GATE 2024 CSE Daily Practice Questions for 11 October 2023

Students can find daily CSE practice questions for GATE 2024 here. Solve the given questions and analyse your exam preparation.

Question 1: Which of the following algorithms solves the all pair shortest path problem?

A: Prim's algorithm

B: Dijkstra's algorithm

C: Bellman ford algorithm

D: Floyd warshalls algorithm

Question 2: Let SLLdel be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let DLLdel be another function that deletes a node in a doubly-linked list given a pointer to the node and a pointer to the head of the list.

Let n denote the number of nodes in each of the linked lists. Which one of the following choices is TRUE about the worst-case time complexity of SLLdel and DLLdel?

A: SLLdel is O(1) and DLLdel is O(n)

B: Both SLLdel and DLLdel are O(log(n))

C: Both SLLdel and DLLdel are O(1)

D: SLLdel is O(n) and DLLdel is O(1)

Question 3: If an array A contains the items 10, 4, 7, 23, 67, 12 and 5 in that order, what will be the resultant array A after third pass of insertion sort?

A: 67,12,10,5,4,7,23

B: 4,7,10,23,67,12,5

C: 4,5,7,67,10,12,23

D: 10,7,4,67,23,12,5

Question 4: Given two statements

Insertion of an element should be done at the last node of the circular list

Deletion of an element should be done at the last node of the circular list

A: Both are true

B: Both are false

C: First is false and second is true

D: None of the above

Question 5: Suppose there are 11 items in sorted order in an array. How many searches are required on the average, if binary search is employed and all searches are successful in finding the item?

A: 3.00

B: 3.46

C: 2.81

D: 3.33

Also Read |

​​​​For the latest Education News, keep visiting CollegeDekho. You can also ‘follow’ our WhatsApp Channel to stay updated with the latest happenings. You can also write to us at our E-Mail ID news@collegedekho.com.