MauryaHub PYQ Practice

cs2002_2025T2_Q1_AN.pdf

Database Management System(DBMS) · Quiz 1 · May 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

[[IMAGE:2b9c95be5032bfd6_2_0]]
Source diagram or notation
  1. [[IMAGE:2b9c95be5032bfd6_2_1]]
    Source diagram or notation
  2. [[IMAGE:2b9c95be5032bfd6_2_2]]
    Source diagram or notation
  3. [[IMAGE:2b9c95be5032bfd6_2_3]]
    Source diagram or notation
  4. [[IMAGE:2b9c95be5032bfd6_2_4]]
    Source diagram or notation

A published solution is not available for this question yet.

Question 48 MCQ · 3.0 marks

[[IMAGE:2b9c95be5032bfd6_3_5]]
Source diagram or notation
  1. [[IMAGE:2b9c95be5032bfd6_3_6]]
    Source diagram or notation
  2. [[IMAGE:2b9c95be5032bfd6_3_7]]
    Source diagram or notation
  3. [[IMAGE:2b9c95be5032bfd6_3_8]]
    Source diagram or notation
  4. [[IMAGE:2b9c95be5032bfd6_3_9]]
    Source diagram or notation

A published solution is not available for this question yet.

Question 49 MCQ · 3.0 marks

When using the **binary search algorithm** on a sorted list, consider the **maximum number of** **comparisons** it might take in the worst-case scenario to find an item or confirm it's absent. If the **total number of items in this sorted list is doubled**, how does this **maximum number of** **comparisons** change?
  1. It doubles
  2. It remains the same
  3. It becomes half
  4. It increases by 1

A published solution is not available for this question yet.

Question 50 MCQ · 3.0 marks

[[IMAGE:2b9c95be5032bfd6_4_10]]
Source diagram or notation
  1. When the input array is already sorted; the algorithm still performs redundant checks.
  2. When the input array is sorted in reverse (descending) order; each element needs to be compared against and shifted past all previously sorted elements.
  3. When the input array contains many duplicate elements; handling duplicates requires extra comparisons.
  4. When the input array elements are randomly distributed; the lack of order maximizes the average number of shifts required.

A published solution is not available for this question yet.

Question 51 MCQ · 3.0 marks

[[IMAGE:2b9c95be5032bfd6_5_11]]
Source diagram or notation
  1. [[IMAGE:2b9c95be5032bfd6_5_12]]
    Source diagram or notation
  2. [[IMAGE:2b9c95be5032bfd6_5_13]]
    Source diagram or notation
  3. [[IMAGE:2b9c95be5032bfd6_5_14]]
    Source diagram or notation
  4. [[IMAGE:2b9c95be5032bfd6_5_15]]
    Source diagram or notation

A published solution is not available for this question yet.

Question 52 MCQ · 3.0 marks

[[IMAGE:2b9c95be5032bfd6_5_16]]
Source diagram or notation
  1. Choosing a median value as the pivot for each recursive call.
  2. Choosing either the smallest or the largest element as the pivot at each recursive call.
  3. Choosing either the first or the last position element as the pivot at each recursive call.
  4. Partitioning the array into two roughly equal halves at each recursive call.

A published solution is not available for this question yet.

Question 53 MCQ · 3.0 marks

[[IMAGE:2b9c95be5032bfd6_6_17]]
Source diagram or notation
  1. [[IMAGE:2b9c95be5032bfd6_6_18]]
    Source diagram or notation
  2. [[IMAGE:2b9c95be5032bfd6_6_19]]
    Source diagram or notation
  3. [[IMAGE:2b9c95be5032bfd6_6_20]]
    Source diagram or notation
  4. [[IMAGE:2b9c95be5032bfd6_6_21]]
    Source diagram or notation

A published solution is not available for this question yet.

Question 54 MCQ · 3.0 marks

[[IMAGE:2b9c95be5032bfd6_7_22]]
Source diagram or notation
  1. [[IMAGE:2b9c95be5032bfd6_7_23]]
    Source diagram or notation
  2. [[IMAGE:2b9c95be5032bfd6_7_24]]
    Source diagram or notation
  3. [[IMAGE:2b9c95be5032bfd6_7_25]]
    Source diagram or notation
  4. [[IMAGE:2b9c95be5032bfd6_7_26]]
    Source diagram or notation

A published solution is not available for this question yet.

Question 55 MCQ · 3.0 marks

[[IMAGE:2b9c95be5032bfd6_7_27]]
Source diagram or notation
  1. 3
  2. 4
  3. 6
  4. 7

A published solution is not available for this question yet.

Question 56 MSQ · 3.0 marks

[[IMAGE:2b9c95be5032bfd6_8_28]]
Source diagram or notation
  1. [[IMAGE:2b9c95be5032bfd6_8_29]]
    Source diagram or notation
  2. [[IMAGE:2b9c95be5032bfd6_8_30]]
    Source diagram or notation
  3. [[IMAGE:2b9c95be5032bfd6_8_31]]
    Source diagram or notation
  4. [[IMAGE:2b9c95be5032bfd6_8_32]]
    Source diagram or notation

A published solution is not available for this question yet.

Question 57 MSQ · 3.0 marks

[[IMAGE:2b9c95be5032bfd6_9_33]]
Source diagram or notation
  1. [[IMAGE:2b9c95be5032bfd6_9_34]]
    Source diagram or notation
  2. [[IMAGE:2b9c95be5032bfd6_9_35]]
    Source diagram or notation
  3. [[IMAGE:2b9c95be5032bfd6_9_36]]
    Source diagram or notation
  4. [[IMAGE:2b9c95be5032bfd6_9_37]]
    Source diagram or notation
  5. [[IMAGE:2b9c95be5032bfd6_9_38]]
    Source diagram or notation

A published solution is not available for this question yet.

Question 58 MSQ · 4.0 marks

[[IMAGE:2b9c95be5032bfd6_10_39]]
Source diagram or notation
  1. (1,4)
  2. (2,4)
  3. (3,4)
  4. (3,5)
  5. (4,5)
  6. (1, 5)

A published solution is not available for this question yet.

Question 59 NAT · 3.0 marks

[[IMAGE:2b9c95be5032bfd6_11_40]]
Source diagram or notation

    A published solution is not available for this question yet.

    Question 60 NAT · 3.0 marks

    [[IMAGE:2b9c95be5032bfd6_11_41]]
    Source diagram or notation

      A published solution is not available for this question yet.

      Question 61 NAT · 3.0 marks

      [[IMAGE:2b9c95be5032bfd6_12_42]]
      Source diagram or notation

        A published solution is not available for this question yet.

        Question 62 NAT · 4.0 marks

        [[IMAGE:2b9c95be5032bfd6_13_43]]
        Source diagram or notation

          A published solution is not available for this question yet.