Bhagwant Institute of Technology Muzaffarnagar

Vision
To promote education as a vehicle for rural development and become to be a world-class institution for
technical education and scientific research for the public good.

Mission
1: To make a lifelong difference to the lives of rural underprivileged girls and boys through holistic
education.

2: Empower rural underprivileged students from all socio-economic strata to level the academic and
professional.

3: Be a centre of excellence in education in emerging technologies in collaboration with the industry and
industrial trends.

4: Build world class research facilities on par with the finest in the world and broaden students' horizons
beyond classroom education.

5: Nurture talents and entrepreneurship and enable all-round personality development in students.

Quality Policy

To continuously thrive to provide a congenial and wholesome academic environment and a healthy
culture for faculty, staff and students which would motivate teacher’s full participation with passion and
develop an intense desire in the students to acquire comprehensive education and hence become a useful
and confident human resource for industry and academia.
 Department of Computer science and Engineering

Vision of B.Tech(CSE) Department

To create technologically superior and ethically strong globally competent manpower for industry and
entrepreneurial mindset.

Mission of B.Tech(CSE) Department

1: To impart technology enabled quality education to students with innovative mindset to meet the
challenges of the industries in a creative manner.

2: To inculcate socially ethically mindset with lifelong learning aptitude and global outreach.

3: To broaden their thinking with entrepreneurial zeal.

Programme Educational Outcomes (PEO’s)

PEO 1: To produce successful post-graduates for industry, government, academia and research for
lifelong learning to fulfil their goals.

PEO 2: To develop ethical leaders with strong communication ability who will excel as an individual
and a team in a society.

PEO 3: To produce successful innovative professionals with computing and analytical ability to design
& develop system with entrepreneurial aptitude.
 Department of Computer Science and Engineering
Programme Outcomes (POs)
1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering problems.
2. Problem analysis: Identify, formulate, review research literature, and analyse complex
engineering problems reaching substantiated conclusions using first principles of mathematics,
natural sciences, and engineering sciences.
3. Design/development of solutions: Design solutions for complex engineering problems and design
system components or processes that meet the specified needs with appropriate consideration for
the public health and safety, and the cultural, societal, and environmental considerations.
4. Conduct investigations of complex problems: Use research-based knowledge and research
methods including design of experiments, analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modelling to complex engineering activities
with an understanding of the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess
societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
7. Environment and sustainability: Understand the impact of the professional engineering
solutions in societal and environmental contexts, and demonstrate the knowledge of, and need for
sustainable development.
8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms
of the engineering practice.
9. Individual and team work: Function effectively as an individual, and as a member or leader in
diverse teams, and in multidisciplinary settings.
10. Communication: Communicate effectively on complex engineering activities with the
engineering community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and receive
clear instructions.
11. Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member and
leader in a team, to manage projects and in multidisciplinary environments.
12. Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.

Department of Computer Science and Engineering

Programme Specific Outcomes (PSOs):-
PSO 1: To Analyse, Design, Test, implement and document Software components, processes for
finding solutions with specific application development using suitable models.

PSO 2: To solve real world problems specified with constraints by using modern software tools,
resources and techniques.
 Bhagwant Institute of Technology
MUZAFFARNAGAR

Department of Computer science and engineering

Semester: V

Subject Code: KCS502

Subject Name: Compiler Design

Course Outcomes:

Upon the completion of this course, the student will be able to:

Course
Outcomes Statement Knowledge Level,
(COs) KL
CO 1 Acquire knowledge of different phases and passes of the compiler and K3, K6
also able to use the compiler tools like LEX, YACC, etc. Students will also
be able to design different types of compiler tools to meet the
requirements of the realistic constraints of compilers.
CO 2 Understand the parser and its types i.e. Top-Down and Bottom-up . K2, K6
parsers and construction of LL, SLR, CLR, and LALR parsing table
CO 3 Implement the compiler using syntax-directed translation method and K4, K5
get knowledge about the synthesized and inherited attributes.
CO 4 Acquire knowledge about run time data structure like symbol table K2, K3
organization and different techniques used in that.
CO 5 Understand the target machine’s run time environment, its instruction K2, K4
set for code generation and techniques used for code optimization.

