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

What is the worst-case time complexity of linear search algorithm?

Choose the correct answer:

Explanation

1. Worst-Case Scenario: Worst-case tab hota hai jab:

Target element array ke aakhri index par ho.
Ya phir target element array mein hai hi nahi.

2. Number of Comparisons: Agar array ka size $n$ hai:

Pehle element ke liye: $1$ comparison
Doosre element ke liye: $2$ comparisons
...
$n$ -th element (aakhri) ke liye: $n$ comparisons

\text{Total Comparisons in Worst Case} = n

3. Mathematical Representation: Kyunki time complexity seedhe taur par input size ( $n$ ) ke proportional hai, isliye ise Big-O notation mein aise likha jata hai:

\text{Worst-case Complexity} = O(n)