CUET PG 2025 — Computer PYQ

Q: How do I solve CUET PG 2025 Computer questions?

Practice CUET PG 2025 Computer previous year questions with step-by-step solutions on Mathem Solvex. Each question includes a detailed explanation and video solution to help you master the concept quickly.

Q: What is the difficulty level of CUET PG Computer questions?

CUET PG Computer questions range from moderate to advanced difficulty. Consistent practice with official previous year papers and topic-wise drills on Mathem Solvex is the most effective preparation strategy.

Q: Are CUET PG previous year papers available for free?

Yes. Mathem Solvex provides free access to CUET PG previous year question papers and topic-wise PDFs. You can download them or attempt them as timed live mock tests directly on the platform.

Question

CUET PG 2025 — Computer PYQ

CUET PG | Computer | 2025

Arrange the following time complexities in increasing order.

(A) Bubble sort (worst case)

(B) Deleting head node in singly linked list

(C) Binary search

(D) Worst case of merge sort

Choose the correct answer from the options given below:

Choose the correct answer:

Explanation

Solution:

Sabse pehle har operation ki time complexity ko define karte hain:

(A) Bubble sort (worst case): $O(n^2)$
(B) Deleting head node in singly linked list: $O(1)$
(C) Binary search: $O(\log n)$
(D) Worst case of merge sort: $O(n \log n)$

Increasing Order (Chhote se bada):

O(1) < O(\log n) < O(n \log n) < O(n^2)

Iska matlab hai:

(B) < (C) < (D) < (A)

Right Answer:

(B), (C), (D), (A)