My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Programming and Data Structures - Computer Science & Information Technology Previous Year Questions

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

23Papers
13Years
135Questions
1Topics

Programming and Data Structures question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Programming and Data Structures. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 75 55.6%
Easy 59 43.7%
Hard 1 0.7%

Question type distribution

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

MCQ 75 55.6%
Numerical Answer Type (NAT) 52 38.5%
MSQ 8 5.9%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
135 Qs

Most asked topics

Top topics across the included previous year papers.

Programming and Data Structures
135 Qs

Subtopic coverage

Top subtopics inside this exact selection.

C Programming and Recursion
73 Qs
Trees, Heaps and Graphs
40 Qs
Linear Data Structures
22 Qs

Paper coverage

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

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

Browse by subtopics

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

C Programming and Recursion

Explore previous-paper coverage, trends and focused practice for C Programming and Recursion.

73 questions23 papers13 years

Trees, Heaps and Graphs

Explore previous-paper coverage, trends and focused practice for Trees, Heaps and Graphs.

40 questions22 papers13 years

Linear Data Structures

Explore previous-paper coverage, trends and focused practice for Linear Data Structures.

22 questions16 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) 202620269View paper
Computer Science and Information Technology (CS) 202620268View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20257View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20258View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20245View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20246View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20235View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20227View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20213View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20216View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20207View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20198View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20188View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20178View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20166View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20166View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20143View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20147View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20142View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20135View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20135View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20135View 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 · Programming and Data Structures · Trees, Heaps and Graphs
Computer Science & Information Technology (CS) 2013 [Session 1]

Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?

Open complete paper
2
2013 · Computer Science & Information Technology · Programming and Data Structures · C Programming and Recursion
Computer Science & Information Technology (CS) 2013 [Session 2]
What is the return value of f(p, p), if the value of p is initialized to 5 before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value. int f (int &x, int c) { c = c - 1; if (c==0) return 1; x = x + 1; return f(x, c) * x; }
Open complete paper
3
2014 · Computer Science & Information Technology · Programming and Data Structures · Trees, Heaps and Graphs
Computer Science & Information Technology (CS) 2014 [Session 1]
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly 4 nodes is O(n^a log^b n). Then the value of a + 10b is ________.
Open complete paper
4
2014 · Computer Science & Information Technology · Programming and Data Structures · C Programming and Recursion
Computer Science & Information Technology (CS) 2014 [Session 2]
Suppose \(n\) and \(p\) are unsigned int variables in a C program. We wish to set \(p\) to \(^nC_3\). If \(n\) is large, which one of the following statements is most likely to set \(p\) correctly?
Open complete paper