KL- Bloom’s Knowledge Level (K1, K2, K3, K4, K5, K6)
K1-Remember, K2-Understand, K3-Apply, K4-Analyze, K5-Evaluate, K6-Create

-
CO-PO & PSO Mapping-

Course
Outcome PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 PO 10 PO 11 PO 12 PSO 1 PSO 2
s
(COs)
CO 1
CO 2
CO 3
CO 4
CO 5
Course
Average
 3- High, 2- Medium, 1-Low

Bhagwant Institute of Technology

MUZAFFARNAGAR

Department of Computer Science and Engineering

Session:- 2023-2024 Semester:- V Section:- A

Course Code:- KCS 502 Course Name:- Compiler Designs

Course Outcome Attainment Sheet

Course Outcomes:-

CO 1 Acquire knowledge of different phases and passes of the compiler and also able to use the compiler tools
like LEX, YACC, etc. Students will also be able to design different types of compiler tools to meet the requirements
of the realistic constraints of compilers. K3, K6
CO 2 Understand the parser and its types i.e. Top-Down and Bottom-up parsers and construction of LL, SLR, CLR,
and LALR parsing table. K2, K6
CO 3 Implement the compiler using syntax-directed translation method and get knowledge about the synthesized
and inherited attributes. K4, K5 CO 4 Acquire knowledge about run time data structure like symbol table
organization and different techniques used in that. K2, K3
CO 5 Understand the target machine’s run time environment, its instruction set for code generation
Assessment Tools:
Gap Analysis of Sessional Exam, Assignments, Course Exit Survey

Course Target:

Attainment Levels for Internal & External Examinations:

Criteria At Level
If the number of students achieving the target is equal or above 40% & less than 50%. 1
If the number of students achieving the target is equal or above 50% & less than 60%. 2
If the number of students achieving the target is equal or above 60% students. 3
 Bhagwant Institute of Technology
MUZAFFARNAGAR

Department of Computer Science and Engineering

Course Outcome Attainment Table:

Attainment through Internal Attainment

Assessment through
COs Target Direct Indirect Overall University Overall Attainment Gap
in % Attainment Attainment Internal Attainment Attainment Level
in % in % Attainment
CO1

CO2

CO3

CO4

CO5

Action taken to fill the Gap:

1.
2.
3.

Faculty Program/NBA Coordinator HoD

 Bhagwant Institute of Technology
MUZAFFARNAGAR

Department of Computer Science and Engineering

LECTURE PLAN
Course Periods Evaluation Scheme
Programme Sem Course Name Code (University) Course Credit
Total
L T P Sessional Marks UE
Compiler Design CT TA Total
B.Tech V KCS502 3 1 0 30 20 50 100 150 4

Period (Actual) Head of Date of Total Date of

L T P Name of Faculty Department Commencement Lectures Conclusion
Planned
3 1 0 Er.Urvashi Mr. Ajay Singh
Chaudhary

L-T Name of the Topic as given in Syllabus KL Assignment/

Schedule Quiz/CT
1 Introduction to Compiler: Phases and passes, Bootstrapping, K1

2 Finite state machines and regular expressions and their K2- K3-
applications to lexical analysis,
3 Optimization of DFA-Based Pattern Matchers K2- K3-
implementation of lexical analyzers,
4 lexical-analyzer generator, LEX compiler, K2-
5 Formal grammars and their application to syntax analysis, K2- K3-
6 BNF notation, ambiguity, YACC. K2- K3-
7 The syntactic specification of programming languages: K2- K3-
8 Context free grammars, derivation and parse trees, K2- K3-
capabilities of CFG.
9 Basic Parsing Techniques: Parsers, Shift reduce parsing,. K2 K4 K5
10 operator precedence parsing, top down parsing, K2 K4 K5
11 predictive parsers Automatic Construction of efficient K4 K5
Parsers: LR parsers,
12 constructing Canonical LR parsing tables, Constructing LALR K2 K4 K5
parsing tables
13 , using ambiguous grammars, an automatic parser generator, K4 K5
implementation of LR Parsers
14 Syntax-directed Translation: Syntax-directed Translation K2
schemes,
15 Implementation of Syntaxdirected Translators, K3
16 Intermediate code, postfix notation, Parse trees & syntax K4-K5-
trees,.
17 three address code, quadruple & triples, translation of K4-K5-
assignment statements,
18 Boolean expressions, statements that alter the flow of K2
 control, postfix translation,
