CUET PG 2021 — Computer PYQ

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

Practice CUET PG 2021 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 2021 — Computer PYQ

CUET PG | Computer | 2021

The time factor when determining the efficiency of an algorithm is measured by

Choose the correct answer:

Explanation

Time Complexity Function

Agar $n$ input size hai aur $T(n)$ total time hai, toh:

T(n) = f(n)

Yahan $f(n)$ algorithm ke steps ki sankhya ko darshata hai.

Big O Notation

Efficiency ko measure karne ke liye hum aksar Big O Notation ka use karte hain, jo "Worst-case Scenario" batata hai:

\text{Efficiency} = O(g(n))

Yahan $g(n)$ growth rate hai. Example ke liye:

Linear Time: $T(n) = O(n)$
Constant Time: $T(n) = O(1)$
Quadratic Time: $T(n) = O(n^2)$

Short Answer: Time factor ko Number of elementary operations