My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Compiler Design - Computer Science & Information Technology Previous Year Questions

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

23Papers
14Years
73Questions
1Topics

Compiler Design question pattern

Every graph below is calculated only from this selection.

Questions by year

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

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 48 65.8%
Easy 20 27.4%
Hard 5 6.8%

Question type distribution

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

MCQ 52 71.2%
Numerical Answer Type (NAT) 13 17.8%
MSQ 8 11%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
73 Qs

Most asked topics

Top topics across the included previous year papers.

Compiler Design
73 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Lexical and Syntax Analysis
41 Qs
Code Generation and Optimization
19 Qs
Translation and Runtime Environments
13 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
3 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
5 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
2 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) 2015 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
3 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
4 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
4 Qs

Browse by subtopics

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

Lexical and Syntax Analysis

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

41 questions19 papers12 years

Code Generation and Optimization

Explore previous-paper coverage, trends and focused practice for Code Generation and Optimization.

19 questions13 papers7 years

Translation and Runtime Environments

Explore previous-paper coverage, trends and focused practice for Translation and Runtime Environments.

13 questions11 papers8 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) 202620263View paper
Computer Science and Information Technology (CS) 202620263View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20254View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20254View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20245View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20245View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20233View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20223View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20214View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20215View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20203View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20194View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20182View 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) 2015 [Session 2]20151View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20142View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20142View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20143View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20134View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20134View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20134View 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 · Compiler Design · Lexical and Syntax Analysis
Computer Science & Information Technology (CS) 2013 [Session 1]
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type \(A \rightarrow \epsilon\) and \(A \rightarrow a\)) to parse a string with \(n\) tokens?
Open complete paper
2
2013 · Computer Science & Information Technology · Compiler Design · Lexical and Syntax Analysis
Computer Science & Information Technology (CS) 2013 [Session 3]
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A → ε and A → a) to parse a string with n tokens?
Open complete paper
3
2014 · Computer Science & Information Technology · Compiler Design · Code Generation and Optimization
Computer Science & Information Technology (CS) 2014 [Session 1]
Which one of the following is FALSE?
Open complete paper
4
2014 · Computer Science & Information Technology · Compiler Design · Lexical and Syntax Analysis
Computer Science & Information Technology (CS) 2014 [Session 2]
Consider the grammar defined by the following production rules, with two operators * and +

\[ S \to T * P \]
\[ T \to U | T * U \]
\[ P \to Q + P | Q \]
\[ Q \to Id \]
\[ U \to Id \]

Which one of the following is TRUE?
Open complete paper
5
2014 · Computer Science & Information Technology · Compiler Design · Code Generation and Optimization
Computer Science & Information Technology (CS) 2014 [Session 3]
One of the purposes of using intermediate code in compilers is to
Open complete paper