19 translation with a top down parser K5
20 . More about translation: Array references in arithmetic , K4-K5, K6-
expressions,
21 procedures call, declarations and case statements K2
22 Symbol Tables: Data structure for symbols tables, K4-K5-
representing scope information.
23 Run-Time Administration: Implementation of simple stack K5-K6
allocation scheme,.
24 storage allocation in block structured language. K2
25 Error Detection & Recovery: K4-
26 Lexical Phase errors, syntactic phase errors semantic errors K4
27 Code Generation: Design Issues, the Target Language.. K2-
28 Addresses in the Target Code, Basic Blocks and Flow Graphs, K4
29 Optimization of Basic Blocks, Code Generator. K5
30 Code optimization: Machine-Independent Optimizations, K5-
Loop optimization,
31 DAG representation of basic blocks, value numbers and K5-K6
algebraic laws, Global Data-Flow analysis

KL- Bloom’s Knowledge Level (K1, K2, K3, K4, K5, K6)
K1-Remember, K2-Understand, K3-Apply, K4-Analyze, K5-Evaluate, K6-Create

Suggested Readings:

1. Aho, Sethi & Ullman, "Compilers: Principles, Techniques and Tools”, Pearson Education
2. K. Muneeswaran,Compiler Design,First Edition,Oxford University Press
3. J.P. Bennet, “Introduction to Compiler Techniques”, Second Edition, McGraw-Hill,2003.
4. Henk Alblas and Albert Nymeyer, “Practice and Principles of Compiler Building with C”, PHI, 2001.
5. V Raghvan, “ Principles of Compiler Design”, McGraw-Hill,
6. Kenneth Louden,” Compiler Construction”, Cengage Learning.
7. Charles Fischer and Ricard LeBlanc,” Crafting a Compiler with C”, Pearson Education
Web References:

1.

2.

Signature of Faculty with Date

 Bhagwant Institute of Technology
MUZAFFARNAGAR

Department of Computer Science and Engineering

LECTURE DELIVERY SCHEDULE

Course Periods Evaluation Scheme
Programme Sem Course Name Code (University) Course Credit
Total
L T P Sessional Marks UE
Compiler design CT TA Total
B.Tech V KCS502 3 1 0 30 20 50 100 150 4

Period (Actual) Head of Date of Total Date of

L T P Name of Faculty Department Commencement Lectures Conclusion
Planned
3 0 0 Er.Urvashi Mr. Ajay Singh
Chaudhary

L-T Date Date Name of the Topic as given in Assignment/Quiz/CT

Schedu Planned Executed Syllabus KL Date of Actual
le Announcement Submission

1 Introduction to Compiler: Phases K1

and passes, Bootstrapping,
2 Finite state machines and regular K2-
K3-
expressions and their applications
to lexical analysis,
3 Optimization of DFA-Based K2-
K3-
Pattern Matchers
implementation of lexical
analyzers,
4 lexical-analyzer generator, LEX K2-
compiler,
5 Formal grammars and their K2-
K3-
application to syntax analysis,
6 BNF notation, ambiguity, YACC. K2-
K3-
7 The syntactic specification of K2-
K3-
programming languages:
8 Context free grammars, K2-
K3-
derivation and parse trees,
capabilities of CFG.
9 Basic Parsing Techniques: K2 K4
K5
Parsers, Shift reduce parsing,.
10 operator precedence parsing, top K2 K4
K5
down parsing,
11 predictive parsers Automatic K4 K5
Construction of efficient Parsers:
 LR parsers,
