cs2002_2025T1_Q1_AN.pdf
Database Management System(DBMS) · Quiz 1 · Jan 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 47 MCQ · 3.0 marks
In the Enrollment table, which of the following is a typical way to handle the primary key?
Use an auto-increment column (e.g., EnrollmentID) as the primary key.
Use a composite primary key consisting of StudentID and CourseID.
There is no need to have a primary key for the Enrollment table.
Use a primary key consisting of StudentID.
A published solution is not available for this question yet.
Question 48 MCQ · 2.0 marks
In a typical design, what is the relationship between the Student table and the Enrollment table?
One-to-One
One-to-Many
Many-to-Many
Many-to-One
**PDSA**
**Section Id :** 64065379121
**Section Number :** 4
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 17
**Number of Questions to be attempted :** 17
**Section Marks :** 50
**Display Number Panel :** Yes
**Section Negative Marks :** 0
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
No
**Clear Response :**
**Section Maximum Duration :** 0
**Section Minimum Duration :** 0
**Section Time In :** Minutes
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.
Question 50 MCQ · 3.0 marks
[[IMAGE:2b3e79f64ad30f28_2_0]]

[[IMAGE:2b3e79f64ad30f28_2_1]]

[[IMAGE:2b3e79f64ad30f28_2_2]]

[[IMAGE:2b3e79f64ad30f28_2_3]]

[[IMAGE:2b3e79f64ad30f28_2_4]]

A published solution is not available for this question yet.
Question 51 MCQ · 3.0 marks
[[IMAGE:2b3e79f64ad30f28_3_5]]

[[IMAGE:2b3e79f64ad30f28_3_6]]

[[IMAGE:2b3e79f64ad30f28_3_7]]

[[IMAGE:2b3e79f64ad30f28_3_8]]

[[IMAGE:2b3e79f64ad30f28_3_9]]

A published solution is not available for this question yet.
Question 52 MCQ · 3.0 marks
[[IMAGE:2b3e79f64ad30f28_3_10]]

[[IMAGE:2b3e79f64ad30f28_3_11]]

[[IMAGE:2b3e79f64ad30f28_3_12]]

[[IMAGE:2b3e79f64ad30f28_3_13]]

[[IMAGE:2b3e79f64ad30f28_3_14]]

A published solution is not available for this question yet.
Question 53 MCQ · 3.0 marks
[[IMAGE:2b3e79f64ad30f28_4_15]]

The number of comparisons is the minimum when the input list is in
ascending order.
The number of comparisons is the maximum when the input list is in
descending order.
The number of comparisons is the same irrespective of the order of the
elements in the input list.
The number of comparisons depends on the number of swaps made during
the process.
A published solution is not available for this question yet.
Question 54 MCQ · 3.0 marks
[[IMAGE:2b3e79f64ad30f28_5_16]]

The number of shifts is always equal to the number of comparisons.
The number of shifts is minimum when the input list is in ascending order.
The number of shifts is minimum when the input list is in descending order.
The number of shifts is independent of the order of the elements in the input
list.
A published solution is not available for this question yet.
Question 55 MCQ · 3.0 marks
What is the time complexity for the worst case behaviour of **Merge Sort** ?
[[IMAGE:2b3e79f64ad30f28_5_17]]

[[IMAGE:2b3e79f64ad30f28_5_18]]

[[IMAGE:2b3e79f64ad30f28_5_19]]

[[IMAGE:2b3e79f64ad30f28_5_20]]

A published solution is not available for this question yet.
Question 56 MCQ · 3.0 marks
[[IMAGE:2b3e79f64ad30f28_6_21]]

[[IMAGE:2b3e79f64ad30f28_6_22]]

[[IMAGE:2b3e79f64ad30f28_6_23]]

[[IMAGE:2b3e79f64ad30f28_6_24]]

[[IMAGE:2b3e79f64ad30f28_6_25]]

A published solution is not available for this question yet.
Question 57 MCQ · 3.0 marks
Consider the following statements:
1. A stack can be used to check whether a word is a palindrome
2. A stack can be used to check if parentheses in an expression are balanced.
3. A stack used to manage print jobs in a printer spooler.
Choose the correct option regarding the given statements.
**Note**: A palindrome is a word that reads the same forwards and backwards. e.g: radar
Statement 1 and Statement 3 are true
Statement 2 and Statement 3 are true
Statement 1 and Statement 2 are true
All statements are true
A published solution is not available for this question yet.
Question 58 MCQ · 3.0 marks
[[IMAGE:2b3e79f64ad30f28_7_26]]

[[IMAGE:2b3e79f64ad30f28_7_27]]

[[IMAGE:2b3e79f64ad30f28_7_28]]

[[IMAGE:2b3e79f64ad30f28_7_29]]

[[IMAGE:2b3e79f64ad30f28_7_30]]

A published solution is not available for this question yet.
Question 59 MCQ · 4.0 marks
[[IMAGE:2b3e79f64ad30f28_8_31]]

E A
C B
C A
E B
A published solution is not available for this question yet.
Question 60 MSQ · 3.0 marks
[[IMAGE:2b3e79f64ad30f28_9_32]]

Insertion of the new node at the front of the linked list.
Insertion of the new node at the end of the linked list.
Deletion of the first node of the linked list.
Deletion of the last node of the linked list.
Search for any element in the linked list
A published solution is not available for this question yet.
Question 61 MSQ · 3.0 marks
[[IMAGE:2b3e79f64ad30f28_9_33]]

[[IMAGE:2b3e79f64ad30f28_9_34]]

[[IMAGE:2b3e79f64ad30f28_9_35]]

[[IMAGE:2b3e79f64ad30f28_9_36]]

[[IMAGE:2b3e79f64ad30f28_9_37]]

A published solution is not available for this question yet.
Question 62 MSQ · 3.0 marks
[[IMAGE:2b3e79f64ad30f28_10_38]]

[[IMAGE:2b3e79f64ad30f28_10_39]]

[[IMAGE:2b3e79f64ad30f28_10_40]]

[[IMAGE:2b3e79f64ad30f28_10_41]]

[[IMAGE:2b3e79f64ad30f28_10_42]]

[[IMAGE:2b3e79f64ad30f28_10_43]]

A published solution is not available for this question yet.
Question 63 NAT · 3.0 marks
[[IMAGE:2b3e79f64ad30f28_11_44]]

A published solution is not available for this question yet.
Question 64 NAT · 3.0 marks
Consider an **undirected graph** G with 55 edges with the least number of vertices possible. What
will be the number of vertices in graph G?
A published solution is not available for this question yet.
Question 65 NAT · 4.0 marks
[[IMAGE:2b3e79f64ad30f28_12_45]]

A published solution is not available for this question yet.