My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Algorithms - Computer Science & Information Technology Previous Year Questions

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

24Papers
14Years
146Questions
1Topics

Algorithms question pattern

Every graph below is calculated only from this selection.

Questions by year

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

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 94 64.4%
Easy 50 34.2%
Hard 2 1.4%

Question type distribution

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

MCQ 83 56.8%
Numerical Answer Type (NAT) 48 32.9%
MSQ 15 10.3%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
146 Qs

Most asked topics

Top topics across the included previous year papers.

Algorithms
146 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Graph Algorithms
66 Qs
Complexity Analysis
40 Qs
Searching, Sorting and Hashing
20 Qs
Algorithm Design Techniques
20 Qs

Paper coverage

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

Computer Science and Information Technology (CS) 2026
7 Qs
Computer Science and Information Technology (CS) 2026
7 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
5 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
5 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
6 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
7 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
7 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
6 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
6 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
7 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2015 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
10 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
10 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
9 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
8 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
7 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
5 Qs
Computer Science & Information Technology (CS) 2013 [Session 2]
4 Qs

Browse by subtopics

Open a focused page built from the same verified paper data.

Graph Algorithms

Explore previous-paper coverage, trends and focused practice for Graph Algorithms.

66 questions23 papers13 years

Complexity Analysis

Explore previous-paper coverage, trends and focused practice for Complexity Analysis.

40 questions20 papers11 years

Searching, Sorting and Hashing

Explore previous-paper coverage, trends and focused practice for Searching, Sorting and Hashing.

20 questions14 papers9 years

Algorithm Design Techniques

Explore previous-paper coverage, trends and focused practice for Algorithm Design Techniques.

20 questions14 papers11 years

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) 202620267View paper
Computer Science and Information Technology (CS) 202620267View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20255View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20255View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20245View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20244View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20235View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20226View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20217View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20215View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20207View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20195View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20186View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20176View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20167View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20165View paper
Computer Science & Information Technology (CS) 2015 [Session 3]20151View paper
Computer Science & Information Technology (CS) 2014 [Session 1]201410View paper
Computer Science & Information Technology (CS) 2014 [Session 2]201410View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20149View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20135View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20134View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20138View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20137View paper

Sample previous year questions

A varied preview from the papers represented in this selection, with every available option.

1
2013 · Computer Science & Information Technology · Algorithms · Searching, Sorting and Hashing
Computer Science & Information Technology (CS) 2013 [Session 1]

Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?

Open complete paper
2
2013 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2013 [Session 2]
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of $n$ vertices?
Open complete paper
3
2013 · Computer Science & Information Technology · Algorithms · Complexity Analysis
Computer Science & Information Technology (CS) 2013 [Session 4]
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
4
2014 · Computer Science & Information Technology · Algorithms · Graph Algorithms
Computer Science & Information Technology (CS) 2014 [Session 1]
Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time of Depth First Search on G, when G is represented as an adjacency matrix?
Open complete paper
5
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