12 constructing Canonical LR parsing K2 K4
K5
tables, Constructing LALR parsing
tables
13 , using ambiguous grammars, an K4 K5
automatic parser generator,
implementation of LR Parsers
14 Syntax-directed Translation: K2
Syntax-directed Translation
schemes,
15 Implementation of K3
Syntaxdirected Translators,
16 Intermediate code, postfix K4-K5-
notation, Parse trees & syntax
trees,.
17 three address code, quadruple & K4-K5-
triples, translation of assignment
statements,
18 Boolean expressions, statements K2
that alter the flow of control,
postfix translation,
19 translation with a top down K5
parser
20 . More about translation: Array , K4-
K5,
references in arithmetic K6-
expressions,
21 procedures call, declarations and K2
case statements
22 Symbol Tables: Data structure for K4-K5-
symbols tables, representing
scope information.
23 Run-Time Administration: K5-K6
Implementation of simple stack
allocation scheme,.
24 storage allocation in block K2
structured language.
25 Error Detection & Recovery: K4-
26 Lexical Phase errors, syntactic K4
phase errors semantic errors
27 Code Generation: Design Issues, K2-
the Target Language..
28 Addresses in the Target Code, K4
Basic Blocks and Flow Graphs,
29 Optimization of Basic Blocks, K5
Code Generator.
30 Code optimization: Machine- K5-
Independent Optimizations, Loop
optimization,
31 DAG representation of basic K5-K6
blocks, value numbers and
algebraic laws, Global Data-Flow
analysis
KL- Bloom’s Knowledge Level (K1, K2, K3, K4, K5, K6)
K1-Remember, K2-Understand, K3-Apply, K4-Analyze, K5-Evaluate, K6-Create
Suggested Readings:

1. Aho, Sethi & Ullman, "Compilers: Principles, Techniques and Tools”, Pearson Education
2. K. Muneeswaran,Compiler Design,First Edition,Oxford University Press
3. J.P. Bennet, “Introduction to Compiler Techniques”, Second Edition, McGraw-Hill,2003.
4. Henk Alblas and Albert Nymeyer, “Practice and Principles of Compiler Building with C”, PHI, 2001.
5. V Raghvan, “ Principles of Compiler Design”, McGraw-Hill,
6. Kenneth Louden,” Compiler Construction”, Cengage Learning.
7. Charles Fischer and Ricard LeBlanc,” Crafting a Compiler with C”, Pearson Education

Web References:

1.

2.

Signature of Faculty with Date

 Bhagwant Institute of Technology
MUZAFFARNAGAR

Department of Computer Science and Engineering

Session:- 2023-2024 Semester:- V Section:- A

Course Code:- KCS502 Course Name:- Compiler Design

Assignment-1

Date of Assignment:- Date of Submission:-

S.N. KL, CO QUESTIONS MARKS

1 CO1 Q1)Design a finite automata that accepts set of strings such that 5
every string ends in 00,over alphabet{0,1}.

2 CO1 Q2) )Design a finite automata that accepts the language 5

L={wε(0,1)*/second symbol of w is ‘0’ and fourth input is
1,over alphabet{0,1}.

3 CO1 Q3) What do you mean by token?.Explain in detail 5

4 CO1 Minimize the DFA 5

5 CO1 Convert to nfa to dfa 5

Bhagwant Institute of Technology
MUZAFFARNAGAR
 Department of Computer Science and Engineering

Session:- 2023-2024 Semester:- V Section:- A

Course Code:- KCS502 Course Name:- Compiler Design

Assignment-2

Date of Assignment:- Date of Submission:-

S.N. KL, CO QUESTIONS MARKS

1 CO2 Consider the following two statements: 5
P:Every regular grammar is LL(1)
Q:Every regular set has a LR(1)
Which of the following is true?

2 CO2 Compute the FIRST and FOLLOW sets for each 5

nonterminal of the grammar given below:
S->Aba|Bca
A->cBCD| ε
B->CdA|ad
C->eC| ε
D->bSf|a

3 CO2 Q3)Test whether the following grammar is LL(1) 5

S->AB|eDa
A->ab|c
B->dC
C->eC| ε
D->fD| ε

4 CO2 Q4)Design SLR(1) parser for the following grammar: 5

S->aAb|bB
A->Aa| ε
B->Bb| ε

5 CO2 What is the advantages of left recursive grammar over right 5

recursive grammar in LR parsing.Explain with suitable
example.

6 CO2 Check whether the given grammar is LR(0) or not: S→PQy, 5

 P→Sy|x, Q→yS

7 CO2 Find the precedence and function table of the following

grammar by using operator precedence technique.
P→SR|S, R→bSR|bS, S→WbS|W, W→L*W|L, L→id

Bhagwant Institute of Technology

MUZAFFARNAGAR
 Department of Computer Science and Engineering

