Question 2 MCQ · 3.0 marks
[[IMAGE:1760cfa3304011ac_2_0]]
- [[IMAGE:1760cfa3304011ac_2_1]]
- [[IMAGE:1760cfa3304011ac_2_2]]
- [[IMAGE:1760cfa3304011ac_2_3]]
- [[IMAGE:1760cfa3304011ac_2_4]]
A published solution is not available for this question yet.
cs2002_2025T3_Q1_AN.pdf
Database Management System(DBMS) · Quiz 1 · Sep 2025
← Course papers · Start practice / exam
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
Question 3 MCQ · 3.0 marks
[[IMAGE:1760cfa3304011ac_3_5]]
- [[IMAGE:1760cfa3304011ac_3_6]]
- [[IMAGE:1760cfa3304011ac_3_7]]
- [[IMAGE:1760cfa3304011ac_3_8]]
- [[IMAGE:1760cfa3304011ac_3_9]]
A published solution is not available for this question yet.
Question 4 MCQ · 3.0 marks
[[IMAGE:1760cfa3304011ac_3_10]]
- 35, 51, 39, 47
- 35, 51, 47
- 35, 51, 43, 47
- 35, 55, 39, 47
- None of these
A published solution is not available for this question yet.
Question 5 MCQ · 3.0 marks
[[IMAGE:1760cfa3304011ac_4_11]]
- 2
- 3
- 4
- 5
A published solution is not available for this question yet.
Question 6 MCQ · 3.0 marks
[[IMAGE:1760cfa3304011ac_4_12]]
- [[IMAGE:1760cfa3304011ac_4_13]]
- [[IMAGE:1760cfa3304011ac_4_14]]
- [[IMAGE:1760cfa3304011ac_4_15]]
- [[IMAGE:1760cfa3304011ac_4_16]]
A published solution is not available for this question yet.
Question 7 MCQ · 3.0 marks
[[IMAGE:1760cfa3304011ac_5_17]]
- Only Statement 1
- Only Statement 2
- Only Statement 3
- Statements 1 and 2
- Statements 2 and 3
A published solution is not available for this question yet.
Question 8 MCQ · 3.0 marks
[[IMAGE:1760cfa3304011ac_6_18]]
- [[IMAGE:1760cfa3304011ac_6_19]]
- [[IMAGE:1760cfa3304011ac_6_20]]
- [[IMAGE:1760cfa3304011ac_6_21]]
- [[IMAGE:1760cfa3304011ac_6_22]]
A published solution is not available for this question yet.
Question 9 MCQ · 3.0 marks
[[IMAGE:1760cfa3304011ac_7_23]]
- [[IMAGE:1760cfa3304011ac_7_24]]
- [[IMAGE:1760cfa3304011ac_7_25]]
- [[IMAGE:1760cfa3304011ac_7_26]]
- [[IMAGE:1760cfa3304011ac_7_27]]
A published solution is not available for this question yet.
Question 10 MCQ · 2.0 marks
[[IMAGE:1760cfa3304011ac_8_28]]
- 1-a, 2-b, 3-c, 4-d
- 1-b, 2-a, 3-d, 4-c
- 1-a, 2-b, 3-d, 4-c
- 1-c, 2-b, 3-a, 4-d
A published solution is not available for this question yet.
Question 11 MSQ · 3.0 marks
[[IMAGE:1760cfa3304011ac_8_29]]
- [[IMAGE:1760cfa3304011ac_8_30]]
- [[IMAGE:1760cfa3304011ac_8_31]]
- [[IMAGE:1760cfa3304011ac_8_32]]
- [[IMAGE:1760cfa3304011ac_9_33]]
- [[IMAGE:1760cfa3304011ac_9_34]]
A published solution is not available for this question yet.
Question 12 MSQ · 3.0 marks
Consider a **connected, undirected graph G** with **n** vertices. A **Breadth-First Search (BFS)**
traversal is performed starting from a source vertex **s**. Let **d(s, v)** denote the shortest distance (in
terms of number of edges) from **s** to vertex **v**.
Which of the following statements is **true** about the BFS traversal?
- All vertices at distance **k** from **s** are visited before any vertex at distance **k + 1** from **s.**
- Once a vertex is visited, it is never visited again during the traversal.
- BFS may fail to visit some vertices, even if the graph is connected.
- The time complexity of BFS using an adjacency list representation is **O(n**\(^{2}\)**).**
A published solution is not available for this question yet.
Question 13 NAT · 3.0 marks
[[IMAGE:1760cfa3304011ac_9_35]]
A published solution is not available for this question yet.
Question 14 NAT · 3.0 marks
[[IMAGE:1760cfa3304011ac_10_36]]
A published solution is not available for this question yet.
Question 15 NAT · 3.0 marks
[[IMAGE:1760cfa3304011ac_10_37]]
A published solution is not available for this question yet.
Question 16 NAT · 3.0 marks
[[IMAGE:1760cfa3304011ac_11_38]]
A published solution is not available for this question yet.
Question 17 NAT · 3.0 marks
[[IMAGE:1760cfa3304011ac_11_39]]
A published solution is not available for this question yet.
Question 18 NAT · 3.0 marks
[[IMAGE:1760cfa3304011ac_12_40]]
A published solution is not available for this question yet.