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

GATE 2024 CSE Daily Practice Questions for 9 October 2023

GATE 2024 CSE Daily Practice Questions for 9 October 2023: The Daily Practice Problems (DPPs) or questions for GATE 2024 CSE will not only enhance the preparation level of the candidates but also improve their subject knowledge. Practicing at least 5 DPPs per day for GATE CSE will help the candidates understand the syllabus coverage and the nature of questions asked in the exam. GATE 2024 is scheduled to be conducted in February. IISc Bangalore has revised the registration dates of GATE 2024 , and the candidates can apply for the exam on or before October 12 without a late fee.

GATE 2024 CSE Daily Practice Questions for 9 October 2023

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

Question 1: Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive and distinct. Consider the following statements:

(I) Minimum spanning tree of G is always unique.

(II) Shortest path between any two vertices of G is always unique.

Which of the above statements is/are necessarily true?

A (I) only

B (II) only

C Both (I) and (II)

D Neither (I) nor (II)

Question 2: An articulation point in a connected graph is a vertex such that removing the vertex and its incident edges disconnects the graph into two or more connected components.

Let T be a DFS tree obtained by doing DFS in a connected undirected graph G.

Which of the following options is/are correct?

A: Root of T can never be an articulation point in G.

B: Root of T is an articulation point in G if and only if it has 2 or more children.

C: A leaf of T can be an articulation point in G.

D: If u is an articulation point in G such that x is an ancestor of u in T and y is a descendent of u in T, then all paths from x to y in G must pass through u.

Question 3: Which of the following is application of Breath First Search on the graph?

A: Finding the diameter of the graph

B: Finding bipartite graph

C: Both (A) and (B)

D: None of the above

Question 4: Breadth First Search(BFS) is started on a binary tree beginning from the root vertex. There is a vertex t at a distance four from the root. If t is the n-th vertex in this BFS traversal, then the maximum possible value of n is______.

A: 16

B: 15

C: 31

D: 32

Question 5: Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE?

P: Minimum spanning tree of G does not change

Q: Shortest path between any pair of vertices does not change

A: P only

B: Q only

C: Neither P nor Q

D: Both P and Q

Also Read |

• CAT 2023 Daily Practice Questions for 9 October
• Current Affairs 9 October 2023 for Competitive Exams
• GATE 2022 Paper-Wise Qualifying Marks
• GATE 2024 Score Mandatory for DRDO Scientist 'B Recruitment
• GATE Question Paper 2023
• GATE 2022 Question Paper
• GATE 2021 Question Paper

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 .