Session:- 2023-2024 Semester:- V Section:- A

Course Code:- KCS502 Course Name:- Compiler Design

Assignment-3

Date of Assignment:- Date of Submission:-

S.N. KL, CO QUESTIONS MARKS

1 CO3 Explain Syntax-directed Translation schemes, 5

2 CO3 Explain Intermediate code, postfix notation 5

3 CO3 Explain three address code, quadruple & triples, translation of 5

assignment statements,

4 CO1 What is the difference between Parse tree and syntax tree 5
Explain

5 CO3 Translate the following arithmetic expression into 5

quadruples and triples:
(i). x=y*z+y*-z (ii). a=-b*(c+d)+b

6 CO3 Translate the following arithmetic expression into 5

quadruples and triples:
(i). x=y*z+y*-z (ii). a=-b*(c+d)+b

7 CO3 Generate three address code for the 5

following code: Switch p+q
{
case 1: x=x+1
case 2: y=y+2
case 3:
z=z+3
default:
c=c-1
}

8 CO3 Consider the following grammar and give the syntax

directed definition to construct parse tree for the input
expression 4*7+3*9. Also construct an annotated parse
tree according to your syntax directed definition.
E→E+T|T, T→T*F|F, F→num.
 Bhagwant Institute of Technology
MUZAFFARNAGAR

Department of Computer Science and Engineering

Session:- 2023-2024 Semester:- V Section:- A

Course Code:- KCS502 Course Name:- Compiler design

Assignment-4

Date of Assignment:- Date of Submission:-

S.N. KL, CO QUESTIONS MARKS

1 CO4 What is symbol table? Explain various data structures used 5
for symbol table.

2 CO4 (i). Explain the function of error handling phase of a 5

compiler. (ii). Write short note on scoping.

3 CO4 Explain activation record 5

Bhagwant Institute of Technology

MUZAFFARNAGAR

Department of Computer Science and Engineering

Session:- 2023-2024 Semester:- V Section:- A

Course Code:- KCS502 Course Name:- Compiler Design

Assignment-5

Date of Assignment:- Date of Submission:-

S.N. KL, CO QUESTIONS MARKS

1 CO5 Construct the flow graph for the following code 5
segment: fact(n)
{
int f=1;
for(i=2
; i≤n;
i++)
f=f*i;
return f;
}

2 CO5 Define a DAG. Construct a DAG for the expression: p+p*(q-r) 5

+(q-r)*s

3 CO5 Explain in detail about loop optimization. 5

Bhagwant institute of Technology

MUZAFFARNAGAR
Department of Computer science and Engineering
SESSIONAL TEST-I
(Odd Semester 2023-2024)
Max. Marks: - 30 Time: - 90 Minutes
Programme: - B.Tech Semester: - V Section:-A
Course Code: - KCS502 Course Title: - Compiler Design
Date of Exam: - Time: -

S.N. KL, CO QUESTIONS MARKS

SECTION-A
1:- Attempt ALL Parts. (3x2)
a)- CO1 What is YACC? Discuss about it. 2

b)- CO2 Design a DFA for the following regular expression: (x+y)*xyy 2

c)- What are the various errors that may appear in compilation 2
process?

SECTION-B
2:- Attempt any THREE parts. (3x5)
a)- What do you understand by lexical phase error and syntactic 5
error? Also suggest methods for recovery of errors.
b)- What are the different phases of compilation process 5

c)- What do you mean by regular expression 5

d)- What do you mean by finite automata explain with example 5

SECTION-C
3:- Attempt any ONE parts. (1x9)
a)- Explain Lex 9

b)- Explain Yacc 9

CO- Course Outcomes mapped with respective question.

KL- Bloom’s Knowledge Level (K1, K2, K3, K4, K5, K6)
K1-Remember, K2-Understand, K3-Apply, K4-Analyze, K5-Evaluate, K6-Create

Bhagwant Institute of Technology

MUZAFFARNAGAR

Department of Computer Science and Engineering

SESSIONAL TEST-II
(Odd Semester-2023-2024)
Max. Marks: - 30 Time: - 90 Minutes
Programme: - B.Tech Semester: - V Section:-A
Course Code: - KCS502 Course Title: - Compiler Design
Date of Exam: - Time: -

