My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Complexity Analysis - Algorithms - Computer Science & Information Technology Previous Year Questions

Practice Complexity Analysis - Algorithms - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

20Papers
11Years
40Questions
1Topics

Complexity Analysis question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Complexity Analysis. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 25 62.5%
Easy 15 37.5%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 29 72.5%
Numerical Answer Type (NAT) 6 15%
MSQ 5 12.5%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
40 Qs

Most asked topics

Top topics across the included previous year papers.

Algorithms
40 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Complexity Analysis
40 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science and Information Technology (CS) 2026
3 Qs
Computer Science and Information Technology (CS) 2026
1 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
3 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
3 Qs
Computer Science & Information Technology (CS) 2013 [Session 2]
2 Qs

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science and Information Technology (CS) 202620261View paper
Computer Science and Information Technology (CS) 202620263View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20251View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20242View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20241View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20232View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20221View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20213View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20211View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20201View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20173View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20161View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20161View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20143View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20144View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20141View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20133View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20132View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20133View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20133View paper

All Complexity Analysis previous year questions

Practice every matching question in batches of 20, with every available option.

1
2013 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2013 [Session 1]
Which of the following statements are TRUE?
1. The problem of determining whether there exists a cycle in an undirected graph is in P.
2. The problem of determining whether there exists a cycle in an undirected graph is in NP.
3. If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.
Open complete paper
2
2013 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2013 [Session 1]
The number of elements that can be sorted in \(\Theta(\log n)\) time using heap sort is
Open complete paper
3
2013 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2013 [Session 1]
Consider the following function: int unknown(int n) { int i, j, k=0; for (i=n/2; i<=n; i++) for (j=2; j<=n; j=j*2) k = k + n/2; return (k); } The return value of the function is
Open complete paper
4
2013 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2013 [Session 2]
Consider the following function: ``` int unknown(int n) { int i, j, k=0; for (i=n/2; i<=n; i++) for (j=2; j<=n; j=j*2) k = k + n/2; return (k); } ``` The return value of the function is
Open complete paper
5
2013 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2013 [Session 3]
Consider the following function:
int unknown(int n) { int i, j, k = 0; for (i = n / 2; i <= n; i++) for (j = 2; j <= n; j = j * 2) k = k + n / 2; return (k); }
The return value of the function is
Open complete paper
6
2013 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2013 [Session 4]
Consider the following function:
int unknown(int n) {
int i, j, k=0;
for (i=n/2; i<=n; i++)
for (j=2; j<=n; j=j*2)
k = k + n/2;
return (k);
}
The return value of the function is
Open complete paper
7
2014 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2014 [Session 1]
Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the correct Venn diagram of the complexity classes P, NP and NP Complete (NPC)?
Open complete paper
8
2014 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2014 [Session 1]
Consider the following pseudo code. What is the total number of multiplications to be performed?

D = 2
for i = 1 to n do
for j = i to n do
for k = j + 1 to n do
D = D * 3
Open complete paper
9
2014 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2014 [Session 1]
Open complete paper
10
2014 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2014 [Session 2]
Which one of the following correctly determines the solution of the recurrence relation with \(T(1) = 1\)?
\(T(n) = 2T\left(\frac{n}{2}\right) + \log n\)
Open complete paper
11
2014 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2014 [Session 2]
Open complete paper
12
2014 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2014 [Session 2]
Open complete paper
13
2014 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2014 [Session 2]
Open complete paper
14
2014 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2014 [Session 3]
The minimum number of arithmetic operations required to evaluate the polynomial \( P(X) = X^5 + 4X^3 + 6X + 5 \) for a given value of \( X \), using only one temporary variable is ______.
Open complete paper
15
2016 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2016 [Session 1]
The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
Open complete paper
16
2017 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2017 [Session 2]
Match the algorithms with their time complexities:
Open complete paper
17
2017 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2017 [Session 2]
Consider the recurrence function \(T(n) = \begin{cases} 2T(\sqrt{n}) + 1, & n > 2 \\ 2, & 0 < n \le 2 \end{cases}\). Then \(T(n)\) in terms of \(\Theta\) notation is
Open complete paper
18
2017 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2017 [Session 2]
Consider the following C function.
int fun(int n) { int i, j; for (i = 1; i <= n; i++) { for (j = 1; j < n; j += i) { printf(" %d %d", i, j); } } }
Time complexity of fun in terms of \( \Theta \) notation is
Open complete paper
19
2020 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2020 [Session 2]
For parameters \( a \) and \( b \), both of which are \( \omega(1) \), \( T(n) = T(n^{a}) + 1 \), and \( T(b) = 1 \). Then \( T(n) \) is
Open complete paper
20
2021 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2021 [Session 1]
Consider the following recurrence relation.
\[ T(n) = \begin{cases} T(n/2) + T(2n/5) + 7n & \text{if } n > 0 \\ 1 & \text{if } n = 0 \end{cases} \]
Which one of the following options is correct?
Open complete paper

Showing 20 of 34 questions