S. K QUESTIONS MAR
N. L, KS
C
O
SECTION-A
1:- Attempt ALL Parts. (3x2)
a)- Explain Top down parser 2

b)- Explain DAG 2

c)- Explainactivation record 2

SECTION-B
2:- Attempt any THREE parts. (3x5)
a)- Discuss the following terms: 5
i. Basic block
ii. Next use information
iii. Flow graph

b)- a. Construct predictive parse table for the following grammar. 5

E → E + T/T
T

→
T

*
F
/
F

→
F

/
a
/
b

c)- 5
a. Construct the SLR parse table for the following Grammar
E→E+E
E
 →
E
*
E

E
→
i
d

d)- Differentiate between stack allocation and heap allocation. 5

e)- What are the various issues in design of code generator & code loop 5
optimization?

SECTION-C
3:- Attempt any ONE parts. (1x9)
a)- 9
Write syntax directed definition for a given assignment statement:
S
→

id
=
E
E
→

E
+
E
E

→
E
*
E

E
→
-
E
E → (E)
E→id

b)- What are the advantages of DAG? Explain the peephole optimization. 9
CO- Course Outcomes mapped with respective question.
KL- Bloom’s Knowledge Level (K1, K2, K3, K4, K5, K6)
K1-Remember, K2-Understand, K3-Apply, K4-Analyze, K5-Evaluate, K6-Create

Bhagwant Institute of Technology

MUZAFFARNAGAR

Department of Computer Science and Engineering

GAP Analysis (ST-I)

Session- 2023-2024 Semester- V Section- A

Course Code- KCS502 Course Code-Compiler Design
Name of Faculty-
S.N. Roll No. Name of Students Section-A Section-B Section-C Total
1a 1b 1c 2a 2b 2c 3a 3b
Identified Topics for Improvement Action Decided:

Bhagwant Institute of Technology

MUZAFFARNAGAR

Department of Computer Science and Engineering

Curriculum: B.Tech 2023-2024 Term: V- Semester

Course: Compiler Design Section: A
Occasion: Sessional Test-I

Course Outcome (COs Attainment):

S.N. Course Outcome (COs) Threshold based Attainment Level Average Based
Attainment Attainment

1 CO1
2 CO2

Direct Attainment/Target Levels:

S.N. Attainment Level Name Attainment Level Target

Value
1 Low 1 40% students scoring >= 76% marks
out of relevant maximum marks.
2 Medium 2 50% students scoring >= 76% marks
out of relevant maximum marks.
3 High 3 60% students scoring >= 76% marks
out of relevant maximum marks.

Bhagwant Institute of Technology

MUZAFFARNAGAR

Department of Computer Science and Engineering

Course Outcome (COs) Attainment:

S.N. Course Outcome (COs) Threshold based Attainment Level Average Based
Attainment Attainment
1 CO1
2 CO2
3 CO3
4 CO4
5 CO5

Actual Course Attainment:- Course Attainment after Weightage:-

Note: The above bar graph depicts the overall class performance with respect to the Threshold % for individual Course Outcomes
(COs). The Threshold based Attainment % & Average based Attainment % is calculated using the below formula.

For Threshold based Attainment %= (x/y)*100 For Average based Attainment %= (x/y)*100
x= Count of Students >= to Threshold % x= Average secured marks of Attempted students
y= Total number of students attempted y= Maximum Marks.

Bhagwant Institute of Technology

MUZAFFARNAGAR

Department of Computer Science and Engineering

Curriculum: B.Tech 2023-2024 Term: V- Semester

Course: Compiler Design Section: A
Occasion: Sessional Test-II

Course Outcome (COs Attainment):

S.N. Course Outcome (COs) Threshold based Attainment Level Average Based
Attainment Attainment

1 CO1
2 CO2
3 CO3
4 CO4
5 CO5

Direct Attainment/Target Levels:

S.N. Attainment Level Name Attainment Level Target

Value
1 Low 1 40% students scoring >= 76% marks
out of relevant maximum marks.
2 Medium 2 50% students scoring >= 76% marks
out of relevant maximum marks.
3 High 3 60% students scoring >= 76% marks
out of relevant maximum marks.

Bhagwant Institute of Technology

MUZAFFARNAGAR

Department of Computer Science and Engineering

Course Outcome (COs) Attainment:

 S.N. Course Outcome (COs) Threshold based Attainment Level Average Based
Attainment Attainment

1 CO1
2 CO2
3 CO3
4 CO4
5 CO5

Actual Course Attainment:- Course Attainment after Weightage:-

Note: The above bar graph depicts the overall class performance with respect to the Threshold % for individual Course Outcomes
(COs). The Threshold based Attainment % & Average based Attainment % is calculated using the below formula.

For Threshold based Attainment %= (x/y)*100 For Average based Attainment %= (x/y)*100
x= Count of Students >= to Threshold % x= Average secured marks of Attempted students
y= Total number of students attempted y= Maximum Marks.

Bhagwant Institute of Technology

MUZAFFARNAGAR

Department of Computer Science and Engineering

PRE UNIVERSITY TEST
(ODD Semester-2023-2024)
Max. Marks: - 100 Time: - 3 Hours
Programme: - B.Tech Semester: - V Section:-A
Course Code: - KCS502 sCourse Title: - Compiler design
Date of Exam: - Time: -

S.N. KL, CO QUESTIONS MARKS

SECTION-A
1:- Attempt ALL Parts. (2x10)
a)- 2

b)- 2

c)- 2

d)- 2

e)- 2

f)- 2

g)- 2

h)- 2

i)- 2

j)- 2

SECTION-B
2:- Attempt any THREE parts. (10x3)
a)- 10

b)- 10

c)- 10

d)- 10

e)- 10

SECTION-C
3:- Attempt any ONE parts. (10x1)
a)- 10

b)- 10

4:- Attempt any ONE parts. (10x1)

a)- 10

b)- 10

5:- Attempt any ONE parts. (10x1)

a)- 10

b)- 10

6:- Attempt any ONE parts. (10x1)

 a)- 10

b)- 10

7:- Attempt any ONE parts. (10x1)

a)- 10

b)- 10

CO- Course Outcomes mapped with respective question.

KL- Bloom’s Knowledge Level (K1, K2, K3, K4, K5, K6)
K1-Remember, K2-Understand, K3-Apply, K4-Analyze, K5-Evaluate, K6-Create

Bhagwant Institute of Technology

MUZAFFARNAGAR

Department of Computer Science and Engineering

Curriculum: B.Tech2023-2024 Term: V- Semester

Course: Compiler design Section: A
Occasion: Pre University Test (PUT)

Course Outcomes (COs) Attainment:

 Section-A Status- CO Attainment is finalized.

CO Code Threshold based Attainment Level Average based

Attainment Attainment
CO 1

CO 2

CO 3

CO 4

CO 5

Actual Course Attainment:- Course Attainment after Weightage:-

Direct Attainment/Target Levels:

S.N. Attainment Level Name Attainment Level Target

Value
1 Low 1 40% students scoring >= 76% marks
out of relevant maximum marks.
2 Medium 2 50% students scoring >= 76% marks
out of relevant maximum marks.
3 High 3 60% students scoring >= 76% marks
out of relevant maximum marks.

Bhagwant Institute of Technology

MUZAFFARNAGAR

Department of Computer Science and Engineering

REVIEW OF AKTU QUESTION PAPER

Session:- 2023-2024 Semester:- v Section:- A
Course Code:- KCS502 Course Name:- Compiler Design

Date of Examination:-
A) Difficulty level of question paper (Difficult/Moderate/Easy):

B) Any portion beyond of the syllabus (indicate question no.):

C) i) Any unit given under weightage:

ii) Any unit given over weightage:

D) Anomaly is choices given as compared to old pattern (or university guidelines):

E) Questions having mistakes or are incomplete (indicate only the question number):

Distribution of question unit wise and comparison to PUT

UNIT Weightage of Units in Weightage of Units in Similar question from AKTU & PUT question
AKTU Question Paper PUT Question Paper paper
Question No. Marks Question No. Marks AKTU Question Marks PUT Marks
(a) (b) (c) (d) No. (e) (f) Question (h)
No. (g)
1

Beyond
Syllabus
Total: Total: Total: Total:

Any other
observatio
n

% of university question paper covered in PUT = [Total (f)/Total (b)]*100

Action recommended or action taken, if any, at the department level: