Iii-I Final Copy 23-7-16 2.00PM

Department of CSE
MLR Institute of Technology, Dundigal, Hyd-500043 Page 1

Department of CSE

Department of CSE
8. III YEAR CSE COURSE STRUCTURE
CODE SUBJECT L T/P/D C
A50511 PRINCIPLES OF PROGRAMMING LANGUAGES 4 - 4
A50017 INTELLECTUAL PROPERTY RIGHTS 4 - 4
A50518 SOFTWARE ENGINEERING 4 - 4
A50514 COMPILER DESIGN 4 - 4
A50510 OPERATING SYSTEMS 4 - 4
A50515 COMPUTER NETWORKS 4 - 4
A50589 OPERATING SYSTEMS LAB - 3 2
A50587 COMPILER DESIGN LAB - 3 2
Total 24 6 28
Note: All End Examinations (Theory and Practical) are of three hours duration.
T – Tutorial L-Theory P- Practical C – Credits

Department of CSE
9. PRINCIPLES OF PROGRAMMING LANGUAGES (A50511)

9.0 COURSE DESCRIPTION
Course Title PRINCIPLES OF PROGRAMMING LANGUAGES

Course Code A50511
Regulation R13-JNTUH
Lectures Tutorials Practical’s Credits
Course Structure
4 - - 4
Course Coordinator Mr.E.Amarnath Reddy
Team of Instructors Mrs. Poonam Khare, Assistant Professor/ Mrs. N. Prameela, Asst. Professor
9.1 COURSE OVERVIEW:

The course addresses growing importance of Programming languages, their uses, and
importance of using different programming tools. Course addresses various influences of
language design and language implementation techniques like, compilers, interpreters.
Describing the meanings of syntax and semantics, comparison of different semantics like,
operational, denotation, axiomatic semantics and generating parse trees. Importance of
variable declaration, scope, binding types. This course also explains about different
expressions and statements used in different programming languages. Comparison of
functional programming and logic programming, structure of imperative programming.
Exceptions and exception handling procedures of different programming languages like, C#,
C++, Java, Ada95. It also introduces the importance of scripting languages and features, data
types of Python language
9.2 PREREQUISITES:
Level Credits Periods/Weeks Prerequisites

UG 4 4 Basic programming concepts, Object Oriented Programming concepts.
9.3. A) MARKS DISTRIBUTION:
University End
Session Marks Total Marks
Exam Marks
Mid Semester Test
There shall be two midterm examinations.
Each midterm examination consists of subjective type and objective type
tests.
The subjective test is for 10 marks of 60 minutes duration.
Subjective test of shall contain 4 questions; the student has to answer2
questions, each carrying 5 marks.
The objective type test is for 10 marks of 20 minutes duration. It consists of
10 Multiple choice and 10 objective type questions, the student has to 75 100
answer all the questions and each carries half mark.
First midterm examination shall be conducted for the first two and half
units of syllabus and second midterm examination shall be conducted for
the remaining portion.
Assignment
Five marks are earmarked for assignments.
There shall be two assignments in every theory course. Marks shall be
awarded considering the average of two assignments in each course.

Department of CSE
9.3 B) Expected Learning Outcomes and Methods for Assessing
S. No Expected Learning Outcomes Assessment method (s)
a Demonstrating the use of scripting languages. Assignment and exercises

Analyzing the skills and using the features of
b Case studies
programming languages.
Differentiating between logic programming and
c Assignments and test
functional programming languages.
Finding various data types of different
d Assignments
9.4 EVALUATION SCHEME:
S. No Component Duration Marks

1 I Mid Examination 90minutes 20
2 I Assignment 5
3 II Mid Examination 90minutes 20
4 II Assignment 5
5 External Examination 3 hours 75
COURSE OBJECTIVES:
I. Define the structure and design principles of programming languages.
II. Describe the skills in analyzing and using the features of programming languages.
III. Describe the preliminary concepts like context - free grammars, Backus - Naur
form, parse trees.
IV. State various data types of different programming languages.
V. Summarize the difference between logic programming and functional programming
languages.
VI. Express the role of variable declarations in programming languages, in particular to
binding, scope, and substitution of variables.
VII. Demonstrate the use of scripting languages.
9.5 COURSE OUTCOMES:
Blooms
Course Objectives Course Outcomes
Level
I. Define the structure and design principles of a) Students will be able to List out Basic
BL 1
programming languages. Concepts of Programming Language
II, Explain the skills in analyzing and using the a) Students will be able to Describe Basic
BL 2
features of programming languages. Concepts of Programming Language
b) Students will be able to Solve whether
III. Illustrate the preliminary concepts like context-
the grammar is Unambiguous or BL 3
free grammars, Backus-Naurform, parsetrees.
ambiguous and construct a parse tree
c) Students will be able to correlate with
IV. Analyze various data types of different the basic concepts of Variables, Storage,
BL 4
programming languages. Binding and Scope rules of different
languages with data types
V. Compare between logic programming and a) Students will be able to Support Basic
BL 5
functional programming languages. Concepts of Programming Language
VI. Generalize the role of variable declarations in d) Students will be able to
BL 6
programming languages, in particular to binding, plan a Concurrency Control Mechanism

Department of CSE
scope, and substitution of variables. in ADA,C++ Languages
BLOOMS LEVEL (BL)

BL 1: Remember / knowledge BL2: Understanding BL3: Apply, develop
BL 4: Analyze BL 5: Evaluate BL 6: Create
9.6 HOW PROGRAM OUTCOMES ARE ASSESSED:
Proficiency
Program Outcomes Level
assessed by
An ability to apply the knowledge of mathematics, Computing, Science and Assignment,
A S
engineering to solve Computer Science and Engineering problems. Exercises
An ability to design and conduct engineering experiments, as well as to analyze
B S Exercises
and interpret data
An ability to design and construct a hardware and software system component,
C S Exercises
or process to meet desired needs, within realistic constraints.
Graduates will demonstrate an ability to visualize and work on laboratory and
D S Exercises
Multi-disciplinary tasks individually or as a member within the teams.
An ability to demonstrate skills to use the techniques, modern engineering
E Tools, Software and equipment’s necessary to analyze computer engineering H Exercises
Problems
F An understanding of professional, social and ethical responsibility N .......
An ability to recognize the global issues like green initiatives and alternate
G energy sources and to take technology to villages and to recognize the rural N .......
requirement
The broad education necessary to understand the impact of engineering Seminars,
H S
solutions in a global, economic, environmental, and societal context Discussions
Graduate will develop confidence for self-education and acquire new
I knowledge in the computing discipline and ability and practice for Multi- H Exercises
disciplinary tasks as a member within the teams
Seminars, Paper
J To communicate effectively S
Presentation
An ability to use the techniques, skills and modern engineering tools necessary Exercises,
K H
for Engineering practice. Discussions
Graduates are able to participate and succeed in competitive examination like
L S Exams, Discussions
GRE, GATE, TOEFL, GMAT etc.
M An ability to setup an enterprise. N .......
The use of current application software and the design and use of operating
systems and the analysis, design, testing and documentation of computer S Exercises
programs for the use in Computer Science and engineering technologies.
N = None S = Supportive H = Highly Related
9.7 SYLLABUS:
UNIT - I
Preliminary Concepts : Reasons for studying concepts of programming languages,
programming domains, Language evaluation criteria, influences on language design,
Language categories, Programming paradigms – Imperative, Object Oriented, functional

Department of CSE
programming, Logic programming, Programming language implementation – Compilation

and Virtual Machines, programming environments. Syntax and Semantics: general problem
of describing syntax and semantics, formal methods of describing syntax- BNF , EBNF for
common programming languages features, parse trees, ambiguous grammars, attribute
grammars, denotational semantics and axiomatic semantics for common programming
language features.
UNIT - II
Data Types : Introduction, primitive, character , user defined, array, associative, record,
union, pointer and reference types, design and implementation uses related to these types,
Names, variable, concept of binding, type checking, strong typing, type compatibility, named
constants, variable initialization. Expressions and Statements : Arithmetic, relational and
Boolean expressions, short-circuit evaluation, mixed mode assignment, Assignment
statements, control structures- statement level, compound statements, selection, iteration,
unconditional statements, guarded commands.
UNIT - III
Subprograms and Blocks : Fundamentals of sub-programs, scope and lifetime of variable,
static and dynamic scope, design issues of subprograms and operations, local referencing
environments, parameter passing methods, overloaded sub-programs, generic sub-programs,
parameters that are sub-program names , design issues for functions user defined overloaded
operators, co routines.
UNIT - IV
Abstract Data Types : Abstractions and encapsulation, introduction to data abstraction,
design issues, language examples, C++ parameterized ADT, object oriented programming in
small talk, C++, Java, C# and Ada 95.Concurrency : Subprogram level concurrency,
semaphores, monitors, message passing, java threads, C# threads.
Exception handling : Exceptions, exception propagation, exception handler in Ada, C++
and Java.
Logic programming Language : Introduction and overview of logic programming, basic
elements of Prolog, application of logic programming.
UNIT - V
Functional Programming Languages: Introduction, fundamentals of FPL, LISP, ML ,
Haskell, applications of functional programming languages and comparison of functional and
imperative languages. Scripting Language: Pragmatics, key concepts, Case study: Python –
Values and Types, variables Storage and control, Bindings and Scope, Procedural
Abstraction, Data Abstraction, Separate Compilation, Module Library.
TEXT BOOKS
1. Concepts of Programming Languages, Robert W Sebesta, Eighth Edition Pearson
Education, 2008.
2. Programming Language Design Concepts, D. A. Watt, Wiley Dreamtech, Rp-2007.
REFERENCES
1. Programming Languages, Second Edition, A.B. Tucker, R.E. Noonan, TMH.
2. Programming Languages, K.C. Louden, Second Edition, Thomson, 2003.
3. LISP Patric Henry Winston and Paul Hom Pearson Education.
4. Programming in PROLOG – W.F. Clocksin and C.S.Mellish, Fifth Edition, Springer.
5. Programming Python, M.Lutz, Third Edition, O’reilly, SPD, rp-2007.
6. Core Python Programming, Chun, Second Edition, Pearson Education, 2007.
7. Guide to Programming with Python, Michael Dawson, Thomson, 2008.

Department of CSE
9.8 COURSE PLAN:

The course plan is meant as a guideline. There may probably be changes
Course
Lecture
Learning Blooms Levels Topics to be covered Reference
No.
Outcomes
Reasons for studying, concepts of programming
1 T1 pg:1.2
Reviews the Remembering / languages.
concepts of Knowledge http://nptel.ac.in/courses/106102067/1
2 T1 pg:1.5
Progamming domains.
Language Evaluation Criteria, influences on T1 pg:1.7-
3-4 To Devalop the
Applying / Language design. 1.19
Programming
Application http://nptel.ac.in/courses/106102067/1
5 languages T1 pg:1.22
Language categories.
Programming Paradigms – Imperative ,Object
List out various
Remembering / Oriented, functional Programming , Logic
7-8 programming T1 pg:1.25
Knowledge Programming.
paradigms.
http://nptel.ac.in/courses/106102067/1
Recall the design
Remembering / Programming Language Implementation – T1 pg:2.2-
9-10 issues of
Knowledge Compilation and Virtual Machines, 2.22
implementation.
11-12 Programming environments T1 pg:1.32
General Problem of describing Syntax and
Semantics,
13 1)http://nptel.ac.in/courses/106102067/2 T1 pg:3.3
Recall various 2)http://nptel.ac.in/courses/106102067/5
Remembering / 3)http://nptel.ac.in/courses/106102067/6
programming
Knowledge
environments. Formal methods of describing syntax -BNF,
EBNF for common programming languages
14-17 T1 pg:3.5
features.
parse trees, ambiguous grammars. T1 pg:3.6-
18
http://nptel.ac.in/courses/106102067/4 3.7
Elaborates the Attribute grammars.
19 T1 pg:3.20
features of Understanding / http://nptel.ac.in/courses/106102067/3
attribute Comprehension denotational semantics and axiomatic semantics
20-22 T1 pg:3.27
grammars. for common programming language features.
Introduction, primitive, character.

23 T1 pg:6.4
Understanding /
User defined, array.
24-25 Comprehension T1 pg:6.13
Associative, record, union.
26-27
Introduction, primitive, character.
List out various http://nptel.ac.in/courses/106102067/12pointer
data types T1 pg:6.41
and reference types, design and implementation
28-29
uses related to these types.
http://nptel.ac.in/courses/106102067/1 T1
pg:6.452
Names, Variable, concept of binding, type T1 pg:5.2-
30
checking, strong typing, type compatibility, 5.8
named constants, variable initialization.
31-33 http://nptel.ac.in/courses/106102067/10 T1 pg:6.58
Use expressions Analyzing / Arithmetic relational and Boolean expressions. T1 pg:7.3-
34
and statements in Analysis http://nptel.ac.in/courses/106102067/9 7.17

Department of CSE
a program. Short circuit evaluation mixed mode

35-36 assignment, Assignment Statements. T1 pg:7.19
Control Structures – Statement Level,
37 Compound Statements. T1 pg:8.2
Selection, Iteration.
38 T1 pg:8.4
Unconditional Statements, guarded commands.
39 T1 pg:8.32
Fundamentals of sub-programs, Scope and
40 lifetime of variable. T1 pg:9.2
Tabulate http://nptel.ac.in/courses/106102067/19
different Static and dynamic scope, Design issues of
41 Analyzing / subprograms and operations. T1 pg:9.13
parameter
Analysis http://nptel.ac.in/courses/106102067/37
passing
42 techniques. local referencing environments T1pg:9.14
Parameter passing methods
43 T1 pg:9.16
T1pg: 9.39-
44
9.41
Differentiate sub-
Analyzing /
45 program and co- Differentiate sub-program and co-routines. T1pg: 9.37
Analysis
routines.
46 T1pg: 9.50
Abstractions and encapsulation, introductions to
47 T1pg: 10.3
data abstraction
List out the
48 Design issues, language examples. T1pg: 10.7
concepts of Understanding /
object oriented Comprehension
49 C++ parameterized ADT. T1pg: 10.24
programming.
object oriented programming in smalltalk, C++,
50 T1pg: 11.13
Java, C#, Ada 95
Subprogram level concurrency, semaphores,
51 Recall the T1pg: 12.6
monitors.
importance of
Understanding /
52 semaphores, Massage passing, Java threads, C# threads. T1pg: 12.17
Comprehension
monitors,
Exceptions, exception Propagation, Exception
53 message passing. T1pg: 13.2
handler in Ada, C++ and Java.
Apply logic Introduction and overview of logic
Analyzing /
54 programming Programming, basic elements of prolog, T1pg: 14.3
Analysis
concepts application of logic programming.
Use of functional
Analyzing / Introduction, fundamentals of FPL, LISP, ML,
55 programming T1pg:14.7
Analysis Haskell.
languages.
Tabulate
functional and Application of Functional Programming
Analyzing /
56 logic Languages and comparison of functional and T1pg: 14.37
Analysis
programming imperative Languages.
languages.
Pragmatics, key concepts, case study:
57 Python- values and types, variables. T1pg: 16.5
Apply scripting http://nptel.ac.in/courses/106102067/19
Analyzing /
languages in web Storage and control, bindings and scope,
Analysis
design. procedural abstraction, data abstraction,
58 T1pg: 16.29
separate compilation, module library.

Department of CSE
SESSION PLANNER
Text/
Date Date
Unit Class Reference Session Objectives
Topic planned conducted
book
1. By the end of the session
student will identify concepts
Preliminary Concepts: of PPL
L1 T1
Introduction 2.. By the end of the session
student will understand
concepts of PPL
Reasons for studying of for studying PPL
L2 T2
PPL 2.. By the end of the session
concepts of for studying PPL
Concepts of
of Programming domains
programming
L3 T1 2.. By the end of the session
languages,
Programming domains
concepts of Programming
domains
of Language Evaluation
I L4, Language Evaluation Criteria
T1
L5 Criteria 2.. By the end of the session
concepts of Language
Evaluation Criteria
of Influences on Language
Influences on design
L6 T1
Language design 2.. By the end of the session
concepts of Influences on
Language design
Language categories student will identify concepts
&Programming of Language categories
L7 Paradigms – T1 2.. By the end of the session
imperative, object student will understand
oriented concepts of Language
categories
of functional Programming ,
functional Logic Programming
L8 Programming , Logic T1 2. By the end of the session
Programming student will understand
concepts of functional
Programming , Logic
Programming
L9, Programming 1. By the end of the session
T1
L10 Language student will identify concepts

Department of CSE
Implementation – of Syntax and Semantics

Compilation and
2.. By the end of the session
Virtual Machines,
programming
concepts of Syntax and
environments
Semantics
CLASS TEST UNIT -1
Syntax and Semantics:
of Syntax and Semantics
Introduction ,general
Problem of describing
Syntax and Semantics
concepts of Syntax and
Semantics
Formal methods of student will identify concepts
describing syntax – of Formal methods of
L12 BNF and context free describing syntax
T1
L13 grammar, 2.. By the end of the session
Fundamentals, list, student will understand
derivations concepts of Formal methods
of describing syntax
of Parse trees , Ambiguous
Parse trees , grammars, Operator
Ambiguous precedence, Associativity of
grammars, Operator operator, Unambiguous
L14, precedence, grammar
T1
L15 Associativity of 2.. By the end of the session
operator, student will understand
Unambiguous concepts of Parse trees ,
grammar Ambiguous grammars,
Operator precedence,
Associatively of operator,
Unambiguous grammar
of EBNF
L16 EBNF T1
concepts of EBNF
of Attribute grammars
L17 Attribute grammars T1 2.. By the end of the session
concepts of Attribute
grammars
of Semantics, Operational
Semantics, semantics
L18 T1
Operational semantics 2.. By the end of the session
concepts of Semantics,
Operational semantics
Axiomatic semantics 1. By the end of the session
L19 ,Denotational T1 student will identify concepts
semantics of Axiomatic semantics

Department of CSE
,Denotational semantics
concepts of Axiomatic
semantics ,Denotation
semantics
of operational and denotation
Differences between
semantics
L20 operational and T1
denotation semantics
concepts of operational and
denotation semantics
of Data types: Introduction,
Data types: primitive, character, user
Introduction, defined
L21 T1
primitive, character, 2.. By the end of the session
user defined student will understand
concepts of Data types:
Introduction, primitive,
character, user defined
L22, of Array
Array T1
L23 2.. By the end of the session
concepts of Array
of Associative, Record,
II L24,L Associative, Record, Union
T1
25 Union 2.. By the end of the session
concepts of Associative,
Record, Union
Pointer and reference of Pointer
L26 T1
types 2.. By the end of the session
concepts of Pointer
of Names, Variables,
Concept of binding, Type
Names, Variables,
checking
L27 Concept of binding, T1
Type checking
concepts of Names,
Variables, Concept of
binding, Type checking
Strong typing, Type
compatibility, Named
L28 T2 of Strong typing, Type
constants, Variable
compatibility, Named
initialization
constants, Variable

Department of CSE
initialization
concepts of Strong typing,
Type compatibility, Named
constants, Variable
initialization
CLASS TEST UNIT 3
Expressions and
of Expressions and
Statements:
Statements
L29 Arithmetic relational T1
and Boolean
expressions
concepts of Expressions and
Statements
Short circuit of Short circuit evaluation
L30 evaluation , mixed T1 2.. By the end of the session
mode assignment student will understand
concepts of Short circuit
evaluation
of Assignment Statements,
Assignment Control Structures Statement
Statements, Control Level, Compound statements
L31 Structures Statement T1 2.. By the end of the session
Level, Compound student will understand
statements concepts of Assignment
Statements, Control
Structures Statement Level,
Compound statements
of Selection, Iteration
L32 Selection, Iteration T1 2.. By the end of the session
concepts of Selection,
Iteration
of Unconditional Statements
Unconditional
Statements
concepts of Unconditional
Statements
of guarded commands-
selection, iteration
guarded commands-
selection, iteration
concepts of guarded
commands-selection,
iteration
CLASS TEST UNIT-2
III L35 Subprograms and T2 1. By the end of the session

Department of CSE
Blocks: Fundamentals student will identify concepts

of sub-programs of Subprograms and Blocks:
Fundamentals of sub-
programs
concepts of Subprograms and
Blocks: Fundamentals of
sub-programs
of Scope and lifetime of
variable, static scope
Scope and lifetime of
variable, static scope
concepts of Scope and
lifetime of variable, static
scope
of dynamic scope
L37 dynamic scope T1
concepts of dynamic scope
of subprograms and
Design issues of
operations
L38 subprograms and T1
operations
concepts of subprograms and
operations
of Local referencing
Local referencing environments
L39 T1
environments, 2.. By the end of the session
concepts of Local
referencing environments
of parameter passing
L40 parameter passing methods
T1
L41 methods 2.. By the end of the session
concepts of parameter
passing methods
of overloaded sub-programs
overloaded sub-
,generic sub-progs
L42 programs ,generic T1
sub-progs
concepts of overloaded sub-
programs ,generic sub-progs
parameters that are 1. By the end of the session
L43 sub-program names, T1 student will identify concepts
design issues for of parameters that are sub-

Department of CSE
functions program names, design

issues for functions
concepts of parameters that
are sub-program names,
design issues for functions
of user defined overloaded
user defined operators, co routines
L44 overloaded operators, T1 2.. By the end of the session
co routines student will understand
concepts of user defined
overloaded operators, co
routines
CLASS TEST FOR UNIT-3
Abstract Data types:
of ADT
L45 Abstractions and T1
encapsulation
concepts of ADT
of data abstraction, design
introductions to data
issues
L46 abstraction, design T1
issues
concepts of data abstraction,
design issues
of different languages
L47 language examples T1 2.. By the end of the session
concepts of different
IV languages
C++ parameterized of ADT
L48 T1
ADT 2.. By the end of the session
concepts of ADT
object oriented
of OOPS
L49 programming in small T1
talk ,C++,
concepts of OOPS
Java, C#, Ada of Java, C#, Ada
L50 95Concurrency: 95Concurrency
T2
,L51 Subprogram level 2.. By the end of the session
concurrency student will understand
concepts of Java, C#, Ada
95Concurrency
L52 Concurrency: T1 1. By the end of the session

Department of CSE
Subprogram level student will identify concepts

concurrency of Concurrency
concepts of Concurrency
of semaphores, monitors,
semaphores, monitors, massage passing
L53 T1
massage passing 2.. By the end of the session
concepts of semaphores,
monitors, massage passing
of Java threads, C# threads
Java threads, C#
threads
concepts of Java threads, C#
threads
CLASS TEST UNIT-4
Exception handling : student will identify concepts
Exceptions, exception of EH
L55 T1
Propagation Exception 2.. By the end of the session
handler in Ada student will understand
concepts of EH
of C++ and Java
L56 C++ and Java T1
concepts of C++ and Java
Logic Programming
Language :
of LPL
L57 Introduction and T1
overview of logic
programming
concepts of LPL
basic elements of of prolog
L58 T2
prolog, 2.. By the end of the session
concepts of prolog
application of logic T1 of LP
L59
programming 2.. By the end of the session
concepts of LP
Functional
Programming
T1 of FPL
V L60 Languages:
R5 2.. By the end of the session
Introduction,
fundamentals of FPL
concepts of FPL
T1 1. By the end of the session
L61 LISP, ML
R5 student will identify concepts

Department of CSE
of LISP, ML
concepts of LISP, ML
HASKELL, Scoping student will identify concepts
rule in common T1 of HASKELL
L62
LISP,ML AND R5 2.. By the end of the session
HASKELL, student will understand
concepts of HASKELL
Applications of FPL,
of Applications of FPL
Comparison of FPL
L63 R5 2.. By the end of the session
and imperative
languages
concepts of Applications of
FPL
Scripting language: of Scripting language
L64 introduction, Key R5 2.. By the end of the session
concepts student will understand
concepts of Scripting
language
of PYTHON
L65 Case study: PYTHON R5
PYTHON
CLASS TEST UNIT-5
L66 REVISION
9.9 MAPPING COURSE OBJECTIVES LEADING TO THE ACHIEVEMENT OF

PROGRAM OUTCOMES:
Course Course Outcomes

Objectives a b c d
I H H H
II H S S
III S S
IV S
V S S H
VI H
S=Supportive H=Highly Related
9.10 MAPPING COURSE OUTCOMES LEADING TO THE ACHIEVEMENT OF

PROGRAM OUTCOMES:
Course Program Outcomes

Outcomes a b C d e f g h i j k l m N
A. S S H S S
B. H S H S H

Department of CSE
C. S S S S H S S
D. S
E. S S S S H S S
F. H S S
S=Supportive H=Highly Related
9.11 OBJECTIVE BITS
UNIT-1
1. Which of the following language is widely used for Scientific Applications?
[March 2000]
A. ALGOL60
B. COBOL
C. LISP
D. FORTRAN
Answer : C
2. Which of the following languages support Independent Compilation? [ ] [March
2005]
A. ADA
B. FORTRAN90
C. FORTRAN II to FORTRAN77
D. C++
Answer: C
3. According to Von Neumann architecture, the central feature of imperative
Languages is [March2009]
A. registers
B. variables
C. identifiers
D. keywords
Answer: C
4. ________ is the first functional programming language [ ] [March 2011]
A. Ada
B. LISP
C. prolog
D. none
Answer : B
5. The following is the widely used programming language developed for Artificial
Intelligence [ ] [March 2007]
A. LISP
B. FORTRAN
C. COBOL
D. ALGOL 60
Answer : A
6. What is the post condition for x = 2 * y + 3 { x> 25 } [ ] [March 2005]
A. y>11
B. x > 25
C. y > 14
D. y > 13
Answer: B

Department of CSE
7. Which of the following is a device that can be used to generate the sentences of a
______language? [ ] [March 2013]
A. Language generator
B. Language recognizers
C. Program generator
D. Sentence generator
Answer A
8. When a grammar rule has its LHS also appearing at the beginning of its RHS
called [ ] [March 2011]
A. Right recursive
B. Left recursive
C. Recursion
D. A&B
Answer B
9. Which attributes are used to pass semantic information up a parse tree [ ] [March
2005]
A. Synthesized attributes
B. Inherited attributes
C. Hirarchial attributes
D. None
Answer A
10. Which parser trace and build the parse tree in preorder [ ][March 2000]
A. Bottom up
B. Top down
C. Only up
D. Up and down
Answer B
11. ________ refers to a collection of tools used in the development of software
programs [ ][March 2009]
A. Programming Environment
B. Programming
C. Aliasing
D. Environment
Answer B
12. An ____ is a logical statement that is assumed to be true[ ] [March 2011]
A. Axiom
B. Socket
C. Stack
D. Static
Answer A
13. The Logical expressions are called [ ] [March 2013]
A. Assertions
B. Semantics
C. Strings
D. Symbols
Answer A
14. The abstractions in a BNF description or grammar are often called __________ [ ]
[March2014]
A. Rules
B. Conditions

Department of CSE
C. Non terminals
D. Terminals
Answer C
15. A Sentence generation is called a ___________ [ ] [March 2006]
A. Statement
B. Token
C. Derivation
D. BNF
Answer C
16. The __________ of a language is category of its lexemes [ ] [March 2009]
A. String
B. Statements
C. Token
D. None of the above
Answer C
17. Which of the following is a natural notation for describing syntax [ ] [March 2011]
A. Regular grammar
B. Automata
C. Context-free grammar
D. Backus-Naur Form
Answer D
18 Which of the following gather the characters of the source program into lexical
units [ ] [March 2009]
A. Lexical Analyzer
B. Syntax Analyzer
C. Parse Tree
D. Code Generator
Answer A
19. Languages designed on Von Neumann architecture are called as [ ] [March 2005]
A. Imperative Languages
B. OOPL
C. Explicit Languages
D. Prolog Language
Answer A
20. List of commands put in a file is known as [ ] [March 2000]
A. Tag
B. Language
C. Script
D. Program
Answer C
UNIT II
1. In c and C++ the asterisk (*) denotes the operation. [ ] [March 2005]
A. dereferencing
B. negation
C. referencing
D. address
Answer A
2. The ------- of a variable is the time between creation and termination [ ] [March
2009]

Department of CSE
A. context
B. scope
C. range
D. life time
Answer D
3. The associatively of postfix + + operator in C + + is [ ] [March 2011]
A. Right
B. depends on expression
C. any order
D. Left
Answer A
4. The following Type compatibility is described in Semantics [ ] [March 2013]
A. structured
B. static
C. denotional
D. dynamic
Answer B
5. The following type is one in which the variables have arrange of values that
consists of memory addresses and a special value nil [ ] [March 2011]
A. enumerated
B. pointer
C. derived
D. Linked List
Answer B
8. The following language has pointer concept [ ] [March 2009]
A. java
B. C++
C. DHTML
D. HTML
Answer B
9. The first high level programming to include pointer variables was [ ] [March 2005]
A. For tran
B. PL/1
C. ALGOL 60
D. ADA
Answer B
10. _____data type specifically available in a language for business applications
[March 2000]
A. int
B. double
C. decimal
D. float
Answer C
11. The following type stores values as sequences of characters [ ] [March 2009]
A. boolean
B. float
C. int
D. string
Answer D
12. __________is the first functional programming language [ ] [March 2011]

Department of CSE
A. Ada
B. LISP
C. prolog
D. none
Answer B
13. A _________is a type whose variables are allowed to store different type values in
same memory [ ] [March 2009]
A. record
B. union
C. associative array
D. array
Answer B
14. Dynamic type checking allowed in [ ] [March 2010]
A. C
B. PHP
C. Java Script
D. B&C
Answer D
15. Variables that are dynamically allocated from the heap is called [ ] [March 2013]
A. Static variables
B. Dynamic variables
C. heap dynamic variables
D. A&B
Answer C
16. The following language does not use the equals sign for assignment operator [ ]
[March2012]
A. ALGOL 6 0
B. C
C. BAS C
D. C++
Answer A
17. In FORTRAN 90, Loop parameters are evaluated [ ] [March 2011]
A. thrice
B. only once
C. twice
D. every time
Answer B
18. Logical expressions are called [ ] [March 2009]
A. axioms
B. conditions
C. assertions
D. subjects
Answer C
19. The equality operator in Fortran95 is _______________. [ ] [March 2005]
A. .EQ
B. EQUAL
C. ==
D. none
Answer A
20 __________ is bound to value only once [ ] [March 2000]

Department of CSE
A. Static variable
B. Dynamic variable
C. Named constant
D. both (a) & (b)
Answer C
UNIT III
1. The first actual parameteris bound to the first formal parameter and so forth,
such parameters are called POSITIONAL PARAMETERS. [March 2000]
2. An OVERLOADED SUBPROGRAM is one that has the same name as another
subprogram in the same referencing environment. [March 2005]
3. A GENERIC sub program is one whose computation can be done on data of different
types in different calls. [March 2009]
4. The three semantic models are IN MODE, OUT MODE, INOUT MODE.
5. C uses PASS-BY-VALUE and pass-by-reference semantics is achieved by using
POINTERS as parameters. [March 2011]
6. An OVERLOADED SUBPROGRAM is a subprogram that has the same name as
another subprogram in the same referencing environment. [March 2009]
7. The invocation of a co routine is called a RESUME. [March 2010]
8. Only one processor but all of the executing programs in such a system appear to run
concurrently, while sharing the process this is called as QUASI-CONCURRENCY.
[March 2011]
9. A POLYMORPHIC subprogram takes parameters of different types on different
activations. [March 2005]
10. Overloaded subprograms provide a particular kind of polymorphism called AD HOC
POLYMORPHISM. [March 2000]
11. Block concept was introduced by [ ] [March 2009]
A. Fortran
B. ALGOL60
C. PL/I
D. Ada
Answer B
12. Multiple selector statement in C is [ ] [March 2013]
A. Case
B. switch
C. goto
D. continue
Answer C
13. Parameters in subprogram header are called [ ] [March 2012]
A. formal parameters
B. actual parameters
C. local variables
D. global variables
Answer A
14. Loop.. end loop is used in [ ] [March 2010]
A. FORTRAN
B. PASCAL
C. Ada
D. C
Answer C

Department of CSE
15. In FORTRAN , global variables are [ ] [March 2009]

A. COMMON
B. GLOBAL
C. STATIC
D. REGISERS
Answer A
16. In Ada, call-by-value parameter passing mechanism can be identified using [ ]
[March 2013]
A. out
B. in out
C. in
D. none of the above
Answer C
17. In C, arrays are passed as parameters using [ ] [March 2012]
A. call-by-value
B. call-by-reference
C. call-by-name
D. call-by-result
Answer B
18. Elseif is used in [ ] [March 2011]
A. ALGOL60
B. Fortran
C. PL/I
D. Ada
Answer D
19. In FORTRAN 77, the default parameter passing mechanism is [ ] [March 2009]
A. call-by-value
B. call-by-reference
C. call-by-name
D. call-by-result
Answer B
20. Down to is used in the for loop of the following language [ ] [March 2000]
A. FORTRAN
B. PASCAL
C. Ada
D. C++
Answer B
UNIT-IV
1. An ABSTRACTION is a view or representation of an entity that includes only the
most significant attributes. [March 2000]
2. The concept of PROCESS ABSTRACTION is the oldest in programming language
design. [March 2005]
3. An instance of an abstract data type is called an OBJECT. [March 2009]
4. The concept of data abstraction had its origins in SIMULA 67. [March 2005]
5. The encapsulating constructs in ADA are called PACKAGES. [March 2011]
6. Package that provides interface of the encapsulation is called SPECIFICATION
PACKAGE. [March 2012]
7. Package which provides implementation of entities in specification package are called
BODY PACKAGE. [March 2013]

Department of CSE
8. Data defined in C++ class are called DATA MEMBERS and the functions defined in a
class are called MEMBER FUNCTIONS. [March 2011]
9. Heap-Dynamic class objects are created with the NEW operator and destroyed with the
DELETE operator. [March 2005]
10. Object oriented programming has its roots in SIMULA 67. [March 2000]
11. The special processing that may be required when an exception is detected is called
EXCEPTION HANDLING. [March 2009]
12. In some situations it is necessary to complete some computations regardless of how
subprogram execution terminates such a computation is called FINALIZATION.
[March 2013]
13. The java system includes two predefined exception classes that are subclasses of
Throwable, ERROR and EXCEPTION. [March 2009]
14. Programming that uses a form of symbolic logic as a programming language is called
LOGIC PROGRAMMING. [March 2011]
15. The form of implementation of prolog is sometimes called as EDINBURGH
SYNTAX. [March 2012]
16. The first implementation of Edinburg syntax is done on DEC system10. [March 2014]
17. All the statements in prolog are constructed from TERM. [March 2011]
18. In rule statement the left part representing then statement is called CONSEQUENT
where as if part at the right side is called the ANTECEDENT. [March 2009]
19. PROPOSITIONS are the logical statements that may evaluate either true or false.
[March 2005]
20. Queries in prolog are called GOALS, when a goal is a composite proposition its facts
are called SUBGOALS. [March 2000]
UNIT-V
1. In FPL a mathematical function is a plot between members of two sets called
DOMAIN SET and RANGE SET. [March 2000]
2. A method called as the Lambda notation is used for defining NAMELESS functions.
3. (car L)= (car(car L)). [March 2005]
4. Original LISP contains two types of data ATOMS and LISTS. [March 2009]
5. ML has EXCEPTION HANDLING and a MODULE facility for implementing
abstract data types. [March 2011]
6. ML is a STRONGLY typed language. [March 2010]
7. Haskell uses NON STRICT semantics. [March 2011]
8. ML uses STRICT SEMANTICS. [March 2009]
9. HASKELL is designed by THOMPSON 1999. [March 2005]
10. In LISP ,function calls are specified using [ ] [March 2000]
A. Postfix
B. Cambridge polish
C. Infix
D. reverse polish
Answer B
11. In the original LISP the number of data types available was [ ] [March 2011]
A. 1
B. 2
C. 3
D. 4
Answer B
12. CAR in LISP returns the following element of a list [ ] [March 2010]

Department of CSE
A. first
B. last
C. tail
D. second
Answer A
13. Following is the keyword used to defina a function in LISP [March 2012]
A. FUN
B. DEFINE
C. CAR
D. LIST
Answer B
14. Function declaration in ML can be done using the keyword [ ] [March 2013]
A. function
B. procedure
C. DEFINE
D. fun
Answer D
15. The method of defining infinite lists in Haskell is [ ] [March 2014]
A. Linked List
B. Lambda expression
C. List comprehension
D. Not possible
Answer C
16. For logic programming, following symbolic logic is used [ ] [March 2011]
A. Integration
B. Relational Algebra
C. Relational Calculus
Answer C
17. A function is [ ] [March 2011]
A. Parameter
B. Function Symbol
C. Compound Term
D. None
Answer B
18. “implies” logical connections is represented using [ ] [March 2009]
A. C
B. „E
C. E‟
D. ø
Answer B
19. CDR in LISP returns the following element of a list [ ] [March 2005]
A. Last and first elements
B. Last but one element
C. remainder of a given list after CAR is removed
D. Entire list except the last element
Answer C
20. Which of the following are scripting languages [ ] [March 2000]
A. HTML
B. C
C. Ada

Department of CSE
D. COBOL
Answer A
9.12 TUTORIAL QUESTIONS

PART-A (SHORT ANSWER QUESTIONS)
Blooms
Course
S. No Questions Taxonomy
Outcome
Level
UNIT –I
1. Define Programming Language. Knowledge a
2. Difference between sentence and sentential form. Analysis b
3. Define Syntax and Semantics. Knowledge a
4. Differentiate between Syntax and Semantics. Analysis b
5. Write BNF notation for i) For loop ii) if-else condition Synthesis c
6. Give grammars for simple assignment statements. Comprehension c
7. Give an un ambiguous grammar for if-then-else. Comprehension c
8. Define Parse trees. Knowledge a
9. Define Denotational semantics. Knowledge a
10. Define Operational semantics. Knowledge a
11. Define Axiomatic semantics. Knowledge a
12. Differentiate compiler and interpreter. Analysis b
13. Describe language recognizers. Knowledge a
14. Describe generators. Knowledge a
15. Distinguish simplicity and orthogonally Comprehension c
UNIT –II
1. Distinguish static and dynamic scoping. Comprehension c
2. Define associative arrays. Knowledge a
3. Define guarded commands? Knowledge a
4. Distinguish named type and structure type compatibility. Comprehension c
5. List the merits of sub range types. Knowledge a
6. Differentiate union and enumeration. Analysis b
7. Define data type. Knowledge a
8. List the merits of type checking. Knowledge a
9. Define user defined data type. Knowledge a
10. Define widening and narrowing conversions? Knowledge a
UNIT -III
1. Define scope and lifetime of a variable. Knowledge a
2. Differentiate shallow and deep binding. Analysis b
3. Define subprogram. Knowledge a
4. Define procedures. Knowledge a
5. Define local referencing environment. Knowledge a
6. Differentiate static and dynamic binding. Analysis b
UNIT –IV
1 Define an exception. Knowledge a
2 Define a thread. Knowledge a

Department of CSE
3 Define concurrency. Knowledge a

4 Define binary semaphore. Knowledge a
5 Define monitors. Knowledge a
6 Define mutual exclusion. Knowledge a
7 Define deadlock. Knowledge a
8 Define an abstract data type. Knowledge a
9 Define logic programming language. Knowledge a
10 Define data abstraction. Knowledge a
UNIT -V
1 Give the meaning of lazy evaluation mean. Comprehension c
2 Define procedural abstraction. Knowledge a
3 List few characteristics of Python language. Knowledge a
4 Define functional language. Knowledge a
5 Define imperative language. Knowledge a
6 Give the meaning of scripting language. Comprehension c
7 List few examples of scripting languages. Knowledge a
8 List keywords of Python language. Knowledge a
9 List data types of Python language. Knowledge a
10 Define the term separate compilation in Python. Knowledge a
PART – B LONG ANSWER QUESTIONS
S. Blooms Course
Question
No Taxonomy Level Outcome
UNIT –I
Discuss language evaluation criteria and the characteristics that affect
1. Comprehension c
them.
2. List the potential benefits of studying programming language concept. Knowledge a
Comprehension,
Explain syntax of a “for” statement in PASCAL using BNF notation
3. Synthesis, b/c/d
and syntax graphs.
Evaluation
Comprehension,
Explain syntax of declaration statement in PASCAL using BNF
4. Synthesis, b/c/d
notation and syntax graphs.
Evaluation
Compute the weakest precondition for each of the following simple
assignment statements and post conditions.
a=2*(b-1)-1{a>0}
5. Application e
b=(c+10)/3 {b>6}
a=a+2*b-1 {a>1}
X=2*y+x-1 {x>11}
Write BNF notation for following: Application,
6. d/e
a)For loop b)If-else condition c)Structure definition Synthesis
Define left most derivation. Prove that the following grammar is
ambiguous.
<program>->begin<stmt_list>end
<stmt_list>-><stmt>
|<stmt>;<stmt_list>
7 Knowledge a
<stmt>-><var>=<expression>
<var>-> A|B|C
<expression>-><var>+<var>
|<var>-<var>
|<var>

Department of CSE
State the given grammar is ambiguous.

<assign> -><id>=<expr>
<id>->A|B|C
8 <expr>-><expr>+<expr> Knowledge a
|<expr>*<expr>
|(<expr>)
|<id>
List the three general methods of implementing a programming
9 Knowledge a
language.
Comprehension,
10 Explain different aspects of the costs of a programming language. Synthesis, b/c/d
Evaluation
UNIT -II
1. Define heterogeneous array. Discuss the design issues of arrays. Knowledge a
Comprehension,
2. Explain in detail the design issues of arithmetic expressions. Synthesis, b/c/d
Evaluation
Discuss structural and name equivalence for types. Give an example of
3. Comprehension c
a language used for each approach.
Define a variable and what the attributes of a variable are. Elaborate on
4. Knowledge a
address of a variable.
Application,
5. Write a note on Boolean and relational expressions. d/e
Synthesis
Comprehension,
Explain the different types of relational operators used in C, Ada and
6. Synthesis, b/c/d
Fortran 95.
Evaluation
What are the advantages and disadvantages of mixed mode arithmetic
7 6
expressions?
Define array and record. Classify arrays based on storage allocation.
8 What are the advantages and disadvantages of allocation memory Knowledge a
during compilation time and run time.
Define static, fixed stack dynamic, stack dynamic, fixed heap dynamic
9 Knowledge a
and dynamic arrays. What are the advantages of each?
10 List the design issues of pointers. Explain. Knowledge a
UNIT –III
Define subprograms. What are the advantages of subprograms?
1. Explain different methods of parameter passing mechanisms to Knowledge a
subprograms.
Comprehension,
2. Explain the design issues of subprograms. Synthesis, b/c/d
Evaluation
3 Discuss about procedures and functions in subprograms. Comprehension c
Define shallow and deep binding for referencing environment of
4 Knowledge a
subprograms that have been passed as parameters.
5 Discuss with suitable examples static and dynamic scope. Knowledge a
6 Discuss generic subprograms in C++. Comprehension c
Comprehension,
7 Explain about Co routines. Synthesis, b/c/d
Evaluation
8. Discuss generic subprograms in java. Comprehension c
9. Discuss the importance of Co routines of Lua language. Comprehension c
10. Discuss the importance of generic subprograms. Comprehension c
UNIT -IV
Knowledge,
1. Describe how exception is handled in ADA with an example. Comprehension, c
Evaluation
Knowledge,
2. Describe briefly about Semaphores. c
Comprehension,

Department of CSE
Evaluation
Knowledge,
3. Describe briefly about Monitors. Comprehension, d
Evaluation
4. Discuss Object Oriented Programming in SMALLTALK. Comprehension c
Application,
5. Write about goal statements and simple arithmetic in PROLOG. d/e
Synthesis
Define binary semaphore. What is counting semaphore? What are the
6. Knowledge a
primary problems with using semaphores to provide synchronization?
Explain the following terms:
• process synchronization Comprehension,
7 • race condition Synthesis, b/c/d
• binary semaphores Evaluation
• MIMD
Comprehension,
8 Explain different types of propositions present in logic programming. Synthesis, d
Evaluation
Knowledge,
Describe the cooperation synchronization and competition
9 Comprehension, d
synchronization in message passing.
Evaluation
Discuss how dining philosopher’s problem and producer consumer
10 Comprehension c
problem are solved using concurrency in Ada.
UNIT – V
Application,
1 Write about control constraints in Python. d/e
Synthesis
Application,
2 Write about data abstraction in Python. d/e
Synthesis
Application,
3 Write about data types and structures of LISP and LISP interpreter. d/e
Synthesis
4 List the ways in which ML is significantly different from scheme. Knowledge a
Knowledge,
5 Describe the scoping rule in common LISP, ML and HASKELL. Comprehension, c
Evaluation
Comprehension,
6 Explain the characteristics of scripting languages. Synthesis, c
Evaluation
7 Discuss in detail about the python primitive types. Comprehension c
Comprehension,
8 Explain about LISP functional programming language. Synthesis, b
Evaluation
9 Discuss and trace the Python code to find the factorial of a number. Comprehension c
Discuss and trace the Python code to print the Fibonacci series
10 Comprehension c
between the given ranges of numbers.
PART – C (PROBLEM SOLVING AND CRITICAL THINKING QUESTIONS)
Blooms
S. Course
Questions Taxonomy
No Outcome
Level
UNIT –I
Give some reasons why computer scientist and professional software
1 developers should study general concepts of language design and Comprehension c
evaluation.
Write reasons for the statement: “Exception handling is very Application,
2 d/e
important, but often neglected by programming languages”. Synthesis

Department of CSE
Write reasons for the statement: “A programming language can be

compiled or interpreted”. Give relative advantages and disadvantages Application,
3 d/e
of compilation and interpretation. Give examples of compiled and Synthesis
interpreted languages.
UNIT – II
List what advantages does java’s break statement have over C’s and
1 Knowledge a
C++’s break statement.
State whether static binding is more reliable or dynamic binding.
2 Knowledge a
Explain why.
UNIT -III
Analysis ,
1. Compare the parameter passing mechanisms of ALGOL and ADA. c/d
Evaluation
State the importance of Local Referencing Environments with suitable
2. Knowledge a
examples.
3. Discuss about different parameter passing methods of Ada language. Comprehension c
UNIT –IV
Discuss the reasons for using exception handlers in a programming
Comprehensi
1. language. What if there exist programming languages with no exception c
on
handlers.
Comprehensi
2. Give the sample code to factorial of a number in PROLOG language. c
on
Sketch the importance of logic programming languages over functional
3. Understand a
UNIT -V
Application,
1. Write features of Haskell that makes very different from schema. d/e
Synthesis
2. List the ways in which ML is significantly different from scheme. Knowledge a
Prove the advantages of Python scripting language over other scripting

3. Understand a
Languages
Comprehensi
4. Give example of Python code to find the roots of quadratic equation c
on
9.13 ASSIGNMENT QUESTIONS

PART – A (SHORT ANSWER QUESTIONS)
Blooms
Course
S. Taxonomy
Questions Outcome
No Level
UNIT –I
1 Define Programming Language. Knowledge a
2 Difference between sentence and sentential form. Analysis b
3 Define Syntax and Semantics. Knowledge a
4 Differentiate between Syntax and Semantics. Analysis a
5 Write BNF notation for i) Forloop ii) if-else condition Synthesis b
6 Give grammars for simple assignment statements. Comprehension c
7 Give an un ambiguous grammar for if-then-else. Comprehension c

Department of CSE
8 Define Parse trees. Knowledge a

9 Define Denotational semantics. Knowledge a
10 Define Operational semantics. Knowledge a
11 Define Axiomatic semantics. Knowledge a
12 Differentiate compiler and interpreter. Analysis b
13 Describe language recognizers. Knowledge a
14 Describe generators. Knowledge a
15 Distinguish simplicity and orthogonality Comprehension c
UNIT –II
1 Distinguish static and dynamic scoping. Comprehension c
2 Define associative arrays. Knowledge a
3 Define guarded commands? Knowledge a
4 Distinguish named type and structure type compatibility. Comprehension c
5 List the merits of sub range types. Knowledge a
6 Differentiate union and enumeration. Analysis b
7 Define data type. Knowledge a
8 List the merits of type checking. Knowledge a
9 Define user defined data type. Knowledge a
10 Define widening and narrowing conversions? Knowledge a
UNIT –III
1 Define scope and lifetime of available Knowledge a
2 Differentiate shallow and deep binding. Analysis b
3 Define subprogram. Knowledge a
4 Define procedures. Knowledge a
5 Define local referencing environment. Knowledge a
6 Differentiate static and dynamic binding. Analysis b
UNIT –IV
1 Define an exception. Knowledge a
2 Define a thread. Knowledge a
3 Define concurrency. Knowledge a
4 Define binary semaphore. Knowledge a
5 Define monitors. Knowledge a
6 Define mutual exclusion. Knowledge a
7 Define deadlock. Knowledge a
8 Define an abstract data type. Knowledge a
9 Define logic programming language. Knowledge a
10 Define data abstraction. Knowledge a
UNIT –V
1 Give the meaning of lazy evaluation mean. Comprehension c
2 Define procedural abstraction. Knowledge a
3 List few characteristics of Python language. Knowledge a
4 Define functional language. Knowledge a
5 Define imperative language. Knowledge a
6 Give the meaning of scripting language. Comprehension c
7 List few examples of scripting languages. Knowledge a

Department of CSE
8 List keywords of Python language. Knowledge c

9 List data types of Python language. Knowledge c
10 Define the term separate compilation in Python. Knowledge c
PART – B (LONG ANSWER QUESTIONS)
Blooms
Course
S. No Questions Taxonomy
Outcome
Level
UNIT –I
1 Discusslanguageevaluationcriteriaandthecharacteristicsthataffect them. Comprehension c
2 List the potential benefits of studying programming language concept. Knowledge a
Comprehensio
Explain syntax of a “for” statement in PASCAL using BNF notation and b/c
3 n, Synthesis,
syntax graphs. /d
Evaluation
Comprehensio
Explain syntax of declaration statement in PASCAL using BNF notation b/c
4 n, Synthesis,
and syntax graphs. /d
Evaluation
Compute the weakest pre condition for each of the following simple
assignment statements and post conditions.
a=2*(b-1)-1{a>0}
5 Application e
b=(c+10)/3{b>6}
a=a+2*b-1 {a>1}
X=2*y+x-1{x>11}
Applicatio
Write BNF notation for following: a) For loop b)If-else condition c) Structure
6 n, e/b
definition
Synthesis
Define left most derivation. Prove that the following grammar is
ambiguous.
<program>->begin<stmt_list>end
<stmt_list>-><stmt>
|<stmt>;<stmt_list>
7 Knowledge a
<stmt>-><var>=<expression>
<var>->A|B|C
<expression>-><var>+<var>
|<var>-<var>
|<var>
State the given grammar is ambiguous.
<assign>-><id>=<expr>
<id>->A|B|C
8 <expr>-><expr>+<expr> Knowledge a
|<expr>*<expr>
|(<expr>)
|<id>
9 List the three general methods of implementing a programming language. Knowledge a
Comprehensio b/
10 Explain different aspects of the costs of a programming language. n, Synthesis, c/
Evaluation d
UNIT -II
1 Define heterogeneous array. Discuss the design issues of arrays. Knowledge a
Comprehensio b/
2 Explain in detail the design issues of arithmetic expressions. n, Synthesis, c/
Evaluation d
Discuss structural and name equivalence for types. Give an example of a
3 Comprehension c
language used for each approach.

Department of CSE
Define a variable and what the attributes of a variable. Elaborate on address

4 Knowledge a
of a variable.
Applicatio
5 Write a note on Boolean and relational expressions. n, e/b
Synthesis
Comprehensio
Explain the different types of relational operators used in C, Ada and
6 n, Synthesis, b/c/d
Fortran 95.
Evaluation
What are the advantages and disadvantages of mixed mode arithmetic
7 Knowledge a
expressions?
Define array and record. Classify arrays based on storage allocation. What are
8 the advantages and disadvantages of allocation memory during compilation Knowledge a
time and runtime?
Define static, fixed stack dynamic, stack dynamic, fixed heap dynamic and
9 Knowledge a
dynamic arrays. What are the advantages of each.
10 List the design issues of pointers. Explain. Knowledge a
UNIT -III
Define sub programs. What are the advantages of sub programs? Explain
1 Knowledge a
different methods of parameter passing mechanisms to sub programs.
Comprehensio
2 Explain the design issues of subprograms. n, Synthesis, b/c/d
Evaluation
3 Discuss about procedures and functions in sub programs. Comprehension c
Define shallow and deep binding for referencing environment of subprograms
4 Knowledge a
that have been passed as parameters.
5 Discuss with suitable examples static and dynamic scope. Knowledge a
6 Discuss generic subprograms in C++. Comprehension c
Comprehensio
7 Explain about Co routines. n, Synthesis, b
Evaluation
8 Discuss generic subprograms in java. Comprehension c
9 Discuss the importance of Co routines of a language. Comprehension c
10 Discuss the importance of generic sub programs. Comprehension c
UNIT –IV
Knowledge,
1 Describe how exception is handled in ADA with an example. Comprehensio c
n, Evaluation
Knowledge,
2 Describe briefly about Semaphores. Comprehensio c
n, Evaluation
Knowledge,
3 Describe briefly about Monitors. Comprehensio c
n, Evaluation
4 Discuss Object Oriented Programming in SMALL TALK. Comprehension c
Applicatio
5 Write about goal statements and simple arithmetic in PROLOG. n, e/b
Synthesis
Define binary semaphore. What is counting semaphore? What are the
6 Knowledge a
primary problems with using semaphores to provide synchronization?
Explain the following terms:
• Process synchronization Comprehensio
7 • race condition n, Synthesis, d
• binary semaphores Evaluation
• MIMD
Comprehensio
8 Explain different types of propositions presenting logic programming. d
n, Synthesis,

Department of CSE
Evaluation
Knowledge,
Describe the cooperation synchronization and competition synchronization
9 Comprehensio c
in message passing.
n, Evaluation
Discuss how dining philosopher’s problem and producer consumer problem
10 Comprehension c
are solved using concurrency in Ada.
UNIT –V
Application,
1 Write about control constraints in Python. d/e
Synthesis
Application,
2 Write about data abstraction in Python. d
Synthesis
Application,
3 Write about data types and structures of LISP and LISP interpreter. d
Synthesis
4 List the ways in which ML is significantly different from scheme. Knowledge a
Knowledge,
5 Describe the scoping rule in common LISP, ML and HASKELL. Comprehension,
d
Evaluation
Comprehensio
6 Explain the characteristics of scripting languages. n, Synthesis,
d
Evaluation
7 Discuss in detail about the python primitive types. Comprehension d
Comprehensio
8 Explain about LISP functional programming language. n, Synthesis,
c
Evaluation
9 Discuss and trace the Python code to find the factorial of a number. Comprehension b
Discuss and trace the Python code to print the Fibonacci series between the
10 Comprehension b
given ranges of numbers.
Blooms
S. Course
Question Taxonomy
No Outcome
Level
UNIT –I
Give some reasons why computer scientist and professional software
1 developers should study general concepts of language design and Comprehension
d
evaluation.
Write reasons for the statement: “Exception handling Is very Application,
2 c
important, but often neglected by programming languages”. Synthesis
Write reasons for the statement: “A programming language can be
compiled or interpreted”. Give relative advantages and disadvantages Application,
3
of compilation and interpretation. Give examples of compiled and Synthesis c
interpreted languages.
UNIT -II
List what advantages does java’s break statement have over C’s and
1 Knowledge
C++’s break statement. b
State whether static binding is more reliable or dynamic binding. Explain
2 Knowledge b
why.
UNIT -III
Analysis ,
1 Compare the parameter passing mechanisms of ALGOL and ADA. c
Evaluation
State the importance of Local Referencing Environments with
2 Knowledge b
suitable examples.
3 Discuss about different parameter passing methods of Ada language. Comprehension c
UNIT –IV

Department of CSE
Discuss the reasons for using exception handlers in a programming

1 language. What if there exist programming languages with no Comprehension b
exception handlers.
2 Give the sample code to factorial of a number in PROLOG language. Comprehension c
Sketch the importance of logic programming languages over
3 Understand d
functional programming languages.
UNIT -V
Application,
1 Write features of Haskell that makes very different from schema. b
Synthesis
2 List the ways in which ML is significantly different from scheme. Knowledge c
Prove the advantages of Python scripting language over other
3 Understand d
scripting languages
4 Give example of Python code to find the roots of quadratic equation Comprehension c

Department of CSE
10. INTELLECTUAL PROPERTY RIGHTS (A50017)

Course Title INTELLECTUAL PROPERTY AND PATENT RIGHTS

Course Code A50017
Course Structure
4 - - 4
Course Coordinator Dr YogithaWagh, Assoc Professor
Team of Instructors Mrs.K Suhrullekha/Ms. V Sreepavani,/Mrs. M Mallika Reddy

This course is designed in such a way that student can outline and classify Intellectual
Property. It helps to identify issues, analyze and practice Intellectual Property Laws in
relation to Intellectual Property rights in the interest of original owner of Intellectual
Property. This course describes Intellectual Property Laws, Associations and Internationally
developments of Intellectual Property.
10.2 PREREQUISITES:
Level Credits Periods / Week Prerequisites

4 45 4 INTELLECTUAL PROPERTY AND PATENT RIGHTS
10.3. MARKS DISTRIBUTION:
University End
Exam Marks
There shall be 2 Mid Term Examinations. Each Mid Term
Examination consists of a Subjective Test and an Objective Test. The
Subjective Test is for duration of 1 hr and the Objective Test is for
duration of 30 minutes. The Objective Test consists of 10 multiple choice
and 10 fill in the blanks type questions. The student has to answer all the
questions and each question carries Half Mark. The subjective test is for
10 marks and the objective test will be for 10 marks. Subjective test
in midterm examinations shall contain 4 questions, with each question
having part a) and part b). Each question will carry 5 marks and the student
75 100
needs to answer any 2 questions. First midterm examination shall be
conducted for the first four units of syllabus and second midterm
examination shall be conducted for the remaining four units. The
objective question paper and the key will be received from JNTUH
University. Five marks are earmarked for assignments. There shall be
two assignments and the marks shall be awarded considering the best
of two assignments in each course. Marks shall be awarded
considering the best of two Mid Term Examinations in each course
reason whatsoever, will get Zero Mark (s)


Department of CSE
2 I Assignment 5
4 II Assignment 5
COURSE OBJECTIVES:
I. Memorize and recognize Intellectual Property and its rights on nationally and
internationally.
II. Classify Intellectual Property and prepares strategies, process in acquisition of rights
against those Intellectual Property.
III. Identify and examine issues of infringement of rights against Intellectual Property and
comply with Intellectual Property Law.
IV. Analyze and formulate the steps involved in Intellectual Property.

Upon successful completion of the course, the student should be familiar with and be able to:
S. BLOOMS
COURSE OUTCOMES
NO LEVELS
Understanding /
a. Understands the legal issues on Intellectual Property Rights
Comprehension
Understanding /
b. An Ability to register a trade mark, copyrights, patents.
Comprehension
Predict issues related to Intellectual property rights on trademarks, copyrights and Analyzing /
c.
patents. Analysis
Understanding /
Summarize and evaluate trade secrets, unfair competition which is being adopted by Comprehension&
d.
various firms. Evaluating /
Evaluation
10.6 HOW PROGRAM OUTCOMES AREASSESSED:
Proficiency
assessed by
An ability to apply knowledge of computing, mathematical foundations,
algorithmic principles, and computer science and engineering theory in N --
a
the modeling and design of computer-based systems to real-world
problems (fundamental engineering analysis skills)
An ability to design and conduct experiments, as well as to analyze and N --
b
interpret data (information retrieval skills)
An ability to design , implement, and evaluate a computer
-based system, process, component, or program to meet desired needs,
N --
c within realistic constraints such as economic, environmental, social,
political, health and safety, manufacturability, and sustainability
(Creative Skills)
An ability to function effectively on multi-disciplinary teams (team N --
d
work)
An ability to analyze a problem, identify, formulate and use the
N --
e appropriate computing and engineering requirements for obtaining its
solution(engineering problem solving skills)
An understanding of professional, ethical, legal, security and social N --
f
issues and responsibilities (professional integrity)

Department of CSE
An ability to communicate effectively both in writing and orally N --

g
(speaking /writing skills)
Lectures,
The broad education necessary to analyze the local and
H Assignments
h global impact of computing and engineering solutions on individuals,
organizations, and society (engineering impact assessment skills)
Recognition of the need for, and an ability to engage in continuing
N --
i professional development and life-long learning (continuing
educational\[iu90lpreness)
N --
j A Knowledge of contemporary issues (social awareness)
An ability to use current techniques, skills, and tools necessary for

N --
k computing and engineering practice (practical engineering analysis
skills)
An ability to apply design and development principles in the Lectures,
H
l construction, of software and hardware systems of varying complexity Assignments,
(software, hardware interface) Tutorials, Exams
An ability to recognize the importance of professional development by
pursuing postgraduate studies or face competitive examinations that N --
m
offer challenging and rewarding careers in computing (successful career
and Immediate employment)
The use of current application software and the design and use of
operating systems and the analysis, design, testing and documentation of
n S Exercises
computer programs for the use in Computer Science and engineering
technologies.
10.7 SYLLABUS
UNIT - I
INTRODUCTION TO INTELLECTUAL PROPERTY: Introduction, types of intellectual
property, international organizations, agencies and treaties, importance of intellectual
property rights
UNIT - II
TRADEMARKS: Purpose and function of trademarks, acquisition of trade mark rights,
protectable matter, selecting and evaluating trade mark' trade mark registration processes.
UNIT – III
LAW OF COPY RIGHTS: Fundamental of copy right law, originality of material, rights of
reproduction, rights to perform the work publicly, copy right ownership issues, copy right
registration, notice of copy right' international copy right law.
LAW OF PATENTS: Foundation of patent law, patent searching process' ownership rights
and transfer.
UNIT - IV
TRADE SECRETS: Trade secretes law, determination of trade secrete status' liability for
misappropriations of trade secrets, protection for submission, trade secrete litigation.
UNFAIR COMPETITION: Misappropriation right of publicity, false advertising.
UNIT – V
NEW DEVELOPMENT OF INTELLECTUAL PROPERTY: New developments in trade
mark law; copy right law patent law, intellectual property audits'. International overview on
intellectual property, international - trade mark law, copy right law, international patent law,
and international development trade secrets law.
List of Text Books / References / Websites / Journals / Others

Department of CSE
TEXT BOOKS:
1. Deborah. E. Bouchoux (2009), Intellectual property, Cengage learning, India.
2. Deborah. E. Bouchoux (2001), Protecting your companies intellectual property,
AMACOM, USA.
REFERENCE BOOKS:
1. Prabuddaganguli (2003), Intellectual property right, Tata McGraw Hill Publishing
company ltd., India.
2. Robert Hisrich, Michael P. Peter, Dean A. Shepherd (2010), Entrepreneurship, Tata
McGraw Hill., India.
10.8 COURSE PLAN:

Lecture Blooms
Course Learning Outcomes Topics to be covered Reference
No. Levels
Introduction, types of intellectual
1 Recognize the intellectual Property. Understand T1: 1
property.
Identify International organization on International organizations – WIPO,
2 Understand T1: 3
Intellectual Property. GATT,INTA
International Agencies and Treaties –
Memorize Agencies and Treaties on
3-5 Remember Madrid Protocol, Paris convention, T1:10
Intellectual Property.
Berne Union
Describe the intellectual property Importance of intellectual property
6-8 Understand T1: 1
right rights
9- 12 Recall the concept of trademarks. Understand Purpose and function of trademarks T1:19
Summarize right of trade mark
13-15 Understand Acquisition of trade mark rights T1:22
rights.
Analyze and Evaluate selection Analyze/Evalu Selecting and evaluating trademarks,
18- 22 T1:41-45
of trade mark ate Trademark registration processes.
23- 25 Outline the concept of copyright. Understand Fundamental of copy right law. T1:185
Classify and Describe right and originality of material, rights of
26- 28 Apply T1: 193
material of copy right. reproduction
Identify and infer rights of works to Rights to perform the work publicly,
29- 34 Understand T1: 198
be publicly issued copy right ownership issues
Prepare and formulate process for copy right registration, notice of copy
34- 36 Apply T1:201
registration and notice of copy right right ‘international copy right law
37- 38 Outline the concept of patent Law Understand Foundation of patent law. T1: 225
Patent searching process' ownership
39- 42 Summarize transfer of patent Law Understand T1:225
rights and transfer.
43 -44 Relate to trade secrete law Analyze Trade secrete law T1: 469
45 Determination of trade secrete Apply Determination of trade secrete T1:447

Status liability for misappropriations
46 Relate to trade secrete law Understand T1: 473
of trade secrets.
Identify trade secret rights for Protection for submission, trade
47-49 Understand T1:477-481
Protection secrets litigation.
Misappropriation right of publicity,
50-52 Relate to trade secrete law Understand T1:493, 498
False advertising.
Examine and outline new
53-54 Understand New developments in trade mark law T1:510
developments in trade mark
Analyze new developments in New Developments in Copy right law
55 Analyze T1:510
Intellectual Property and patent law

Department of CSE
56-57 Define Intellectual property Audit Remember Intellectual property audits T1:515
Review of the International property International overview on intellectual
58 Evaluate T1:521
laws property
Analyze new developments in
59-63 Analyze International trade mark law. T1:525
Intellectual Property
Examine and outline new Copy right law, international patent
64-65 Analyze T1:288
developments in trade mark law, and international development
To Recall recent development in
66-67 Remember trade secrets law T1:484
International trade secrets

PROGRAM OUTCOMES:
Program Outcomes
Course
Objectives
a b c D e F g h i j k l m n
I. S H H H
II. H S H H H
III. S H
IV. H S S S
S = Supportive H = Highly Related

ROGRAM OUTCOMES:

Educational
n
Outcomes a b c D e F g h i j k l m
a. S H H S
S
b. S H S S H S H S S
c. H S H S H
d. S S H S H H
S= Supportive H= Highly relative
10.11 OBJECTIVEQUESTIONS
UNIT I
1. The preliminary search is often called as
A. First search
B. basic search
C. knock out search
D. full search
Answer B
2. TMEP stands for
A. trademark management exam procedure
Department of CSE
B. trademark manual examining procedure

C. trademark monotype evaluation paper
D. trademark manipulation exam practice
Answer B
3. -----------IPR protects the information of the business regarding the formulas,
methods used in manufacture of the product.
A. Copyright
B. patent
C. trade secrets
D. trademark
Answer C
4. Any product of the human mind that is protected under law
A. Intellectual property
B. patent law
C. Copyright law
D. trade secret law
Answer A
5. A ------------ Protects new, original and ornamental designs for useful objects.
A. Plant patent
B. provisional patent
C. reissue patent
D. design patent
Answer D
6. The ------ exists for the lifetime of a person.
A. Right to control
B. legal right
C. right of publicity
D. copyright
Answer C
7. The person or entity that creates a copyrightable work is known as
A. Copyright
B. author
C. unfair competition
D. trademark
Answer B
8. The law that protects the confidential information is
A. Legal rights
B. patent law
C. Copyright law
D. trade secret law
Answer D
9. The process of moving an application through the patent and trademark office is
called
A. Declaration
B. prosecution
C. fixation
D. dilution
Answer B
10. The new renewal period for all the marks is
A. 5years

Department of CSE
B. 8years
C. 10 years
D. 20years
Answer C
11. -------------------are not protected by copyrights
A. ideas
B. copy
C. facts
D. procedures
Answer A
12. A _____ is a material object from which a work can be reproduced or
communicated
A. Phonorecords
B. fixation
C. idea
D. copy
Answer A
13. -------------- must be filed for each class of goods named in the application
A. Document
B. data card
C. specimen
D. valid note
Answer A
14. The period within which the amendment to allege use cannot be filed is called the
A. Lock period
B. dead period
C. slack period
D. blackout period
Answer A
15. The copy right protection is not available for _________&_________
A. Facts & copy
B. ideas& procedures
C. grades & ideas
D. copy &procedures
Answer C
16. Trademark registration does not create trademark
A. Laws
B. rights
C. events
D. values
Answer B
17. Computer software programs such as windows and word perfect are considered
A. Literary works
B. dramatic works
C. Choreographic works
D. architectural works
Answer A
18. ---------------- is considered a mute performance with expressive communication
A. Mime
B. gestures

Department of CSE
C. dramatic
D. pantomime
Answer D
19. The law that requires extensive knowledge of engineering and the science
A. Legal rights
B. patent law
C. Copyright law
D. trade secret law
Answer B
20. Copyright law protects works of
A. Ownership
B. authorship
C. relationship
D. friendship
Answer B
UNIT II
1. Trademark law is part of the law of
A. Fair competition
B. unfair competition
C. ownership
D. authorship
Answer B
2. A trade name is the name of a business and also may function as a
A. Copyright
B. patent
C. trade secrets
D. trademark
Answer A
3. The overall appearance of a product or service is
A. Trade secret
B. trade mark
C. service mark
D. trade dress
Answer D
4. ---------------- occurs when a similar mark adversely affects the reputation of a
distinctive mark.
A. Declaration
B. prosecution
C. fixation
D. dilution
Answer D
5. Graphic icon that functions to identify the source for various products or services
from one company
A. Hallmark
B. trade mark
C. service mark
D. House mark
Answer A
6. Agreement granting limited trademark rights

Department of CSE
A. Trademark license
B. License
C. Registration
D. Dilution
Answer A
7. Any form of business can own a
A. Copyright
B. patent
C. trade secrets
D. trademark
Answer D
8. Trademarks rights may be transferred in the form of a
A. License
B. assignment
C. license / assignment
D. None
Answer C
9. Assignment of federally registered trademark should be recorded with the patent
and------ office
A. Copyright
B. patent
C. trade secrets
D. trademark
Answer D
10. Initial pleading filed by the petitioner in an opposition proceedings is
A. Notice
B. petition
C. Notice of opposition
D. Rejection
Answer C
11. Initial pleading filed by the petitioner in an Cancellation proceedings is
A. Notice
B. Petition to Cancel
C. Notice of opposition
D. Rejection
Answer B
12. The court order, instructing the infringer to stop the infringing activity is known
as an
A. Injunction
B. Junction
C. Rejection
D. objection
Answer A
13. A set of statement to be used directly or indirectly in a computer to bring about a
certain result
A. Current program
B. derivative work
C. dilution
D. computer program
Answer D

Department of CSE
14. ------------------ rights may be transferred in the form of a license / assignment

A. Trade secret
B. copyright
C. trademarks
D. trade dress
Answer C
15. ------------------ is part of the law of unfair competition
A. Fair competition
B. trademark law
C. ownership
D. authorship
Answer B
16. Assignment of federally registered trademark should be recorded with the -- & ----
- office
A. Copyright Patent
B. patent& Trade secret
C. trade secrets
D. Patent &trademark
Answer D
17. Trademark registration does not create trademark
A. Laws
B. rights
C. events
D. values
Answer B
18. The first party to adopt and uses a particular mark in connection with its goods &
services
A. Junior user
B. secondary user
C. senior user
D. None
Answer C
19. The first party to adopt and uses a trademark similar to a mark previously
adopted and used by a senior user is called
A. Junior user
B. secondary user
C. c) senior user
D. d) None
Answer A
20. Dilution occurs when a similar mark adversely affects the reputationof a
A. Collective mark
B. house mark
C. suggestive mark
D. Distinctive mark.
Answer D
UNIT III
1. A trademark or service mark that is federally registered is identified by the
symbol
A. ®

Department of CSE
B. ©
C. ™
D. @
Answer A
2. A “whittling away” or weakening of the famous mark distinction is
A. Blur’s
B. blurring
C. blurred
D. blared
Answer B
3. When famous mark is damaged by an unpleasant or unwholesome use of a similar
Mark is
A. Tarnishment
B. punishment
C. distinctiveness
D. membership
Answer A
4. The act that is used to protect against other forms of unfair competition
A. Espionage act
B. patent act
C. Lanham act
D. dilution act
Answer C
5. The federal trademark dilution act was passed enabling owners of famous mark in
A. 1978
B. 1989
C. 1990
D. 1995
Answer D
6. The graphic symbols that may use stylized lettering or concise imagery is
A. Names
B. works
C. logos
D. symbols
Answer C
7. Anything that serves to differentiate the goods or services is
A. Logos
B. device
C. symbols
D. names
Answer B
8. Color combination are protectable as
A. Trade secret
B. copyright
C. trademarks
D. trade dress
Answer D
9. a floral fragrance applied to yarn was registered as a first scent in the year
A. 1978
B. 1989

Department of CSE
C. 1990
D. 1995
Answer C
10. Mark used by members of a cooperative, association collective group, organization
to Signify or indicate membership is
A. Collective mark
B. house mark
C. suggestive mark
D. famous mark
Answer A
11. Mark that functions to denote the source of various products or services from one
Company is
A. Collective mark
B. house mark
C. suggestive mark
D. famous mark
Answer B
12. The mark alludes to or hints at the nature or quality of the goods
A. Collective mark
B. house mark
C. famous mark
D. suggestive mark
Answer D
13. Terms that describes an entire group or class of good is
A. Rationale terms
B. generic terms
C. initial terms
D. final terms
Answer B
14. An agreement to restrict the grant of proprietary right to one person is
A. Exclusive license
B. inclusive license
C. Collective license
D. generic license
Answer A
15. Primary copyright record made for each version of a particular work is
A. Basic registration
B. initial registration
C. First registration
D. last registration
Answer A
16. Request for an order of the court is
A. Emotion
B. judgment
C. promotion
D. motion
Answer D
17. Relief awarded by the court as a result of the judge or jury’s verdict is
A. Judgment
B. punishment

Department of CSE
C. permission
D. license
Answer A
18. The mark used by a collective membership organization is referred as _________
A. House mark
B. collective mark
C. suggestive mark
D. famous mark
Answer B
19. The mark which is used in conjunction with a trademark or service mark is
A. Famous mark
B. suggestive mark
C. certification mark
D. Service mark
Answer C
20. Work that combines authorship in two or more media is
A. Compilations works
B. derivative works
C. Multimedia works
D. collective works
Answer B
UNIT IV
1. Trade secrets are also protected under principles of state
A. Contract law
B. patent law
C. Copyright law
D. trade secret law
Answer A
2. A system of legal rules derived from the precedents and principles established by
court decisions.
A. Contract law
B. patent law
C. Copyright law
D. common law
Answer D
3. Copyright law does not exist separate from
A. Contract law
B. patent law
C. Copyright law
D. trade secret law
Answer D
4. Disassembly and examination of products thatare available to the public
A. Reverse engineering
B. security engineering
C. Employee engineering
D. Civil engineering
Answer A
5. A confidentiality agreement is also known as
A. Disclosure agreement

Department of CSE
B. nondisclosure agreement
C. Agreement
D. exit agreement
Answer B
6. An exit agreement is similar to an
B. nondisclosure agreement
C. Confidential agreement
D. exit agreement
Answer C
7. A covenant not to compete is a contract that restrains a person from engaging in a
A. Business
B. trade
C. profession
D. all of the above
Answer D
8. Contract by which one party promises to submit an idea and the other party
promises to evaluate the idea is called
A. Evaluation agreement
B. disclosure agreement
C. Confidential agreement
D. exit agreement
Answer A
9. Agreement whereby one party pays the other for the opportunity to later exploit
an Idea or work
B. evaluation agreement
C. Option agreement
D. confidential agreement
Answer C
10. A special relationship of trust, confidence, or responsibility between persons is
called
A. Fiduciary relationship
B. relationship
C. Friendship
D. special relationship
Answer A
11. Copyright law does not protect
A. Ideas
B. copy
C. facts
D. procedures
Answer A
12. The illegal acquisition of trade secrets through theft, bribery etc. Is called
A. Improper means
B. proper means
C. other means
D. electronic means
Answer D
13. The authority of a court to hear a certain type of case is

Department of CSE
A. Law
B. jurisdiction
C. judgment
D. rights
Answer C
14. The parties in litigation are governed by rules of ---------procedure
A. Facts
B. ideas
C. civil
D. procedures
Answer C
15. The court hearing in which the parties present their facts and evidence to a judge
or jury
A. Civil
B. trial
C. instructions
D. facts
Answer B
16. That act that makes it a federal crime to steal a trade secret or to receive
or possess trade secret information knowing that it is
A. Theft
B. misused
C. loss
D. stolen
Answer D
17. The civil cover sheet is a form required for use by the court in maintaining
A. Finance records
B. accounts records
C. Statistical records
D. project records
Answer C
18. The uniform trade secret act created in --------- and amended in --------
A. 1979&1985
B. 1985&1989
C. 1990&1995
D. 1979&1986
Answer A
19. The act that is to provide protection against high-tech thefts of trade secrets
A. Statues and contract law
B. Lanham act
C. Economic espionage act
D. uniform trade secret act
Answer C
20. Which act permits a court to order the return of all trade secrets and related
materials
A. Statues and contract law
B. Lanham act
C. Economic espionage act
D. Uniform trade secret act
Answer D

Department of CSE
UNIT V
1. The procedure acquiring international protection vary from country to country
and the process is often
A. Expensive
B. Expensive& Complex
C. Complex & Expensive
D. Complex
Answer B
2. Only a few countries besides the United States grant trademark right based on use
in
A. Commerce
B. Economics
C. Science
D. Arts
Answer A
3. The new renewal period for all the marks is
A. 5years
B. 8years
C. 10 years
D. 20years
Answer C
4. The length of period for trademark protection may vary from 5 to
A. 5years
B. 10years
C. 15 years
D. 20years
Answer C
5. The period of time between filing an application and obtaining a registration may
vary in Belgium is
A. 1month
B. 2months
C. 3months
D. 4months
Answer B
6. The period of time between filing an application and obtaining a registration may
vary in Japan is
A. 1Year
B. 2Years
C. 3years
D. 4Years
Answer D
7. Some countries register trademarks automatically without any
A. Permissions
B. oppositions
C. Examinations
D. Preparations
Answer C
8. Some countries do not register
A. Famous mark
B. suggestive mark

Department of CSE
C. Certification mark
D. Service mark
Answer D
9. A list of Paris convention countries is provided at the
A. Indian websites
B. National websites
C. PTO website
D. POT website
Answer C
10. Several companies including Ethiopia, Laos, and Pakistan are not parties to the
A. Paris convention
B. Madrid Protocol
C. European Community
D. Berne Convention
Answer A
11. The European Community has adopted a new form of trade protection known as
A. Trademark
B. Community trademark
C. Famous mark
D. Service mark
Answer B
12. OHIM means
A. Officer for Harmonization in the internal Market
B. Office for Harmon in the internal Market
C. Office for Harmonization in the international Market
D. Office for Harmonization in the internal Market
Answer D
13. Members of the Paris Convention are known as
A. Convention Countries
B. European Convention
C. Berne Convention
D. Rome Convention
Answer A
14. The European Patent office (EPO) is a------------- patent office
A. Lingual
B. Trilingual
C. Multiple
D.
Answer B
15. A trademark infringement lawsuit may involve additional claims
A. Declaration
B. prosecution
C. fixation
D. dilution
Answer D
16. The agreement that to be recorded either with the national trademark office
orwith a government agency
A. License
B. Registration
C. dilution

Department of CSE
D. Declaration
Answer A
17. The trademark owners must either register the trademark or be qualified as the --
--------Of the trademark
A. Registration
B. dilution
C. License
D. Declaration
Answer C
18. The PTO will forward the international application to the
A. OHIM
B. WIPO
C. TMEP
D. EPO
Answer B
19. The Paris Convention treaty limits
A. Piracy
B. mock print
C. duplicate
D. photocopy
Answer A
20. Rules of proper trademark usage can be summarized in a company’s
A. Magazine
B. License
C. Register
D. Handbook
Answer D
10.12 TUTORIAL QUESTIONS BANK

PART-A (SHORT ANSWERQUESTIONS)
Blooms
S. Course
Questions Taxonomy
No Outcome
level
UNIT – I
Indicate whether the following items would be protectable as
trademarks, copyrights, patents and trade secrets:
There are a number of international organizations, agencies and treaties
that promote the use and protection of intellectual property such as
INTA, WIPO, Madrid Protocol, and Paris convention etc.,
(i) A Vaccum cleaner
1. Apply c
(ii) The name of a new type of ice cream
(iii) A company’s plans for its future business operations
and possible mergers
(iv) A new type of rose
(v) A new slogan to be used by Burger king
(vi) A new novel by Toni Morrison
How long will patent protection for this invention last? A patent was
issued on January 28, 2003, to Hoffman-LaRoche Inc. for a new type of
2. Apply c
compound to treat Alzheimer’s disease. The application was filed on
August 10, 2000.
3. The novel Moby Dick was written in 1851 and its author, Herman Apply c

Department of CSE
Melville, died in 1891. Can a sequel based on the novel be written by

another author?
“People have always realized the importance of protecting intellectual
4. property rights, the rapid developing pace of technology has led to Analysis d
increased awareness of significance of intellectual property assets. “
Explain “The agency charged with granting patents and registering
5. trademarks is The United States Patent and Trademark Office (PTO), one Understand a
of fourteen bureaus within the U.S. Department of Commerce.”
UNIT_ II
1. Discuss the exclusions from trademark protection Understand b
2. Illustrate protectable matters which can be protected as Trademarks? Remember a
3. Explain the process of selecting and evaluating a mark. Understand b
Discuss the risks to the client of using TRICLEAN without further
investigation. Assume that a client wishes to use the mark TRICLEAN
4. Understand b
for a cleaning product. A search of the Patent Trade Office (PTO) records
discloses that a previous registration for TRICLEAN has expired.
Explain what should the client do? If a search of Patent Trade Office
5. (PTO) records for NUTRICREAM discloses a reference for Apply c
NUTRIKREEM,
UNIT-III
Discuss. Alex invents a 13-inch television with improved technology and
receives a patent. Two years later, Alex makes a 14-inch television with
1. Apply c
the same components as the earlier patented invention. Is Alex likely to
receive a patent for the new 14-inch television?
“Justify “To register a work, the applicant must send the following three
2. elements to the copyright office: a properly completed application form, a Apply c
filing fee, and a deposit of the work being registered.
Discuss.”There are a variety of application forms to be used in applying
for registration, the information required of an applicant and the format
3. Apply c
of the forms are nearly identical from form to form. There are several
sections or “spaces” that must be completed. “
Explain appropriate copyright notice for the following works by Jane
Daniels: (i) A book published in 1968
4. Apply c
(ii) A sound recording published in 1999
(iii) Poems published in 2002.
Discuss “A book was first distributed and published in 1981 although the
copyright notice for the work mistakenly listed 1980 as the year of
5. Apply c
copyright. What is the effect of this mistake? What if the copyright notice
identified 1984 as the year of copyright? “
UNIT – IV
Justify “Langley Inc., a large retailer, is the owner of various manuals
that outline processes regarding inventory control procedures for
1. Analyze d
inventory in its stores. The processes are known by others in retail
industry but are not know to the public at large. “
Discuss whether the competitor may use the information. David, an
employee a Gregson Associates Inc., took valuable company information
home with him so he could work on a project at home. David left the
2.material on a train and it was discovery by Gregson’s competitors. As Analyze d
soon as Gregson realized what had occurred, Gregson sent a notice to the
competitor informing it of the value nature of the material and demanding
its return. The competitor is alleging that the material now belongs to it.
Discuss whether sally has misappropriated a trade secret. Sally, a senior
employee of Taylor Enterprises Inc., has decided to leave the company
and go to work for one of Taylor’s competitors. Sally is not subject to
3. Analyze d
any confidentiality agreements. Sally has been able to memorize Taylor’s
preferred customer list and plans to take this information to her new
employer.
Justify Renee is an employee of Harris Manufacturing Inc. Renee
4. Apply d
inadvertently published Harris’s customer list on the Internet where the

Department of CSE
list has been available for two weeks.

Justify In case of misappropriation of trade secrets there lies a liability.
5. Apply d
Do you agree?
UNIT – V
Discuss. A Berne convention member nation has decided to allow for a
1. term of copyright protection of sixty years. May it do so? May it allow Apply d
for a term of protection of forty years?
Explain how does the Digital Millennium Copyright Act ensure that the
2. United States complies with its obligations under the WIPO Copyright Apply d
Treaty?
Justify Patricia has invented a new twist top for beverage containers. She
applied for her patent in the United States on July 1. She would like to
3. file an application in France for the same invention. What is the Apply d
advantage to Patricia in filing the application in France by July 1 of next
year?
Explain A resident of Italy filed an application in Italy for a design
patent on March 1. What is the latest day that the application can be filed
4. Apply d
in the United States to capture the filing date in Italy for purposes of
priority?
Discuss There is a dynamic tension inherent in copyright law: the rights
of authors and creators to protect their works and reap the benefits of
5. Apply d
their creations must be balanced against the right of the public to have
access to information.
PART – B (LONG ANSWERQUESTIONS)
Blooms
S. Course
Questions Taxonomy
No Outcome
level
UNIT – I
Justify: Many of the rights ownership common to real and personal
1. property are also common to intellectual property. Intellectual property Analyze d
can be bought, sold and licensed.
Discuss the types of intellectual property The term “Intellectual
property” is usually thought of as comprising four separate, but often
2. Understand a
overlapping legal fields: trademarks, copyrights, patents and trade
secrets..
Explain the concept of protecting valuable business information.
It consists of any valuable business information that, if known by a
3. Understand a
competitor, would afford the competitor some benefit or advantage.
There is no limit to the type of information that can be protected.
Explain the concept of protecting valuable business information. It
consists of any valuable business information that, if known by a
4. Understand a
There is no limit to the type of information that can be protected
Discuss along with its types. “A grant permitted to its Owner to prevent
others from making, using or selling an invention. This protection is also
5. Analyze d
available for useful, novel and no obvious inventions. Discuss along with
its types.
UNIT – II
Classify the following marks as trademarks, service marks, collective
marks or certification marks:
i. AMERICAN MEDICAL ASSOCIATION (to indicate membership in
1. Apply c
registrants organization) ii. COMET (for cleaner)
iii. MIDAS MUFFLER (for car repair services)
iv. OPRAH (for television shows) v. CHEF BOYARDEE (for pasta)
2. The design of a microphone be trademarked if the design is the most Apply

Department of CSE
effective way of producing sound? Discuss

Henry Allen operates a computer consulting service in Portland, Oregon.
To announce the opening of his business, he sends a flyer advertising the
3. business services to a friend in Seattle. Is this use sufficient to support an Apply c
application for federal trademark registration? What if Henry advertises
his services in various computer journals?
Whether a person could likely to obtain a trademark registration for the
following goods or services indicated, and discuss the objections, if any,
that the PTO might arise.
Mark Good or Services
4. THOMAS EDISON Light Blub Evaluate e
TIGER WOOD’S CHOICE Golf balls
QUICK PRINT Photocopy services
AVELLE High-definition TV
DANGEROUS Perfume
Not every word, design or slogan can function as a trademark. Generic
5. matter cannot be registered and even descriptive marks cannot be unless Understand b
secondary meaning is shown. Justify
UNIT – III
Ann, an employee of Gregory publishers Inc. created a computer
1. program for her employer while on the job. What form should be used to Apply c
register the copyright for this computer program?
The period of duration for the following works:
a) A novel written by Sam in 1980
b) Advertising copy written by Dave for his employer and
2. created and Apply c
c) published in 1995;
d) A novel published in 1920; and
e) A novel created in 1970 but not published until 1998
A drama class at the local college is rehearsing Arthur Miller’s play The
Crucible. Is this performance a violation of any copyright rights? Assume
3. Evaluate e
the drama class performs the play for students at the college. Is this
performance a violation of any copyright rights?
Is the following violates any copy rights? Tower records plays songs
4. from albums and CDs on the current Top 10 list throughout the store Apply/Evaluate c/d
premises. Justify your answer.
If you recently purchased the book The Founding Fathers, may you later
5. Analyze d
sell the book to a friend? Explain with a case.
UNIT – IV
Employers are generally free to require employees, independent
contractors, and consultants to sign express agreements relating to the
1. Understand b
confidentiality of information. These agreements are usually enforced by
courts as long as they are reasonable. Discuss
“A variety of defenses may be raised by a party accused of
2. Analyze d
misappropriating another’s trade secrets”. Justify
“A trade secret owner may request a variety of remedies such as
3. Injunctive relief, money damages, attorneys’ fees and costs from a court Analyze d
of Law”. Illustrate
Explain Trade secrets are legally fragile and may be lost by inadvertent
disclosure or failure to reasonably protect them, companies should
4. Understand b
implement trade secret protection programs to safeguard valuable
information.
Explain the factors in determination of trade secret status.
5. Courts routinely examine these factors to determine whether a company’s Understand b
information constitutes a trade secret.
UNIT – V
State if a trademark application be filed for this mark?In the course of
1. conducting an intellectual property audit, the audit team discovers an Apply c
unregistered trademark that the client company has not used in several

Department of CSE
years.
Renee is an employee of Harris Manufacturing Inc. Renee inadvertently
2. published Harris’s customer list on the Internet where the list has been Evaluate e
available for two weeks. Is this IP infringement?
Al Dyer recently registered the domain name gap.com with Acme
Registrars. Mr.Dyer has no relationship with Gap Inc. and has written
3. Analyze d
Gap Inc. a letter offering to sell the domain name to it for $10000. What
can Gap Inc. do to protect its mark GAP®?
Can a trademark owner secure a trademark registration for NAPA
4. Apply c
VALLEY OAK BARREL for wine made in the state of Washington?
If a mark has been registered in Germany, is the PTO obligated to
5. Analyze d
register it in the United States?
PART-C (CRITICAL THINKINGQUESTIONS)
S. Blooms
Questions Course Outcomes
No Taxonomy
UNIT-I
1 What rights does the Intellectual Property owner have? Remember a
2 How should one protect IPRs in a joint development project? Remember a
3 What are the legislations covering IPRs in India? Remember a
4 Who are responsible for administration of IPRs in the country? Remember a
5 Briefly explain about the agencies and treaties regarding IPR. Understand b
UNIT-II
1 What can be registered as a trade mark in India? Remember a
2 What is a service mark and collective mark? Remember a
3 What is the purpose and function of a trade mark? Remember a
4 Write a note on acquisition of trade mark rights. Apply c
5 What do you mean by a protectable matter? Remember a
UNIT-III
1 How can the owner of a copyrighted work be identified? Apply c
2 What do the term “patent pending” and “patent applied for” mean? Remember a
If two or more persons work together to make an invention, to whom
3 Understand b
will the patent be granted?
4 What is a Patent? Remember a
5 What kind of protection does a patent offer? Remember a
UNIT-IV
1 What does it mean to "misappropriate" a trade secret? Remember a
2 What do you mean by the term unfair competition? Remember a
3 When Can an Employee Develop A Business On His Own Time? Remember a
4 What is misappropriation right of publicity? Explain. Apply c
5 Write a note on false advertising. Remember a
UNIT-V
Explain the terms and conditions involved in today’s scenario to register
1 Understand b
a patent.
2 State the new trade mark law. Analyze c
3 State the new copy rights law. Analyze c
4 State the new patents law. Analyze c
5 State the most recently set up law on trade secrets. Analyze c

Department of CSE
10.13 ASSIGNMENT QUESTIONS

PART-A (SHORT ANSWERQUESTIONS)
Blooms
S. Course
Questions Taxonomy
No Outcome
level
Unit – I
1.Explain IPR infringing goods? Understand b
2.Explain is the role of customs in IPR enforcement? Understand b
3.Explain do I do when I have made a discovery? Understand b
4.Explain the importance of IPR. Understand b
5.Describe the various agencies of IPR in INDIA? Understand b
UNIT – II
1.
Explain the trade mark registration process. Understand b
2.
Describe selecting and evaluating a trade mark? Understand b
Describe the grounds for objection or refusal to register a trade mark in b
3. Understand
India?
4.
Explain the benefits of Indian trademark registration? Understand b
5.
Explain the common law trademark rights? Understand b
UNIT – III
1.Describe the need for patents Understand b
2.Explain the meaning of originality of a material? Understand b
3.List some of the copy right ownership issues. Understand b
4.State is the foundation of patent law? Understand b
5.Explain is the patent searching process? Understand b
UNIT IV
1.Explain the factors determine whether something is a “trade secret”? Understand b
Describe does one choose whether to patent something or keep it as a b
2. Understand
trade secret?
Describe the kinds of monetary damages are available for trade secret b
3. Understand
misappropriation?
Explain undisclosed know-how and business information? What are b
4. Understand
trade secrets?
5.Explain the effects of misappropriation of trade secrets? Understand b
UNIT – V
1.Explain can auditing of intellectual property be carried out? Understand b
2.State who is authorized to conduct auditing of intellectual property? Understand b
Explain the terms and conditions for new development of intellectual b
3. Understand
property?
4.State a note on laws of IPR in INDIA. Understand b
5.Explain the importance of setting up laws for intellectual property. Understand b
S. Blooms Course
Questions
No Taxonomy level Outcome
UNIT – I
1. Justify: Many of the rights ownership common to real and personal Analyze d

Department of CSE
property are also common to intellectual property.

2. Discuss the types of intellectual property Remember a
3. How will you protect your business information? Apply c
Explain the concept of protecting valuable business information. It
consists of any valuable business information that, if known by a
4. Understand b
There is no limit to the type of information that can be protected
“A grant permitted to its Owner to prevent others from making,
using or selling an invention. This protection is also available for
5. Analyze d
useful, novel and non obvious inventions.” Discuss along with its
types.
UNIT – II
Classify the following marks as trademarks, service marks,
collective marks or certification marks:
i. AMERICAN MEDICAL ASSOCIATION (to indicate
6. Apply c
membership in registrants organization) ii. COMET (for cleaner)
iii. MIDAS MUFFLER (for car repair services)
iv. OPRAH (for television shows) v. CHEF BOYARDEE (for pasta)
Discuss the design of a microphone be trademarked if the design is
7. Understand b
the most effective way of producing sound?
Discuss Henry Allen operates a computer consulting service in
Portland, Oregon. To announce the opening of his business, he sends
a flyer advertising the business services to a friend in Seattle. Is this
8. Understand b
use sufficient to support an application for federal trademark
registration? What if Henry advertises his services in various
computer journals?
What a person could likely to obtain a trademark registration for the
following goods or services indicated, and discuss the objections, if
any, that the PTO might arise.
Mark Good or Services
THOMAS EDISON Light Blub
9. Apply c
TIGER WOOD’S CHOICE Golf balls
QUICK PRINT Photocopy services
AVELLE High-
definition TV
DANGEROUS Perfume
Not every word, design or slogan can function as a trademark.
10. Generic matter cannot be registered and even descriptive marks Evaluate e
cannot be unless secondary meaning is shown. Justify.
UNIT – III
Identify the form of copyright notice that should be used. In 2002,
Ann, an employee of Gregory publishers Inc. created a computer
11. Remember c
program for her employer while on the job. What form should be
used to register the copyright for this computer program?
State the period of duration for the following works:
f) A novel written by Sam in 1980
g) Advertising copy written by Dave for his employer and
12. created and Remember c
h) published in 1995;
i) A novel published in 1920; and
j) A novel created in 1970 but not published until 1998
Discuss. A drama class at the local college is rehearsing Arthur
Miller’s play The Crucible. Is this performance a violation of any
13. copyright rights? Assume the drama class performs the play for Understand c
students at the college. Is this performance a violation of any
copyright rights?
Justify if the following violates of any copy rights. Tower records
14. Create c
plays songs from albums and CDs on the current Top 10 list

Department of CSE
throughout the store premises.

State the principle governs your answer? If you recently purchased
15. the book The Founding Fathers, may you later sell the book to a Remember c
friend?
UNIT – IV
Discuss. Employers are generally free to require employees,
independent contractors, and consultants to sign express agreements
16. Analyze d
relating to the confidentiality of information. These agreements are
usually enforced by courts as long as they are reasonable.
Discuss “A variety of defenses may be raised by a party accused of
17. Analyze d
misappropriating another’s trade secrets”.
Explain “A trade secret owner may request a variety of remedies
18. such as Injunctive relief, money damages, attorneys’ fees and costs Analyze d
from a court of Law”.
Explain Trade secrets are legally fragile and may be lost by
inadvertent disclosure or failure to reasonably protect them,
19. Analyze d
companies should implement trade secret protection programs to
safeguard valuable information.
Explain the factors in determination of trade secret status.
20. Courts routinely examine these factors to determine whether a Analyze d
company’s information constitutes a trade secret.
UNIT – V
State if a trademark application be filed for this mark?In the course
of conducting an intellectual property audit, the audit team discovers
21 Remember a
an unregistered trademark that the client company has not used in
several years.
Explain Renee is an employee of Harris Manufacturing Inc. Renee
22 inadvertently published Harris’s customer list on the Internet where Apply c
the list has been available for two weeks.
Explain the practice called and what can Gap Inc. do to protect its
mark GAP®? Al Dyer recently registered the domain name gap.com
23 with Acme Registrars. Mr. Dyer has no relationship with Gap Inc. Apply c
and has written Gap Inc. a letter offering to sell the domain name to
it for $10000.
Discuss. “Can a trademark owner secure a trademark registration for
24 NAPA VALLEY OAK BARREL for wine made in the state of Apply c
Washington?”
Discuss “If a mark has been registered in Germany, is the PTO
25 Apply c
obligated to register it in the United States? “
PART-C (CRITICAL THINKINGQUESTIONS)
Blooms Course
S. No Questions
Taxonomy Outcomes
UNIT I
1 What are IPR infringing goods? Remember 1
2 What is the role of customs in IPR enforcement? Remember 1
3 What do I do when I have made a discovery? Remember 1
4 Explain the importance of IPR. Understand 2
5 What are the various agencies of IPR in INDIA? Remember 1
UNIT II
1 Explain the trade mark registration process. Understand 2
2 What is selecting and evaluating a trade mark? Remember 1
What are grounds for objection or refusal to register a trade mark in
3 Understand 2
India?

Department of CSE
4 What are the benefits of Indian trademark registration? remember 1

5 What are common law trademark rights? Remember 1
UNIT III
1 Why are patents necessary? Understand 2
2 What do you mean by originality of a material? Remember 1
3 List some of the copy right ownership issues. Remember 1
4 What is the foundation of patent law? Remember 1
5 What is the patent searching process? Understand 2
UNIT IV
1 What factors determine whether something is a “trade secret”? Understand 2
How does one choose whether to patent something or keep it as
2 Remember 1
atrade secret?
What kinds of monetary damages are available for trade secret
3 Analyze 3
misappropriation?
What is undisclosed know-how and business information? What are
4 Remember
trade secrets?
5 What are the effects of misappropriation of trade secrets? Remember 1
UNIT V
1 How can auditing of intellectual property be carried out? Understand 2
2 Who is authorized to conduct auditing of intellectual property? Remember 1
What are the terms and conditions for new development of
3 Analyze 3
intellectual property?
4 Write a note on laws of IPR in INDIA. Understand 2
5 Explain the importance of setting up laws for intellectual property. Remember 1

Department of CSE
11. SOFTWARE ENGINEERING (A50518)

11.1 COURSE DESCRIPTION FORM
Course Title SOFTWARE ENGINEERING

Course Code A50518
Course Structure
4 - - 4
Course Coordinator Dr. KVSN Rama Rao
Team of Instructors Mr. K Rajesh

Software Engineering comprises the core principles consistent in software construction
and maintenance: fundamental software processes and life-cycles, mathematical
foundations of software engineering, requirements analysis, software engineering
methodologies and standard notations, principles of software architecture and re-use,
software quality frameworks and validation, software development, and maintenance
environments and tools. An introduction to object-oriented software development
process and design.
11.2 PREREQUISITE(S):

UG 4 4 -
11.3 COURSE ASSESSMENT METHODS
University End
Exam Marks
There shall be two midterm examinations. Each midterm
examination consists of essay paper, objective paper and
assignment.
The essay paper is for 10 marks of 60 minutes duration and shall
contain 4questions. The student has to answer 2 questions, each
carrying 5 marks.
The objective paper is for 10 marks of 20 minutes duration. It
consists of 10multiple choice and 10 fill-in-the blank questions, the
student has to answer all the questions and each carries half mark.
75 100
First midterm examination shall be conducted for the first two and
half units of syllabus and second midterm examination shall be
conducted for the remaining portion.
Five marks are earmarked for assignments. There shall be two
assignments in every theory course. Assignments are usually issued
at the time of commencement of the semester. These are of problem
solving in nature with critical thinking.
Marks shall be awarded considering the average of two midterm
tests in each course.

Department of CSE

1 I Mid Examination 80 minutes 20
2 I Assignment 5
3 II Mid Examination 80 minutes 20
4 II Assignment 5
COURSE OBJECTIVES:
I. Be familiar with basic Software engineering methods and practices, and its
applications.
II. Master the implementation of software engineering layered technology and Process
frame work.
III. Be familiar with software measurement and software risks.
IV. Be familiar with software requirements and the SRS documents.
V. Be familiar with role of project management including planning, scheduling, risk
management.
VI. Master the implementation of different software architectural styles.
11.5. COURSE OUTCOMES:

At the end of the course the students are able to:
BLOOMS
S NO COURSE OUTCOMES
LEVELS
Explain fundamental knowledge in mathematics, programming and computer Understanding /
a.
systems. Comprehension
Apply basic knowledge and understanding of the analysis, synthesis and design of Applying /
b.
complex systems. Application
Applying /
c. Apply software engineering principles and techniques.
Application
Creating /
d. Design and evaluate large-scale software systems.
Synthesis
Applying /
e. Apply the notations used to analyze the performance of algorithms.
Application
Creating /
f. Demonstrate ethical standards and legal responsibilities.
Synthesis
Explain to communicate and coordinate competently by listening, speaking, reading Understanding /
g.
and writing. Comprehension
Understanding /
h. Explain the principles, tools and practices of IT project management.
Comprehension
Illustrate the managing time, processes and resources effectively by prioritizing Understanding /
i.
competing demands. Comprehension
Applying /
j. Apply the fundamental knowledge of science in emerging technologies.
Application
Applying /
k. Develop as an effective member or leader of software engineering teams.
Application
Analyzing /
l. Experiment different testing methods.
Analysis

Department of CSE
11.6 HOW PROGRAM OUTCOMES ARE ASSESSED:
Proficiency
assessed by
Engineering knowledge: Apply the knowledge of mathematics,
Assignments,
A science, engineering fundamentals, and an engineering specialization to H
Tutorials
the solution of complex engineering problems
Problem analysis: Identify, formulate, review research literature, and
analyze complex engineering problems reaching substantiated
B H Assignments
conclusions using first principles of mathematics, natural sciences, and
engineering sciences.
Problem analysis: Identify, formulate, review research literature, and
analyze complex engineering problems reaching substantiated
C S Mini Projects
conclusions using first principles of mathematics, natural sciences, and
engineering sciences.
Conduct investigations of complex problems: Use research-based
knowledge and research methods including design of experiments,
D S Projects
analysis and interpretation of data, and synthesis of the information to
provide valid conclusions.
Modern tool usage: Create, select, and apply appropriate techniques,
resources, and modern engineering and IT tools including prediction and
E S Mini Projects
modeling to complex engineering activities with an understanding of the
limitations.
The engineer and society: Apply reasoning informed by the contextual
knowledge to assess societal, health, safety, legal and cultural issues and
F N --
the consequent responsibilities relevant to the professional engineering
practice.
Environment and sustainability: Understand the impact of the
Professional engineering solutions in societal and environmental
G N --
Contexts, and demonstrate the knowledge of, and need for sustainable
development.
Ethics: Apply ethical principles and commit to professional ethics and
H N --
responsibilities and norms of the engineering practice.
Individual and team work: Function effectively as an individual, and as
I a member or leader in diverse teams, and in multi disciplinary S Mini Projects
settings.
Communication: Communicate effectively on complex engineering
activities with the engineering community and with society at large, such
J as, being able to comprehend and write effective reports and design N --
documentation, make effective presentations, and give and receive
clear instructions.
Project management and finance: Demonstrate knowledge and
understanding of the engineering and management principles and apply
K H Mini Projects
these to one’s own work, as a member and leader in a team, to manage
projects and in multidisciplinary environments.
Life-long learning: Recognize the need for, and have the preparation and
L ability to engage in independent and life-long learning in the S Projects
broadest context of technological change.
An ability to recognize the importance of professional development by
pursuing postgraduate studies or face competitive examinations that N --
M
offer challenging and rewarding careers in computing (successful career
and Immediate employment)
N S Exercises
technologies.
N= None S= Supportive H = Highly Related

Department of CSE
11.7. SYLLABUS
UNIT-I
Introduction to Software Engineering: The evolving role of software, Changing Nature of
Software, legacy software, Software Myths.
A Generic View of Process: Software engineering-A layered technology, a process
framework, The Capability Maturity Model Integration (CMMI), Process Patterns, Process
Assessment, personal and team process models.
Process Models: The Waterfall model, Incremental process models, Evolutionary Process
Models, Specialized Process Models, The Unified Process.
UNIT-II
Software Requirements: Functional and non-Functional Requirements, User Requirements,
System Requirements, Interface Specification, the software requirement document.
Requirement engineering process: Feasibility studies, Requirements elicitation and analysis,
requirements validation, Requirements management. System models: Context Models,
behavioral models, Data models, object models, structured method
UNIT-III
Design Engineering: Design process and design quality, Design concepts, the design model,
pattern based software design. Creating an Architectural Design: Software architecture, Data
design, Architectural Styles and patterns, Architectural design, assessing alternative
architectural designs, mapping data flow into software architecture. Modeling Component-
level design: designing class –based components, conducting component-level design, object
constraint language, designing conventional components. Performing User interface design:
Golden rules, User interface analysis and design, interface analysis, interface design steps,
Design evaluation
UNIT-IV
Testing Strategies: A strategic approach to software testing, test strategies for conventional
software, Black-Box and White-Box testing, Validation testing, System testing, the art of
Debugging.
Product metrics: Software Quality, Frame work for Product metrics, Metrics for Analysis
Model, Metrics for Design Model, Metrics for source code, Metrics for testing, Metrics for
maintenance.
Metrics for Process and Products: Software Measurement, Metrics for software quality.
UNIT-V
Risk management: Reactive vs. Proactive Risk strategies, software risks, Risk identification,
Risk projection, Risk refinement, RMMM, RMMM plan.
Quality Management: Quality concepts, software quality assurance, Software Reviews,
Formal technical Reviews, Statistical Software quality Assurance, Software reliability, The
ISO 9000 quality standards.
TEXT BOOKS:
1. Software engineering a practitioner’s approach, Roger S Pressman, sixth edition
McGraw Hill International Edition.
2. Software Engineering, Ian Sommerville, seventh edition, Pearson education
REFERENCES:
1. Software Engineering, a Precise Approach, PankajJalote, Wiley India, 2010.
2. Software Engineering: A primer, Waman S Jawadekar, Tata McGraw-Hill, 2008.
3. Fundamentals of Software Engineering, Rajib Mall, PHI, 2005

Department of CSE
11.8 COURSE PLAN:

At the end of the course, the students are able to achieve the following course learning
outcomes
Lecture Course Learning

Blooms Levels Topics to be covered Reference
No. Outcomes
The evolving role of
software, Changing
Explain the evolution of Understanding / T1:1.1
1-4 Nature of Software.
software Comprehension T1:1.4
Legacy software,
Software Myths.
Software engineering-A
Explain process frame Understanding /
5 layered technology, a T1:2.1
work Comprehension
process framework.
The Capability Maturity
Understanding /
6 Illustrate CMMI Model Integration T1:2.3
Comprehension
(CMMI).
Process Patterns, Process
Understanding /
7-9 Explain process patterns Assessment, personal and T1:2.4
Comprehension
team process models.
The Waterfall model,
Incremental process
Demonstrate waterfall
models, Evolutionary
model, incremental Understanding /
10-15 Process Models, T1:3.2
evolutionary, Comprehension
Specialized Process
specialized models
Models, The Unified
Process.
Distinguish between
Functional and non-
16-18 Functional and non- Analyzing / Analysis T2:6.1
functional Requirements
Functional Requirements
User Requirements,
Discuss user and system
System Requirements.
requirements, Explain
19-22 Creating / Synthesis Interface Specification, T2:6.2
software requirement
the software requirement
document
document
Requirements elicitation
and analysis,
Demonstrate requirement Understanding /
23-25 requirements validation, T2:7.2
Management Comprehension
Requirements
management
Context Models,
Demonstrate Design Understanding / behavioral models, Data
26-32 T2:8.1
Engineering Comprehension models, object models,
structured method
Design process and
Understanding /
33-35 Explain design concepts design quality, Design T1:9.2
Comprehension
concepts
Understanding / The design model, pattern
36-37 Explain software design T1:9.4
Comprehension based software design
Software architecture,
Demonstrate Architectural Understanding / Data design, Architectural
38-41 T1:10.1
Styles and patterns Comprehension Styles and patterns,
Architectural design
Assessing alternative
Illustrate data flow in Understanding / architectural designs,
42-44 T1:10.5
software architecture Comprehension mapping data flow into
software architecture.
45-46 Explain component level Understanding / Designing class –based T1:9.3

Department of CSE
design Comprehension components, conducting

component-level design,
object constraint
language, designing
conventional components
Golden rules, User
Understanding /
47 Summarize golden rules interface analysis and T1:12.1
Comprehension
design, interface analysis
Understanding / Interface design steps,
48 Explain interface design T1:12.3.4
Comprehension Design evaluation.
A strategic approach to
software testing, test
strategies for conventional
Demonstrate testing Understanding / software, Black-Box and
49-50 T1:13.1
techniques Comprehension White-Box testing,
Validation testing, system
testing, the art of
debugging.
Software Quality, Frame
work for product metrics,
Understanding /
51-52 Explain software quality Metrics for Analysis T1:15.1
Comprehension
Model, Metrics for
Design Model
Metrics for source code,
Demonstrate metrics for Understanding /
53 metrics for testing, T1:15.5
testing Comprehension
metrics for maintenance
Metrics for process and
Explain metrics of Understanding / products: Software
54 T1:22.1
software quality Comprehension Measurement, Metrics for
software quality
Reactive vs. Proactive
Risk strategies, software
risks, Risk identification,
Understanding /
55 Demonstrate RMMM Risk T1:25.1
Comprehension
projection, Risk
refinement, RMMM,
RMMM plan.
Quality concepts,
software quality
Understanding /
56-58 Explain quality concepts assurance, Software T1:26.1
Comprehension
Reviews, Formal
technical Reviews
Statistical Software
quality Assurance,
Demonstrate quality Understanding /
59-60 Software reliability, The T1:26.6
standards Comprehension
ISO 9000quality
standards

PROGRAM OUTCOMES:

Objectives a b c d e f g h i j k l m n
a S H H H
b H H
c H

Department of CSE
d H S S S
e H H
f H
S= Supportive H = Highly Related

PROGRAM OUTCOMES:

Outcomes a b c d e f g h i j k l m n
a. S H H H H
b. H H
c. H H
d. H S S S S
e. H H
f. H
g. S H H H H
h. H H
i. H H
j. H S S S S
k. H H
l. H
11.11 OBJECTIVE QUESTIONS:
UNIT-I
1. The statement of an organization’s commitment to quality is a Policy
A. Vision
B. Mission
C. Principle
D. Goal
Answer: A
2. Which of the following is not a defect metric?
A. Location
B. Cause
C. Time to fix
D. All the above
Answer: D
3. Quality improvement programs may require the product itself to be changed.
A. True
B. False
Answer: True
4. Which of the following does not form a part of a workbench?
A. Standards

Department of CSE
B. Quality attributes
C. Quality Control
D. Procedures
E. Rework
Answer: C
5. The focus on the product is highest during
A. A walkthrough
B. A checkpoint review
C. An inspection
Answer: B
6. During an inspection, inspectors normally make suggestions on correcting the
defects found.
A. True
B. False
Answer: True
7. Modifying existing standards to better match the need of a project or environment
is Definition
A. Standard for a standard
B. Tailoring
C. Customization
Answer: B
8. The term “benchmarking” means
A. Comparing with past data from your organization
B. Comparing with result of a market survey
C. Comparing with the results of a customer survey
Answer: D
9. An example of deployment of a quality approach is: The degree to which the
approach embodies effective evaluation cycles
A. The appropriate and effective application to all product and service characteristics
B. The effectiveness of the use of tools, techniques, and methods
C. The contribution of outcomes and effects to quality improvement
D. The significance of improvement to the company’s business
Answer: C
10. The concept of continuous improvement as applied to quality means: Employees
will continue to get better
A. Processes will be improved by a lot of small improvements
B. Processes will be improved through a few large improvements
C. Improved technology will be added to the process, such as acquiring CASE tools
D. The functionality of the products will be enhanced
Answer: C
11. The activity which includes confirming understanding, brainstorming and testing
ideas is a
A. Code walkthrough
B. Inspection
C. Review
D. Structured walkthrough
Answer: C
12. The following can be considered to measure quality:

Department of CSE
A. Customer satisfaction
B. Defects
C. Rework
D. All of the above
Answer: D
13. the most common reason for the presence of large number of bugs in a software
product is
A. Incompetence of the developer
B. Incompetence of the tester
C. Bad requirements
D. Wrong use of tools and techniques
Answer: C
14. System Test Plan will not include Approach
A. Pass/Fail criteria
B. Risks
C. Suspension and Resumption criteria
Answer: A
15. Function Point is not a measure of
A. Effort
B. Complexity
C. Usability
D. All of the above
Answer: B
16. Quality assurance personnel must not be involved in changing work products.
A. True
B. False
Answer: True
17. The purpose of cost-of-quality computations is to show how much is being spent
for the quality control and quality assurance program.
A. True
B. False
Answer: False
18. Method by which release from the requirements of a specific standard may be
obtained for a specific situation is a Tailoring
A. Customization\
B. Force field analysis
C. Waiver
Answer: B
19. Measure designed to minimize the probability of modification, destruction, or
inability to retrieve software or data is
A. Preventive security
B. Corrective security
C. Protective security
Answer: C
20. Quality assurance is a function responsible for
A. Controlling quality
B. Managing quality

Department of CSE
C. Inspections
D. Removal of defects
Answer: C
UNIT-II
1. The word management in quality assurance describes many different functions,
encompassing
A. Policy management
B. Human resource management, safety control
C. Component control and management of other resources and daily schedules
Answer: C
2. With defined process in SEI’s process model, organization will achieve the
foundation for major and continuing process.
a. True
b. False
Answer: A
3. Statistical process control help to identify the __________ of process problems
which are causing defects.
A. Root cause
B. Nature
C. Person/persons involve
D. All of the above
E. None of the above
Answer: B
4. Requirement s engineering is a generic process that does not vary from one
software project to another
A. True
B. False
Answer: B
5. During project inception the internet of the tasks are to determine
A. Basic problem understanding
B. Nature of the solution needed
C. People who want a solution
Answer: C
6. Three things that make requirements elicitation difficult are problems of
A. Budgeting
B. Scope
C. Understanding
D. Volatility
Answer: A
7. A stakeholder is anyone who will purchase the completed software system under
development or
A. True
B. False
Answer: C
8. It is relatively common for different customers to propose conflicting
requirements, each arguing that his version is the right one.
A. True

Department of CSE
B. False
Answer: B
9. Which of the following is not one of the context-free questions that would be used
during project inception?
A. What will be the economic benefit from a good solution?
B. Who is behind the request for work?
C. Who will pay for the work?
D. Who will use the solution?
Answer: A
10. In collaborative requirements gathering the facilitator
A. Arranges the meeting place
B. Cannot be a customer
C. Controls the meeting
D. Must be an outsider
Answer: C
11. Which of the following is not one of the requirement classifications used in
Quality Functions Deployment?
A. Exciting
B. Expected
C. Mandatory
D. Normal
Answer: C
12. The work products produced during requirement elicitation will vary depending
on the
A. Size of the budget
B. Size of the product being built
C. Software process being used
D. Stakeholder’s needs
Answer : A
13. Developers and customers create use-cases to help the software team understand
how differ rent classes of end-users will use functions.
A. True
B. False
Answer: A
14. Use-case actors are always people, never system devices.
A. True
B. False
Answer: B
15. The result of the requirements engineering task is an analysis model that defines
which of the following problem domains?
A. Information
B. Functional
C. Behavioral
D. All of the above
Answer: C
16. Analysis patterns facilitate the transformation of the analysis model into a design
model by suggesting reliable solutions to common problems
A. True
B. False
Answer: B

Department of CSE
17. In win-win negotiation, the custome4r’s needs are met even though the developers
need may not be.
A. True
B. False
Answer: A
18. Complexity measurements are quantitative values accumulated by a pre-
determined method for measuring complexity of a
A. Software engineering process
B. Software product
C. Database
D. Project team
Answer : B
19. Function points provide an objective measure of the application system that can be
used to compare different kinds of application systems
A. Size
B. Complexity
C. Performance
D. Operation ease
Answer : C
20. Which of the following is not relevant in quantifying the amount of information
processing function?
A. External inquiry
B. Software platform
C. External output
D. Logical internal file
Answer : D
UNIT-III
1. Function point analysis requires information on hardware and software for the
application system.
A. True
B. False
Answer: B
2. Statistical methods are used to differentiate random variation from
A. Standards
B. Assignable variation
C. Control limits
D. Specification limits
Answer: C
3. Random causes of process problems can be ____________ eliminated
A. Sometimes
B. Never
C. Rarely
D. Always
Answer : D
4. Which two factors must be considered when developing acceptance criteria?
A. Match with requirements
B. Ability to benchmark system
C. Schedule of system delivery
Answer: B

Department of CSE
5. Which two are included the software requirements specification?

A. Error handling
B. Data description
C. Functional description
D. Performance description
Answer: B
6. A data dictionary was created during the requirements analysis phase of a
software engineering project. What information does it contain?
A. Interface
B. Data type
C. Restrictions
D. Content description
Answer: C
7. What is configuration management in software engineering?
A. Overall management of the design of the system
B. Management of the configurable components in a system
C. The identification o the configuration of a system at discreet points in time to
control changes to the configuration
D. In object-oriented programming, the management of objects that control the
configuration of some other function (s) in the system
Answer: B
8. Which statement about the preliminary design stage of a software development
project is true?
A. The preliminary design is an internal document used only by programmers.
B. The preliminary design is a result of mapping product requirements into software
and hardware functions.
C. The preliminary produce the preliminary design by defining the software structure
in enough detail to programmer.
D. The developers produce the preliminary design by defining the software structure in
enough detail permit coding.
Answer : D
9. What is functional decomposition in software system design?
A. A design method that breaks a system into smaller units.
B. A requirements analysis method that breaks the system into cohesive and related
units.
C. A design methodology that uses modular prototypes to build the complete system
D. The ability to upgrade the features of a particular module of a system with minimal
impact on other modules
Answer : D
10. Which modeling methodology most clearly shows the classification and abstraction
of entities in the system?
A. Data flow model
B. Event driven model
C. Object oriented model
D. Entity-relationship model
Answer : C
11. Which three not-functional system requirements are affected by system
architecture? Cost
A. Security
B. Usability

Department of CSE
C. Performance
D. Maintainability
Answer : A
12. Which statement about a prototype is true?
A. It is a functional model of the entire system
B. It is the complete untested product ready for final review by the customer
C. It is necessary in order to accurately verify that the product is progressing in
accordance with requirements specifications
D. It is a full-scale model of the entire system at some partial stage in development
showing the functional form of the system
Answer: C
13. What is usability in software engineering?
A. The ability of the end user to use the product successfully
B. A measure of the relative effort required to learn how to use a software product
C. The degree to which the product integrates with the environment in which it is used
D. A metric that describes the degree to which a software product meets its
requirements
Answer : B
14. Software ___________ it work done to enhance software functionally, correct
errors and improve the performance of software
A. Re-design
B. Maintenance
C. Corrections
D. Re-engineering
Answer : C
15. How is an application’s “version” different from its “release”?
A. A release is a small change to an earlier release
B. A version is a small change made to an earlier version
C. Versions the one made available to customers and a release is a change to a previous
version
D. A release is the one made available to customers and a version is a change to a
previous release.
Answer : B
16. Which two steps is part of a typical post-implementation review?
A. Briefly describe the general impact of the system on the managers, users, and
customers.
B. Outline the traceability matrix mapping requirements to function points to test cases
to test results
C. Generate an architectural baseline from which to measure risk, success factors, and
customer satisfaction
D. Describe the primary project management methodology and systems developments
methodology used to develop the system
Answer : B
17. Which of the following is not one of the broad categories used to classify
operations?
A. Computation
B. Data manipulation
C. Event monitors
D. Transformers
Answer : C

Department of CSE
18. Objects inherit a class

A. Operations
B. Name
C. Relationships
D. Instance
Answer : B
19. Data object description incorporates data and
A. Its report
B. Occurrence
C. Attributes
D. Instances
Answer : B
20. The maximum number of objects that can participate in a relationship is called
A. Directionality
B. Composition
C. Multiplicity
D. Cardinality
Answer : B
UNIT-IV
1. An important step in interface design is
A. Modeling
B. Interface analysis
C. Physical environment in which the objects should work
D. Definition of interface objects and the action applied on them
Answer : C
2. Name and two design evaluation techniques
A. Application accessibility and internationalization
B. Feedback and amount of learning required by users
C. User request help and page layout
D. System response time and user help facilities
Answer : B
3. The two characteristics of system response time are
A. Length and variability
B. Menu and labeling
C. Analysis and patterns
D. Speed and time
Answer : C
4. First level prototype is evaluated by
A. Developer
B. User
C. Designer
D. Tester
Answer : B
5. To collect qualitative data, ___________ can be distributed to users of the
prototype
A. CASE tools
B. Reusable components the design
C. Use cases
D. Questionnaires

Department of CSE
Answer : D
6. The unit test focuses on ______ and ______ within the boundaries of a component
A. Inconsistencies and omissions
B. Outright errors and quality
C. Internal processing logic and data structures
D. Verification and validation on units
Answer : C
7. A systematic technique for constructing the software architecture while interfacing
to uncover errors is called
A. Unit testing
B. Integration testing
C. System testing
D. Smoke testing
Answer : B
8. ________ testing is the re-execution of some subset of tests that have already been
conducted to ensure that changes have not propagated
A. Regression testing
B. Smoke testing
C. Integration testing
D. Sandwich testing
Answer : C
9. The process of uncovering errors, diagnosing them and correcting them is called
A. Testing
B. Planning
C. Debugging
D. Designing
Answer : B
10. Initially, tests focus on each component individually for functionality of the
comment and this test is called
A. Unit testing
C. System testing
D. Basis path testing
Answer : B
11. In an object oriented testing strategy the focus of testing is
A. A unit
B. A class
C. A package
D. A component
Answer : C
12. ________ tests for subordinate levels ________ testing uses top-down tests for
upper levels of the program structure, coupled with bottom-up
A. Sandwich testing
C. Smoke testing
D. Regression testing
Answer : B
13. Which one of these belongs to integration testing in the OO context?
A. Class testing
B. Thread based testing

Department of CSE
C. Validation testing
D. Formal technical testing
Answer : D
14. Software is tested to uncover_________ that were made inadvertently as it was
designed and constructed
A. Faults
B. Errors
C. Bugs
D. Mistakes
Answer : C
15. ________ testing is designed to test the run-time performance of software within
the context of an integrated system
A. Integration testing
B. Performance testing
C. System testing
D. Validation testing
Answer : D
16. Brute force, backtracking, because elimination are strategies used in
A. Art of debugging
B. System testing
C. Smoke testing
D. Performance testing
Answer : B
17. Recovery testing is a part of integration testing
A. True
B. False
Answer : B
18. Validation testing begins at the culmination of _______ testing
A. System testing
B. Smoke testing
C. Integration testing
D. OO testing
Answer : C
19. Software ___________ is how easily a computer program can be tested
A. Testability
B. Operability
C. Decomposability
D. Stability
Answer : B
20. During security testing the tester plays the role of the individual who desire to
A. Debug the system
B. Identify errors during integration
C. Penetrate the system
D. Check for validations
Answer : C
UNIT-V
1. Function Point measures are programming language dependent.
A. True
B. False

Department of CSE
Answer : B
2. _______ is a detailed sequence of steps that describes the interaction between the
user and the
A. Key classes
B. Support classes
C. Scenario scripts
D. Subs systems
Answer : C
3. A__________ is an aggregation of classes that support a function that is visible to
the end-user of a system
A. Scenarion scripts
B. Key classes
C. Support classes
D. Sub systems
Answer : C
4. Mention any two web engineering project metrics
A. Scenario scripts and number of key classes
B. Number of support classes and subsystems
C. Numbers of static pages and number of internal page link
D. Use cases and lines of code
Answer : C
5. __________ metrics are derived by normalizing quality and / or productivity
measures by considering the size of the software that has been produced
A. Direct
B. Indirect
C. Size oriented
D. Process oriented
Answer : B
6. ___________ is the degree to which the software performs its required function.
A. Correctness
B. Integrity
C. Usability
D. Maintainability
Answer : D
7. the most common measure for correctness is _____________
A. KLOC
B. Function point
C. Security
D. Defects per KLOC
Answer : D
8. COCOMO stands for
A. Customer cost model
B. Constructive cost model
C. Consistent cost model
D. Configuration cost model
Answer : B
9. the most common measure for correctness is ----------------------
A. KLOC
B. Function point
C. Security

Department of CSE
D. Defects per KLOC

Answer : D
10. COCOMO stands for
A. customer cost model
B. constructive cost model
C. consistent cost model
D. configuration cost model
Answer : D
11. SEI stands for
A. number of errors found during software engineering activity i
B. number of defects found before delivery in activity i
C. number of defects found after delivery in activity i
D. number of errors found in the i
Answer : B
12. MTTC stands for
A. Maintenance to track changes
B. Mean time to change
C. metrics to translate change
D. measure to track changes
Answer : C
13. ---- is the probability that an attack of a specific type will occur within a given time
A. Integrity
B. security
C. threat
D. attack
Answer : D
14. Staff turnover, poor communication with the customer are risks which are
extrapolated from past experience and are called ------------------ risks
A. technical risks
B. known risks
C. predictable risks
D. unpredictable risks
Answer : B
15. Software risk always involves two characteristics
A. firefighting and crisis management
B. known and unknown risks
C. uncertainty and loss
D. staffing and budget
Answer : C
16. Software risk impact assessment should focus on consequences affecting
A. planning, resources , cost , schedule
B. marketability, cost , personnel
C. business, technology, process
D. performance, support, cost , schedule
Answer : B
17. Reactive risk strategies are also called firefighting mode.
A. true
B. false
Answer : B

Department of CSE
18. The reason for refining risks is to break them into smaller units having different
consequences.
A. true
B. false
Answer : B
19. Building an excellent product or system that no one really want is
A. technical risk
B. business risk
C. known risk
D. project risk
Answer : C
20. The risk which gives the degree of uncertainty that the project schedule will be
maintained and that the product will be delivered in time is ----------------
A. known risk
B. unknown risk
C. schedule risk
D. technical risk
Answer : B
11.12 TUTORIAL QUESTION BANK (5/UNIT)

Blooms
Course
Question Taxonomy
S. No Outcome
Level
UNIT – I
1 Explain is legacy software? Knowledge 1
2 Demonstrate all the applications of software? Knowledge 2
3 List the types of software myths? Knowledge 2
4 Discuss the architecture of layered technology? Understand 2
5 List all the umbrella activities in process framework? Understand 2
6 Explain is process pattern? Knowledge 2
7 List the types of software models? Understand 2
8 List the types other software process models? Understand 2
9 Explain software component? explain its uses Understand 2
10 Explain process assessment? Knowledge 2
11 List the models in CMMI? Knowledge 2
12 Explain the levels in continuous model in CMMI? Understand 2
13 Compare between perspective and iterative process models? Understand 2
14 Explain staged model in CMMI? Knowledge 2
15 Write the other name of waterfall model and who invented waterfall model? Understand 2
16 Explain boehm model? Understand 2
17 List the phases in unified process model?? Understand 2
18 List the types of patterns? Knowledge 3
19 Explain PSP and TSP? Knowledge 3
20 Explain high speed adaptation model? Understand 3
UNIT – II
1 Explain the kinds of system requirements? Knowledge 3

Department of CSE
2 Explain functional requirement? Knowledge 3

3 Explain nonfunctional requirement? Understand 3
4 Explain domain requirements? Understand 3
5 List kinds of nonfunctional requirements? Knowledge 3
6 Explain example of functional requirement? Understand 3
7 Explain user requirements in detail. Understand 3
8 Explain system requirement in detail? Understand 4
9 Explain interface and list out how many types of there and what are they? Knowledge 4
10 Explain the term stake holder? Knowledge 4
11 Explain requirements gathering?? Knowledge 4
12 Explain requirement validation? Understand 5
13 Explain requirement review? Understand 5
14 Explain data dictionary? Understand 5
15 Discuss data flow model? Knowledge 5
16 Explain state machine model of a microwave oven? Knowledge 5
17 List kinds of behavioral and object models? Knowledge 5
18 Design class hierarchy for library by using in heritance model? Knowledge 5
19 Describe ethnography? Understand 5
20 Explain viewpoints and types of viewpoints? Understand 5
UNIT – III
1 Explain why design is important in design engineering? Knowledge 4
2 Discuss analysis and design model? Understand 4
3 Describe quality attributes and its guidelines? Understand 5
4 List the design concepts? Knowledge 5
5 Justify the importance of refactoring? Understand 5
6 Discuss on low coupling? Understand 5
7 Define software architecture with its importance? Understand 5
8 Explain taxonomy of architectural styles? Knowledge 5
9 Write short notes on architecture patterns? Knowledge 6
10 Compare function oriented and object oriented design? Understand 6
11 Define top-down and bottom-up design model? Knowledge 6
12 Write short notes on coupling? Knowledge 6
13 List out the steps for conducting component level design? Knowledge 6
14 Write short notes on cohesion? Knowledge 6
15 Design the class based components? Understand 6
16 List out the golden rules for interface design? Understand 7
17 Write short notes on interface design steps? Knowledge 7
18 Describe design evaluation? Knowledge 7
19 List out all the design issues? Understand 7
20 Explain process in user interface design? Understand 7
UNIT - IV
1 Compare verification and validation? Knowledge 6
2 Write short notes on unit testing? Knowledge 6
3 Describe smoke testing? Knowledge 6
4 List out the steps for bottom-up integration? Knowledge 6

Department of CSE
5 List out the steps for top-down integration? Understand 7

6 Write short note on integration testing? Understand 7
7 Compare Quality assurance vs. Quality Control? Knowledge 7
8 Define CASE tools? Knowledge 7
9 Write short notes on validation testing? Knowledge 7
10 Explain art of debugging? Understand 7
11 Describe regression testing? Knowledge 9
12 List out the steps for integration step documentation? Knowledge 9
13 Describe performance testing? Knowledge 9
14 Write short notes on glass box testing? Knowledge 9
15 Explain behavioral testing? Understand 9
16 List the quality factors of McCall’s? Understand 9
17 List the quality factors of ISO 9126? Knowledge 9
18 Define the following terms measures, metrics, and indicators? Understand 9
19 Write short notes on product metric land scrape? Understand 9
20 List out the metrics for analysis model? Understand 9
UNIT - V
1 Define reactive and proactive risk strategies? Knowledge 8
2 List out the generic subcategories of predictable risks? Understand 8
3 Define risk components? Understand 8
4 List out the conditions for risk refinement? Knowledge 9
5 Write about quality concepts? Understand 9
6 Write short notes on formal technical reviews? Understand 9
7 List out review guidelines?? Understand 9
8 Describe six sigma for software? Knowledge 9
9 Write about the classification of case tool? Knowledge 9
10 Write a short notes on ISO 9000 quality standards? Understand 9
11 Write the formulae for measures of reliability and availability? Knowledge 9
12 Explain about software cost estimation? Knowledge 10
13 Write short note on the various estimation techniques? Knowledge 10
14 Define software risks and what are the types of software risks? Knowledge 10
15 Describe risk components and drivers? Understand 10
16 Write the purpose of timeline chart? Understand 10
17 Expand RMMM in RMMM plan? Knowledge 10
18 Define software reliability? Understand 10
19 Define quality and quality control in quality management? Understand 11
20 Write a short note on risk identification? Understand 11
PART – B (LONGANSWER QUESTIONS)
Blooms
Course
S. No Question Taxonomy
Outcome
Level
UNIT - I
1 Explain the evolving role of software? Knowledge 1
2 Define software and explain the various characteristics of software? Knowledge 2

Department of CSE
Describe “Software myth”? Discuss on various types of software myths

3 Knowledge 2
and the true aspects of these myths?
4 Explain software Engineering? Explain the software engineering layers? Understand 2
5 Explain in detail the capability Maturity Model Integration (CMMI)? Understand 2
Describe with the help of the diagram discuss in detail waterfall model.
6 Knowledge 2
Give certain reasons for its failure?
7 Explain briefly on (a) the incremental model (b) The RAD Model? Understand 2
8 Explain the Spiral model in detail? Understand 2
Describe With the help of the diagram explain the concurrent
9 Understand 2
development model?
10 Explain unified process? Elaborate on the unified process work products? Knowledge 3
11 Explain specialized process models? Knowledge 3
12 Explain different software applications? Knowledge 3
13 Explain the paradigms do you think would be most effective? Why? Understand 3
14 Explain product and process are related? Understand 3
15 Explain personal and team process models? Understand 3
16 Explain process frame work activities? Knowledge 3
17 Explain the purpose of process assessment? Knowledge 3
18 Explain changing nature of software in detail? Knowledge 3
Explain and contrast perspective process models and iterative process
19 Understand 3
models?
20 Explain about the evolutionary process models? Understand 3
UNIT – II
1 Write short notes on user requirements. What is requirements? Knowledge 3
2 Compare functional requirements with nonfunctional requirements? Knowledge 3
Explain briefly the following: Coupling between the modules,
3 Understand 5
ii)The internal Cohesion of a module
Discuss the fundamental principles of structured design.
4 Knowledge 5
Write notes on transform analysis.
5 Explain software architecture in a detail manner? Understand 5
6 Explain software design? Explain data flow oriented design? Understand 5
7 Explain the goals of the user interface design? Understand 5
8 Discuss briefly about the golden rules for the user interface design? Knowledge 5
9 Discuss interface design steps in a brief manner Knowledge 6
10 Explain how the design is evaluated? Understand 6
11 Explain design processing along with its quality? Knowledge 6
12 Explain the design concepts in software engineering? Understand 6
13 Explain pattern based software design in a detail manner? Understand 6
14 Elaborate model for the design? Understand 6
15 Discuss architectural styles and patterns? Knowledge 6
16 Explain with a neat diagram of architectural design? Knowledge 6
17 Elaborate modeling component level design? Knowledge 6
18 Describe mapping data flow into a software architecture? Understand 6
19 Explain the guide lines of component level design ? Understand 6
20 Describe the way of conducting a component level design? Understand 6
UNIT – III
1 Explain about the importance of test strategies for conventional software? Knowledge 6
2 Discuss black box testing in a detailed view? Apply 6

Department of CSE
3 Compare black box testing with white box testing? Apply 6

4 Compare validation testing and system testing? Knowledge 6
5 Discuss software quality factors? Discuss their relative importance? Understand 7
6 Discuss an overview of quality metrics? Understand 7
Explain should we perform the Validation test–the software developer or
7 Apply 7
the software user? Justify your answer?
8 Explain about Product metrics? Knowledge 7
9 Explain about Metrics for maintenance? Knowledge 7
10 Explain in detail about Software Measurement? Understand 7
11 Explain about Metrics for software quality? Knowledge
12 Explain strategic approach to software testing Understand 7
13 Describe test strategies for conventional software Understand 7
14 Describe validation testing Understand 7
15 Write a long notes on system testing Knowledge 7
16 Demonstrate art of debugging Knowledge 7
17 Discuss a framework for product metrics Knowledge 7
18 Demonstrate metrics for analysis model Understand 7
19 List the metrics for the design model Understand 7
20 Describe metrics for source code and for testing Understand 7
UNIT 5
1 Explain about software risks? Knowledge 8
Elaborate the concepts of Risk management Reactive Proactive Risk
2 Understand 8
strategies?
3 Explain about RMMM Plan? Understand 8
4 Explain about Quality concepts? Knowledge 9
5 Explain software quality assurance? Understand 9
6 Explain about formal technical reviews? Understand 9
7 Explain in detail ISO 9000 quality standards? Understand 9
8 Discuss risk refinement? Knowledge 9
9 Compare reactive with proactive risk strategies? Knowledge 9
10 Discuss software reliability? Understand 9
11 Briefly explain about formal approaches to SQA? Knowledge 9
12 Demonstrate statistical SQA? Understand 9
13 Define software reliability along with its terms? Understand 9
14 Explain risk projection in detail? Understand 9
15 Explain seven principals of risk management? Knowledge 9
16 Explain software reviews in brief? Knowledge 9
17 Explain six sigma for software engineering? Knowledge 9
18 Explain quality management with their terms? Understand 9
19 Demonstrate risk identification? Understand 9
20 Describe developing a risk table? Understand 9
PART C (CRITICAL ANSWER QUESTIONS)
Blooms
Course
Outcome
Level

Department of CSE
UNIT – I
1. Explain specialized process models? Knowledge 3
2. Explain different software applications? Knowledge 3
3. Explain the paradigms do you think would be most effective? Why? Understand 3
4. Explain product and process are related? Understand 3
5. Explain personal and team process models? Understand 3
6. Explain process frame work activities? Knowledge 3
7. Explain the purpose of process assessment? Knowledge 3
8. Explain changing nature of software in detail? Knowledge 3
Explain and contrast perspective process models and iterative process
9. Understand 3
models?
10. Explain about the evolutionary process models? Understand 3
UNIT – II
1. Explain design processing along with its quality? Knowledge 6
2. Explain the design concepts in software engineering? Understand 6
3. Explain pattern based software design in a detail manner? Understand 6
4. Elaborate model for the design? Understand 6
5. Discuss architectural styles and patterns? Knowledge 6
6. Explain with a neat diagram of architectural design? Knowledge 6
7. Elaborate modeling component level design? Knowledge 6
8. Describe mapping data flow into a software architecture? Understand 6
9. Explain the guide lines of component level design? Understand 6
10. Describe the way of conducting a component level design? Understand 6
UNIT – III
1. Explain about Metrics for software quality? Knowledge
2. Explain strategic approach to software testing Understand 7
3. Describe test strategies for conventional software Understand 7
4. Describe validation testing Understand 7
5. Write a long notes on system testing Knowledge 7
6. Demonstrate art of debugging Knowledge 7
7. Discuss a framework for product metrics Knowledge 7
8. Demonstrate metrics for analysis model Understand 7
9. List the metrics for the design model Understand 7
10. Describe metrics for source code and for testing Understand 7
UNIT IV
Elaborate the concepts of Risk management Reactive Proactive Risk
2 Understand 8
strategies?

Department of CSE
UNIT-V
12 Demonstrate statistical SQA? Understand 9
13 Define software reliability along with its terms? Understand 9
14 Explain risk projection in detail? Understand 9
15 Explain seven principals of risk management? Knowledge 9
16 Explain software reviews in brief? Knowledge 9
17 Explain six sigma for software engineering? Knowledge 9
18 Explain quality management with their terms? Understand 9
19 Demonstrate risk identification? Understand 9
20 Describe developing a risk table? Understand 9
11. 13 ASSIGNMENT QUESTIONS:

Blooms
Course
Outcome
Level
UNIT-1
1 Remember 2
4 Understand 4
UNIT-II
1 Compare functional requirements with nonfunctional requirements? Remember 2
2 Explain requirement engineering process? Remember 2
3 Discuss briefly how requirement validation is done? Remember 2
Discuss your knowledge of how an ATM is used; develop a set of use
4 cases that could serve as a basis for understanding the requirements for an Understand 2
ATM system?
Describe four types of non-functional requirements that maybe placed on a
5 Understand 4
system. Give examples of each of these types of requirement?
UNIT-III
Explain a two level process? Why should system design be finished before
1 the detailed design, rather starting the detailed design after the Understand 3
requirements specification? Explain with the help of a suitable example
Discuss briefly the following fundamental concepts of software design:
2 Understand 3
i) Abstraction, ii) Modularity, iii) Information hiding
Explain briefly the following: i)Coupling between the modules, ii)The
3 Understand 3
internal Cohesion of a module
5 Explain the goals of the user interface design? Remember 4
UNIT – IV
Explain about the importance of test strategies for conventional
1 Remember 3
software?
2 Discuss black box testing in a detailed view? Remember 3
3 Compare black box testing with white box testing? Understand 3
4 Compare validation testing and system testing? Remember 3

Department of CSE

UNIT-V
1 Explain about software risks? Remember 3
Elaborate the concepts of Risk management Reactive vs Proactive Risk
2 Understand 3
strategies?
3 Explain about RMMM Plan? Remember 3
4 Explain about Quality concepts? Understand 3
Blooms
Course
Outcome
Level
UNIT – I
1 Explain is legacy software? Knowledge 1
2 Demonstrate all the applications of software? Knowledge 2
3 List the types of software myths? Knowledge 2
4 Discuss the architecture of layered technology? Understand 2
5 List all the umbrella activities in process framework? Understand 2
6 Explain is process pattern? Knowledge 2
7 List the types of software models? Understand 2
8 List the types other software process models? Understand 2
9 Explain software component? explain its uses Understand 2
10 Explain process assessment? Knowledge 2
11 List the models in CMMI? Knowledge 2
12 Explain the levels in continuous model in CMMI? Understand 2
13 Compare between perspective and iterative process models? Understand 2
14 Explain staged model in CMMI? Knowledge 2
15 Write the other name of waterfall model and who invented waterfall model? Understand 2
16 Explain boehm model? Understand 2
17 List the phases in unified process model?? Understand 2
18 List the types of patterns? Knowledge 3
19 Explain PSP and TSP? Knowledge 3
20 Explain high speed adaptation model? Understand 3
UNIT – II
1 Explain the kinds of system requirements? Knowledge 3
2 Explain functional requirement? Knowledge 3
3 Explain nonfunctional requirement? Understand 3
4 Explain domain requirements? Understand 3
5 List kinds of nonfunctional requirements? Knowledge 3
6 Explain example of functional requirement? Understand 3
7 Explain user requirements in detail? Understand 3
8 Explain system requirement in detail? Understand 4
9 Explain interface and list out how many types of there and what are they? Knowledge 4
10 Explain the term stake holder? Knowledge 4
11 Explain requirements gathering?? Knowledge 4

Department of CSE
12 Explain requirement validation? Understand 5

13 Explain requirement review? Understand 5
14 Explain data dictionary? Understand 5
15 Discuss data flow model? Knowledge 5
16 Explain state machine model of a microwave oven? Knowledge 5
17 List kinds of behavioral and object models? Knowledge 5
18 Design class hierarchy for library by using in heritance model? Knowledge 5
19 Describe ethnography? Understand 5
20 Explain viewpoints and types of viewpoints? Understand 5
UNIT – III
1 Explain why design is important in design engineering? Knowledge 4
2 Discuss analysis and design model? Understand 4
3 Describe quality attributes and its guidelines? Understand 5
4 List the design concepts? Knowledge 5
5 Justify the importance of refactoring? Understand 5
6 Discuss on low coupling? Understand 5
7 Define software architecture with its importance? Understand 5
8 Explain taxonomy of architectural styles? Knowledge 5
9 Write short notes on architecture patterns? Knowledge 6
10 Compare function oriented and object oriented design? Understand 6
11 Define top-down and bottom-up design model? Knowledge 6
12 Write short notes on coupling? Knowledge 6
13 List out the steps for conducting component level design? Knowledge 6
14 Write short notes on cohesion? Knowledge 6
15 Design the class based components? Understand 6
16 List out the golden rules for interface design? Understand 7
17 Write short notes on interface design steps? Knowledge 7
18 Describe design evaluation? Knowledge 7
19 List out all the design issues? Understand 7
20 Explain process in user interface design? Understand 7
UNIT - IV
1 Compare verification and validation? Knowledge 6
2 Write short notes on unit testing? Knowledge 6
3 Describe smoke testing? Knowledge 6
4 List out the steps for bottom-up integration? Knowledge 6
5 List out the steps for top-down integration? Understand 7
6 Write short note on integration testing? Understand 7
7 Compare Quality assurance vs. Quality Control? Knowledge 7
8 Define CASE tools? Knowledge 7
9 Write short notes on validation testing? Knowledge 7
10 Explain art of debugging? Understand 7
11 Describe regression testing? Knowledge 9
12 List out the steps for integration step documentation? Knowledge 9
13 Describe performance testing? Knowledge 9
14 Write short notes on glass box testing? Knowledge 9

Department of CSE
15 Explain behavioral testing? Understand 9

16 List the quality factors of McCall’s? Understand 9
17 List the quality factors of ISO 9126? Knowledge 9
18 Define the following terms measures, metrics, and indicators? Understand 9
19 Write short notes on product metric land scrape? Understand 9
20 List out the metrics for analysis model? Understand 9
UNIT - V
1 Define reactive and proactive risk strategies? Knowledge 8
2 List out the generic subcategories of predictable risks? Understand 8
3 Define risk components? Understand 8
4 List out the conditions for risk refinement? Knowledge 9
5 Write about quality concepts? Understand 9
6 Write short notes on formal technical reviews? Understand 9
7 List out review guidelines?? Understand 9
8 Describe six sigma for software? Knowledge 9
9 Write about the classification of case tool? Knowledge 9
10 Write a short note on ISO 9000 quality standards? Understand 9
11 Write the formulae for measures of reliability and availability? Knowledge 9
12 Explain about software cost estimation? Knowledge 10
13 Write short note on the various estimation techniques? Knowledge 10
14 Define software risks and what are the types of software risks? Knowledge 10
15 Describe risk components and drivers? Understand 10
16 Write the purpose of timeline chart? Understand 10
17 Expand RMMM in RMMM plan? Knowledge 10
18 Define software reliability? Understand 10
19 Define quality and quality control in quality management? Understand 11
20 Write short notes on risk identification? Understand 11
PART-C (CRITICAL ANSWER QUESTIONS)
Blooms
Course
Outcome
Level
UNIT - I
1 Explain the evolving role of software? Knowledge 1
2 Define software and explain the various characteristics of software? Knowledge 2
3 Knowledge 2
6 Knowledge 2
8 Explain the Spiral model in detail? Understand 2
Describe With the help of the diagram explain the concurrent
9 Understand 2
development model?
10 Explain unified process? Elaborate on the unified process work products? Knowledge 3

Department of CSE
UNIT – II
1 Write short notes on user requirements. What is requirements? Knowledge 3
2 Compare functional requirements with nonfunctional requirements? Knowledge 3
Explain briefly the following: Coupling between the modules,
3 Understand 5
ii)The internal Cohesion of a module
Discuss the fundamental principles of structured design. Write
4 Knowledge 5
notes on transform analysis.
5 Explain software architecture in a detail manner? Understand 5
7 Explain the goals of the user interface design? Understand 5
8 Discuss briefly about the golden rules for the user interface design? Knowledge 5
9 Discuss interface design steps in a brief manner Knowledge 6
10 Explain how the design is evaluated? Understand 6
UNIT – III
1 Explain about the importance of test strategies for conventional software? Knowledge 6
2 Discuss black box testing in a detailed view? Apply 6
3 Compare black box testing with white box testing? Apply 6
4 Compare validation testing and system testing? Knowledge 6
6 Discuss an overview of quality metrics? Understand 7
Explain should we perform the Validation test–the software developer or
7 Apply 7
the software user? Justify your answer?
8 Explain about Product metrics? Knowledge 7
9 Explain about Metrics for maintenance? Knowledge 7
10 Explain in detail about Software Measurement? Understand 7
UNIT IV
Elaborate the concepts of Risk management Reactive vs Proactive Risk
2 Understand 8
strategies?
Understand 5
5 Explain software quality assurance?
UNIT-V

Department of CSE
12. COMPILER DESIGN (A50514)

12.1 COURSEDESCRIPTION FORM:
Course Title COMPILER DESIGN

Course Code A50514
Course Structure
4 - - 4
Course Coordinator Mrs. K. Archana , Assistant Professor
Team of Instructors Mrs. K. Archana , Assistant Professor

This course deals with the basic techniques of Compiler Construction and tools that can
used to perform syntax-directed translation of a high-level programming language into an
executable code. This will provide deeper insights into the more advanced semantics aspects
of programming languages, code generation, machine independent optimizations, dynamic
memory allocation, types and their inferences, object orientation. The course is presented to
the students by using power point projections, lecture notes, subjective and objective tests,
assignments, and laboratory.
12.2 PREREQUISITE(S):

UG 4 4 C Programming and Formal Languages Automata Theory
University End
Exam Marks
There shall be 2 midterm examinations. Each midterm Examination
Consists of subjective type and Objective type tests.
The subjective test is for 10 marks, with duration of 1 hour. Subjective test
of each semester shall contain 4 questions; the student has to answer2
questions, each carrying 5 marks.
The objective type test is for10 marks with duration of 20 minutes. It
consists of 10 Multiple choice and 10 objective type questions, the student
75 100
has to answer all the questions and each carries half mark.
First midterm examination shall be conducted for the first four units of
syllabus and second midterm examination shall be conducted for the
Remaining portion.
Five marks are marked for assignments. There shall be two assignments in
every theory course. Marks shall be awarded considering the average of
two assignments in each course

2 I Assignment 5

Department of CSE

4 II Assignment 5
COURSE OBJECTIVES:
I. Identify the major concepts of language translation and phases of compiler design
II. Discuss the common forms of parsers
III. Extend the knowledge of parser by parsing LL parser and LR parser
IV. Demonstrate intermediate code using technique of syntax directed translation
V. Illustrate the various optimization techniques for designing various optimizing
compilers
VI. Construct machine dependent optimizations that are effective in improving the
quality of output code
ES. BLOOMS
COURSE OUTCOMES
NO LEVELS
Understand the compiler construction tools and Describes the Functionality of each Understanding /
a.
stage of compilation process Comprehension
Able to construct Grammars for Natural Languages and find the Syntactical Applying /
b.
Errors/Semantic errors during the compilations using parsing techniques Application
Understanding /
c. Understand the different representations of intermediate code.
Comprehension
Applying /
d. Able to construct new compiler for new languages.
Application
Applying /
e. Able to participate in GATE, PGECET and other competitive examinations
Application
12.6 HOW COURSE OUTCOMES ARE ASSESSED:
Proficiency
assessed by
An ability to apply the knowledge of mathematics, Computing,
A Science and engineering to solve Computer Science and Engineering S Exercises
problems.
An ability to design and conduct engineering experiments, as well as to
B
analyze and interpret data.
An ability to design and construct a hardware and software system,
C H Exercises
component, or process to meet desired needs, within realistic constraints.
Graduates will demonstrate an ability to visualize and work on
D laboratory and Multi-disciplinary tasks individually or as a member
within the teams.
An ability to demonstrate skills to use the techniques, modern
E engineering Tools, Software and equipment’s necessary to analyze H Assignments
computer Problems.
F An understanding of professional, social and ethical responsibility N -----
An ability to recognize the global issues like green initiatives and

G S Exercises
alternate energy sources and to take technology to villages and to

Department of CSE
recognize the rural requirements.

The broad education necessary to understand the impact of engineering
H H Discussion
solutions in a global, economic, environmental, and societal context.
Example
I knowledge in the computing discipline and ability and practice for H
Assignments
Multi-disciplinary tasks as a member within the teams
J To communicate effectively N -----
An ability to use the techniques, skills and modern engineering tools

K N -----
necessary for Engineering practice
Graduates are able to participate and succeed in competitive examination Exams
L H
like GRE,GATE, TOEFL, GMAT etc. Discussion
M
technologies.
The basic knowledge of electronics, electrical components, computer
N architecture and applications of microcomputer systems,
communications needed in data transport.
12.7 SYLLABUS:
UNIT – I
Overview of Compilation: Phases of Compilation – Lexical Analysis, Regular Grammar and
regular expression for common programming language features, pass and Phases of
translation, interpretation, bootstrapping, data structures in compilation – LEX lexical
analyzer generator.
Top down Parsing: Context frees grammars, Top down parsing – Backtracking, LL (1),
recursive descent parsing, Predictive parsing, Preprocessing steps required for predictive
parsing.
UNIT – II
Bottom up parsing: Shift Reduce parsing, LR and LALR parsing, Error recovery in parsing ,
handling ambiguous grammar, YACC – automatic parser generator.
UNIT – III
Semantic analysis: Intermediate forms of source Programs – abstract syntax tree, polish
notation and three address codes. Attributed grammars, Syntax directed translation,
Conversion of popular Programming languages language Constructs into Intermediate code
forms, Type checker.
Symbol Tables: Symbol table format, organization for block structures languages, hashing,
tree structures representation of scope information. Block structures and non block structure
storage allocation: static, Runtime stack and heap storage allocation, storage allocation for
arrays, strings and records.
UNIT –IV
Code optimization: Consideration for Optimization, Scope of Optimization, local
optimization, loop optimization, frequency reduction, folding, DAG representation.
Data flow analysis: Flow graph, data flow equation, global optimization, redundant sub
expression elimination, Induction variable elements, Live variable analysis, Copy
propagation.
UNIT – V

Department of CSE
Object code generation: Object code forms, machine dependent code optimization, register
allocation and assignment generic code generation algorithms, DAG for register allocation.
TEXT BOOKS:
1. Principles of compiler design -A.V. Aho .J.D.Ullman; Pearson Education.
2. Modern Compiler Implementation in C- Andrew N. Appel, Cambridge University
Press.
REFERENCES:
1. lex & yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly
2. Modern Compiler Design- Dick Grune, Henry E. Bal, Cariel T. H. Jacobs, Wiley
dreamtech.
3. Engineering a Compiler-Cooper & Linda, Elsevier.
4. Compiler Construction, Louden, Thomson.
12.8 COURSE PLAN:

At the end of the course, students are able to achieve the following learning outcomes.
Lecture
Course Learning Outcomes Blooms Levels Topics to be covered Reference
No.
Overview of Compilation Introduction
Understanding / to compilation process. T1:1.1-1.4,
L1 Understand the basic compilers
Comprehension http://nptel.ac.in/courses/106108052/2 T2:1.2
#
Interpretation
Understanding / http://nptel.ac.in/courses/106108052/2 T1:1.1-1.4,
L2 Understand the basic compilers
Comprehension # T2:1.2
http://nptel.ac.in/courses/106108113/
Understand the difference Understanding / Pass and Phases of translation T1:1.1-1.4,
L3
between Pass and Phases Comprehension http://nptel.ac.in/courses/106108052/1 T2:1.2
Phases of Compilation
• Lexical Analysis Phase
• Syntax Analysis Phase
• Semantic Analysis Phase
Understand the Phases of Understanding /
L4 • Intermediate Analysis Phase T1:1.4-1.8
Compilation Comprehension
• Code optimization Analysis Phase
• Code generation Analysis Phase
#
Phases of Compilation
• Lexical Analysis Phase
• Syntax Analysis Phase
• Semantic Analysis Phase
Understand the Phases of Understanding /
L5 • Intermediate Analysis Phase T1:1.4-1.8
Compilation Comprehension
• Code optimization Analysis Phase
• Code generation Analysis Phase
#
Lexical Analysis:
Applying / • Lexemes
L6 Construct Lexical Analysis T1:35-3.7
Application • Tokens
Relate common programming Regular Grammar and regular
Remembering /
L7 languages are converting into expression for common programming T1:3.3,T2:2.3
Knowledge
regular grammar and expression. language features
L8 Relate common programming Remembering / Regular Grammar and regular T1:3.3,T2:2.3

Department of CSE
languages are converting into Knowledge expression for common programming

regular grammar and expression. language features
Construct a new compiler which Bootstrapping
Applying /
L9 is more complicated convert into http://nptel.ac.in/courses/117108048/4 T1:3.3,T2:2.3
Application
simpler. 1
Data structures in compilation -LEX
Generate a LEX program with
Applying / lexical analyzer generator
L10 Specifications with the help of T1:4.1
commands
#
Identify the grammar w.r.t
Top down Parsing: Context free
language L={ Applying /
L11 Grammars T1:4.1
N, P, T, S} the construct Left Application
http://nptel.ac.in/courses/106106049/#
most and Right Most derivations.
Pre-processing steps required for
predictive parsing:
• Remove Back Tracking
For Construction of Predictive Applying / • Remove left recursion
L14 T1:4.1, T2:3.1
parser require steps Application • Remove left Factoring
• Remove ambiguity
Construction of Predictive Parsing
structure.
Pre-processing steps required for
predictive parsing:
• Remove Back Tracking
For Construction of Predictive Applying / • Remove left recursion
L15 T1:4.1, T2:3.1
parser require steps Application • Remove left Factoring
• Remove ambiguity
structure.
Predictive parsing LL (1)
• Construct FIRST() Function
Construction of Predictive Applying /
L16 • Construct Follow () Function T1:4.4
Parsing Table Application
Table
L17 • Construct Follow () Function T1:4.4
Table
L18 • Construct Follow () Function T1:4.5,4.6,
Table
Construction of Recursive
descent parsing-
Applying /
L19 Construct Each and Every Non- Recursive descent parsing T1:4.5,4.6,
Application
Terminal as a production or
Method.
Construction of Recursive
descent parsing-
Applying /
L20 Construct Each and Every Non- Recursive descent parsing T1:4.5,4.6,
Application
Terminal as a
production or Method
Understand the Basic Concept of
Understanding / Bottom up parsing : Shift Reduce
L21 Bottom up T1:4.5,4.6,
Comprehension parsing
Parsing and it’s Types.
Construct Shift Reduce parsing Applying / Shift Reduce parsing
L22 T1: 4.7
table Application • Construct Shift Action

Department of CSE
• Construct Reducing Action

• Understand the Accept Action
LR parsing
• Construct Canonical set of Items
Applying /
L23 Construct LR parsing table • Construct FIRST() Function T1: 4.7
Application
• Construct Follow () Function
• Construction of LR Parsing Table
LR parsing
Applying /
L24 Construct LR parsing table • Construct FIRST() Function T1: 4.7
Application
Construction of LR Parsing Table
LR parsing
Applying /
L25 Construct LR parsing table • Construct FIRST() Function T1:4.8
Application
Construction of LR Parsing Table
LALR parsing
• Construct Canonical set of Items of
SLR and CLR
• Merge SLR and CLR Canonical set
Applying /
L26 Construct LALR parsing table of Items. T1:4.8
Application
Construction of LALR Parsing
Table
LALR parsing
SLR and CLR
• Merge SLR and CLR Canonical set
Applying /
L27 Construct LALR parsing table of Items. T1:4.5,4.6,
Application
• Construction of LALR Parsing
Table
LALR parsing
SLR and CLR
Applying / • Merge SLR and CLR Canonical set
L28 Construct LALR parsing table T1: 4.7
Application of Items.
Construction of LALR Parsing Table
Error recovery in parsing
Identify the Errors in LR parsing Applying / Construct Canonical set of Items
L29 T1:4.9
by using methods. Application http://nptel.ac.in/courses/106108113/1
1
Handling ambiguous grammar
Identify the ambiguous grammar Applying /
L30 Construct Canonical set of Items T1:4.9
LR parsing by using methods. Application
YACC – Automatic parser generator
Implement LALR parser • Specification Rules
Applying /
L31 generator and Identify the • Commands T1:4.9
Application
Syntactical Error Messages http://nptel.ac.in/courses/106108052/2
#
Understand Intermediate forms Semantic analysis: Intermediate forms
of source Understanding / of source Programs.
L32 T1:5.1
Programs and construct the object Comprehension • Abstract syntax tree
code forms • polish notation

Department of CSE
• three address codes

Intermediate forms of source
Programs.
Understand Intermediate forms • Abstract syntax tree
Understanding /
L33 of source Programs and construct • polish notation T1:5.2
Comprehension
the object code forms • three address codes
#
Attributed grammars
• Synthesized Attributed grammars
Understand Types of the Understanding /
L34 • Inherited Attributed grammars T1: 5.3
Attributed grammars Comprehension
#
Syntax directed translation
• Mkptr (op,operand1,operand2)
Understand translation schemes method
Understanding /
L35 and convert • Mkleaf (operand1,id) Method T1: 5.4
Comprehension
into Intermediate forms • Mknum (operand1,num) method
#
Conversion of popular Programming
languages language Code Constructs
Apply programming language Applying /
L36 into Intermediate forms T1: 5.4
Code into Intermediate forms Application
#
Conversion of popular Programming
languages language Code Constructs
Apply programming language Applying /
L37 into Intermediate forms T1:8.1-8.6
Code into Intermediate forms Application
#
Type checker.
Understanding /
L38 Understand Type checker • Implicit method T1:8.1-8.6
Comprehension
• Explicit method
Symbol Tables: Symbol table format
• Entries in the symbol table
• Link with symbol and Hash Table
Understand the symbol table Understanding /
L39 Types of name length T1:6.1-6.2
format Comprehension
• Variable name length
• Fixed name Length
To Identify and Analyze the Applying / Organization for block structures
L40 T1:6.1-6.2
block structures languages Application Languages
Hashing, tree structures representation
Applying / of scope information.
L41 Identify scope information T1: 6.3-6.6
#
Block structures and non-block
To Differentiate Block structures
Applying / structure storage allocation
L42 and non block of various T1: 6.3-6.6
programming languages
#
Static, Runtime stack and heap storage
To Compare different storage Applying / allocation
L43 T1:7.6
allocation Application http://nptel.ac.in/courses/106108052/2
#
Storage allocation for arrays strings
To Compare different storage Applying / and records.
L44 T1:7.6
allocation Application http://nptel.ac.in/courses/106108052/2
#

Department of CSE
Code optimization: Consideration for

Optimization
• Algorithm
Understand Various optimization • Programming language
L45 T1:7.7
techniques • Address allocation Types of
Optimization
• Machine dependent optimization
• Machine Independent optimization
Scope of Optimization
Understand Various optimization Understanding / Local Optimization
L46 T1:7.8-7.9
techniques Comprehension Loop Optimization
local optimization
Common sub expression elimination
Understand Various optimization Understanding / Copy propagation
L47 T1:10.2-10.3
techniques Comprehension Dead code elimination
Reduction in strength
local optimization
Common sub expression elimination
Understand Various optimization Understanding / Copy propagation
L48 T1:10.4
techniques Comprehension Dead code elimination
Reduction in strength
loop optimization
Loop Invariant method
Loop Motion/Movement
Constant Propagation
Understand Various optimization Understanding /
L49 Loop Fusion T1:10.5
techniques Comprehension
Loop Unrolling
Redundant common sub
expression elimination
loop optimization
Loop Invariant method
Loop Motion/Movement
Constant Propagation
Understand Various optimization Understanding /
L50 Loop Fusion T1:10.6
techniques Comprehension
Loop Unrolling
Redundant common sub expression
elimination
DAG representation.
Identify the rules
Understand DAG representation Understanding /
L51 Apply the concept T2:9.1
for basic blocks and flow graph. Comprehension
Construct DAG
DAG representation. Identify the rules
Understand DAG representation Understanding / of DAG Apply the concept Construct
L52 T1:10.7-10.8
for basic blocks and flow graph. Comprehension DAGhttp://nptel.ac.in/courses/106108
052/8
Data flow analysis: Flow graph
Construct the three code
Construct the three address code Applying /
L53 Construct basic blocks T1:10.9
for Flow Graph Application
#
Data flow equation.
Construct the three address code Applying /
L54 Construct exit and entry levels T1:10.9
Data flow equation. Application
Construct Table based on levels with

Department of CSE
available equations.
#
global optimization
Understand the global Understanding / Structural level equation
L55 T1:10.10
optimization Comprehension Numbered level equation
Understand the global redundant sub expression elimination
Understanding /
L56 optimization of redundant sub http://nptel.ac.in/courses/106108052/1 T1:10.11
Comprehension
expression elimination 7
Induction variable elements
Identify the dependent variable of
available expression
Understand Induction variable Understanding /
L57 Identify the which is linked with T1:10.12
elements Comprehension
dependent variable.
4
Live variable analysis
Identify the which the live variable
Understand Live variable Understanding / Based on basic block and given
L58 T1:10.12
analysis Comprehension expression.
4
Live variable analysis
Identify the which is the live variable
Understand Live variable Understanding /
L59 Based on basic block and given T1:10.13
analysis Comprehension
expression.
Copy propagation
Identify the which is the copy
statement in three address code
Understand Copy propagation of Understanding /
L60 Based on basic block and given T1:10.14
local Optimization Comprehension
expression.
4
Object code generation: Object code
forms
Understand various Object code Understanding /
L61 Absolute code T1:10.15
forms Comprehension
Reloadable code
Assembler code
Machine dependent code optimization
Graph Coloring
Understand various code Understanding / Register allocation
L62 T1:10.16
optimization Techniques Comprehension Global optimization
Register allocation and Assignment
Most frequent used variables
Understand various Register
Understanding / Local /global Register allocation and
L63 allocation and Assignment T1:10.17
Comprehension Assignment
techniques
3
Generic code generation algorithms
Understand Generic code Understanding / Construct three address code
L64 T1:10.18
generation Algorithms Comprehension Construct Assembly code
Assign the register
DAG for register allocation.
Understand various applications Understanding /
L65 Labeling Algorithm T1:10.19-23
DAG Comprehension
Heuristic Algorithm

Department of CSE
8

PROGRAM OUTCOMES:

Objectives a b C d e F g h i j k l m n
I. S H H
II. H H H
III. H H S H H S
IV. S S H
V. H H H H S H
VI. H

PROGRAMOUTCOMES:

Outcomes a b C d e F g h i j k l m n
a S H H H H H
b S S S S H S
c S H S H
d S H
e S H
S =Supportive H = Highly Related
12.11 OBJECTIVE QUESTIONS:
UNIT-I
1. Match the followings: [Gate-1990]
Group I Group II
A. Lexical Analysis p. DAG’s
B. Code optimization q. Syntax tree
C. Code generation r. Pushdown Automaton
D. Abelian Group’s s. Finite Automaton
Answer: a-q, b-p, c-r, d-s
2. Which of the following strings can definitely be said to be token without looking at
the next input character while compiling a pascql program? [Gate-1995]
I. Begin II. Program III.<>
A. I
B. II
C. III
D. All
Answer: C
Explanation:

Department of CSE
<> symbol is said to be token without looking at the next input character while
compiling a Pascal program.
3. Type checking is normally done during [Gate-1998]
A. Lexical Analysis
B. Syntax Analysis
C. Syntax Directed Translation
D. Code Optimization
Answer: Syntax Analysis
Explanation: Type checking is normally done durig syntax analysis. In practice, there
are a number of tasks that might be conducted during syntax analysis phase such as
performing type checking and other kinds of semantic analysis like generating
intermediate code.
4. The number of tokens in the FORTRAN statement DO 10 I= 1.25 is [Gate-
1999]
A. 3
B. 4
C. 5
D. 6
Answer: C
Explanation:
DO
10
I Number of tokens=5
=
1.25
5. The ‘C’ language is [NET-DEC-2012]
A. Context free language
B. Context sensitive language
C. Regular language
Answer: B
Exp: Because a context free language is powerful to describe the concept of
programming language and also describe the syntax of programming languages.
6. In analyzing the compilation of PL/I program, the term “lexical analysis” is
associated with [APSET-2013]
A. recognition of basic syntactic constructs through reductions
B. recognition of basic elements and creation of uniform symbols
C. creation of more optional matrix
D. use of macro processor to produce more optimal assembly code
Answer: B
7. In a compiler the module that checks every character of the source text is called
[APSET-2012]
A. the code generator
B. the code optimizer
C. the lexical analyzer
D. the syntax analyzer.
Answer: C
8. In machine language the operand can be [NET-DEC-2013]
A. an addressable register
B. the location of an instruction in memory

Department of CSE
C. literal numbers to be used by the program

D. any of the above.
Answer: any of the above.
9. Which data structure in a compiler is used for managing information about
variables and their attributes? [Gate-2010]
A. Abstract Syntax tree
B. Symbol Table
C. Semantic stack
D. Parse Table
Answer: symbol table
Explanation: Symbol Table is the data structure used for during the complete
information about the source code
10. In Compiler, keywords of a language are recognized during [Gate-2011]
A. Parsing of the program
B. The code generation
C. The lexical analysis of the program
D. Dataflow Analysis
Answer: The lexical analysis of the program
Explanation: During lexical analysis the compiler scans the source code, divide into
words and generate the tokens.
11. Consider the grammar defined by the following production rules, with two
operators * and +
S →T * P
T→ U | T * U
P →Q+ P | Q
Q → Id
U → Id
Which one of the following is TRUE? [Gate-2014]
A. + is left associative, while * is right associative
B. + is right associative, while * is left associative
C. Both + and * are right associative
D. Both + and * are left associative
Answer: B
Exp:
S →T * P
T→ U | T * U
P →Q+ P | Q
Q → Id
U → Id
As the production rule T T * U is defined as left recursive rule, so * is left associative
operator.
As the production rule P Q+ P is defined as left recursive rule, so + is a right
associative operator.
12. Which one of the following is a top-down parser? [Gate-2007]
A. Recursive descent parser
B. An LR (k) parser
C. Operator precedence parser
D. An LALR(k) Parser
Answer: Recursive descent parser
Exp: Predictive and Recursive Descent Parser are the top-down parser

Department of CSE
13. Consider the following two statements: [Gate-2007]

P: Every regular grammar is LL (1)
Q: Every Regular set has LR (1) Grammar
Which of the following TRUE?
A. Both P and Q are true
B. P is true and Q is false
C. P is false and Q is true
D. Both P and Q are false
Answer: Both P and Q are true
Exp: Regular grammar is well recognized by LL (1) parser and LR (1) parser is stronger
and more powerful than LL(1) so regular is also accepted by LR(1) parser. Every
regular set has LR (1) grammar. So both statements are correct.
14. Which of the following suffices to convert an arbitrary CFG to an LL(1)
grammar? [Gate-2003]
A. Removing left recursion
B. Factoring the grammar alone
C. Removing left recursion and factoring the grammar
Answer: Removing left recursion and factoring the grammar
Explanation:
To convert an arbitrary CFG to an LL (1) grammar we must remove left recursion and
left factoring. If we can’t remove these then the parser may go to infinite loop and
requires lot of back tracking.
15. Which of the following suffices to convert an arbitrary CFG to an LL(1)
grammar? [Gate-2003]
A. Removing left recursion alone
B. Factoring the grammar alone
C. Removing left recursion and factoring the grammar
Answer: Removing left recursion and factoring the grammar
Explanation:
To convert an arbitrary CFG to an LL (1) grammar we must remove left recursion and
left factoring. If we can’t remove these then the parser may go to infinite loop and
require lot of back tracking
16. Consider the grammar shown below [Gate-2003]
SiEtSSꞌ | a
SꞌeS | ε
E b
In the predictive parser table. M of this grammar, the entries M[S, $] respectively are
A. { SꞌeS} and { Sꞌε}
B. {SeS} and { }
C. { Sꞌε} and { Sꞌε}
D. { SꞌeS, Sꞌε } and { Sꞌε}
Answer: { SꞌeS, Sꞌε } and { Sꞌε}
17. Which of the following strings is generated by the grammar? [Gate-2007]
SaB/bA
B b/bS/aBB
Aa/aS/bAA
A. aaaabb
B. aabbbb

Department of CSE
C. aabbab
D. abbbba
Answer: aabbab
18. Consider the grammar [Gate-2013]
SABSc | Abc
BA AB
Abab
BbAB
Aaaa
Which of the following sentences can be derived by this grammar?
A. abc
B. aab
C. abcc
D. abbc
Answer: abc
19. The language generated by the above grammar is the set of all strings, made up of
a, b, c such that [Gate-2013]
A. The number of a’s, b’s and c’s will be equal
B. a’s always precedes b’s
C. b’s always precedes c’s
D. The number of a’s, b’s , and c’s are the same and the a’s precedes the b’s which
precedes the c’s.
Answer: The number of a’s, b’s , and c’s are the same and the a’s precedes the b’s
which precedes the c’s.
Explanation: Generate some of the strings that can be derived from start state and verify
that they fall into the category covered by The number of a’s, b’s , and c’s are the same
and the a’s precedes the b’s which precedes the c’s.
20. Consider the following grammar [Gate-2006]
S FR
R*S | ε
Fid
In the predictive parser table. M of this grammar, the entries M [S,id] and M[R, $]
respectively are
A. { SFR} and { Rε}
B. {SFR} and {R*S }
C. { SFR} and { }
D. { Fid } and { Rε}
Answer: { SFR} and { Rε}
UNIT-II
1. Which of the following are Error Recovery Techniques [GATE-2010]
A. Global-Correction III
B. Phrase-Level Error Recovery
C. Error-Production
D. All
Answer: D
2. The minimum value of k in LR (k) is [GATE2009]
A. 1
B. 0
C. 2

Department of CSE
D. 3
Answer: B
3. ----------- are the constructed data types. [GATE-2005]
A. Arrays
B. Structures
C. Pointer
D. All
Answer: D
4. 4. There are ------ representations used for these address code. [GATE-2011]
A. 1
B. 2
C. 3
D. 4
Answer: C
5. While performing type checking --- special basic types are needed. [APSET-2010]
A. 1
B. 2
C. 3
D. 4
Answer: C
6. Indirect triples are used to implement [NET-2008]
A. Infix notation
B. Postfix notation
C. Three address code
D. Prefix notation
Answer: C
7. A Sound Type system eliminates--, when the target program runs.[NET-2006]
A. Type Error
B. Runtime Error
C. Compiler Type Errors
D. Done
Answer: A
8. Implicit Type Conversion is called -------------- [GATE-2009]
A. Coercion
B. Correction
C. C-Type
D. None
Answer: A
9. ---determines the type of a language construct from the way it is used. [GATE-
2006]
A. Type Synthesis
B. Type Reference
C. Type Inference
D. All
Answer: B
10. ----------- are the constructed data types. [GATE-2005]
A. Arrays
B. Structures
C. Pointer
D. All

Department of CSE
Answer: D
11. 4. There are ------ representations used for these address code. [GATE-2004]
A. 1
B. 2
C. 3
D. 4
Answer: C
12. While performing type checking ------ special basic types are needed.[GATE-2001]
A. 1
B. 2
C. 3
D. 4
Answer: C
13. Indirect triples are used to implement [GATE-2002]
A. Infix notation
B. Postfix notation
C. Three address code
D. Prefix notation
Answer: C
14. A collection of syntactic rule is called a [GATE-2001]
A. Grammar
B. NFA
C. Sentence
D. Language
Answer: A
15. In operator precedence parsing precedence relations are defined [GATE-2005]
A. For all pair of non-terminals
B. Set strings of symbols over given
C. Set of all alphabets
D. Only for a certain pair of terminals
Answer: D
16. Which Type is the context free Grammar [GATE-2005]
A. Type 3
B. Type 2
C. Type 1
D. Type 0
Answer: B
17. A Sound Type system eliminates---, when the target program runs.[GATE-2006]
A. Type Error
B. Runtime Error
C. Compiler Type Errors
D. Done
Answer: A
18. 9. Implicit Type Conversion is called -------------- [GATE-2007]
A. Coercion
B. Correction
C. C-Type
D. None
Answer: A

Department of CSE
19. 10. ------determines the type of a language construct from the way it is used.
[GATE-2005]
A. Type Synthesis
B. Type Reference
C. Type Inference
D. All
Answer: B
20. Which of the following are Error Recovery Techniques [GATE-2003]
A. Global-Correction III
B. Phrase-Level Error Recovery
C. Error-Production
D. All
Answer: D
UNIT-III
1. The storage strategy in which activation record is maintained even after the
execution of a procedure is completed is [GATE-2004]
A. Stack allocation
B. Heap allocation
C. Static allocation
D. Dynamic allocation
Answer: C
2. The following symbol table implementation has the minimum access time.[GATE-
2002]
A. hash table
B. search tree
C. linear list
D. self-organizing list
Answer: B
3. Uniform symbol table [GATE-2005]
A. Contains all constants in the program
B. Is a permanent table of decision rules in the form of patterns for matching with the
uniform symbol table to discover syntactic structure
C. Consists of full or partial list of tokens as they appear in program created by
lexical analysis and used for syntax analysis and interpretation
D. A permanent table which lists all keywords and special symbols of language in
symbolic form
Answer: C
execution of a procedure is completed. [GATE-2006]
A. Stack allocation
B. Heap allocation
Answer: B
5. Which of the following parameter passing mechanism has the feature, that
operations on the formal parameters do not affect values in the activation record
of the caller? [GATE-2000]
A. call-by-value
B. call-by reference

Department of CSE
C. call-by-name
D. call-by-procedure
Answer: A
6. ----- data structure gives intermediate performance to implement symbol tables.
[GATE-2003]
A. hash tables
B. trees
C. both
D. linear list
Answer: B
7. ------ analyzer phase refers symbol table for type conflict issue. [GATE02003]
A. semantic
B. syntactic
C. lexical
D. none
Answer: A
8. -------- is are used as the key to accessing the scope information from symbol
table. [GATE2006]
A. procedure name
B. nesting depth
C. both
D. none
Answer: C
9. A hash function is defined as F(key) = key mod 7 with linear probing is used to
insert the keys 37,38,72,48,98,11,56 into a hash table indexed from 0 to 6 .Then in
which location the key 11 is stored. [GATE-2007]
A. 6
B. 5
C. 1
D. 4
Answer: D
10. A compiler uses a data structure called _________________ to keep track of scope
and binding information about names. [GATE-2013]
A. Symbol Table
B. Hash table
C. Both
D. None
Answer: A
11. Uniform symbol table [GATE-2012]
A. Contains all constants in program
B. Is a permanent table of decision rules in the form of patterns for matching with the
uniform symbol table to discover syntactic structure
C. Consists of full or partial list of tokens as they appear in program created by
lexical analysis and used for syntax analysis and interpretation
D. A permanent table which lists all key words and special symbols of language in
symbolic form
Answer: C
12. When inserted the characters of the string:

Department of CSE
KRPCSNYTJM into hash table of size 10 by using hash function H (X) = (ORD (X)-
ORD ('A') + 1) mod 10 and linear probing to resolve collisions. Insertions that cause
collisions are [GATE2004]
A. C, S
B. Y, M
C. J, M
D. S, T
Answer: C
13. A hash function is defined as F(key) = key mod 7 with linear probing is used to
insert the keys37,38,72,48,98,11,56 into a hash table indexed from 0 to 6 .Then in
which location the key 11 is stored.[GATE-2005]
A. 6
B. 5
C. 1
D. 4
Answer: B
14. A hash function is defined as F (key) = key mod 7 with linear probing is used to
insert the keys37,38,72,48,98,11,56 into a hash table indexed from 0 to 6 .Then
following key is stored as the last element[GATE-2004]
A. 98
B. 56
C. 11
D. 48
Answer: D
execution of a procedure is completed is [GATE-2006]
A. Stack allocation
B. Heap allocation
Answer: B
16. The following symbol table implementation has the minimum access time.[GATE-
2008]
A. hash table
B. search tree
C. linear list
Answer: A
17. In the search trees implementation the expected time required to enter 'n' names
and make 'm' enquiries is proportional to [GATE-2007]
A. (n +m) log n
B. (m +n) log m
C. m n log n
D. m n log m
Answer: A
18. Time is independent of number of entries in a symbol table among [GATE2008]
A. Linear list
B. Search tree
C. Hash table
D. Self-organizing lists

Department of CSE
Answer: C
19. Based on the property of locality of reference the symbol table is implemented in
[GATE2009]
A. Linear list
B. search tree
C. hash table
Answer: C
20. Access time of symbol table will be logarithmic if it is implemented by[GATE-
2011]
A. linear list
B. search tree
C. hash table
Answer:
UNIT-IV
1. A region of validity every name possesses in the source program is[Gate-1990]
A. Scope
B. Life time
C. Binding
D. Domain
Answer: B
2. An optimized compiler [Gate-1991]
A. Is optimized to occupy less space
B. Is optimized to take less time for execution
C. Optimized the code
D. Optimized to small typing font
Answer: C
3. Object language program than the most obvious for a given source program is
[Gate-2001]
A. Code generation
B. Code optimization
C. Code execution
D. Code debugging
Answer: C
4. The "90-10" rule states that [APSET-2006]
A. 90 % of code is executed in 10 % of time
B. 90 % of time is spent in 10 % of code
C. 90 % of time is spent in correcting 10 % of errors
D. 10 % of time is spent in correcting 90 % of errors
Answer: B
5. The most heavily travelled parts of programs are [NET-2007]
A. Inner loops
B. Constants
C. Static variables
D. Global variables
Answer: D
6. Machine independent code optimization can be applied to [NET-2003]
A. Source code

Department of CSE
B. Intermediate representation
C. Object code
D. Run-time output
Answer: A
7. At a point in a program if the value of variable can be used subsequently, then that
variable is [NET-2005]
A. Dead
B. Duplicate
C. Aliasing
D. Live
Answer: D
8. The region of validity every name possesses in the source program is [GATE-1998]
A. Scope
B. Life time
C. Binding
D. Domain
Answer: A
9. Which of the following is not a peephole optimization? [GATE 2011]
A. Removal of unreachable code
B. Elimination of multiple groups
C. Elimination of loop invariant compilation
D. Loop unrolling
Answer: C
10. At point p if no matter what path is taken from p, the expression e will be
evaluated before any of its operands are defined, then expression e is said to be
[GATE-2008]
A. Lazy
B. Late
C. Busy
D. Dummy
Answer: B
11. The evaluation which avoids the action at all which is clearly advantageous
[GATE-2001]
A. Late
B. Lazy
C. Critical
D. Smart
Answer: C
12. Which of the following comments about peep hole optimization are false.
[GATE-1997]
A. It is applied to small part of the code
B. It can be used to optimize intermediate code
C. To get the best out of this, it has to be applied repeatedly
D. It can be applied to the code that is contiguous
Answer: C
13. Shorter equivalent sequence. [GATE-2005]
A. Peep hole optimizer
B. Assembler
C. Linker
D. Loader

Department of CSE
Answer: A
14. The evaluation ordering in which we know beforehand that will have to perform
the action anyway, but we find it advantageous to perform it as late as possible
[GATE-2007]
A. Late
B. Lazy
C. Critical
D. Smart
Answer: A
15. The evaluation ordering in which, code for node is issued as soon as the code for all
of its Operands has been issued [GATE-2009]
A. Early
B. Late
C. Lazy
D. Critical
Answer: C
16. Peep-hole optimization is form of [GATE-2011]
A. Local optimization
B. Constant folding
C. Copy propagation
D. Data flow analysis
Answer: A
17. If the transformation of a program can be performed by looking only at
statements in basic block then it is said to be [GATE-2010]
A. Local
B. Global
C. Algebraic
D. Matrix
Answer: C
18. If E was previously computed and the values of variable in E have not changed
since previous computation, then an occurrence of an expression E is[ GATE-
2008]
A. Copy propagation
B. Dead code
C. Common sub expressions
D. Constant folding
Answer: C
19. In block B if s occurs in B and there is no subsequent assignment to y within B,
then the copy statement s:x :=y is [GATE-2006]
A. Generated
B. Killed
C. Blocked
D. Dead
Answer: A
20. In block B if x or y is assigned there and s is not in B then s: x :=y is[GATE-2005]
A. Generated
B. Killed
C. Blocked
D. Dead
Answer: B

Department of CSE
UNIT-V
1. The following cannot be used to identify loops [NET-2008]
A. Depth first ordering
B. Reducible graphs
C. Dominators
D. Flow chart
Answer: D
2. Replacement of a string concatenation operator "||" by an addition is example for
[GATE-2009]
A. Strength reduction
B. Operator overriding
C. Operator over loading
D. Operator elimination
Answer: A
3. The replacement of an expensive operation by a cheaper one [GATE-2001]
A. Operator overriding
B. Operator overloading
C. Reduction in strength
D. Operator elimination
Answer: C
4. The loop which does not contain any other loops are [GATE-2000]
A. Natural loop
B. Inner loop
C. Main loop
D. Nested loop
Answer: B
5. Identify the basic blocks in the following code 10 goto 20 20 goto 10 [GATE-2006]
A. Go to 20
B. Go to 10
C. Two independent basic blocks
D. Both statements in one block
Answer: C
6. Loop is collection of nodes that [NET-2008]
A. Is loosely connected
B. Is strongly connected with several entries
C. Is having several entries
D. Is strongly connected with unique entry
Answer: D
7. n loop optimization technique a loop whose body is rarely executed is [GATE-
2008]
A. Dead code
B. Blank code
C. Redundant code
D. Blank stripper
Answer: D
8. If the following optimization is attempted, count of number of jumps to each label
can be found from symbol table of that label [GATE-2007]
A. Back tracking
B. Peephole optimization
C. Dynamic programming

Department of CSE
D. Global optimization
Answer: B
9. The use of the following greatly improves the code when pushing or popping a
stack, as in parameter passing [GATE-2000]
A. Flow of control
B. Auto increment addressing modes
C. Auto decrement addressing modes
D. Both auto increment and auto decrement addressing modes
Answer: D
10. The following can be done through peephole optimization [GATE-2007]
A. Dynamic programming
B. Greedy method
C. Unreachable code elimination
D. Code generation
Answer: C
11. The following algebraic identities can be eliminated through peephole optimization
[GATE-2009]
A. x:=x+0
B. x:=x*1
C. x:=x+0 and x:=x*1
D. Jumps over jumps
Answer: C
12. Replacing the exponent operator by the shift of multiplication is [GATE-2000]
A. Constant folding
B. Reduction in strength
C. Copy propagation
D. Elimination of dead variables
Answer: B
13. Method to improve the target program by examining a short sequence of target
instructions [GATE-2011]
A. Back tracking
Answer: B
14. Program transformation that is not characteristic of peephole optimization
[GATE-2002]
A. Redundant instruction elimination
B. Flow of control optimization
C. Back patching
D. Use of machine idioms
Answer: C
15. The following is the small moving window in target program [GATE-2000]
A. Screen saver
B. Graphics
C. Peephole
D. Greedy window
Answer: C
16. Use of machine idioms is one of the characteristic of [GATE-2012]
A. Back tracking

Department of CSE
Answer: B
17. Peephole optimization is to eliminate [GATE-2011]
A. Constant folding
B. Jumps over jumps
C. Copy propagation
D. Elimination of dead variables
Answer: B
18. Machine independent optimization is [GATE-2014]
A. Register allocation
B. Frequency reduction
C. Data intermixed with instructions
D. Machine features instructions
Answer: C
19. Computing two or more identical computations to a place in the program where
the computation can be done once and the result to used in the entire original
places is [GATE-2015]
A. Replacing
B. Profiling
C. Hoisting
D. Rearranging
Answer: B
20. Deducing at compile time that the value of an expression is a constant and using
that constant instead is [GATE-2013]
A. Constant folding
B. Constant deduction
C. Macro substitution
D. Copy propagation
Answer: A
12.12 TUTORIALS QUESTION BANK

PART - A (SHORT ANSWER QUESTIONS)
Blooms
Course
Outcome
Level
UNIT – I
1 Define Complier briefly? Understand a
2 Explain the cousins of compiler? Understand b
3 Define the two main parts of compilation? What they perform? Understand c
4 How many phases does analysis consists? Understand e
5 Define and explain the Loader? Remember d
6 Explain about preprocessor? Remember a
7 State the general phases of a compiler? Understand b
8 State the rules, and define regular expression? Remember c
9 Explain a lexeme and Define regular sets? Remember e
10 Explain the issues of lexical analyzer? Understand d

Department of CSE
11 State some compiler construction tools? Understand c

12 Define the term Symbol table? Understand e
13 Define the term Interpreter? Remember d
14 Define the term Tokens in lexical analysis phase? Understand a
15 Explain about error Handler? Understand e
16 Define a translator and types of translator? Understand d
17 Explain about parser and its types? Understand c
18 Construct NFA for (a/b)* and convert into DFA? Remember e
19 Define bootstrap and cross compiler? Understand d
20 Define pass and phase? Understand a
Analyze the output of syntax analysis phase? What are the three general types
21 Remember e
of parsers for grammars?
List the different strategies that a parser can employ to recover from a
22 Understand d
syntactic error?
23 Explain the goals of error handler in a parser? Understand c
24 How will you define a context free grammar? Remember e
25 Define context free language. When will you say that two CFGs are equal? Remember d
26 Give the definition for leftmost and canonical derivations? Understand c
27 Define a parse tree? Understand a
28 Explain an ambiguous grammar with an example? Apply e
29 When will you call a grammar as the left recursive one? Apply d
30 List different types of compiler? Remember c
UNIT - II
1 Define the term handle used in operator precedence? Understand e
2 Define LR (0) items in bottom up parsing? Remember d
3 State the disadvantages of operator precedence parsing? Remember c
4 LR (k) parsing stands for what? Understand e
5 Why LR parsing is attractive one and explain? Understand d
6 Define go to function in LR parser with an example? Understand c
7 Why SLR and LALR are more economical to construct Cananonical LR? Understand a
8 Explain about handle pruning? Understand e
9 Explain types of LR parsers? Understand d
10 List down the conflicts during shift-reduce parsing. Remember e
UNIT – III
1 State the benefits of using machine-independent intermediate form? Remember e
2 List the three kinds of intermediate representation? Understand d
3 How can you generate three-address code? Understand c
Define syntax tree? Draw the syntax tree for the assignment statement. a :=b
4 Apply c
* -c + b * -c.
5 Explain postfix notation? Remember a
6 Explain the usage of syntax directed definition? Apply e
7 Define abstract or syntax tree? Understand d
8 Show the DAG for a: =b *-c + b * -c? Apply c
9 Translate a or b and not c into three address code? Apply c
10 Define basic blocks? Understand a
11 Discuss back-end and front-end? Understand e
12 Define the primary structure preserving transformations on basic blocks? Understand c

Department of CSE
13 List common methods for associating actual and formal parameters? Understand a
14 List various forms of target programs? Remember e
15 Define back patching? Understand d
16 List different data structures used for symbol table? Remember c
17 Explain the steps to search an entry in the hash table? Understand c
18 List the different types of type checking? Explain? Understand e
19 Explain general activation record? Understand d
20 State the difference between heap storage and hash table? Understand d
UNIT – IV
1 Explain the principle sources of optimization? Understand d
2 Explain the patterns used for code optimization? Understand c
3 Define the 3 areas of code optimization? Understand c
4 Define local optimization? Understand a
5 Define constant folding? Understand e
6 List the advantages of the organization of code optimizer? Understand d
7 Define Common Sub expressions? Understand c
8 Explain Dead Code? Understand c
9 Explain the techniques used for loop optimization and Reduction in strength? Understand a
Mention the issues to be considered while applying the techniques for code
10 Understand e
Optimization?
11 List the different data flow properties? Understand a
12 Explain inner loops? Understand e
13 Define flow graph? Understand d
14 Define a DAG? Mention its Apply? Understand c
15 Define peephole optimization? Understand c
16 Explain machine instruction for operations and copy statement? Understand a
17 Analyze global data flow? Understand d
18 Explain about live variable analysis? Understand c
19 Define the term copy propagation? Understand c
20 Explain data flow equation? Understand c
UNIT – V
1 Explain about machine dependent and machine independent optimization? Remember e
2 Explain the role of code generator in a compiler? Understand a
3 Write in detail the issues in the design of code generator. Apply e
Show the code sequence generated by the simple code generation
Algorithm
4 u := a – c Apply d
v := t + u
d := v + u//d live at the end
5 Explain the instructions and address modes of the target machine? Understand c
Identify the register descriptor target code for the source language
6 Statement“(a-b) + (a-c) + (a-c);” Understand c
The 3AC for this can be written ast := a – b
7 Mention the properties that a code generator should possess. Apply a
8 How do you calculate the cost of an instruction? Understand d
9 How will you map names to values? Understand c
10 Generate the code for x: =x+1 for target machine? Understand e

Department of CSE
PART - B (LONG ANSWER QUESTIONS
Blooms Taxonomy Course

S. No Question
Level Outcome
UNIT - I
Define compiler? State various phases of a compiler and explain them in
1 Understand 1
detail.
Explain the various phases of a compiler in detail. Also Write down the
2 Apply 1
output for the following expression after each phase a: =b*c-d.
3 Explain the cousins of a Compiler? Explain them in detail. Understand 1
Describe how various phases could be combined as a pass in a compiler?
4 Remember 3
Also briefly explain Compiler construction tools.
For the following expression
5 Position:=initial+ rate*60 Apply 1
Write down the output after each phase
6 Explain the role Lexical Analyzer and issues of Lexical Analyzer. Remember 1
7 Differentiate the pass and phase in compiler construction? Remember 1
8 Explain single pass and multi pass compiler? With example? Understand 1
9 Define bootstrapping concept in brief? Understand 1
10 Explain the general format of a LEX program with example? Understand 3
Construct the predictive parser the following grammar:
S->(L)|a
11 L->L,S|S. Apply 4
Construct the behavior of the parser on the sentence (a, a) using the
grammar specified above
Explain the algorithm for finding the FIRST and FOLLOW positions for
a given non-terminal.
ii) Consider the grammar,
E ->TE‟
E->+TE‟|@
12 Understand 4
T ->FT‟
T->*FT‟|@
F->(E)|id.
Construct a predictive parsing table for the grammar given above. Verify
whether the input string id + id * id is accepted by the grammar or not.
Prepare the predictive parser for the following grammar:
S->a|b|(T)
T ->T, S|S
Write down the necessary algorithms and define FIRST and
13 FOLLOW. Show the behavior of the parser in the sentences, Apply 4
i.
(a,(a,a))
ii.
(((a,a),a,(a),a)
Explain operator grammar? Draw the precedence function graph for the
following table.
A ( ) , $
> > >
14 Understand 4
( < < = <
) > > >
, < < > >
$ < <
UNIT - II
Consider the grammar E
1 E + E|E *E|(E)| id Apply 5
Show the sequence of moves made by the shift-reduce parser on the

Department of CSE
input id1+id2*id3 and determine whether the given string is accepted

by the parser or not.
i) State shift-reduce parsing? Explain in detail the conflicts that may
occur during shift-reduce parsing.
2 ii)For the grammar given below, calculate the operator precedence Understand 5
relation and the precedence functions
EE + E|E- E|E * E|E / E|E E|(E)|-E|id
Prepare a canonical parsing table for the grammar given below
3 SCC Analysis 5
CcC|d
Analyze whether the following grammar is SLR(1) or not. Explainyour
answer with reasons.
SLR
4 SR Apply 5
L* R
RL
L id
Consider the grammar given below.
EE + T
ETT
TT * F
TF
5 Apply 5
F(E)
Fid
Prepare LR parsing table for the above grammar .Give the moves of
LR parser on id * id + id
ii) Briefly explain error recovery in LR parsing.
UNIT – III
Explain with an example to generate the intermediate code for the flow of
1 Apply 8
control statements?
2 List the various ways of calling the procedures? Explain in detail? Analysis 6
Explain 3addresscodes and mention its types. How would you implement
3 Apply 8
the three address statements? Explain with suitable examples?
Explain how declaration is done in a procedure using syntax directed
4 Apply 7
translation?
a) Write a note on the specification of a simple type checker.
5 b) Define a type expression? Explain the equivalence of type Analysis 7
expressions with an appropriate example.
Generate the three-address code for the following C program
fragment
while(a > b)
{
6 if (c < d) Understand 8
x = y + z;
else
x = y - z;
}
Generate the code for the following C statements using its equivalent
three address code.
a=b+1
7 Understand 8
x = y+3
y = a/b
a = b+c
Describe the method of generating syntax directed definition for control
8 Understand 7
Statements?
9 Explain procedure calls with suitable example? Understand 7
Explain Intermediate code generation for Basic block, Control Flow and
10 Apply 8
Boolean Expressions?

Department of CSE
11 Write about Quadruple and Triple with its structure? Apply 8

12 Explain different schemes of storing name attribute in symbol table. Understand 9
Write the advantages and disadvantages of heap storage allocation
13 Apply 9
strategies?
14 Distinguish between static and dynamic storage allocation? Understand 9
15 Differentiate between stack and heap storage? Understand 9
UNIT – IV
1 Explain the principle sources of code optimization in detail? Understand 10
2 Explain peephole optimization? Understand 10
Discuss about the following
Copy propagation
3 Understand 10
Dead code elimination
Code motion
4 Explain in the DAG representation of the basic block with example. Understand 11
5 Explain Local optimization and loop optimization in detail Understand 11
6 Write about Data Flow Analysis of structural programs? Understand 12
7 Explain various Global optimization techniques in detail? Understand 12
Generate target code for the given program segments:
main()
{
8 Apply 11
inti=4,j;
j = i + 5;
}
9 Discuss algebraic simplification and reduction in strength? Understand 11
10 Explain the various source language issues? Understand 10
11 Explain in detail the issues in design of a code generator? Understand 13
12 Demonstrate the simple code generator with a suitable example? Apply 13
13 List the different storage allocation strategies? Explain. Understand 12
14 (a) Write the procedure to detect induction variable with example? Understand 11
(b) With example explain dead code elimination?
(a) Explain how loop invariant computation can be eliminated?
(b) Explain how “Redundant sub-expression eliminates” can be
15 Understand 11
done
in a given program?
UNIT – V
a) Explain the concept of object code forms?
b) Generate optimal machine code for the following C program.
main()
{
1 Apply 13
inti, a[10];
while (i<=10)
a[i] =0
}
2 Explain Machine dependent code optimization in detail with an example? Understand 14
(a) Discuss various object code forms?
3 Understand 13
(b) Write a short note on code generating algorithms?
Write about target code forms and explain how the instruction forms
4 Understand 14
effect the computation time?
Consider the following basic block of 3-address instructions:
a := b + c
5 x := a + b Apply 13
b := a – d
c := b + c

Department of CSE
d := a – d
y := a – d
Write the next-use information for each line of the basic block?
GROUP- C ANALYTICAL AND CRITICAL THINKING
Blooms
Course
S. No. Question Taxonomy
Outcome
Level
UNIT – I
Consider the following fragment of C code:
float i, j;
1 Apply 1
i = i*70+j+2;
Write the output at all phases of the compiler for above „C‟ code.
Construct an NFA for regular expression R= (aa | b) * ab convert it into an
2 Remember 2
equivalent DFA.
Describe the languages denoted by the following regular expressions.
3 (0+1)*0(0+1)(0+1) Remember 2
0*10*10*10*
Explain with one example how LEX program perform lexical
4 analysis for the following PASCAL patterns Identifiers, Comments, Apply 3
Numerical constants, Keywords, Arithmetic operators?
Check whether the following grammar is a LL(1)grammar
SiEtS|iEtSeS|a
5 Apply 4
Eb
Also define the FIRST and Followers.
Consider the grammar below
6 E->E+E|E-E|E*E|E/E|a|b Apply 4
Obtain left most and right most derivation for the string a+b*a+b.
Define ambiguous grammar? Test whether the following grammar is
7 ambiguous or not. Apply 4
E->E+E|E-E|E*E|E/E|E↑|(E)|-E|id
8 State the limitations of recursive descent parser? Remember 4
Convert the following grammar into LL(1)grammar,
9 Apply 4
S->ABC A->aA|C B->b C->c.
Write a recursive descent parser for the grammar.
bexpr->bexpr or bterm|bterm
10 bterm->bterm and bfactor|bfactor Apply 4
bfactor->notebfactor|(bexpr)|true|false.
Where or, and, not,(,),true, false are terminals of the grammar.
UNIT – II
Explain the common conflicts that can be encountered in a shift-reduce
1 Apply 5
parser?
2 Explain LALR parsing, justify how it is efficient over SLR parsing. Remember 5
3 Discuss error recovery in LL and LR parsing. Remember 5
UNIT – III
Suppose that the type of each identifier is a sub range of integers, for
expressions with operators +, -, *, div and mod, as in Pascal. Write type-
1 Understand 7
checking rules that assign to each sub expression the sub range its value must
lie in.
Define type expression? Write type expression for the following types. i.
2 Functions whose domains are functions from integers to pointers to integers Understand 7
and whose ranges are records consisting of an integer and a character.

Department of CSE
12.13 ASSIGNMENTS QUESTION BANK

PART A (SHORT ANSWER QUESTIONS)
Blooms
Course
Outcome
Level
UNIT – I
Explain about the different phases of a compiler, showing the output of each
Create
1. phase, using the example of the following statement: position : = initial + rate 2
Analyzing
* 60http://nptel.ac.in/courses/106108113/module1/Lecture1.pdf
Explain compiler and interpreter with suitable diagram
2. Analyzing 3
http://textofvideo.nptel.iitm.ac.in/106105084/lec28.pdf
Differentiate between pass and Phase
3. Analyzing 3
http://www.nptel.ac.in/courses/112108150/pdf/Lecture_Notes/MLN_07.pdf
Create the different sections of LEX program with Example
4. Create 2
http://textofvideo.nptel.iitm.ac.in/106108052/lec1.pdf.
Determine the input buffer scheme for scanning the source program. How the
use of sentinels can improve its performance? Describe in detail
5. Evaluate 1
http://nptel.ac.in/courses/Webcourse-contents/IIT-
KANPUR/compilers/download/ska-sl1.pdf
UNIT- II
Specify what are the issues of Top-Down Parsing techniques
1. http://nptel.ac.in/courses/Webcourse-contents/IIT- Creating 4
KANPUR/compilers/ui/Course_home-4-11.htm
Explain back tracking with example
2. Apply 5
http://nptel.ac.in/courses/106105078/pdf/Lesson%2009.pdf
Create recursive descent parser for the following grammar.
3. Creating 3
Create SLR parsing table for the following grammar.
S AS|b
4. A SA|a Creating 5
Create predictive parse table for the following grammar.
E E + T| T
T T F| F
5. Creating 6
F F * |a |b
UNIT-III
S AS|b
1. A SA|a Creating 5
Create LALR parsing table for the following grammar
2. S Aa | bAc | Bc | bBa Creating 5
Ad

Department of CSE
Bd
Discover What are the common conflicts that can be encountered in shift –
reduce parser.
3. http://textofvideo.nptel.iitm.ac.in/106108113/lec9.pdf Apply 6
R R ′|′ R | RR | R*| (R) | a | b
4. Creating 5
Prepare What is an operator grammar? Give an example.
5. Apply 6
www.nptel.ac.in/syllabus/106104072/
UNIT-IV
Create the DAG for the following basic block
D := B_C
E :=A+B
1. Create 3
B := B+C
A := E-D
www.nptel.ac.in/courses/.../instr-sched-3.pdf
Determine What are the legal evaluation orders and names for the values at
the nodes for the DAG of problem (a).
2. i. Assuming A, B and C are alive at the end of the basic block? Evaluate 10
ii. Assuming only A is live at the end?
www.nptel.ac.in/courses/.../instr-sched-3.pdf
Explain different principal sources of optimization technique with suitable
examples
3. www.nptel.ac.in/courses/111105039 Apply 11
www.nptel.ac.in/courses/106108056/
www.nptel.ac.in/.../OPTIMIZATION%20METH.
Explain in detail the Optimization technique “strength reduction”.
www.nptel.ac.in/courses/111105039
4. Apply 12
www.nptel.ac.in/.../OPTIMIZATION%20METH.
Summarize What is a DAG. Explain its applications
www.nptel.ac.in/courses/.../local-opt-part-2.pdf
5. www.nptel.ac.in/courses/106108052/7 Create 8
www.textofvideo.nptel.iitm.ac.in/.../lec8.pdf
UNIT-V
Explain different machine dependent code optimization techniques
1. www.nptel.ac.in/courses/.../intro-to-optim-2.pdf Creating 10
Explain the different issues in the design of a code generator.
www.nptel.ac.in/courses/.../code-gen-part-1.pdf
2. Creating 15
www.nptel.ac.in/courses/.../code-gen-part-3.pdf
www.nptel.ac.in/courses/106108052/9
Explain the concept of object code forms.
3. www.textofvideo.nptel.iitm.ac.in/.../lec25.pdf Creating 12
Compute various Register allocation optimization techniques with an
examplewww.textofvideo.nptel.iitm.ac.in/.../lec11.pdf
4. Apply 11
Create an algorithm for processing Macro Definition
5. Creating 14
www.nptel.ac.in/courses/.../lecture2.pdf

Department of CSE
Blooms
Course
Outcome
Level
UNIT - I
Define compiler? State various phases of a compiler and explain them in
1 Understand 1
detail.
Explain the various phases of a compiler in detail. Also Write down the
2 Apply 1
output for the following expression after each phase a: =b*c-d.
3 Explain the cousins of a Compiler? Explain them in detail. Understand 1
Describe how various phases could be combined as a pass in a compiler?
4 Remember 3
Also briefly explain Compiler construction tools.
For the following expression
5 Position:=initial+ rate*60 Apply 1
Write down the output after each phase
6 Explain the role Lexical Analyzer and issues of Lexical Analyzer. Remember 1
7 Differentiate the pass and phase in compiler construction? Remember 1
8 Explain single pass and multi pass compiler? With example? Understand 1
9 Define bootstrapping concept in brief? Understand 1
10 Explain the general format of a LEX program with example? Understand 3
Construct the predictive parser the following grammar:
S->(L)|a
11 L->L,S|S. Apply 4
Construct the behavior of the parser on the sentence (a, a) using the
grammar specified above
Explain the algorithm for finding the FIRST and FOLLOW positions for
a given non-terminal.
ii) Consider the grammar,
E ->TE‟
E->+TE‟|@
12 Understand 4
T ->FT‟
T->*FT‟|@
F->(E)|id.
Construct a predictive parsing table for the grammar given above. Verify
whether the input string id + id * id is accepted by the grammar or not.
Prepare the predictive parser for the following grammar:
S->a|b|(T)
T ->T, S|S
Write down the necessary algorithms and define FIRST and
13 FOLLOW. Show the behavior of the parser in the sentences, Apply 4
i.
(a,(a,a))
ii.
(((a,a),a,(a),a)
Explain operator grammar? Draw the precedence function graph for the
following table.
A ( ) , $
> > >
14 Understand 4
( < < = <
) > > >
, < < > >
$ < <

Department of CSE
UNIT – II
Consider the grammar E
E + E|E *E|(E)| id
1 Show the sequence of moves made by the shift-reduce parser on the Apply 5
input id1+id2*id3 and determine whether the given string is accepted
by the parser or not.
i) State shift-reduce parsing? Explain in detail the conflicts that may
occur during shift-reduce parsing.
2 ii)For the grammar given below, calculate the operator precedence Understand 5
relation and the precedence functions
EE + E|E- E|E * E|E / E|E E|(E)|-E|id
Prepare a canonical parsing table for the grammar given below
3 SCC Analysis 5
CcC|d
Analyze whether the following grammar is SLR (1) or not. Explain your
answer with reasons.
SLR
4 SR Apply 5
L* R
RL
L id
Consider the grammar given below.
EE + T
ETT
TT * F
TF
5 Apply 5
F(E)
Fid
Prepare LR parsing table for the above grammar .Give the moves of
LR parser on id * id + id
ii) Briefly explain error recovery in LR parsing.
UNIT – III
Explain with an example to generate the intermediate code for the flow of
1 Apply 8
control statements?
2 List the various ways of calling the procedures? Explain in detail? Analysis 6
Explain 3addresscodes and mention its types. How would you implement
3 Apply 8
the three address statements? Explain with suitable examples?
Explain how declaration is done in a procedure using syntax directed
4 Apply 7
translation?
a) Write a note on the specification of a simple type checker.
5 b) Define a type expression? Explain the equivalence of type Analysis 7
expressions with an appropriate example.
Generate the three-address code for the following C program
fragment
while(a > b)
{
6 if (c < d) Understand 8
x = y + z;
else
x = y - z;
}
Generate the code for the following C statements using its
equivalent
three address code.
7 a=b+1 Understand 8
x = y+3
y = a/b
a = b+c

Department of CSE
Describe the method of generating syntax directed definition for control

8 Understand 7
Statements?
9 Explain procedure calls with suitable example? Understand 7
Explain Intermediate code generation for Basic block, Control Flow and
10 Apply 8
Boolean Expressions?
11 Write about Quadruple and Triple with its structure? Apply 8
12 Explain different schemes of storing name attribute in symbol table. Understand 9
Write the advantages and disadvantages of heap storage allocation
13 Apply 9
strategies?
14 Distinguish between static and dynamic storage allocation? Understand 9
15 Differentiate between stack and heap storage? Understand 9
UNIT – IV
1 Explain the principle sources of code optimization in detail? Understand 10
2 Explain peephole optimization? Understand 10
Discuss about the following
Copy propagation
3 Understand 10
Dead code elimination
Code motion
4 Explain in the DAG representation of the basic block with example. Understand 11
5 Explain Local optimization and loop optimization in detail Understand 11
6 Write about Data Flow Analysis of structural programs? Understand 12
7 Explain various Global optimization techniques in detail? Understand 12
Generate target code for the given program segments:
main()
{
8 Apply 11
inti=4,j;
j = i + 5;
}
9 Discuss algebraic simplification and reduction in strength? Understand 11
10 Explain the various source language issues? Understand 10
11 Explain in detail the issues in design of a code generator? Understand 13
12 Demonstrate the simple code generator with a suitable example? Apply 13
13 List the different storage allocation strategies? Explain. Understand 12
14 (a) Write the procedure to detect induction variable with example? Understand 11
(b) With example explain dead code elimination?
(a) Explain how loop invariant computation can be eliminated?
15 (b) Explain how “Redundant sub-expression eliminates” can be Done in a Understand 11
given program?
UNIT – V
a) Explain the concept of object code forms?
b) Generate optimal machine code for the following C program.
main()
{
1 Apply 13
inti, a[10];
while (i<=10)
a[i] =0
}
2 Explain Machine dependent code optimization in detail with an example? Understand 14
(a) Discuss various object code forms?
3 Understand 13
(b) Write a short note on code generating algorithms?
Write about target code forms and explain how the instruction forms
4 Understand 14
effect the computation time?
5 Consider the following basic block of 3-address instructions: Apply 13

Department of CSE
a := b + c
x := a + b
b := a – d
c := b + c
d := a – d
y := a – d
Write the next-use information for each line of the basic block?
PART C (CRITICAL ANSWER QUESTIONS)

S. No Question
Level Outcome
UNIT – I
1. Define the term Interpreter? Remember 1
2. Define the term Tokens in lexical analysis phase? Understand 1
3. Explain about error Handler? Understand 1
4. Define a translator and types of translator? Understand 1
5. Explain about parser and its types? Understand 1
6. Construct NFA for (a/b)* and convert into DFA? Remember 2
7. Define bootstrap and cross compiler? Understand 1
8. Define pass and phase? Understand 3
Analyze the output of syntax analysis phase? What are the three general types
9. Remember 1
of parsers for grammars?
List the different strategies that a parser can employ to recover from a
10. Understand 1
syntactic error?
11. Explain the goals of error handler in a parser? Understand 3
12. How will you define a context free grammar? Remember 3
13. Define context free language. When will you say that two CFGs are equal? Remember 2
14. Give the definition for leftmost and canonical derivations? Understand 4
15. Define a parse tree? Understand 1
16. Explain an ambiguous grammar with an example? Apply 1
17. When will you call a grammar as the left recursive one? Apply 4
18. List different types of compiler? Remember 1
UNIT - II
1. Define go to function in LR parser with an example? Understand 5
2. Why SLR and LALR are more economical to construct Canonical LR? Understand 5
3. Explain about handle pruning? Understand 5
4. Explain types of LR parsers? Understand 5
5. List down the conflicts during shift-reduce parsing. Remember 5
UNIT – III
7 Define abstract or syntax tree? Understand 7
8 Show the DAG for a: =b *-c + b * -c? Apply 7
9 Translate a or b and not c into three address code? Apply 8
10 Define basic blocks? Understand 9
11 Discuss back-end and front-end? Understand 8
12 Define the primary structure preserving transformations on basic blocks? Understand 8
13 List common methods for associating actual and formal parameters? Understand 8
14 List various forms of target programs? Remember 8

Department of CSE
15 Define back patching? Understand 8

16 List different data structures used for symbol table? Remember 9
17 Explain the steps to search an entry in the hash table? Understand 9
18 List the different types of type checking? Explain? Understand 7
19 Explain general activation record? Understand 9
20 State the difference between heap storage and hash table? Understand 9
UNIT – IV
1. List the different data flow properties? Understand 11
2. Explain inner loops? Understand 11
3. Define flow graph? Understand 11
4. Define a DAG? Mention its Apply? Understand 12
5. Define peephole optimization? Understand 12
6. Explain machine instruction for operations and copy statement? Understand 12
7. Analyze global data flow? Understand 11
8. Explain about live variable analysis? Understand 10
9. Define the term copy propagation? Understand 11
10. Explain data flow equation? Understand 11
UNIT – V
Identify the register descriptor target code for the source language
statement
1. “(a-b) + (a-c) + (a-c);” Understand 13
The 3AC for this can be written as
t := a – b
2. Mention the properties that a code generator should possess. Apply 13
3. How do you calculate the cost of an instruction? Understand 14
4. How will you map names to values? Understand 14
5. Generate the code for x: =x+1 for target machine? Understand 14

Department of CSE
13. OPERATING SYSTEMS (A50510)

Course Title OPERATING SYSTEMS

Course Code A50510
Lectures Tutorials Practical’ Credits
Course Structure
5 - -s 4
Course Coordinator Mr. P. Dayakar
Team of Instructors Mr. Y. Madan Reddy
Mrs. Anitha

Operating systems course is intended as a general introduced to the techniques used to
implement operating systems and related kinds of systems software. The topics covered will
be functions and structure of operating systems, process management (creation,
synchronization, and communication); processor scheduling; deadlock prevention, avoidance,
and recovery; main-memory management; virtual memory management (swapping, paging,
segmentation and page-replacement-algorithms); control of disks and other input/output
devices; file-system structure and implementation; and protection and security.
13.2 PREREQUISITES:
Level Credits Periods / Prerequisites

Week Fundamentals of Computers, Basic data structures, computer
UG 4 5
organization, and a high-level language, such as C.
University End
Exam Marks
There shall be 2 midterm examinations. Each midterm examination
consists of subjective type and objective type tests. The subjective test is for
10 marks, with duration of 1 hour. Subjective test of each semester shall
contain 4 questions; the student has to answer 2 questions, each
carrying5marks.
The objective type test is for 10 marks with duration of 20minutes. It
consists of10 multiple choice and 10 objective type questions, the student
75 100
have to answer all the questions and each carry half mark.
First midterm examination shall be conducted for the first two and half units
of syllabus and second midterm examination shall be conducted for the
remaining portion.
Five marks are earmarked for assignments. There shall be two assignments
in every theory course. Marks shall be awarded considering the average of
two assignments in each course.

2 I Assignment --- 5

Department of CSE

4 II Assignment ---- 5
COURSE OBJECTIVES:
I. To understand main components of OS and their working
II. To study the operations performed by OS as a resource Manager
III. To understand the scheduling policies of OS
IV. To understand the different memory management techniques.
V. To understand process concurrency and synchronization
VI. To understand the concepts of input/output, storage and file management
VII. To study different OS and compare their features.

a. Ability to learn system and operating system architecture.
b. Ability to learn different functions of operating systems such as process management
,memory management, I/O management and File management
c. Implement algorithm of CPU Scheduling and disk scheduling
d. To be able to achieve emerging operating system trends architecture and its
functionalities
e. Ability to learn system and operating system architecture
f. Understands the concept of deadlocks and able to analyze a given situation leads to
deadlock or not
Proficiency
Assessed by
An ability to apply knowledge of computing, mathematical
foundations, algorithmic principles, and computer science and
Assignment, Exams,
a engineering theory in the modeling and design of computer-based S
Lectures
systems to real-world problems (fundamental engineering analysis
Skills).
Lectures
An ability to design and conduct experiments, as well as to analyze
b S Assignments
and interpret data (information retrieval skills).
, Tutorials
Assignments,
c component, or process to meet desired needs, within realistic H
tutorials, lectures
constraints.
An ability to function effectively on multi-disciplinary teams
d N -
(teamwork).
An ability to analyze a problem, and identify, formulate and use the
Lectures
e appropriate computing and engineering requirements for obtaining H
Tutorials
its solution (engineering problem solving skills).
An understanding of professional, ethical, legal, security and social Lectures
f S
issues and responsibilities (professional integrity). Assignments
An ability to communicate effectively, both in writing and orally
g N -
(speaking / writing skills).
The broad education necessary to analyze the local and global
h impact of computing and engineering solutions on individuals, S Examination
organizations, and society (engineering impact assessment skills).

Department of CSE
Recognition of the need for, and an ability to engage in continuing

i professional development and life-long learning (continuing N -
education awareness).
j A knowledge of contemporary issues (social awareness). N -

An ability to use current techniques, skills, and tools necessary for Lectures, Assignments
k computing and engineering practice(practical engineering analysis H Tutorials,
Skills) Exam
Graduates are able to participate and succeed in competitive
l examination S Tutorials
like GRE, GATE, TOEFL, GMAT etc.
The use of current application software; the design and use of
operating
Lectures,
m Systems; and the analysis, design, testing, and documentation of H
Assignments
computer programs for the use in information engineering
technologies.
The basic knowledge of electronics, electrical components, computer
Lectures,
n architecture and applications of micro computer systems, H
Assignments
communications needed in data transport.
N= None S= Supportive H = Highly Relate
13.7 SYLLABUS:
UNIT -I
Operating System Introduction :Operating Systems objectives and functions, computer
system architecture, OS structure, OS Operations, Evolution of Operating Systems-Simple
batch, Multi programmed, time shared, Personal Computer, Parallel, Distributed systems,
Real Time Systems, Special Purpose systems, Operating System Services, User OS interface,
system calls, Types of System calls, System Programs, Operating System Design and
Implementation, OS Structure, Virtual Machines.
UNIT -II
ProcessandCPUScheduling–Processconcepts–heProcess,ProcessState,ProcessControlBlock,
Threads, Process scheduling-Scheduling queues, Schedulers, Context Switch, Preemptive
scheduling, Dispatcher, Scheduling criteria, Scheduling algorithms, Multi-Processor
Scheduling, Real Time Scheduling, Thread scheduling, Case studies: Linux, windows.
Process Coordination-Process synchronization, the critical- section problem, Peterson’s
Solution, synchronization Hardware, semaphores, classic problems of synchronization,
monitors. Case studies UNIX, Linux, Windows.
UNIT -III
Memory Management and Virtual Memory- Logical & Physical Address, Swapping,
contiguous memory allocation, paging, structure of the page table, segmentation,
Segmentation with Paging, virtual memory, demand paging, Performance of Demand Paging,
page-Replacement, algorithms, Allocation of frames, Thrashing.
UNIT -IV
File system Interface- the concept of a file, Access Methods, Directory structure, File
system mounting, file sharing, protection.
FileSystemimplementation-
Filesystemstructure,filesystemimplementation,FileSystemStructure, File System
Implementation, Allocation methods, Free space Management, Directory Implementation,
Efficiency and Performance, Directory implementation, directory implementation, allocation
methods, free-space management, efficiency and performance,
Mass-storage structure: overview of Mass-storage structure, Disk structure, disk

Department of CSE
attachment disk scheduling, Disk Management, swap-space management.

UNIT-V
Principles of deadlock – system model, deadlock characterization, Methods of Handling
Deadlocks, deadlock prevention, Dead Lock Detection and Dead lock avoidance and
recovery form deadlock.
Protection: System Protection, Goals of Protection, Principles of Protection, Domain of
protection Access Matrix, Implementation of Access Matrix, Access control, Revocation of
Access Rights, Capability- Based systems, Language – Based Protection,
TEXT BOOK:
1. Operating System Principles. Abraham Silberchatz, Peter B.Galvin Greg Gagne,
th
8 Edition, Wiley Student Edition.
th
2. Operating Systems-Internals and Design Principles, W.Stallings 6 Edition, Pearson
REFERENCE BOOKS:
rd
1. Modern Operating Systems, Andrew S Tenenbaum, 3 Edition, PHI
nd
2. Operating System A Concept Based Approach, 2 Edition, D.M. Dhamdhere ,TMH
3. Principals of Operating Systems, B.L Stuart, Cengage learning India Edition
nd
4. Operating Systems, A.S.Godbole, 2 Edition, TMH
5. An Introduction to Operating Systems, P.C.P Bhatt, PHI
6. Operating Systems, S.Haldar and A.A. Aravind, Person Education
13.8 COURSEPLAN:
Lecture
Course Learning Outcomes Blooms Levels Topics to be covered Reference
No.
Understand the purpose of Operating Operating System Overview:
system. Explain the objectives and Understanding / Introduction, OS operations.
L1 T1:1.1-1.5
functionality of modern operating Comprehension http://nptel.ac.in/courses/10610
system. 8101/1
Describe how operating systems have Evolution of Operating
evolved over time from primitive batch Systems. T1:1.9-1.10
L2 Creating / Synthesis
systems to sophisticated multi user http://nptel.ac.in/courses/10610 T2: 1.2
systems. 8101/1
Operating system structures:
Explain the services provided by the T1:1.4, 1.6-
Operating System Services,
OS. Describe the functions of a Understanding / 1.8, 2.1-
L3-L4 System calls.
contemporary operating system with Comprehension 2.3
http://nptel.ac.in/courses/10610
respect to convenience, efficiency.
8101/3
Explain the concepts of logical layer, System Programs Operating
Understanding / T1 :2.5,2.6
benefits of building abstract layers in System Design and
L5-L6 Comprehension R1: 1.6
hierarchical fashion. Implementation
Virtual Machine
Explain the importance of Virtual Understanding /
L7 http://nptel.ac.in/courses/10610 T2:2.5
Machine. Comprehension
8101/3
Distinguish between a resource, a Process Management : Process
program and process. Understanding / Concept, Process State T1:3.1
L8
Explain the different states that a task Comprehension http://nptel.ac.in/courses/10610 T2: 3.1-3.2
may pass through. 8101/3
Explain the data structure needed to T1:3.1,
Understanding /
L9 support the management of many tasks. Process Control Block, Threads 4.1-4.5
Comprehension
Describe the difference between T2: 3.3, T2:

Department of CSE
process and threads 4

Describe reasons for using interrupt,
dispatching, context switching to
Scheduling queues, Process
support concurrency in an operating T1:5.1-5.2
L10- Understanding / schedulers,
system. T2: 9
L11 Comprehension Context Switching, Scheduling
Explain the characteristics that used to R1- 2.4
criteria.
compare various CPU scheduling
Algorithms.
Create a GANTT chart illustrating the
execution of set of processes following T1:5.3
L12-
Any scheduling algorithm. Creating / Synthesis Scheduling Algorithms T2- 9.2
L14
Compare the performance of the R1- 2.4
Scheduling Algorithms.
Multiprocessor Scheduling in T1:5.4
Explain about the multi core processors Understanding /
L15 Linux and T2: 10.3-10.6
systems. Comprehension
Windows R1- 2.4
Discuss how processor scheduling is T1:5.4
L16 done in real time systems and real time Creating / Synthesis Real Time Scheduling R1- 2.4.4
OS. T2:10.2
Discuss the importance of Thread
T1:5.5
L17 Scheduling in modern operating Creating / Synthesis Thread Scheduling
R1- 2.4.6
systems,
Recognize the critical resource and
Process Coordination, Process
explain the
Synchronization, Critical
behavior of semaphores
L18- Section T1:6.1-6.2
Summarize the range of mechanisms Creating / Synthesis
L20 Problem R1: 2.3
that can be employed at the operating
system level to realize concurrent
8101/6
systems.
Peterson solution for process
Describe reasons for using interrupts, synchronization,
T1:6.3-6.4
L21 dispatching, and context switching to Creating / Synthesis SynchronizationHardwarehttp://
R1:2.3
support concurrency in an OS nptel.ac.in/courses/106108101/
6
Explain the importance of Cooperating Semaphores, Classical
L22- process. Understanding / Problems of Synchronization, T1:6.5-6.7
L26 Describe the how the mechanism of Comprehension Monitorshttp://nptel.ac.in/cours R1: 2.3
process synchronization is achieved. es/106108101/6
Memory Management, Logical
Address Space and Physical
L27- Understanding / Address Space, Swapping and T1:8.1 -8.3
Explain about Memory Segmentation
L28 Comprehension Contiguous Allocation R1: 3
8101/4
Paging, Structure of Page
Table, Segmentation,
L29- Explain the paging and segmentation Understanding / T1:8.4-8.6
Segmentation with paging.
L31 techniques. Comprehension R1: 3.3
8101/4
Summarize the principals of virtual Virtual Memory, demand
memory as applied to caching and paging, performance of demand
L32- Understanding / T1:9.1-
paging. paging
L33 Comprehension 9.2R1:3.3
Analyze the performance of demand http://nptel.ac.in/courses/10610
paging. 8101/4
Describe various memory page
Page Replacement Algorithms
L34- replacement algorithms T1:9.4
Creating / Synthesis http://nptel.ac.in/courses/10610
L36 Evaluate and Analyze the performance R1: 3.4
8101/4
of the page replacement algorithms.
L37 Explain memory hierarchy and cost Understanding / Allocation of frames, Thrashing T1: 9.5-9.6

Department of CSE
performance tradeoffs Evaluate the Comprehension Case Study-Unix

tradeoffs in terms of memory size
(main memory, cache memory,
auxiliary memory) and processor speed.
Summarize the full range of
considerations that support file systems. File system interface, Access
L38- Compare and contrast different Understanding / Methods and Directory T1:10.1-10.3
L39 approaches to Comprehension structurehttp://nptel.ac.in/course R1: 4.1- 4.2
file organization, recognizing the s/106108101/2
strengths and weakness of each.
File system mounting, file
L40- Understanding / sharing protection. case study – T1:10.4-10.6
Explain about a File System.
L41 Comprehension Unixhttp://nptel.ac.in/courses/1 R1: 4.1- 4.2
06108101/2
File system structure, File
system implementation T1:11.1-11.2
L42 Describe a File System Implementation Creating / Synthesis
http://nptel.ac.in/courses/10610 R1: 4.3
8101/2
Describe how files are stored in File Allocation Methods,
L43 Creating / Synthesis T1: 11.3-11.4
secondary storage. Directory implementation
Summarize how hardware Free Space Management,
developments have lead to changes in Understanding / efficiency and performance, T1:11.5-11.6
L44
our priorities for the design and Comprehension comparison of Unix and R1: 4.4
management of file systems Windows
Analyze the various memory portioning Understanding /
L45
techniques. Comprehension Overview of Mass Storage T1: 12.1
Discuss about the disk structure and Structure T1:12.2-12.3
attachment
Describe and compare several
algorithms for Disk Scheduling algorithms
L47- T1:12.4
scheduling disk request, including Creating / Synthesis http://nptel.ac.in/courses/10610
L48 R1: 5.4
FCFS,SSTF, 8101/5
SCAN,C-SCAN and LOOK
Discuss the disk Initialization, booting
from disk and bad-block recovery
process. Disk Management, Swap Space T1:12.5-12.6
Discuss how the maximum throughput management R1:5.4
rate for virtual memory systems is
achieved.
Explain conditions that lead to Deadlocks: System model,
deadlock. deadlock characterization,
Understanding / T1:7.1-7.3
L50 Difference between deadlock , Handling deadlock
Comprehension R1: 6.2
starvation and race condition. Explain http://nptel.ac.in/courses/10610
how to handle a deadlock situation 8101/6
Deadlock prevention
Understanding / T1: 7.4
L51 Understand deadlock prevention http://nptel.ac.in/courses/10610
8101/6
Deadlock avoidance- Bankers
Understanding / Algorithm T1:7.5
L52 Understand deadlock Avoidance
Comprehension http://nptel.ac.in/courses/10610 R1: 6.5
8101/6
Deadlock Detection-Bankers
Algorithm
Understanding / T1:7.6-7.7
L53 Understand deadlock detection Recovery from Dead Lock
8101/6
System Protection, Goal of
Compare and contrast current methods Understanding /
L54 Protection T1:14.1
for implementing security Comprehension

Department of CSE
8101/9
Principals of Protection,
Explain the mechanism available in an Understanding / Domain of Protection,
L55 T1:14.2-14.3
OS to control access to resources. Comprehension http://nptel.ac.in/courses/10610
8101/10
Access Matrix, Implementation
L56- Describe the access control matrix and
Creating / Synthesis Access Matrix, Access Control, T1:14.4-14.7
L58 how it relates to ACL and C-Lists,
Revocation of Access Rights
L59- Describe Capability based system and Capability Based System,
Creating / Synthesis T1:14.8-14.9
L60 Language based protection. Language Based Protection.
13.9 MAPPING COURSE OBJECTIVE LEADING TO THE ACHIEVEMENT OF

PROGRAM OUTCOMES:

Objectives a b c d E f g h i j k I m n
I S S S S S H H
II S S H S H S S S
III S S H H S H S H H
IV H H H S S S H S S S
V S S S S S S S S S S
VI S H H S S S S S S S
VII H H H S S S S S H H
S=Supportive H = Highly Related

PROGRAM OUTCOMES:

Objectives a b c d E f g h i j K m n
A S S S H I
B H H S H H H
C S H H H H
D S S H S S S
E S S H S
F S S H S
13.11 OBJECTIVE BITS:
UNIT-I
1. _____ is a large kernel, including scheduling file system, networking, device
drivers, memory management and more.
A. Monolithic kernel
B. Micro kernel
C. Macro kernel
D. Mini kernel
Answer: A
2. The two central themes of modern operating system are...............
A. Multiprogramming and Distributed processing
B. Multiprogramming and Central Processing

Department of CSE
C. Single Programming and Distributed processing

D. None of above
Answer: A
3. Which of the following is/ are the part of operating system?
A. Kernel services
B. Library services
C. Application level services
D. All of the above
Answer: D
4. State True or False
i) In spooling high speed device like a disk is interposed between running program
and low-speed device in Input/output.
ii) By using spooling for example instead of writing directly to a printer, outputs are
written to the disk.
A. i-True, ii-False
B. i-True, ii-True
C. i-False, ii-True
D. i-False, ii-Fals
Answer: B
5. Which of the following is/are the functions of operating system?
i) Sharing hardware among users. iii) Recovering from errors.
v) Scheduling resources among users.
A. i, ii, iii and iv only
B. ii, iii, iv and v only
C. i, iii, iv and v only
D. All i, ii, iii, iv and v
ii) Allowing users to share data among themselves.
iv) Preventing users from interfering with one another.
Answer: D
6. With _____only one process can execute at a time; meanwhile all other process are
waiting for the processer. With ______more than one process can be running
simultaneously each on a different processer.
A. Multiprocessing, Multiprogramming
B. Multiprogramming, Uni processing
C. Multiprogramming, Multiprocessing
D. Uni programming, Multiprocessing
Answer: C
7. ___________is a example of an operating system that support single user process
and single thread.
A. UNIX
B. MS-DOS
C. OS/2
D. Windows 2000
Answer: A
8. _________ Involves treating main memory as a resource to be allocated to and
shared among a number of active processes.
A. Partition management
B. Memory management
C. Disk management
D. All of the above

Department of CSE
Answer: B
9. Which of the following is an operating system call?
A. CREATE
B. LINK
C. SYSTEM
D. All the above
Answer: D
10. What is Shell?
A. It is a hardware component.
B. It is a command interpreter
C. It is a part in compiler
D. It is a tool in CPU scheduling.
Answer: B
11. Let the time taken to switch between user and kernel modes of execution be t1
while the time taken to switch between two processes be t2. Which of the following
is TRUE?
A. t1 > t2
B. t1 = t2
C. t1 < t2
D. Nothing can be said about the relation between t1 and t2
Answer: C
12. Which concept explains the working of an Operating System?
A. It is event driven
B. It is object oriented
C. It is procedure based system software
D. It is a collection of procedures that interact with each other
Answer: A
13. Which of these is/are the desirable features of an Operating system
A. Extensible
B. Portable
C. Reliable
D. All of the above
Answer: D
14. More than one word are put in one cache block to
A. exploit the temporal locality of reference in a program
B. exploit the spatial locality of reference in a program
C. reduce the miss penalty
D. none of the above
Answer: B
15. Which of the following statements is false?
A. Virtual memory implements the translation of a program’s address space into
physical memory address space
B. Virtual memory allows each program to exceed the size of the primary memory
C. Virtual memory increases the degree of multiprogramming
D. Virtual memory reduces the context switching overhead
Answer: D
16. Which of the following need not necessarily be saved on a context switch between
processes?
A. General purpose registers
B. Translation look-aside buffer

Department of CSE
C. Program counter
D. All of the above
Answer: B
17. Where does the swap space reside?
A. RAM
B. Disk
C. ROM
D. On-chip cache
Answer: B
18. Increasing the RAM of a computer typically improves performance because:
A. Virtual memory increases
B. Larger RAMs are faster
C. Fewer page faults occur
D. Fewer segmentation faults occur
Answer: C
19. What is the swap space in the disk used for?
A. Saving temporary html pages
B. Saving process data
C. Storing the super-block
D. Storing device drivers
Answer: B
20. What is operating system?
A. collection of programs that manages hardware resources
B. system service provider to the application programs
C. link to interface the hardware and application programs
D. all of the mentioned
Answer: D
UNIT-II
1. Process is _________
A. A program in execution
B. An instance of a program running on a computer.
C. The entity that can be assigned to and executed
D. All of the above.
Answer: D
2. Switching the CPU to another process requires to save state of the old process and
loading new process state is called as
A. Process Blocking
B. Context Switch
C. Time Sharing
D. None of the above.
Answer: B
3. A Thread
A. Is a light weight process where the context switching is low
B. Is a light weight process where the context switching is high
C. Is used to speed up paging.
Answer: A
4. To avoid the race condition, the number of processes that may be simultaneously
inside their critical section is

Department of CSE
A. 8
B. 1
C. 16
D. 0
Answer: B
5. The strategy of allowing processes that are logically run able to be temporarily
suspended is called
A. Preemptive Scheduling
B. Non Preemptive Scheduling
C. Shortest Job first
D. First come First Serve.
Answer: A
6. Inter process communication
A. Is required for all processes
B. Is used done via disk drives
C. Is never necessary
D. Allows processes to synchronize activity.
Answer: D
7. Following is/are the reasons for process suspension
A. Swapping parent process
B. Inter request
C. Timing
D. All the above.
Answer: D
8. ............. Executes must frequently and makes the fine grained decision of which
process to execute the next.
A. Long-term scheduling
B. Medium-term scheduling
C. Short-term scheduling
Answer: C
9. State which statement is true for Suspended process?
i) The process is not immediately available for execution.
ii) The process may be removed from suspended state automatically without removal
order.
A. i only
B. ii only
C. i and ii only
D. None.
Answer: C
10. For which of the following policy can we expect the average waiting time to be the
shortest?
A. First Come first served
B. Last come first served
C. Longest job last
D. Random selection of jobs.
Answer: D
11. Consider the following code fragment:
if (fork() == 0)
{ a = a + 5; printf("%d,%d\n", a, &a); }

Department of CSE
else { a = a –5; printf("%d, %d\n", a, &a); }

Let u, v be the values printed by the parent process, and x, y be the values printed by the
child process. Which one of the following is TRUE?
A. u = x + 10 and v = y
B. u = x + 10 and v != y
C. u + 10 = x and v = y
D. u + 10 = x and v != y
Answer: C
12. The atomic fetch-and-set x, y instruction unconditionally sets the memory location
x to 1 and fetches the old value of x in y without allowing any intervening access to
the memory location x. consider the following implementation of P and V functions
on a binary semaphore .
void P (binary_semaphore *s) {
unsigned y;
unsigned *x = &(s->value);
do {
fetch-and-set x, y;
} while (y);
}
void V (binary_semaphore *s) {

S->value = 0;
}
Which one of the following is true?
A. The implementation may not work if context switching is disabled in P.
B. Instead of using fetch-and-set, a pair of normal load/store can be used
C. The implementation of V is wrong
D. The code does not implement a binary semaphore
Answer A
13. Three concurrent processes X, Y, and Z execute three different code segments that
access and update certain shared variables. Process X executes the P operation
(i.e., wait) on semaphores a, b and c; process Y executes the P operation on
semaphores b, c and d; process Z executes the P operation on semaphores c, d, and
a before entering the respective code segments. After completing the execution of
its code segment, each process invokes the V operation (i.e., signal) on its three
semaphores. All semaphores are binary semaphores initialized to one. Which one
of the following represents a deadlockfree order of invoking the P operations by
the processes?
A. X: P(a)P(b)P(c) Y:P(b)P(c)P(d) Z:P(c)P(d)P(a)
B. X: P(b)P(a)P(c) Y:P(b)P(c)P(d) Z:P(a)P(c)P(d)
C. X: P(b)P(a)P(c) Y:P(c)P(b)P(d) Z:P(a)P(c)P(d)
D. X: P(a)P(b)P(c) Y:P(c)P(b)P(d) Z:P(c)P(d)P(a)
Answer B
14. A shared variable x, initialized to zero, is operated on by four concurrent processes
W, X, Y, Z as follows. Each of the processes W and X reads x from memory,
increments by one, stores it to memory, and then terminates. Each of the processes
Y and Z reads x from memory, decrements by two, stores it to memory, and then
terminates. Each process before reading x invokes the P operation (i.e., wait) on a
counting semaphore S and invokes the V operation (i.e., signal) on the semaphore
S after storing x to memory. Semaphore S is initialized to two. What is the
maximum possible value of x after all processes complete execution?
A. -2

Department of CSE
B. -1
C. 1
D. 2
Answer D
15. The following two functions P1 and P2 that share a variable B with an initial value
of 2 execute concurrently.
P1()
{
C = B – 1;
B = 2*C;
}
P2()
{
D = 2 * B;
B = D - 1;
}
The number of distinct values that B can possibly take after the execution is
A. 3
B. 2
C. 5
D. 4
Answer A
16. A certain computation generates two arrays a and b such that a[i]=f(i) for 0 ≤ i < n
and b[i]=g(a[i]) for 0 ≤ i < n. Suppose this computation is decomposed into two
concurrent processes X and Y such that X computes the array a and Y computes
the array b. The processes employ two binary semaphores R and S, both initialized
to zero. The array a is shared by the two processes. The structures of the processes
are shown below.
Process X: Process Y:
private i; private i;
for (i=0; i < n; i++) { for (i=0; i < n; i++) {
a[i] = f(i); EntryY(R, S);
ExitX(R, S); b[i]=g(a[i]);
} }
Which one of the following represents the CORRECT implementations of ExitX and
EntryY?
(A)
ExitX(R, S) {
P(R);
V(S);
}
EntryY (R, S) {
P(S);
V(R);
}
(B)
ExitX(R, S) {
V(R);
V(S);
}
EntryY(R, S) {
P(R);
P(S);
}
(C)

Department of CSE
ExitX(R, S) {
P(S);
V(R);
}
EntryY(R, S) {
V(S);
P(R);
}
(D)
ExitX(R, S) {
V(R);
P(S);
}
EntryY(R, S) {
V(S);
P(R);
}
Answer C
17. A shared variable x, initialized to zero, is operated on by four concurrent processes
W, X, Y, Z as follows. Each of the processes W and X reads x from memory,
increments by one, stores it to memory, and then terminates. Each of the processes
Y and Z reads x from memory, decrements by two, stores it to memory, and then
terminates. Each process before reading x invokes the P operation (i.e., wait) on a
counting semaphore S and invokes the V operation (i.e., signal) on the semaphore
S after storing x to memory. Semaphore S is initialized to two. What is the
maximum possible value of x after all processes complete execution?
A. -2
B. -1
C. 1
D. 2
Answer D
18. A process executes the code
fork();
fork();
fork(); Gate 2006
The total number of child processes created is
A. 3
B. 4
C. 7
D. 8
Answer C
19. Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the
value of memory location X, increments it by the value i, and returns the old value
of X. It is used in the pseudocode shown below to implement a busy-wait lock. L is
an unsigned integer shared variable initialized to 0. The value of 0 corresponds to
lock being available, while any non-zero value corresponds to the lock being not
available. Gate 2008
AcquireLock(L){
while (Fetch_And_Add(L,1))
L = 1;
}
ReleaseLock(L){
L = 0;
}
This implementation

Department of CSE
A. fails as L can overflow

B. fails as L can take on a non-zero value when the lock is actually available
C. works correctly but may starve some processes
D. works correctly without starvation
Answer B
20. The atomic fetch-and- set x, y instruction unconditionally sets the memory location
x to 1 and fetches the old value of x n y without allowing any intervening access to
the memory location x.
consider the following implementation of P and V functions on a binary
semaphore S.
void P (binary_semaphore *s)
{
unsigned y;
unsigned *x = &(s->value);
do
{
fetch-and- set x, y;
}
while (y);
}
void V (binary_semaphore *s)
{
S->value = 0;
}
Which one of the following is true?
A. The implementation may not work if context switching is disabled in P
B. Instead of using fetch-and –set, a pair of normal load/store can be used
C. The implementation of V is wrong
D. The code does not implement a binary semaphore
Answer A
UNIT-III
1. Which of the following are encompassed within primary memory management
operations:
A. The allocation of main memory to programs
B. The garbage collection to achieve compaction
C. Managing the process control block
D. Protection to user data when a user exceeds his allocated data area allocation.
Answer:
2. Once a program is compiled, it can be loaded for execution
A. Only from the compiler generated starting address
B. Anywhere in the main memory
C. User needs to specify where the compiled code is to be loaded
D. It is loaded starting from address 0 in the main memory
Answer: D
3. Indicate which amongst the following statements are true for virtual memory.
A. It allows for multiple users to use the system
B. It enhances scope for multi-programming
C. It extends the address space
D. It reduces external fragmentation as well as internal fragmentation.

Department of CSE
Answer: A
4. Paging was prompted by what form of reasoning:
A. Because on compilation the program code is paginated.
B. Because program display a strong locality of reference.
C. Because we print programs on pages
D. None
Answer: A
5. Which of the following are the likely causes of thrashing?
A. Because there are too many users connected to the system
B. Because the page size was very small
C. Because we followed a first in first out policy
D. Because we followed a least recently used policy for page replacement
Answer: B
6. The typical page size may be
A. Usually between 10 and100 bytes
B. Usually of 512 to 2k bytes
C. More than 100 KB bytes but less than 1 MB
D. Minimally 1 MB
Answer: C
7. Which one of the following is the address generated by CPU?
A. physical address
B. absolute address
C. logical address
D. none of the mentioned
Answer: C
8. The address of a page table in memory is pointed by
A. stack pointer
B. page table base register
C. page register
D. program counter
Answer: B
9. The segment base contains the:
A. starting logical address of the process
B. starting physical address of the segment in memory
C. segment length
D. None of these
Answer: B
10. Each entry in a segment table has a:
A. segment base
B. segment peak
C. segment limit
D. segment value
Answer: A, C
11 A computer system supports 32-bit virtual addresses as well as 32-bit physical
addresses. Since the virtual address space is of the same size as the physical
address space, the operating system designers decide to get rid of the virtual
memory entirely. Which one of the following is true?
A. Efficient implementation of multi-user support is no longer possible
B. The processor cache organization can be made more efficient now
C. Hardware support for memory management is no longer needed

Department of CSE
D. CPU scheduling can be made more efficient now

Answer C
12 A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor
has a translation look-aside buffer (TLB) which can hold a total of 128 page table
entries and is 4-way set associative. The minimum size of the TLB tag is:
A. 11 bits
B. 13 bits
C. 15 bits
D. 20 bits
Answer C
13 A virtual memory system uses First In First Out (FIFO) page replacement policy
and allocates a fixed number of frames to a process. Consider the following
statements:
P: Increasing the number of page frames allocated to a process sometimes
increases the page fault rate.
Q: Some programs do not exhibit locality of reference. Which one of the following
is TRUE?
A. Both P and Q are true, and Q is the reason for P
B. Both P and Q are true, but Q is not the reason for P.
C. P is false, but Q is true
D. Both P and Q are false.
Answer B
14 A processor uses 36 bit physical addresses and 32 bit virtual addresses, with a page
frame size of 4 Kbytes. Each page table entry is of size 4 bytes. A three level page
table is used for virtual to physical address translation, where the virtual address
is used as follows
• Bits 30-31 are used to index into the first level page table
• Bits 21-29 are used to index into the second level page table
• Bits 12-20 are used to index into the third level page table, and
• Bits 0-11 are used as offset within the page
The number of bits required for addressing the next level page table (or page
frame) in the page table entry of the first, second and third level page tables are
respectively
A. 20, 20 and 20
B. 24, 24 and 24
C. 24, 24 and 20
D. 25, 25 and 24
Answer D
15 A multilevel page table is preferred in comparison to a single level page table for
translating virtual address to physical address because
A. It reduces the memory access time to read or write a memory location.
B. It helps to reduce the size of page table needed to implement the virtual address
space of a process.
C. It is required by the translation lookaside buffer.
D. It helps to reduce the number of page faults in page replacement algorithms.
Answer B
16 In which one of the following page replacement policies, Belady’s anomaly may
occur?
A. FIFO
B. Optimal

Department of CSE
C. LRU
D. MRU
Answer A
17 The essential content(s) in each entry of a page table is / are
A. Virtual page number
B. Page frame number
C. Both virtual page number and page frame number
D. Access right information
Answer B
18 A system uses FIFO policy for page replacement. It has 4 page frames with no
pages loaded to begin with. The system first accesses 100 distinct pages in some
order and then accesses the same 100 pages but now in the reverse order. How
many page faults will occur?
A. 196
B. 192
C. 197
D. 195
Answer A
19 Let the page fault service time be 10ms in a computer with average memory access
time being 20ns. If one page fault is generated for every 10^6 memory accesses,
what is the effective access time for the memory?
A. 21ns
B. 30ns
C. 23ns
D. 35ns
Answer B
20 Consider the virtual page reference string
1, 2, 3, 2, 4, 1, 3, 2, 4, 1
On a demand paged virtual memory system running on a computer system that
main memory size of 3 pages frames which are initially empty. Let LRU, FIFO
and OPTIMAL denote the number of page faults under the corresponding page
replacements policy. Then
A. OPTIMAL < LRU < FIFO
B. OPTIMAL < FIFO < LRU
C. OPTIMAL = LRU
D. OPTIMAL = FIFO
Answer B
UNIT-IV
1. By using the specific system call, we can
A. open the file
B. read the file
C. write into the file
Answer: D
2. File type can be represented by
A. file name
B. file extension
C. file identifier

Department of CSE
Answer: B
3. Data cannot be written to secondary storage unless written within a ______.
A. file
B. swap space
C. directory
D. text format
Answer: A
4. The information about all files is kept in:
A. swap space
B. operating system
C. separate directory structure
D. None of these
Answer: C
5. In UNIX, the open system call returns:
A. pointer to the entry in the open file table
B. pointer to the entry in the system wide table
C. a file to the process calling it
D. None of these
Answer: A
6. The directory can be viewed as a _________ that translates file names into their
directory entries.
A. symbol table
B. partition
C. swap space
D. cache
Answer: A
7. When a user job starts in a two level directory system, or a user logs in :
A. the users user file directory is searched
B. the system’s master file directory is searched
C. the master file directory is indexed by user name or account number, and each
entry points to the UFD for that user
D. All of these
Answer: B, C
8. In the tree structured directories,
A. the tree has the stem directory
B. the tree has the leaf directory
C. the tree has the root directory
D. All of these
Answer: C
9. A server crash and recovery will __________ to a client.
A. be visible
B. affect
C. be invisible
D. harm
Answer: C
10. The server must write all NFS data ___________.
A. synchronously
B. asynchronously
C. index-wise
D. None of these

Department of CSE
Answer: A
11. A computer system supports 32-bit virtual addresses as well as 32-bit physical
addresses. Since the virtual address space is of the same size as the physical
address space, the operating system designers decide to get rid of the virtual
memory entirely. Which one of the following is true?
A. Efficient implementation of multi-user support is no longer possible
B. The processor cache organization can be made more efficient now
C. Hardware support for memory management is no longer needed
D. CPU scheduling can be made more efficient now
Answer C
12. A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor
has a translation look-aside buffer (TLB) which can hold a total of 128 page table
entries and is 4-way set associative. The minimum size of the TLB tag is:
A. 11 bits
B. 13 bits
C. 15 bits
D. 20 bits
Answer C
13. A virtual memory system uses First In First Out (FIFO) page replacement policy
and allocates a fixed number of frames to a process. Consider the following
statements:
P: Increasing the number of page frames allocated to a process sometimes
increases the page fault rate.
Q: Some programs do not exhibit locality of reference. Which one of the following
is TRUE?
Both P and Q are true, and Q is the reason for P(B) Both P and Q are true, but Q is not
the reason for P.
(C) P is false, but Q is true
(D) Both P and Q are false.
Answer (B)
14. A processor uses 36 bit physical addresses and 32 bit virtual addresses, with a page
frame size of 4 Kbytes. Each page table entry is of size 4 bytes. A three level page
table is used for virtual to physical address translation, where the virtual address
is used as follows
• Bits 30-31 are used to index into the first level page table
• Bits 21-29 are used to index into the second level page table
• Bits 12-20 are used to index into the third level page table, and
• Bits 0-11 are used as offset within the page
The number of bits required for addressing the next level page table (or page
frame) in the page table entry of the first, second and third level page tables are
respectively
A. 20, 20 and 20
B. 24, 24 and 24
C. 24, 24 and 20
D. 25, 25 and 24
Answer (D)
15. A multilevel page table is preferred in comparison to a single level page table for
translating virtual address to physical address because
A. It reduces the memory access time to read or write a memory location.

Department of CSE
B. It helps to reduce the size of page table needed to implement the virtual address
space of a process.
C. It is required by the translation lookaside buffer.
D. It helps to reduce the number of page faults in page replacement algorithms.
Answer (B)
16. In which one of the following page replacement policies, Belady’s anomaly may
occur?
A. FIFO
B. Optimal
C. LRU
D. MRU
Answer (A)
17. The essential content(s) in each entry of a page table is / are
A. Virtual page number
B. Page frame number
C. Both virtual page number and page frame number
D. Access right information
Answer B
18. A system uses FIFO policy for page replacement. It has 4 page frames with no
pages loaded to begin with. The system first accesses 100 distinct pages in some
order and then accesses the same 100 pages but now in the reverse order. How
many page faults will occur?
A. 196
B. 192
C. 197
D. 195
Answer A
19. Let the page fault service time be 10ms in a computer with average memory access
time being 20ns. If one page fault is generated for every 10^6 memory accesses,
what is the effective access time for the memory?
A. 21ns
B. 30ns
C. 23ns
D. 35ns
Answer B
20. Consider the virtual page reference string
1, 2, 3, 2, 4, 1, 3, 2, 4, 1
On a demand paged virtual memory system running on a computer system that
main memory size of 3 pages frames which are initially empty. Let LRU, FIFO
and OPTIMAL denote the number of page faults under the corresponding page
replacements policy. Then
A. OPTIMAL < LRU < FIFO
B. OPTIMAL < FIFO < LRU
C. OPTIMAL = LRU
D. OPTIMAL = FIFO
Answer B
UNIT-V
1. A direct method of deadlock prevention is to prevent the occurrences of ................
A. Mutual Exclusion.

Department of CSE
B. Hold and Wait

C. Circular Wait
D. Non Preemption.
Answer: C
2. _________Refers to a situation in which a process is ready to execute but is
continuously denied access to a processor in deference to other processes.
A. Synchronization
B. Mutual Exclusion
C. Deadlock
D. Starvation
Answer: B
3. A system is in the safe state if
A. the system can allocate resources to each process in some order and still avoid a
deadlock
B. there exist a safe sequence
C. both (a) and (b)
Answer: C
4. What is the drawback of banker’s algorithm?
A. in advance processes rarely know that how much resource they will need
B. the number of processes changes as time progresses
C. resource once available can disappear
Answer: C
5. To avoid deadlock
A. there must be a fixed number of resources to allocate
B. resource allocation must be done only once
C. all deadlocked processes must be aborted
D. inversion technique can be used
Answer: C
6. A deadlock avoidance algorithm dynamically examines the __________, to ensure
that a circular wait condition can never exist.
A. resource allocation state
B. system storage state
C. operating system
D. resources
Answer: A
7. Domain structure what is Access-right equal to ?
A. Access-right = object-name, rights-set
B. Access-right = read-name, write-set
C. Access-right = read-name, execute-set
D. Access-right = object-name, execute-set .
Answer: A
8. The pattern that can be used to identify a virus is known as
A. stealth
B. virus signature
C. armored
D. multipartite
Answer: B
9. File virus attaches itself to the

Department of CSE
A. source file
B. object file
C. executable file
Answer: C
10. In asymmetric encryption
A. same key is used for encryption and decryption
B. different keys are used encryption and decryption
C. no key is required for encryption and decryption
Answer: B
11. Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be processes.
Suppose each process P[i] executes the following:
wait (m[i]); wait(m[(i+1) mode 4]);
-- -- --
release (m[i]); release (m[(i+1)mod 4]);
This could cause
A. Thrashing
B. Deadlock
C. Starvation, but not deadlock
Answer B
12. The enter_CS() and leave_CS() functions to implement critical section of a process
arerealized using test-and- set instruction as follows:
void enter_CS(X)
while test-and- set(X) ;
void leave_CS(X)
X = 0;
In the above solution, X is a memory location associated with the CS and is
initialized to 0. Now consider the following statements:
I. The above solution to CS problem is deadlock-free
II. The solution is starvation free.
III. The processes enter CS in FIFO order.
IV More than one process can enter CS at the same time.
Which of the above statements is TRUE?
A. I only
B. I and II
C. II and III
D. IV only
Answer A
13. Consider the following snapshot of a system running n processes. Process i is
holding Xi instances of a resource R, 1 <= i <= n. currently, all instances of R
are occupied. Further, for all i, process i has placed a request for an additional Yi
instances while holding the Xi instances it already has. There are exactly two
processes p and q such that Yp = Yq = 0. Which one of the following can serve as a
necessary condition to guarantee that the system is not approaching a deadlock?
A. min (Xp, Xq) < max (Yk) where k != p and k != q
B. Xp + Xq >= min (Yk) where k != p and k!= q
C. max (Xp, Xq) > 1
D. min (Xp, Xq) > 1

Department of CSE
Answer B
14. Which of the following is NOT true of deadlock prevention and deadlock
avoidance schemes?
A. In deadlock prevention, the request for resources is always granted if the resulting
state is safe
B. In deadlock avoidance, the request for resources is always granted if the result
state is safe
C. Deadlock avoidance is less restrictive than deadlock prevention
D. Deadlock avoidance requires knowledge of resource requirements a priori
Answer A
15. Before proceeding with its execution, each process must acquire all the resources it
needs is called
A. pre-emption.
B. circular wait.
C. hold and wait
D. deadlock.
Answer C
16. In domain structure what is Access-right equal to ?
A. Access-right = object-name, rights-set
B. Access-right = read-name, write-set
C. Access-right = read-name, execute-set
D. Access-right = object-name, execute-set
Answer A
17. What does access matrix represent ?
A. Rows-Domains, Columns-Objects
B. Rows-Objects, Columns-Domains
C. Rows-Access List, Columns-Domains
D. Rows-Domains, Columns-Access list
Answer A
18. What are the three copy rights ?
A. Copy
B. transfer
C. limited copy
D. owner
Answer a,b,c
19. If we preempt a resource from a process, the process cannot continue with its
normal execution and it must be :
A. aborted
B. rolled back
C. terminated
D. queued
Answer B
20. Each request requires that the system consider the __________, _____________,
____________ to decide whether the current request can be satisfied or must wait
to avoid a future possible deadlock. (choose three)
A. resources currently available
B. processes that have previously been in the system
C. resources currently allocated to each process
D. future requests and releases of each process

Department of CSE
Answer a, c and d
13.12 ASSIGNMENT QUESTION BANK

PART A (SHORT ANSWER QUESTIONS)
Blooms
Course
Outcome
Level
UNIT – I
1. Justify language approach {Level V} Analyze f
2. Elaborate an operating system ?Explain Unix system structure {Level VI} Evaluate a
Modify various components of operating–system structure explains the simple
3. Create c
and layered approach of operating system in details. {Level VI}
a) In a multi programming and time –sharing environment, several users
share the systems imultaneously, This situation can result in various
security problem:
4. Analyze b
i) What are two such problem?
ii) Can be ensure the same degree of security in a time-shared machine as in a
dedicated machine? Explain your answer {Level V}
5. Purpose is dual Mode of Operation{Level V} Analyze f
UNIT – II
Construct an example to compare the Shortest Job First strategy of processor
1 scheduling with a Longest Job First strategy, in terms of processor utilization, Create d
turnaround time and throughput {Level VI}
Elaborate classic problems of synchronization.
2. Remember e
a) Compute the need for mutual exclusion?{Level VI}
(b) Justify a critical resource?{Level V} Create/
3 a
(c) Estimate a critical section?{Level VI} Evaluate
(d) Evaluate the starvation?{Level V}
In this problem you are to compare reading a file using a single-threading file
server and a multithreaded server. It takes 15 msec to get a request for work,
dispatch it, and do the rest of the necessary processing, assuming that the data
4 needed are in the block cache. If a disk operation is needed, as is the case Create c
one-thread of the time, an additional 75 msec is required, during which time
the thread sleeps. How many requests/sec can the server handle if it single
threaded? If it is multithreaded?{Level VI}
a) State and explain the various fields of a process control block.
b) Consider the following four processes, with the length of the CPU burst
given inmilli seconds.
Process Arrival time Burst time
P1 0 8
5. P2 1 4 Create f
P3 2 9
P4 3 5
Calculate the average waiting time for
i) Preemptive SJF schedule
ii) Non preemptive SJF schedule. {Level VI}
UNIT-III
1. Elaborate paging ?Compute Demand paging {Level VI} Create b
Estimate the page replacement Algorithms?
2. Evaluate c
Determine types of page replacement Algorithms{Level V}
3. Justify Segmentation and Thrashing {Level V} Evaluate c
Consider the following page-reference string 2 3 2 15 2 4 5 3 2 5 2 How
4. Create a
many pages faults occur for the following replacement algorithms, assuming

Department of CSE
three frames? 1.FIFO 2.LRU 3.OPTIMAL {Level VI}

Give memory partition of 100 K,500 K,200 K,300 K and 600 K(in order)
how would each of the first fit, best fit and worst fit algorithm place process
of 212K,417, 112, and 426 (in order) ? Which algorithm makes the most
efficient use memory?
Consider the following page reference string: 1, 2, 3,4, 2, 1, 5, 6, 2, 1, 2, 3, 7,
5. Create c
6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the following
replacement algorithms, assuming one, two, three, four, five, six, or seven
frames? Remember all frames are initially empty, so your first unique pages
will all cost one fault each. a) LRU replacement b) FIFO replacement c)
Optimal replacement {Level VI}
UNIT – IV
A file system with 300 G Byte uses a file descript or with 8 direct block
address. 1 indirect block address and 1 doubly indirect block address. The size
1 Create f
of each disk block is 128 Bytes and the size of each disk block address is 8
Bytes. The maximum possible file size in this file system. {Level VI}
Consider a disk system with 100 cylinders. The requests to access the
cylinders occur in followingsequence:4, 34, 10, 7, 19, 73, 2, 15, 6,
2 20Assuming that the head is currently at cylinder 50, what is the time taken to Create e
satisfy all requests if it takes1ms to move from one cylinder to adjacent one
and shortest seek time first policy is used?{Level VI}
Consider a system that supports 5,000 users. Suppose that you want to allow
4,990 of these users to be able to access one file. a). How would you specify
3 this protection scheme in UNIX? Create e
b) Can you suggest another protection scheme that can be used more
effectively for this purpose than the scheme provided by UNIX?{Level VI}
Justify various techniques implemented for free space management, discuss
4 Evaluate f
With suitable examples. {Level V}
(a) Elaborate different criteria for choosing a file organization. {Level VI}
5 (b) Formulate the indexed file, indexed sequential file organization.{Level Evaluate d
VI}
6 Elaborate allocation methods of secondary storage methods {Level VI} Create c
UNIT – V
a) justify is deadlock? State the necessary condition for deadlock? {level V} Evaluate&
1. c
b) compile any one Strategy of prevention {level VI} Create
Interpret how we elimination deadlock by resource preemption can-selection
2. Create b
a victim –Rollback-starvation {Level VI}
Determine how can we eliminating deadlock by aborting a process-Abort all
3. deadlock processes-Abort 1 process at a time until the deadlock cycle is Create c
eliminated {Level VI}
4. justify about system protection?{Level V} Evaluate a
Suppose that a system is in an unsafe state. Show that it is possible for the
processes to complete their execution without entering a deadlock state.
Answer: An unsafe state may not necessarily lead to deadlock, it just a system
5. Evaluate f
is in an unsafe state. Show that it is possible for the processes to complete
their execution without entering a deadlock state. Answer: An un safe state
may not necessarily lead to deadlock, it just{Level VI}
PART B (LONG ANSWER QUESTIONS)

S. No Question
Level Outcome
UNIT – I
1 Application of Interrupt processing {Level III} Apply b
2 Differentiate between programmed I/O & interrupt drive I/O {Level IV} Analyze a
3 Classify operating systems, give one example for each type{level IV} Analyze f

Department of CSE
4. Compare hard and soft Real time system{level IV} Analyze c

5. Difference between symmetric and asymmetric multiprocessor{Level IV} Analyze e
UNIT-II
1. scheduling with a Longest Job First strategy, in terms of processor utilization, Create a
(a) Compute the need for mutual exclusion? {Level VI}
(b) Justify a critical resource? {Level V}
2. Analyze Evaluate d
(c) Estimate a critical section?{Level VI}
given in milliseconds.
P1 0 8
3. P2 1 4 Evaluate b
P3 2 9
P4 3 5
ii) Non preemptive SJF schedule. {Level IV}
Five batch jobs A through E, arrive at computer center at almost the same time.
They have estimated running times of 10,6,2,4 and 8 minutes. Their (externally
determined) priorities are 3,5,2,1 and 4, respectively, with 5 being the highest
priority. for each of the following scheduling algorithms, determine the mean
4. process turn -around time . Ignore process switching overhead. Evaluate Analyze c
a) Round robin
b) priority scheduling
c) First come, First served(run in order 10,6,2,4,8)
d) shortest job first {Level V}
5. Define a process? Analyze different process states {Level IV} b
UNIT-III
Summarize the page replacement algorithms On a system using simple
segmentation, compute the physical address for each of the logical address is
given in the following segment table. If the address generate fault, indicate so.
Segment Base Length
1. 0 330 124 Create e
1 867 211
2 111 99
3 498 302
2 a)0,99 b) 2,78 c) 1,265 c) 3,222 d)0,111 Apply d
Memory partition with used and unused block are given in the following fig.
Additional request 200k, 100k, and 50k (in the order) are received. At what
3. starting address will each of the additional requests be allocated for following Create c
allocation?
1. First fit 2. Best fit{Level VI}
Consider a paging hardware with a TLB. Assume that the entire page table and
all the pages are in the physical memory. It takes 10milliseconds to search the
4. TLB and 80 milliseconds to access the physical memory. If the TLB hit ratio is Apply f
0.6. Calculate the effective memory access time (in milliseconds) is
_________.(GATE : 2014, Paper III)
UNIT-IV
Suppose that we agree that 1 kilobyte is 1,024 bytes, 1 megabyte is1,0242
bytes, and 1 gigabyte is 1,0243 bytes. This progression continues through
1. terabytes, pet bytes, and Exabyte’s (1, 0246). Several proposed scientific Apply d
projects plan to record and store a few Exabyte’s of data during the next decade.
Calculate

Department of CSE
a) How many disk drives would be required to hold 4exabytes of data?

b) How many magnetic tapes would be required to hold 4exabytes of data?
c) How many optical tapes would be required to hold 4exabytes of data
d) How many holographic storage cartridges would be required to hold 4 exa
bytes of data?
e) How many cubic feet of storage space would each option require?
Consider a file currently consisting of 100 blocks. Assume that the file control
block (and the index block, in the case of indexed allocation)is already in
memory. Calculate how many disk I/O operations are required for contiguous,
linked, and indexed (single-level) allocation strategies, if, for one block, the
following conditions hold. In the contiguous-allocation case, assume that there
is no room to grow at the beginning but there is room to grow at the end. Also
2. assume that the block information to be added is stored in memory. Apply c
a) The block is added at the beginning.
b) The block is added in the middle.
c) The block is added at the end.
d) The block is removed from the beginning.
e) The block is removed from the middle.
f) The block is removed from the end.
Consider a hard disk with 16 recording surfaces (0 −15 ) having
16384cylinders (0 - 16383 ) and each cylinder contains 64 sectors (0 − 63 )
.Data storage capacity in each sector is 512 bytes. Data are organized cylinder–
3. wise and the addressing format is. A file of size 42797 KB is stored in the disk Apply b
and the starting disk location of the file is. Calculate is the cylinder number of
the last sector of the file, if it is stored in a contiguous manner?
(A) 1281 (B) 1282 (C) 1283 (D) 1284
4. Interpret briefly on mass storage structure? Evaluate b
A FAT (file allocation table) based file system is being used and the total
overhead of each entry in the FAT is 4 bytes in size. Given a 100 x 106bytes
5. disk on which the file system is stored and data block size is 103bytes, Apply d
Calculate the maximum size of a file that can be stored on this disk
in units of 106 bytes . GATECSE: 2015
UNIT-V
Can a system detect that some of its processes are starving? Justify If you
1. answer “yes,” explain how it can. If you answer “no,” explain how the system Evaluate f
can deal with the starvation problem.
A possible method for preventing deadlocks is to have a single, higher order
resource that must be requested before any other resource. For example, if
multiple threads attempt to access the synchronization objects A· · · E,
deadlock is possible. (Such synchronization objects may include mutexes,
semaphores, condition variables, and the like.)We can prevent the deadlock by
2. Evaluate c
adding a sixth object F. Whenever a thread wants to acquire the
synchronization lock for any object A· · · E, it must first acquire the lock for
object F. This solution is known as containment: the locks for objects A· · ·
Eare contained within the lock for object F. Compare this scheme with the
circular-wait scheme
Two processes X and Y need to access a critical section. Consider the
3. Analyze b
following synchronization construct used by both the processes

Department of CSE
Process X Process Y
/*other code /*other code
for process X*/ for Process Y*/
while(true) while(true)
{ {
Var P=true; varQ = true;
While(var while(var
Q==true) P==true)
{ {
/*critical /*critical
section*/ section*/
varP=false; varQ=false;
} }
} }
for Process X*/ for process Y*/
Here var P and var Q are shared variables and both are initialized to false.
Which one of the following statements is true.
Estimate the operating system contains 3 resources, the number of instance of
each resource type 7,7,10. The current allocation state is as shown below
Current allocation Maximum need
process
R1 R2 R3 R1 R2 R3
4. P1 2 2 3 3 6 8 Create c
P2 2 0 3 4 3 3
P3 1 2 4 3 4 4
1.Is the current allocation in a safe state
2. Can the request made by process p1(1 1 0) be granted? {Level VI}
5. Differentiate between capability lists and access lists? Analyze f
A Burroughs B7000/B6000 MCP file can be tagged as sensitive data. When
6. such a file is deleted, its storage area is overwritten by some random bits. Create C
Explain the purpose would such a scheme be useful
Blooms Program
S. No. Question Taxonomy Outcome
Level
UNIT – I
How does the distinction between kernel mode and user mode function as a
1
rudimentary form of protection (security) system? Justify. Apply c
Explain using a simple system call as an example (e.g. getpid, or uptime),

2 what is generally involved in providing the result, from the point of calling
Understand b
the function in the C library to the point where that function returns?
In a multiprogramming and time-sharing environment, several users share the

system simultaneously. This situation can result in various security problems?
3 a) Explain two such problems?
b) Can we ensure the same degree of security in a time-shared machine as Apply a
we have in a dedicated machine? Explain your answer.
Explain why must the operating system be more careful when accessing
4 input to a system call (or producing the result) when the data is in memory
Understand f
instead of registers?
Discuss how a multi-threaded application can be supported by a user- level
5 threads package. It may be helpful to consider (and draw) the components of
Understand c
such a package, and the function they perform?

Department of CSE
UNIT – II
Suppose we have a single processor system, and jobs arrive at a rate of 10
jobs a Seconds, suppose each job takes an average of 50 milli-seconds to
1
complete. Assure that both distributions are exponential. What is the expected
Apply f
number of jobs in the system and the average time in the system?

GROUP - A (SHORT ANSWER QUESTIONS)

S. No Question
Level Outcome
UNIT – I
1 Application of Interrupt processing {Level III} Apply b
2 Differentiate between programmed I/O & interrupt drive I/O {Level IV} Analyze a
3 Classify operating systems, give one example for each type{level IV} Analyze f
4. Compare hard and soft Real time system{level IV} Analyze c
5. Difference between symmetric and asymmetric multiprocessor{Level IV} Analyze e
UNIT-II
1. scheduling with a Longest Job First strategy, in terms of processor utilization, Create a
(a) Compute the need for mutual exclusion? {Level VI}
(b) Justify a critical resource? {Level V}
2. Analyze Evaluate d
(c) Estimate a critical section?{Level VI}
given in milliseconds.
P1 0 8
3. P2 1 4 Evaluate b
P3 2 9
P4 3 5
ii) Non preemptive SJF schedule. {Level IV}
Five batch jobs A through E, arrive at computer center at almost the same time.
They have estimated running times of 10,6,2,4 and 8 minutes. Their (externally
determined) priorities are 3,5,2,1 and 4, respectively, with 5 being the highest
priority. for each of the following scheduling algorithms, determine the mean
4. process turn -around time . Ignore process switching overhead. Evaluate Analyze c
a) Round robin
b) priority scheduling
c) First come, First served(run in order 10,6,2,4,8)
d) shortest job first {Level V}
Interpret
5. b
a process? Analyze different process states {Level IV}
UNIT-III
Summarize the page replacement algorithms On a system using simple
segmentation, compute the physical address for each of the logical address is
1. given in the following segment table. If the address generate fault, indicate so. Create e
Segment Base Length
0 330 124

Department of CSE
1 867 211
2 111 99
3 498 302
2 a)0,99 b) 2,78 c) 1,265 c) 3,222 d)0,111 Apply d
Memory partition with used and unused block are given in the following fig.
Additional request 200k, 100k, and 50k (in the order) are received. At what
3. starting address will each of the additional requests be allocated for following Create c
allocation?
1. First fit 2. Best fit{Level VI}
Consider a paging hardware with a TLB. Assume that the entire page table and
all the pages are in the physical memory. It takes 10milliseconds to search the
4. TLB and 80 milliseconds to access the physical memory. If the TLB hit ratio is Apply f
0.6. Calculate the effective memory access time (in milliseconds) is
_________.(GATE : 2014, Paper III)
UNIT-IV
Suppose that we agree that 1 kilobyte is 1,024 bytes, 1 megabyte is1,0242
bytes, and 1 gigabyte is 1,0243 bytes. This progression continues hrough
terabytes, pet bytes, and Exabyte’s (1, 0246). Several proposed scientific
projects plan to record and store a few Exabyte’s of data duringthe next decade.
Calculate
1. a) How many disk drives would be required to hold 4exabytes of data? Apply d
b) How many magnetic tapes would be required to hold 4exabytes of data?
c) How many optical tapes would be required to hold 4exabytes of data
d) How many holographic storage cartridges would be required to hold 4
exabytes of data ?
e) How many cubic feet of storage space would each option require?
Consider a file currently consisting of 100 blocks. Assume that the file control
block (and the index block, in the case of indexed allocation)is already in
memory. Calculate how many disk I/O operations are required for contiguous,
linked, and indexed (single-level) allocation strategies, if, for one block, the
following conditions hold. In the contiguous-allocation case, assume that there
is no room to grow at the beginning but there is room to grow at the end. Also
2. assume that the block information to be added is stored in memory. Apply c
a) The block is added at the beginning.
b) The block is added in the middle.
c) The block is added at the end.
d) The block is removed from the beginning.
e) The block is removed from the middle.
f) The block is removed from the end.
Consider a hard disk with 16 recording surfaces (0 −15 ) having
16384cylinders (0 - 16383 ) and each cylinder contains 64 sectors (0 − 63 )
.Data storage capacity in each sector is 512 bytes. Data are organized cylinder–
3. wise and the addressing format is . A file of size 42797 KB is stored in the disk Apply b
and the starting disk location of the file is .Calculate is the cylinder number of
the last sector of the file, if it is stored in a contiguous manner?
(A) 1281 (B) 1282 (C) 1283 (D) 1284
4. Interpret briefly on mass storage structure? Evaluate b
A FAT (file allocation table) based file system is being used and the total
overhead of each entry in the FAT is 4 bytes in size. Given a 100 x 106bytes
5. disk on which the file system is stored and data block size is 103bytes, Apply d
Calculate the maximum size of a file that can be stored on this disk in units of
106 bytes .GATECSE: 2015
UNIT-V
Can a system detect that some of its processes are starving? Justify If you
1. answer “yes,” explain how it can. If you answer “no,” explain how the system Evaluate f
can deal with the starvation problem.
2. A possible method for preventing deadlocks is to have a single, higher order Evaluate c

Department of CSE
resource that must be requested before any other resource. For example, if
multiple threads attempt to access the synchronization objects A· · · E,
deadlock is possible. (Such synchronization objects may include mutexes,
semaphores, condition variables, and the like.)We can prevent the deadlock by
adding a sixth object F. Whenever a thread wants to acquire the
synchronization lock for any object A· · · E, it must first acquire the lock for
object F. This solution is known as containment: the locks for objects A· · ·
Eare contained within the lock for object F. Compare this scheme with the
circular-wait scheme
Two processes X and Y need to access a critical section. Consider thefollowing
synchronization construct used by both the processes
Process X Process Y
for process X*/ for Process Y*/
while(true) while(true)
{ {
Var P=true; varQ = true;
While(var while(var
Q==true) P==true)
3. Analyze b
{ {
/*critical /*critical
section*/ section*/
varP=false; varQ=false;
} }
} }
for Process X*/ for process Y*/
Here var P and var Q are shared variables and both are initialized to false.
Which one of the following statements is true.
Estimate the operating system contains 3 resources, the number of instance of
each resource type 7,7,10. The current allocation state is as shown below
Current allocation Maximum need
process
R1 R2 R3 R1 R2 R3
4. P1 2 2 3 3 6 8 Create c
P2 2 0 3 4 3 3
P3 1 2 4 3 4 4
1.Is the current allocation in a safe state
2. Can the request made by process p1(1 1 0) be granted? {Level VI}
5. Differentiate between capability lists and access lists? Analyze f
A Burroughs B7000/B6000 MCP file can be tagged as sensitive data. When
6. such a file is deleted, its storage area is overwritten by some random bits. Create c
Explain the purpose would such a scheme be useful
GROUP - II (LONG ANSWER QUESTIONS
Blooms
Course
Outcome
Level
UNIT – I
1. Justify language approach {Level V} Analyze b
2. Elaborate an operating system ?Explain Unix system structure {Level VI} Evaluate a
Modify various components of operating–system structure explains the simple
3. Create f
and layered approach of operating system in details. {Level VI}
a) In a multi programming and time –sharing environment, several users
4. share the systems imultaneously, This situation can result in various security Analyze c
problem:

Department of CSE
i) What are two such problem?

ii) Can be ensure the same degree of security in at ime-shared machine as in a
dedicated machine? Explain your answer {Level V}
5. Purpose is dual Mode of Operation{Level V} Analyze e
UNIT – II
1 scheduling with a Longest Job First strategy, in terms of processor utilization, Create a
Elaborate classic
problems of
2. d
synchronization.
{Level VI}
a) Compute the need for mutual exclusion?{Level VI}
(b) Justify a critical resource?{Level V} Create/
3 b
(c) Estimate a critical section?{Level VI} Evaluate
In this problem you are to compare reading a file using a single-threading file
server and a multithreaded server. It takes 15 msec to get a request for work,
dispatch it, and do the rest of the necessary processing, assuming that the data
4 needed are in the block cache. If a disk operation is needed, as is the case Create c
one-thread of the time, an additional 75 msec is required, during which
time the thread sleeps. How many requests/sec can the server handle if it single
threaded? If it is multithreaded?{Level VI}
given inmilli seconds.
P1 0 8
5. P2 1 4 Create b
P3 2 9
P4 3 5
ii) Non preemptive SJF schedule. {Level VI}
UNIT-III
1. Elaborate paging ?Compute Demand paging {Level VI} Create b
Estimate the page replacement Algorithms?
2. Evaluate c
Determine types of page replacement Algorithms{Level V}
3. Justify Segmentation and Thrashing {Level V} Evaluate c
Consider the following page-reference string 2 3 2 15 2 4 5 3 2 5 2 How
4. many pages faults occur for the following replacement algorithms, assuming Create a
three frames? 1.FIFO 2.LRU 3.OPTIMAL {Level VI}
Give memory partition of 100 K,500 K,200 K,300 K and 600 K(in order)
how would each of the first fit, best fit and worst fit algorithm place process
of 212K,417, 112, and 426 (in order) ? Which algorithm makes the most
efficient use memory?
Consider the following page reference string: 1, 2, 3,4, 2, 1, 5, 6, 2, 1, 2, 3, 7,
5. Create c
6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the following
replacement algorithms, assuming one, two, three, four, five, six, or seven
frames? Remember all frames are initially empty, so your first unique pages
will all cost one fault each. a) LRU replacement b) FIFO replacement c)
Optimal replacement {Level VI}
UNIT – IV
A file system with 300 G Byte uses a file descriptor with 8 direct block
address. 1 indirect block address and 1 doubly indirect block address. The size
1 Create d
of each disk block is 128 Bytes and the size of each disk block address is 8
Bytes. The maximum possible file size in this file system. {Level VI}

Department of CSE
Consider a disk system with 100 cylinders. The requests to access the
cylinders occur in followingsequence:4, 34, 10, 7, 19, 73, 2, 15, 6,
2 20Assuming that the head is currently at cylinder 50, what is the time taken to Create c
satisfy all requests if it takes1ms to move from one cylinder to adjacent one
and shortest seek time first policy is used?{Level VI}
Consider a system that supports 5,000 users. Suppose that you want to
allow 4,990 of these users to be able to access one file. a). How would you
3 specify this protection scheme in UNIX? Create b
b) Can you suggest another protection scheme that can be used more
effectively for this purpose than the scheme provided by UNIX?{Level VI}
Justify various techniques implemented for free space management, discuss
4 Evaluate b
With suitable examples. {Level V}
(a) Elaborate different criteria for choosing a file organization. {Level VI}
5 (b) Formulate the indexed file, indexed sequential file organization.{Level Evaluate d
VI}
6 Elaborate allocation methods of secondary storage methods {Level VI} Create d
UNIT – V
a) justify is deadlock? State the necessary condition for deadlock? {level V} Evaluate&
1. f
b) compile any one Strategy of prevention {level VI} Create
Interpret how we elimination deadlock by resource preemption can-selection
2. Create c
a victim –Rollback-starvation {Level VI}
Determine how can we eliminating deadlock by aborting a process-Abort all
3. deadlock processes-Abort 1 process at a time until the deadlock cycle is Create b
eliminated {Level VI}
4. justify about system protection?{Level V} Evaluate c
Suppose that a system is in an unsafe state. Show that it is possible for the
processes to complete their execution without entering a deadlock state.
Answer: An unsafe state may not necessarily lead to dead lock, it just a
5. Evaluate f
system is in an unsafe state. Show that it is possible for the processes to
complete their execution without entering a deadlock state. Answer: An
unsafestate may not necessarily lead to deadlock, it just{Level VI}
Blooms Course
S. No. Question Taxonomy Outcome
Level
UNIT – I
How does the distinction between kernel mode and user mode
1 function as a rudimentary form of protection (security) system?
Apply a
Justify.
Explain using a simple system call as an example (e.g. getpid, or
uptime), what is generally involved in providing the result, from the
2
point of calling the function in the C library to the point where that Understand b
function returns?
In a multiprogramming and time-sharing environment, several users
share the system simultaneously. This situation can result in various
security problems?
3
c) Explain two such problems?
Apply a
d) Can we ensure the same degree of security in a time-shared machine as
we have in a dedicated machine? Explain your answer.
Explain why must the operating system be more careful when accessing
4 input to a system call (or producing the result) when the data is in memory
Understand a
instead of registers?
Discuss how a multi-threaded application can be supported by a user-
5 level threads package. It may be helpful to consider (and draw) the
Understand c
components of such a package, and the function they perform?

Department of CSE
UNIT – II
Suppose we have a single processor system, and jobs arrive at a rate of 10

jobs a Seconds, suppose each job takes an average of 50 milli-seconds to
1
complete. Assure that both distributions are exponential. What is the
Apply b
expected number of jobs in the system and the average time in the system?

Department of CSE
14. COMPUTER NETWORKS (A50515)

Course Title Computer networks

Course Code A50515
Regulation R13
Lectures Tutorials Practicals Credits
Course Structure
5 -- -- 4
Course Coordinator Mr. ILAIAH KAVATI
Team of Instructors Ms. K.NAVYA, Mr. N.SUBBA REDDY
14.1 COURSEOVERVIEW:
The course introduces main concepts of networking; application areas;
classification; reference models; transmission environment; technologies; routing
algorithms; IP, UDP and TCP protocols; reliable data transferring methods; application
protocols; network security; management systems; perspectives of communication networks.
The course structure consists of lectures in classroom and individual work.
14.2 PREREQUISITES:
Level Credits Periods/Weeks Prerequisites

UG 4 5 Computer Networks, Network security
University End
Exam Marks
There shall be 2 midterm examinations. Each midterm examination
consists of subjective type and objective type tests. The subjective test is for
10 marks, with duration of 1 hour. Subjective test of each semester shall
contain 4 questions; the student has to answer 2 questions, each
carrying5marks.
The objective type test is for 10 marks with duration of 20minutes. It
consists of10 multiple choice and 10 objective type questions, the student
75 100
have to answer all the questions and each carry half mark.
First midterm examination shall be conducted for the first two and half units
of syllabus and second midterm examination shall be conducted for the
remaining portion.
Five marks are earmarked for assignments. There shall be two assignments
in every theory course. Marks shall be awarded considering the average of
two assignments in each course.

2 I Assignment - 5
4 II Assignment - 5

Department of CSE
COURSEOBJECTIVES:
I. To introduce the fundamentals of various types of computer networks
II. To demonstrate the TCP/IP and OSI models with merits and demerits
III. To explore the various layers of OSI model
IV. To introduce UDP and TCP models
BLOOMS
S NO COURSE OUTCOMES
LEVELS
Understanding /
a Understand and explain computer networks and its components.
Comprehension
Remembering /
b Identify the different types of network topologies and protocols.
Knowledge
Enumerate the layers of the OSI model and TCP/IP. Explain the function(s) of Creating /
c
each layer. Synthesis
Creating /
d Understand and building the skills of sub netting and routing mechanisms.
Synthesis
Familiarity with the basic protocols of computer networks, and how they can Understanding /
e
be used to assist in network design and implementation. Comprehension
Understanding /
f Familiarity with UDP and TCP models
Comprehension
Program Outcomes Level Proficiency assessed by
Assignments,
An ability to apply the knowledge of mathematics, Computing, Science
A H Tutorials,
and engineering to solve Computer Science and Engineering problems.
Exams
An ability to design and conduct engineering experiments, as well as to
B S Assignments, tutorials
analyze and interpret data.
C H Assignments, Tests
component, or process to meet desired needs, within realistic constraints.
Graduates will demonstrate an ability to visualize and work on
D laboratory and Multi-disciplinary tasks individually or as a member N ------
within the teams.
An ability to demonstrate skills to use the techniques, modern
E engineering Tools, Software and equipments necessary to analyze H Assignments, Tests
computer engineering Problems.
F An understanding of professional, social and ethical responsibility S Lectures
An ability to recognize the global issues like green initiatives and
G S ----
alternate energy recognize the rural requirements.
The broad education necessary to understand the impact of engineering
H N Lectures
solutions in a global, economic, environmental, and societal context.
Assignments, Tutorials,
I knowledge in the computing discipline and ability and practice for H
Exams
Multi-disciplinary tasks as a member within the teams
J To communicate effectively N ------
An ability to use the techniques, skills and modern engineering tools
K H Assignment s, Tutorials
practice necessary for Engineering practice.

Department of CSE
Graduates areable to participate and succeed in competitive examination

L N Assignments, Tutorials
like GRE, GATE, TOEFL, GMAT etc
The use of current application software and the design and use operating
M systems and the analysis, design, testing and documentation of computer H Assignments, Tutorials
programs for the use computer science and engineering technologies .
N An ability to setup an enterprise. S Assignments,
14.7 SYLLABUS:
UNIT 1
Over view if Internet: Protocol, Layering scenario, TCP/IP Protocol Suite: The OSI Model,
Internet history standards and administration, Compare OSI and TCP/IP reference model.
Physical Layer: Guided transmission media, wireless transmission media. DLL: design
issues, CRC Codes, Elementary DLL protocols, Sliding window protocol
UNIT 2
Multiple Access Protocols -ALOHA, SLOTTED ALOHA, CSMA ,Collision free protocols.
Ethernet-physical layer, Ethernet- MAC sub layer, DLL switching and use of bridges,
Learning bridges, spanning tree bridges ,Repeaters ,hubs, bridges, switches, Routers and
gateways
UNIT 3
Network layer design issues, Store and forward packet switching, Connectionless and
connection oriented networks, routing, count to infinity problem, Hierarchical routing.
Congestion control algorithms, Admission control
UNIT 4
Internetworking: tunneling, Internetwork routing, Packet fragmentation, IPV4 Protocol, IPV6
Protocol, IP addresses CIDR, IMCP, ARP, RARP, DHCP.
Transport layer: services provided, Addressing connection establishment, release Crash
recovery
UNIT 5
Internet transport protocols UDP-RPC, Real time transport protocol, Introduction to
TCP,TCP service model TCP Segment header, TCP Connection establishment, release, TCP
connection management modeling. TCP Sliding window protocol, TCP Congestion control,
Future of TCP.
Application layer- introduction, providing services, Application layer Paradigms, Client
server model, HTTP, FTP, Electronic mail, TELNET, DNS, SSH.
TEXT BOOKS:
1. Computer networks-Andrew S Tanenbaum, 4th edition, Pearson education
2. Data communication and networking-Behrouz. A. Forouzan , fifth edition, TMH, 2013
REFERENCE BOOKS:
1. An engineering approach to computer networks-S.KESHAV, 2nd Edition, Pearson
education.
2. Understanding communications and networks, 3rd edition, W.A.Shay, Cengage
learning
3. Introduction to computer networks and cyber security, Chwan-Hwa (John) Wu,j. David
Irwin, CRC Press
4. Computer networks, L.L Peterson and B.S Davie, 4th edition,, ELSEVIER

Department of CSE
5. Computer networking: A top down approach featuring the internet, james F.Kurouse,
K.W ROSS , 3rdedition,pearson education
14.8 COURSE PLAN:

Lecture Course Learning

Blooms Levels Topics to be covered Reference
No. Outcomes
Understand and explain
computer networks
Introduction to Computer networks , Layering
components and its Understanding / T2 pg:3
L1 scenario Protocol,
terminology and Comprehension T2 pg:32
http://nptel.ac.in/video.php?subjectId=106105081/1
importance of Layering
concept
Describe the layers of
the OSI model. Explain Creating /
L2 The OSI Model, T2 pg:44
the function(s) of each Synthesis
layer.
Explain the layers of the
TCP/IP. Explain the Understanding / TCP/IP Protocol suite
L3 T2 pg:35
function(s) of each Comprehension
layer.
Understand the working
Understanding / Internet history Standards: ARPANET Novel NET, T2 pg:17-
and history of Internet
L4 Comprehension MILNET,CSNET 19
standards
Explain all the
Understanding / Comparsion of OSI and TCP/IP reference model
L5 differences between the T2 pg:45
Comprehension http://nptel.ac.in/video.php?subjectId=106105081/1
reference model
Identify the different
Physical Layer: Guided transmission media and
types of guided media Understanding / T2 pg:187-
L6 wireless transmission media
and wireless media and Comprehension 202
also compare them.
Discuss all the design
issues of DDL like error
control, flow control, Data Link Layer: Design issues,CRC Codes
Creating / T2
L7 framing. All the error http://nptel.ac.in/video.php?subjectId=106105081/16
Synthesis pg:235,257
detecting and correcting
codes like CRC will be
discussed in detailed.
Familiarity with the
basic
protocols of computer
Understanding / Elementary DLL protocols
L8 networks, and how they T2 pg:300
can be used to assist in
network design and
implementation
Familiarity with the
basic
protocols of computer
Understanding / Sliding window protocol
L9 networks, and how they T2 pg:303
Comprehension http://nptel.ac.in/courses/106105081/35
can be used to assist in
network design and
implementation
Discuss the primary
importance and use of a Multiple Access Protocols: ALOHA, Slotted Aloha,
Creating /
L10 shared medium for Pure Aloha T2 pg:325
Synthesis
client transmissions. http://nptel.ac.in/video.php?subjectId=106105081/13
Comparison between

Department of CSE
slotted and pure aloha

Discuss the medium
access for transmitting Creating / CSMA:1 persistence, P-persistence, Non persistence
L11 T2 pg:331
data on a shared Synthesis http://nptel.ac.in/video.php?subjectId=106105081/19
transmission medium
Discuss the efficiency Creating /
L12 Collision free protocols T2 pg:335
of the transmission Synthesis
Illustrate how it
encompasses quite a
Creating / Ethernet-physical layer
L13 few physical media T2 pg:364
Synthesis http://nptel.ac.in/courses/106105081/19
interfaces and several
magnitudes of speed.
Illustrate the frame
Creating / Ethernet- MAC sub layer
L14 structure of MAC sub T2 pg:364
layer
Explain the types & Understanding /
L15 DLL switching and use of bridges T2 pg:373
working of bridges Comprehension
Understand the learning
Understanding /
L16 & working of spanning Learning bridges, spanning tree bridges T2 pg:447
Comprehension
tree bridges
L17- Explain in detail about Understanding / Repeaters and Hub, Bridge, Switches Routers and
T2 pg:446
L18 connecting devices Comprehension Gateways
Discuss the design
issues of network layer
Understanding /
L19 like routing, providing Network layer design issues T2 pg:512
Comprehension
services to the upper
layer
Discuss the packet Understanding /
L20 Store and forward packet switching T2 pg:513
switching mechanisms Comprehension
Understanding in detail
about Connectionless Understanding /
L21 Connectionless and connection oriented networks T2 pg:516
and connection oriented Comprehension
mechanisms
Understand the graph
Understanding / Routing algorithms: Optimality Principle
L22 representation of the T2 pg:658
networks
Discuss in detail about Understanding /
L23 Shortest path and flooding T2 pg:668
static routing algorithm Comprehension
Describe in detail about
Creating /
L24 dynamic routing Distance vector routing , count to infinity problem T2 pg:660
Synthesis
algorithm
Discuss in detail about
Creating /
L25 dynamic routing Hierarchical routing algorithm T2 pg:653
Synthesis
algorithm
Understanding the
Understanding / Congestion control algorithm, Admission control
L26 traffic control T2 pg:552
mechanisms
Describe the secure
Understanding /
L27 movement of data from T2 pg:579
Comprehension
one network to another.
Internetworking: tunneling
Discuss how to transmit
a packet from a source Creating /
L28
to a destination in an Synthesis T2 pg:582
internetwork.
Discuss how to divide
Creating /
L29 the packets depends Packet fragmentation T2 pg:589
Synthesis
upon the transmission
Discuss in detail about Creating / IPV4 Protocol
L30 T2 pg:582
frame structure of IPv4 Synthesis http://nptel.ac.in/courses/106105081/28

Department of CSE
protocol
Understanding / IPV6 Protocol
L31 frame structure of IPv6 T2 pg:596
protocol
Understand how the
participation of a Understanding / IP addresses
L32 T2 pg:596
computer in a computer Comprehension http://nptel.ac.in/courses/106105081/32
network
Understand the method
for allocating IP
Understanding /
L33 addresses and routing CIDR T2 pg:667
Comprehension
Internet Protocol
packets.
Understanding / ICMP
L34 message control T2pg:621
protocol
Understand how to
Understanding / T2
L35 convert physical to IP ARP,RARP
Comprehension pg:612,618
address and vice versa
Discuss how to
distribute network Understanding /
L36 DHCP T2 pg:551
configuration Comprehension
parameters dynamically
Discuss the transport Creating /
L37 Transport layer: services provided to the upper layer T2 pg:693
layer design issues Synthesis
Discuss the elements of Creating /
L38 Addressing connection establishment, release . T2 pg:723
transport protocol Synthesis
Discuss the elements of Creating /
L39 Crash recovery T2 pg:729
transport protocol Synthesis
Discuss the connection Understanding / Internet transport protocols UDP
L40 T2 pg:709
less protocol service Comprehension http://nptel.ac.in/video.php?subjectId=106105081/30
Understand inter Understanding /
L41 Remote procedure call T2 pg:689
process communication Comprehension
Discuss how to
Creating /
L42 delivering audio and Real time transport protocol T2 pg:999
Synthesis
video over IP networks.
Creating / Introduction to TCP
L43 connection oriented T2 pg:715
Synthesis http://nptel.ac.in/video.php?subjectId=106105081/31
protocol
Discuss how to achieve
Creating /
L44 Reliable, in-order, byte- TCP service model T2 pg:715
Synthesis
stream delivery
Discuss about header Creating /
L45 TCP Segment header T2 pg:721
format of TCP Synthesis
Understanding of the
Understanding / TCP Connection establishment, release
L46 connect, accept, and T2 pg:723
Comprehension
close functions
Discuss about packet
format, data transfer, Creating / TCP connection management modeling
L47 T2 pg:724
and connection Synthesis
management
Describe the features of
Understanding / TCP Sliding window protocol
L48 packet based data T1 pg:711
transmission protocols
Describe how to avoid
Understanding / TCP Congestion control
L49 the congestions in the T2 pg:765
internet
Describe how to Understanding /
L50 Future of TCP T2 pg:719
provide the methods to Comprehension

Department of CSE
resend
missing/ corrupted
packets.
Discuss design issues of Creating /
L51 Application layer- introduction, services T2 pg:816
application layer Synthesis
Discuss the
Creating /
L52 relationships to the Application layer paradigms T2 pg: 820
Synthesis
other layers.
Illustrate the system
Creating /
L53 made up of both client Client server model T2 pg:823
Synthesis
and server software.
Discuss how to retrieve
interlinked resources
Creating / HTTP
L54 led to the establishment T2 pg:876
of the World Wide
Web.
Discuss how to transfer
Creating / FTP
L55 files between computers T2 pg:887
on a network.
Describe
communication within Understanding /
L56 Electronic mail T2 pg:891
a patient-physician Comprehension
relationship
Describe how to access
Understanding /
L57 remote computers over TELNET T2 pg:904
Comprehension
TCP/IP networks.
Describe to resolve
Understanding / DNS
L58 human readable T2 pg:910
hostnames
Discuss administrating Creating /
L59 SSH T2 pg:907
the remote computers Synthesis
14.9. MAPPING COURSE OBJECTIVES LEADING TO THE ACHIEVEMENT OF

PROGRAM OUTCOMES:
Program Outcomes
Course
Objectives A b c d e f g h i j k l m n
I H H H S H S H
II H S S S H S S H S H
III H H H H H S H H S
IV H H S S H S S H
S
14.10 MAPPINGCOURSEOUTCOMESLEADINGTOTHEACHIEVEMENTOF
PROGRAM OUTCOMES:

Educational
Outcomes a b c d e f g h i j k l m n
a H H H S H S H

Department of CSE
b H S S S H S S H S H
c H H H H H S H H S
d H H S S H S S H
S
e H S H H S H H S
f S S H
14.11 OBJECTIVEQUESTIONS
UNIT I
1. The computer network is
A. Network computer with cable
B. Network computer without cable
C. Both of the above
Answer B
2. FDDI used which type of physical topology?
A. Bus
B. Ring
C. Star
D. Tree
Answer: C
3. FTP stands for
A. File transfer protocol
B. File transmission protocol
C. Form transfer protocol
D. Form transmission protocol
Answer: C
4. Ethernet system uses which of the following technology.
A. Bus
B. Ring
C. Star
D. Tree
Answer: B
5. Which of the following are the network services?
A. File service
B. Print service
C. Database service
D. All of the above
Answer: D
6. If all devices are connected to a central hub, then topology is called
A. Bus Topology
B. Ring Topology
C. Star Topology
D. Tree Topology
Answer: B
Department of CSE
7. FDDI stands for

A. Fiber Distributed Data Interface
B. Fiber Data Distributed Interface
C. Fiber Dual Distributed Interface
D. Fiber Distributed Data Interface
Answer: A
8. Which of the following is an application layer service?
A. Network virtual terminal
B. File transfer, access and management
C. Mail service
D. All of the above
Answer: D
9. Which is the main function of transport layer?
A. Node to node delivery
B. End to end delivery
C. Synchronization
D. Updating and maintaining routing tables
Answer: B
10. The ............ layer change bits onto electromagnetic signals.
A. Physical
B. Transport
C. Data Link
D. Presentation
Answer: B
11. In mesh topology, relationship between one device and another is ..............
A. Primary to peer
B. Peer to primary
C. Primary to secondary
D. Peer to Peer
Answer: B
12. The performance of data communications network depends on ..............
A. Number of users
B. The hardware and Software
C. The transmission
D. All of the above
Answer: D
13. Find out the OSI layer, which performs token management.
A. Network Layer
B. Transport Layer
C. Session Layer
D. Presentation Layer
Answer: C
14. The name of the protocol which provides virtual terminal in TCP/IP model is.
A. Telnet
B. SMTP
C. HTTP
D. None
Answer: C
15. The layer one of the OSI model is
A. Physical layer

Department of CSE
B. Link layer
C. Router layer
D. Broadcast layer
Answer: A
16. What is the name of the network topology in which there are bi-directional links
between each possible node?
A. Ring
B. Star
C. Tree
D. Mesh
Answer: A
17. What is the commonly used unit for measuring the speed of data transmission?
A. Bytes per second
B. Baud
C. Bits per second
D. Both B and C
Answer: D
18. Which of the communication modes support two way traffic but in only once
direction of a time?
A. Simplex
B. Half-duplex
C. Three - quarter's duplex
D. Full duplex
Answer: A
19. The loss in signal power as light travels down the fiber is called.............
A. Attenuation
B. Propagation
C. Scattering
D. Interruption
Answer: D
20. Which of the following TCP/IP protocols is used for transferring files form one
machine to another?
A. FTP
B. SNMP
C. SMTP
D. RPC
Answer: A
UNIT II
1. A network that needs human beings to manually route signals is called....
A. Fiber Optic Network
B. Bus Network
C. T-switched network
D. Ring network
Answer: B
2. TCP/IP .................layer corresponds to the OSI models to three layers.
A. Application
B. Presentation
C. Session
D. Transport

Department of CSE
Answer: A
3. Which of the transport layer protocols is connectionless?
A. UDP
B. TCP
C. FTP
D. Net
Answer: D
4. Which of the following applications allows a user to access and change remote files
without actual transfer?
A. DNS
B. FTP
C. NFS
D. Telnet
Answer: A
5. The data unit in the TCP/IP layer called a....
A. Message
B. Segment
C. Datagram
D. Frame
Answer: C
6. DNS can obtain the .................of host if its domain name is known and vice versa
A. Station address
B. IP address
C. Port address
D. ChecksuM
Answer: B
7. Which of the following OSI layers correspond to TCP/IP's application layer
A. Application
B. Presentation
C. Session
D. All of the above
Answer: D
8. Devices on one network can communicate with devices on another network via
a.......
A. File Server
B. Utility Server
C. Printer Server
D. Gateway
Answer: A
9. A communication device that combines transmissions from several I/O devices into
one line is a
A. Concentrator
B. Modifier
C. Multiplexer
D. Full duplex file
Answer: C
10. Which layers of the OSI determines the interface often system with the user?
A. Network
B. Application
C. Data link

Department of CSE
D. Session
Answer: B
11. Which of the following of the TCP/IP protocols is the used for transferring files
from one machine to another?
A. FTP
B. SMTP
C. SNMP
D. Rpe
Answer: A
12. In which OSI layers does the FDDI protocol operate?
A. Physical
B. Data link
C. Network
D. A and B
Answer: D
13. In FDDI, data normally travel on..................
A. The primary ring
B. The Secondary ring
C. Both rings
D. Neither ring
Answer: A
14. The ............layer of OSI model can use the trailer of the frame for error detection
A. Physical
B. Data link
C. Transport
D. Presentation
Answer: B
15. In a ................topology, if there are n devices in a network, each device has n-1
ports for cables.
A. Mesh
B. Star
C. Bus
D. Ring
Answer: A
16. Another name for Usenet is
A. Gopher
B. Newsgroups
C. Browser
D. CERN
Answer: A
17. The standard suit of protocols used by the Internet, Intranets, extranets and some
other networks
A. TCP/IP
B. Protocol
C. Open system
D. Internet work processor
Answer: A
18. State whether the following is true or false
i. In bus topology, heavy Network traffic slows down the bus speed
ii. It is multipoint configuration

Department of CSE
A. True, True
B. A) True, True
C. False, True
D. False, False
Answer: A
19. Which of the following is the logical topology?
A. Bus
B. Tree
C. Star
D. Both A and B
Answer: D
20. Which of the following is/ are the drawbacks of Ring Topology?
A. Failure of one computer, can affect the whole network
B. Adding or removing the computers disturbs the network activity.
C. If the central hub fails, the whole network fails to operate.
D. Both of A and B
Answer: D
UNIT III
1. Which of the following is not the layer of TCP/IP protocol?
A. Application Layer
B. Session Layer
C. Transport Layer
D. Internetwork layer
Answer: D
2. ................... address use 7 bits for the <network> and 24 bits for the <host>
portion of the IP address.
A. Class A
B. Class B
C. Class C
D. Class D
Answer: C
3. . ............. Addresses are reserved for multicasting.
A. Class B
B. Class C
C. Class D
D. Class E
Answer: A
4. State the following statement is true or false.
i) In class B addresses a total of more than 1 billion addresses can be formed.
ii) Class E addresses are reserved for future or experimental use.
A. True, False
B. True, True
C. False, True
D. False, False
Answer: B
5. Which of the following statement is true?
i) An address with all bits 1 is interpreted as all networks or all hosts.
ii) The class A network 128.0.0.0 is defined as the loopback network.
A. i only

Department of CSE
B. ii only
C. Both A and B
Answer: B
6. Which is not the Regional Internet Registers (RIR) of the following?
A. American Registry for Internet Numbers (ARIN)
B. Europeans Registry for Internet Numbers (ERIN)
C. Reseaux IP Europeans (RIPE)
D. Asia Pacific Network Information Centre (APNIC)
Answer: B
7. Match the following IEEE No to their corresponding Name for IEEE 802
standards for LANs.
i) 802.3 a) WiFi
ii) 802.11 b) WiMa
iii) 802.15.1 c) Ethernet
iv) 802.16 d) Bluetooth
A. i-b, ii-c, iii-d, iv-a
B. i-c, ii-d, iii-a, iv-b
C. i-c, ii-a, iii-d, iv-b
D. i-b, ii-d, iii-c, iv-a
Answer: A
8. . ........... was the first step in the evolution of Ethernet from a coaxial cable bus to
hub managed, twisted pair network.
A. Star LAN
B. Ring LAN
C. Mesh LAN
D. All of the above
Answer: D
9. . ............... Is the predominant form of Fast Ethernet, and runs over two pairs of
category 5 or above cable.
A. 100 BASE-T
B. 100 BASE-TX
C. 100 BASE-T4
D. 100 BASE-T2
Answer: B
10. IEEE 802.3ab defines Gigabit Ethernet transmission over unshielded twisted pair
(UTP) category 5, 5e or 6 cabling known as....................
A. 1000 BASE-T
B. 1000 BASE-SX
C. 1000 BASE-LX
D. 1000 BASE-CX
Answer: D
11. Which one of the following is not a function of network layer?
A. routing
B. inter-networking
C. congestion control
Answer: D
12. The 4 byte IP address consists of
A. network address

Department of CSE
B. host address
C. both (a) and (b)
Answer: D
13. Which one of the following routing algorithm can be used for network layer
design?
A. shortest path algorithm
B. Multi destination routing
C. distance vector routing
Answer: A
14. A routing
A. contains the list of all destinations
B. data is not sent by packets
C. none of the mentioned
D. None
Answer: A
15. Which one of the following algorithm is not used for congestion control?
A. traffic aware routing
B. admission control
C. load shedding
Answer: B
16. ICMP is primarily used for
A. error and diagnostic functions
B. addressing
C. forwarding
Answer: B
17. What is stat frame deli meter (SFD) in ether net frame?
A. 10101010
B. 10101011
C. 00000000
D. 11111111
Answer: B
18. MAC address is of
A. 24 bits
B. 36 bits
C. 42 bits
D. 48 bits
Answer: A
19. What is auto negotiation?
A. a procedure by which two connected devices choose common transmission
parameters
B. a security algorithm
C. a routing algorithm
Answer: A
20. Ethernet in metropolitan area network (MAN) can be used as
A. puree ther net

Department of CSE
B. ether net over SDH

C. ether net over MPLS
Answer: D
UNIT IV
1. In asymmetric key cryptography, the private key is kept by
A. sender
B. receiver
C. all the connected devices
D. None
Answer: C
2. Which one of the following algorithm is not used in asymmetric-key
cryptography?
A. RSA algorithm
B. Diffie - hellman algorithm
C. electronic code book algorithm
Answer: C
3. Which of the following field in IPv4 datagram is not related to fragmentation?
A. Flags
B. Offset
C. TOS
D. Identifier
Answer: D
4. The TTL field has value 10. How many routers (max) can process this datagram?
A. 11
B. 5
C. 10
D. 1
Answer: A
5. If the value in protocol field is 17, the transport layer protocol used is ____.
A. TCP
B. UDP
C. Either of the mentioned
D. None of the mentioned
Answer: A
6. For a 10Mbps Ethernet link, if the length of the packet is 32bits, the transmission
delay is (in milliseconds)
A. 3.2
B. 32
C. 19.
Answer: A
7. What should be the flag value to indicate the last fragment?
A. 0
B. 1
C. TTl value
Answer: C

Department of CSE
8. Which of these is not applicable for IP protocol?

A. is connectionless
B. offer reliable service
C. offer unreliable service
Answer: A
9. Fragmentation has following demerits
A. complicates routers
B. open to DOS attack
C. over lapping of fragments.
D. All of the mentioned
Answer: D
10. Which field helps to check rearrangement of the fragments?
A. offset
B. flag
C. TTL
D. identifier
Answer: C
11. DHCP is used for
A. IPv4
B. Ipv6
C. both (a) and (b)
D. None
Answer: C
12. The DHCP server
A. maintains a database of available IP addresses
B. maintains the information about client configuration parameters
C. grants a IP address when receives a request from a client
Answer: C
13. IP assigned for a client by DHCP server is
A. for a limited period
B. for unlimited period
C. not time dependent
Answer: B
14. DHCP uses UDP port ____ for sending data to the server.
A. 66
B. 67
C. 68
D. 69
Answer: A
15. Traffic intensity is given by, where L = number of bits in the packet a = average
rate R = transmission rate
A. La/R
B. LR/a
C. R/La
Answer: B
16. DHCP client and servers on the same subnet communicate via

Department of CSE
A. UDP broadcast
B. UDP unicast
C. TCP broadcast
D. TCP unicast
Answer: C
17. After obtaining the IP address, to prevent the IP conflict the client may use
A. internet relay chat
B. broader gateway protocol
C. address resolution protocol
Answer: B
18. What is DHCP snooping?
A. techniques applied to ensure the security of an existing DHCP infrastructure
B. encryption of the DHCP server requests
C. algorithm for DHCP
Answer: C
19. If DHCP snooping is configured on a LAN switch, then clients having specific
______ can access the network.
A. MAC address
B. IP address
C. both (a) and (b)
Answer: C
20. Which one of the following is a cryptographic protocol used to secure HTTP
connection?
A. stream control transmission protocol (SCTP)
B. transport layer security (TSL)
C. explicit congestion notification (ECN)
D. resource reservation protocol
Answer: B
UNIT V
1. SSH can be used in only
A. unix -like operating systems
B. windows
C. both (a) and (b)
Answer: A
2. FTP is built on _____ architecture
A. P2P
B. Both of the mentioned
C. None of the mentioned View
D. Client-server
Answer: A
3. FTP uses _____ parallel TCP connections to transfer a file
A. 1
B. 2
C. 3
D. 4

Department of CSE
Answer: C
4. Identify the incorrect statement
A. FTP stands for File Transfer Protocol
B. FTP uses two parallel TCP connections
C. FTP sends its control information in-band
D. FTP sends exactly one file over the data connection
Answer: C
5. If 5 files are transfered from server A to client B in the same session. The number
of TCP connection between A and B is
A. 5
B. 6
C. 7
D. 8
Answer: D
6. FTP server
A. Mantains state
B. Is stateless
C. Has single TCP connection for a file transfer
Answer: C
7. The commands, from client to server, and replies, from server to client, are sent
across the control connection in ____ bit ASCII format
A. 8
B. 7
C. 3
D. 5
Answer: A
8. Find the FTP reply whose message is wrongly matched
A. 331 – Username OK, password required
B. 425 – Can’t open data connection
C. 452 – Error writing file
D. 452 – Can’t open data connection
Answer: A
9. Mode of data transfer in FTP, where all the is left to TCP
A. Stream mode
B. Block mode
C. Compressed mode
Answer: B
10. The password is sent to the server using _____ command
A. PASSWD
B. PASS
C. PASSWORD
Answer: C
11. Which standard TCP port is assigned for contacting SSH servers?
A. port 21
B. port 22
C. port 23
D. port 24

Department of CSE
Answer: D
12. Which one of the following authentication method is used by SSH?
A. public-key
B. host based
C. password
D. of the mentioned
Answer: C
13. Which of the following is a form of DoSattack?
A. Vulnerability attack
B. Bandwidth flooding
C. Connection flooding
D. All of the mentioned
Answer: B
14. Packet sniffers involve
A. Active receiver
B. Passive receiver
C. Both of the mentioned
Answer: B
15. Electronic mail uses this Application layer protocol
A. SMTP
B. HTTP
C. FTP
D. SIP
Answer: C
16. This is a time-sensitive service
A. File transfer
B. File download
C. E-mail
D. Internet telephony
Answer: B
17. The packet of information at the application layer is called
A. Packet
B. Message
C. Segment
D. Frame
Answer: B
18. This is one of the architecture paradigms
A. Peer to peer
B. Client-server
C. HTTP
D. Both a and b
Answer: C
19. Application layer offers _______ service
A. End to end
B. Process to process
C. Both of the mentioned
Answer: B
20. Which field helps to check rearrangement of the fragments?

Department of CSE
A. offset
B. flag
C. TTL
D. Identifier
Answer: A
14.12 ASSIGNMENT QUESTION BANK

PART – A (SHORT ANSWERQUESTIONS)
Blooms
S. Course
Question Taxonomy
No Outcome
Level
UNIT-I
1 Define computer networks. Knowledge a
2 Difference between point to point and broadcasting transmission Analysis b
3 Define multicasting and broadcasting. Knowledge b
4 Differentiate guided and unguided transmission media Analysis d
Write the three criteria necessary for an effective and efficient
5 Synthesis c
network?
6 What is the advantage of distributed processing? Comprehension c
7 Give the factors that affect the performance of a network Comprehension b
8 Define CRC (Cyclic Redundancy Check) Knowledge b
9 Define Hamming distance Knowledge e
10 Define PROTOCOL Knowledge e
11 Define De facto and De jure standards Knowledge d
12 Differentiate DLL and transport layer functions Analysis b
13 Describe sliding window protocol. Knowledge a
14 Discuss the use of standards? Knowledge a
UNIT II
1 Distinguish Internet architecture and OSI architecture Comprehension a
2 Define in detail the error detection and error corrections Knowledge e
3 Define error control Knowledge e
4 Distinguish FDDI and basic token ring Comprehension a
5 List the merits of bridges Differentiate Knowledge e
6 Define role of VCI Knowledge e
7 List the the links operated on the physical media in detail Knowledge e
8 Define CSMA Knowledge d
9 Define some of the physical properties of Ethernet Knowledge e
UNIT III
1 Define Masking Knowledge d
2 Define the class field in IP address Knowledge c
3 Define different kinds of Multicast Routing Knowledge e
4 Distinguish between hostid and netid Comprehension e
5 List the merits of sub netting Knowledge c
6 Differentiate between physical and logical address Analysis e
UNIT IV
1 Define tunneling Knowledge a
2 Distinguish between IPV4 and IPV6 Comprehension c
3 List the merits of ICMP Knowledge d
4 Differentiate between ARP and RARP Analysis b
5 List the merits of bridges Knowledge c
6 Describe Link state routing algorithm Knowledge d
7 Define quality of service Knowledge f
8 Define congestion control algorithms Knowledge e

Department of CSE
9 Define UDP Knowledge e

10 Define TCP Knowledge d
UNIT – V
1 Give the meaning of web browser Comprehension a
2 Define three main divisions of the DNS Knowledge c
3 List few characteristics of email system Knowledge d
4 Define SMTP Knowledge e
5 Define role does the DNS resolver play in the DNS system Knowledge a
6 Give the meaning of WWW Comprehension f
7 List few examples of cryptography methods Knowledge c
8 Distinguish between HTTP and FTP Comprehension f
9 List four properties of HTTP Knowledge f
10 Define mailing list. Knowledge e
S. Blooms Taxonomy Course

Question
No Level Outcome
UNIT-I
What is a computer network? Discuss various types of networks
1 topologies in computer network. Also discuss various advantages Comprehension b
and disadvantages
2 List the applications of Computer Networks? Knowledge c
Comprehension,
3 Explain the following:- a) LAN b) MAN c) WAN d) ARPANET Synthesis, a
Evaluation
Comprehension,
Explain TCP/IP Model? Explain the functions and protocols and
4 Synthesis, b
services of each layer? Compare it with OSI Model.
Evaluation
Comprehension,
Explain IP addressing. How it is classified? How is subnet
5 Synthesis, c
addressing is performed?
Evaluation
Comprehension,
6 Explain the following: i. TCP ii. UDP Synthesis, f
Evaluation
7 Discuss star topology is commonly preferred? Knowledge c
State In what situations contention based MAC protocols are
8 Knowledge a
suitable?
Explain, Is there any relationship between transmission media and Comprehension,
9 b
topology? Synthesis,
Comprehension,
Explain vulnerable period. How it affects the performance in
10 Synthesis, f
MAC protocols?
Evaluation
UNIT-II
Discuss how throughput is improved in slotted ALOHA over pure
1 Knowledge a
ALOHA?
Comprehension,
Explain how performance is improved in CSMA/CD protocol
2 Synthesis, b
compared to CSMA protocol?
Evaluation
Discuss the parameter ‘a’? How does it affect the performance of
3 Comprehension f
the CSMA protocol?
4 Define point to point protocol. Explain the frame format of PPP. Knowledge e
5 Explain in detail CSMA Protocol in detail. Comprehension, a
Comprehension,
Explain pure ALOHA and slotted ALOHA? Consider the delay of
6 Synthesis, d
both at low load. Which one is less? Explain your answer
Evaluation
7 Explain in detail CSMA/CD Protocol in detail. How it detects Comprehension, f

Department of CSE
collision. Synthesis,
What are bridges? Give the characteristics of them. Compare
8 Knowledge a
bridges with routers.
9 Define Spanning tree bridges and Source routing bridges. Knowledge b
10 List the the limitations of bridges. Knowledge a
UNIT-III
Briefly explain the services provided by physical layer to network
1 Comprehension, a
layer.
Explain IPv6. Explain its advantages over IPv4. Also explain its Comprehension,
2 c
frame format. Synthesis,
3 Discuss network layer design issues. Comprehension b
Compare FDMA, TDMA and CDMA in terms of their ability to
4 Knowledge d
handle groups of stations?
Discuss with connection oriented and connection-less network
5 Knowledge e
routing.
6 Discuss about hierarchichal routing. Comprehension a
7 Explain basic IEEE 802.3 Ethernet MAC Data Frame. Comprehension, c
Briefly describe the reasons why a single organization may end up
8 Comprehension d
with multiple LANs and choose bridges.
9 Discuss the standard Ethernet cabling and cable topologies. Comprehension e
10 Describe the addressing mechanism in 802.11( Wi-Fi). Comprehension f
UNIT-IV
1 Describe shortest path algorithm with a suitable illustration Knowledge, b
2 Describe the distance vector routing algorithm Knowledge, c
Describe the frame format, operation and ring maintenance feature
3 Comprehension, a
of
4 IEEE 802.5 MAC protocol. Evaluation d
5 How a Token Ring LAN does operate? Discuss Knowledge e
Given the address 23.56.7.91 and the default class A mask, find the
6 Synthesis,Evaluation a
beginning address (network address).
7 Describe the functions of MAC sub layer. Comprehension, b
8 List out the advantages and drawbacks of ring topology. Synthesis, a
9 List out the advantages and drawbacks of bus topology. Evaluation c
UNIT-V
1 Write about TCP segment Header. Application, a
2 Differentiate between ISO-OSI and TCP/IP reference model. Analysis c
Write two ways in which computer applications differ from
3 Application,Synthesis c
network applications ?
4 List the features of SSH. Knowledge a
5 Describe DNS Knowledge, b
6 Explain DHCP Comprehension, c
Discuss the following terms with respect to ATM: VPI, UNI,
7 Comprehension f
synchronous, AAL, Cell , PVC.
8 Explain TELNET Comprehension, a
9 Discuss functions of application layer Comprehension b
10 Discuss electronic mail. Comprehension a
S. Blooms Course
Question
No Taxonomy Level Outcome
UNIT I
Draw a CRC encoder and decoder for CRC code with C (7, 4).
1 Knowledge f
Also explain how this CRC design works, with an example
If the transmitted code word is 10011000 and the received code Comprehension b
2
word is 11001001. What is the error word ? Write transmitted Application,

Department of CSE
code word , received code word and error word as polynomials.

Compare synchronous time division multiplexing with statistical
Synthesis c
3 time division multiplexing.
UNIT-II
1 Explain remote bridges with a neat diagram. Comprehension a
A large population of ALOHA users manages to generate 50
requests/sec, including both originals and retransmissions. Time is
slotted in the units of 40 msec.
i. What is the chance of success on the first attempt?
2 Knowledge b
ii. What is the probability of exactly k collisions and then a
success?
iii. What is the expected number of transmission attempts
needed??
UNIT- III
1 Compare IPV4 and IPV6. Analysis , b
2 State the problems due to congestion.. Knowledge c
3 Discuss Link state routing algorithm. Comprehension d
UNIT-IV
Illustrate simplex, half-duplex and full duplex modes. Explain
1 with relevant examples for each. What mode is used when two Analysis b
people are communicating by a telephone line?
Using Differential Manchester encoding scheme, draw the time
2 Understand a
vs. amplitude graphs for the bit stream 0101101001.
UNIT-V
What is the average number of transmission required to send a
Application,
1 frame of length 1600 bytes correctly, if the bit error rate is 1 x 10- b
Synthesis
6.
What are the various classes of IP addressing? Calculate the
2 Knowledge a
maximum number of class A, B and C network Ids.
What do you understand by the term ‘structured cabling’. State
the main rules that should be used when installing a cable. Show Understand
3 e
that maximum cabling area for LAN for horizontal cabling runs is Comprehension
approximately 200m.
If the transmitted code word is 10011000 and the received code
4 word is 11001001. What is the error word? Write transmitted code Comprehension f
word, received code word and error word as polynomials.

PART – A (SHORT ANSWERQUESTIONS)
Blooms
Course
Outcome
Level
UNIT-I
Define the following standard organizations: ISO, ITU-T, IEEE,
1 Knowledge b
ANSI, EIA, TIA, IAB, ETF, and IRTF.
Give a technical comparison between OSI & TCP/IP reference Comprehens
2 a
model. ion
Application,
3 Write the classification of Networks according to their size. a
Synthesis
Write the various design issues related to the layers in ISO-OSI
5 Knowledge b
model.
6 Write about TCP/IP Protocol suite Knowledge e
UNIT – II
1 List features of pure ALOHA and slotted ALOHA? Comprehension b

Department of CSE
State properties of : a) Ethernet b) Wireless LAN c) Source routing Comprehension,

2 c
bridge Synthesis,
3 Give a short study on fast Ethernet cabling? Comprehension c
Describe token. Discuss the protocol of token ring LAN in general.
Comprehension,
4 Discuss with example how priority is implemented in a token ring a
Synthesis,
LAN?
Give the function of Connecting LAN’s. Backbone Networks, and Comprehens
5 b
Virtual LANs ion
Give Explain the function and basic operation of the following Application,
6 b
Frame Relay Synthesis
a
7 Discuss about the Logical Addressing, IPv4 Addresses Comprehension
Comprehension,
8 Explain about the Internet protocol, Internetworking e
Synthesis,
Explain about the Forwarding and routing, delivery, forwarding, Comprehens
9 d
Unit cast Routing protocols, Multi cast routing protocols. ion
Explain the about the mapping b/w IPv4, IPv6 transition from IPv4 Application,
10 e
to IPv6 Synthesis
11 Describe the QOS in Switched networks d
UNIT – III
1 Describe Integrated Services, Differentiated services Comprehension c
Comprehension,
2 Explain about the Internet protocol, Internetworking d
Synthesis,
Explain about the Forwarding and routing, delivery, Knowledge,
3 e
forwarding, Unicast Routing protocols, Comprehension
Explain the about the mapping b/w IPv4, IPv6 transition from IPv4 Comprehension,
4 a
to IPv6 Synthesis,
Knowledge,
5 Describe the QOS in Switched networks d
Comprehension
Knowledge,
6 Describe Integrated Services, Differentiated services e
Comprehension
UNIT – IV
1 Explain Electronic mail, File Transfer Comprehension, d
Discuss the purpose of Electronic mail and file Transfer, Remote Evaluation
2 e
Logging Synthesis
Write about Distributed of name space DNS in the Internet, Application,
3 f
Resolution, DNS messages Synthesis
Knowledge
4 List function of a Telnet f
Synthesis
UNIT-V
Comprehension,
1 Discuss transport service primitives a
Evaluation
Describe the concepts of TCP, UDP, SCTP, Congestion control and Comprehension,
2 b
Quality of service Evaluation
3
Compare NSAP & TSAP Analysis, d
4 Explain protocol scenarios for releasing a connection Comprehension, e
5 Give functionality that is supported by user agen Comprehension f
Blooms
S. Course
Question Taxonomy
No Outcome
Level
UNIT-I
Define computer networks? Discuss various types of networks
1 Comprehension a
topologiesin computer network. Also discuss various advantages and

Department of CSE
disadvantages
2 List the applications of Computer Networks? Knowledge a
Comprehension,
3 Explain the following:- a) LAN b) MAN c) WAN d) ARPANET Synthesis, b
Evaluation
Comprehension,
Explain TCP/IP Model? Explain the functions and protocols and
4 Synthesis, b
services of each layer? Compare it with OSI Model.
Evaluation
Comprehension,
Explain IP addressing. How it is classified? How is subnet addressing is
5 Synthesis, d
performed?
Evaluation
Comprehension,
6 Explain the following: i. TCP ii. UDP Synthesis, f
Evaluation
7 Discuss star topology is commonly preferred? Knowledge a
8 State In what situations contention based MAC protocols are suitable? Knowledge b
Explain; Is there any relationship between transmission media and Comprehension,
9 a
topology? Synthesis,
Comprehension,
Explain vulnerable period. How it affects the performance in MAC
10 Synthesis, b
protocols?
Evaluation
UNIT-II
Discuss how throughput is improved in slotted ALOHA over pure
1 Knowledge c
ALOHA?
Comprehension,
Explain how performance is improved in CSMA/CD protocol
2 Synthesis, c
compared to CSMA protocol?
Evaluation
Discuss the parameter ‘a’? How does it affect the performance of the
3 Comprehension d
CSMA protocol?
4 Define point to point protocol. Explain the frame format of PPP. Knowledge d
5 Explain in detail CSMA Protocol in detail. Comprehension, d
Comprehension,
Explain pure ALOHA and slotted ALOHA? Consider the delay of both
6 Synthesis, f
at low load. Which one is less? Explain your answer
Evaluation
Comprehension,
7 Explain in detail CSMA/CD Protocol in detail. How it detects collision. f
Synthesis,
What are bridges? Give the characteristics of them. Compare bridges
8 Knowledge b
with routers.
9 Define Spanning tree bridges and Source routing bridges. Knowledge c
10 List the the limitations of bridges. Knowledge b
UNIT-III
Briefly explain the services provided by physical layer to network
1 Comprehension, d
layer.
Explain IPv6. Explain its advantages over IPv4. Also explain its frame Comprehension,
2 c
format. Synthesis,
3 Discuss network layer design issues. Comprehension e
Compare FDMA, TDMA and CDMA in terms of their ability to handle
4 Knowledge b
groups of stations?
Discuss with connection oriented and connection-less network
5 Knowledge c
routing.
6 Discuss about hierarchichal routing. Comprehension c
7 Explain basic IEEE 802.3 Ethernet MAC Data Frame. Comprehension, b
Briefly describe the reasons why a single organization may end up with
8 Comprehension b
multiple LANs and choose bridges
9 Discuss the standard Ethernet cabling and cable topologies. Comprehension b
10 Describe the addressing mechanism in 802.11( Wi-Fi). Comprehension c
UNIT-IV
1 Describe shortest path algorithm with a suitable illustration Knowledge, d

Department of CSE
2 Describe the distance vector routing algorithm Knowledge, d

3 Describe the frame format, operation and ring maintenance feature of Comprehension, b
4 IEEE 802.5 MAC protocol. Evaluation c
5 How a Token Ring LAN does operate? Discuss Knowledge c
Given the address 23.56.7.91 and the default class A mask, find the Synthesis,
6 e
beginning address (network address). Evaluation
7 Describe the functions of MAC sub layer. Comprehension, c
8 List out the advantages and drawbacks of ring topology. Synthesis, c
9 List out the advantages and drawbacks of bus topology. Evaluation d
UNIT-V
1 Write about TCP segment Header. Application, e
2 Differentiate between ISO-OSI and TCP/IP reference model. Analysis f
Write two ways in which computer applications differ from network
3 Synthesis b
applications ?
4 List the features of SSH. Knowledge d
5 Describe DNS Knowledge, e
6 Explain DHCP Comprehension, f
Discuss the following terms with respect to ATM: VPI, UNI,
7 Comprehension e
synchronous, AAL, Cell , PVC.
8 Explain TELNET Comprehension, f
9 Discuss functions of application layer Comprehension f
10 Discuss electronic mail. Comprehension e
Blooms
S. Course
Question Taxonomy
No Outcome
Level
UNIT-I
Draw a CRC encoder and decoder for CRC code with C (7, 4). Also
1 Knowledge b
explain how this CRC design works, with an example.
If the transmitted code word is 10011000 and the received code word
2 is11001001. What is the error word? Write transmitted code word, Comprehension c
received code word and error word as polynomials.
Compare synchronous time division multiplexing with statistical time Application,
3 d
division multiplexing. Synthesis
UNIT-II
1 Explain remote bridges with a neat diagram. Comprehension b
A large population of ALOHA users manages to generate 50 requests
/sec , including both originals and retransmissions. Time is slotted in
the units of40 msec.
2 Knowledge c
i. What is the chance of success on the first attempt?
ii. What is the probability of exactly k collisions and then a success?
iii. What is the expected number of transmission attempts needed??
UNIT-III
Analysis ,
1 Compare IPV4 and IPV6. e
Evaluation
2 State the problems due to congestion.. Knowledge d
3 Discuss Link state routing algorithm. Comprehension d
UNIT-IV
1 Discuss distance vector algorithm. Comprehension e
Illustrate simplex, half-duplex and full duplex modes. Explain with
2 relevant examples for each. What mode is used when two people are Analysis b
communicating by a telephone line?
Using Differential Manchester encoding scheme, draw the time vs.
3 Understand c
amplitude graphs for the bit stream 0101101001.
UNIT-V

Department of CSE
What is the average number of transmission required to send a frame of Application,

1 f
length 1600 bytes correctly, if the bit error rate is 1 x 10-6. Synthesis
What are the various classes of IP addressing? Calculate the maximum
2 Knowledge f
number of class A, B and C network Ids.
What do you understand by the term ‘structured cabling’. State the
main rules that should be used when installing a cable. Show that
3 Understand c
maximum cabling area for LAN for horizontal cabling runs is
approximately 200m.
If the transmitted code word is 10011000 and the received code word
4 is11001001. What is the error word ? Write transmitted code word , Comprehension c
received code word and error word as polynomials.

Department of CSE
15. OPERATING SYSTEMS LAB (A50589)

15.1 SYLLABUS
Objectives:
• To use Linux pertaining system for study of operating system concepts.
• To write the code to implement and modify various concepts in operating systems using
Linux.
List of Programs:
1. Simulate the following CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS d) Priority
2. Simulate all file allocation strategies
a) Sequential b) Indexed c) Linked
3. Simulate MVT and MFT
4. Simulate all File Organization Techniques
a) Single level directory b) Two level c) Hierarchical d) DAG
5. Simulate Bankers Algorithm for Dead Lock Avoidance
6. Simulate Bankers Algorithm for Dead Lock Prevention
7. Simulate all page replacement algorithms
a) FIF b) LRU c) LFU Etc.
8. Simulate Paging Technique of memory management.
Oucomes:
• The course objectives ensure the development of students applied skills in operating
systems related areas.
• Student’s willg in knowledge in writing of software routines modules or implementing
various concepts of perating systems.

Department of CSE
15.2 LAB SESSION PLANNER
DATE OF DATE OF
S. NO WEEK NO EXPERIMENT NAME
PLANNED CONDUCTED
Simulate the following CPU Scheduling
1 WEEK 1 Algorithms
a) FCFS b) SJF
Simulate the following CPU Scheduling
2 WEEK 2 Algorithms
c) Round Robin d) Priority
Simulate file Allocation strategies:
3 WEEK 3
a)Sequential b) Indexed c) Linked
Simulate Multiple Programming with fixed
4 WEEK 4
Number of Tasks (MFT)
Simulate multiple Programming with
5 WEEK 5
Variable Number of Tasks (MVT)
Simulate Banker’s Algorithm for Deadlock
6 WEEK 6
Avoidance
7 WEEK 7 Simulate Algorithm for Deadlock Prevention.
Simulate page replacement algorithms:
8 WEEK 8
a) FIFO b) LRU c)LFU
Simulate Paging Technique of memory
9 WEEK 9
management
Simulate all file Organization Techniques
10 WEEK 10
a) Single level b) Two Level
Simulate all file Organization Techniques
11 WEEK 11
c) Hierarchical d) DAG

Department of CSE
16.0 COMPILER DESIGN LAB (A50587)

16.1 SYLLABUS
Objectives:
• To provide an understanding of the language translation peculiarities by designing a
complete translator for a mini language.
Recommended System/Software Requirements:

• Intel based desktop PC with minimum of 166 MHZ or faster processor with at least 64
MB RAM & 100 MB free disk space
• C++ compiler and JDK kit
Consider the following mini Language, a simple procedural high-level language, only
operating on integer
Data, with a syntax looking vaguely like a simple C crossed with Pascal. The syntax of the
language is
Defined by the following BNF grammar:
<program> ::= <block>
<block> ::= { <variabledefinition><slist> }
| { <slist> }
<variabledefinition> ::= int<vardefist> ;
<vardefilist> ::= <vardec> | <vardec>, <vardeflist>
<vardec> ::= <assignment> | <ifstatement> | <whilestatement>
<slist> ::= <statement> | <statement> | <whilestatement>
| <block> | <printstatement> | <empty>
<assignment> ::= <identifier> = <expression>
| <identifier>{ <expression>> } = <expression>
|<ifstatement> ::= if <bexpresssion> then <slist> else <slist>endif
| if<bexpression> then <slist>endif
<whilestatement> ::= while <bexpression> do <slist>enddo
<printstatement> ::= print ( <expression> )
<expression> ::= <expression><addingop><term> | <term> | <addingop>
<term>
<bexpression> ::= <expression><relop><expression>
<relop> ::= < \ < = | == | >= | > \ !=
<addingop> ::= + | -
<term> ::= <term><multop><factor> | <factor>
<multop> ::= * | /
<factor> ::= <constant> | <identifier> | <identifier> { <expression> }
1 ( <expression> )
<constant> ::= <digit> | <digit><constant>
<identifier> ::= <identifier><letterordigit> | <letter>
<letterodigit> ::= <letter> | <digit>
<letter> ::= alblcldlelflglhliljlklmlnlolplqlrlsltlulvlwlxlylz
<digit> ::= 0l1l2l3l4l5l6l7ll9
<empty> has the obvious meaning
Comments (zero or more characters enclosed between the standard C/Java style
comentbracket ?
*…*/) can be inserted. The language has rudimentary support for 1
Dimensional arrays. The declaration

Department of CSE
Inta[3] declares an array of three elements, referenced as a[0], a[1] and a[2]. Note also that
you should
Worry about the scoping of names.
A simple program written in this language is:
{ int a[3], t1, t2’
T1=2’
A[0]=1; a[1]=2; a [t1]=3;
T2=-(a[2]+t1*6)/a[2]-t1);
If t2>5 then
Print(t2);
Else {
Int t3;
T3=99;
T2=25;
T3=99;
T2=25;
Print(-t1+t2*t3); /* this is a comment
On 2 lines */
} endif }
1. Design a Lexical analyzer for the above language. The lexical analyzer should ignore
redundant spaces, tabs and newlines. It should also ignore comments. Although the
syntax specification states that identifiers can be arbitrarily long. You may restrict the
length to some reasonable value.
2. Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer
generating tools.
3. Design Predictive parser for the given language
4. Design LALR bottom up parser for the above language.
5. Convert the BNF rules into Yacc form and write code to generate abstract syntax tree.
6. Write program to generate machine code from the abstract syntax tree generated by the
parser. The following instruction set may be considered as target code.
The following is a simple register-based machine, supporting a total of 17 instructions. It has

three distinct internal storage areas. The first is the set of instructions. It has three distinct
Internal storage areas. The first is the set of 8 registers, used by the individual instructions as
detailed below, the second is an area used for the storage of variables and the third is an area
used for the storage of program. The instructions can be preceded by a label. This consists of
an integer in the range 1 to 9999 and the label is followed by a colon to separate it from the
rest of the instruction. The numerical label can be used as the argument to a jump instruction,
as detailed below.
In the description of the individual instructions below, instruction argument types are
specified as follows:
R
Specifies a register in the form R0, R1, R2, R3, R4, R5, R6, R7 (or r0, r1, etc..).
L
Specifies a numerical label (in the range 1 to 9999).
V
Specifies a “variable location” (a variable number, or a variable location pointed to by a
register – see
below)
A

Department of CSE
Specifies a constant value, a variable location, a register or a variable location pointed to by a

register (an indirect address). Constant values are specified as an integer value, optionally
preceded by a minus sign, preceded by a # symbol. An indirect address is specified by an @
followed by a register.
So, for example, an A-type argument could have the form 4 (variable number 4), #4 (the
constant value), r4 (register 4) or @r4 (the contents of register 4 identifies the variable
location to be accessed).
The instruction set is defined as follows:
LOAD A, R
Loads the integer value specified by A into register R.
STORE R.V
Stores the value in register R to variable V.
OUT R
Outputs the value in register R.
ADD A, R
Adds the value specified by A to register R, leaving the result in register R,
SUB A,R
Subtracts the value specified by A from register R, leaving the result in register R.
MUL A,R
Multiplies the value specified by A by register R, leaving he result in register R.
DIV A,R
Divides register R by the value specified by A, leaving the result in register R.
JMP L
Causes an unconditional jump to the instruction with the label L/
JEQ R, L
Jumps to the instruction with the lable L if the value in register R is zero.
JNE R, L
Jumps to the instruction with the label L if the value in register R is not zero.
JGE R, L
Jumps to the instruction with the label L if the value in register R is greater than or equal to
zero.
JGT R, L
Jumps to the instruction with the label L if the value in register R is greater than zero.
JLR R,L
Jumps to the instruction with the label L if the value in register R is less than JLR R,L
Jumps to the instruction with the label L if the value in register R is less than zero.
NOP
Is an instruction with no effect. It can be tagged by a label.
STOP
Stops execution of the machine. All programs should terminate by executing a STOP
instruction.
Outcomes:
• By this laboratory, students will understand the practical approach of how a compiler
works.
• This will enable him to work in the development phase of new computer languages in
industry.

Department of CSE
16.2 LAB EXPERIMENT SCHEDULE
DATE OF DATE OF
S NO WEEK NO EXPERIMENT NAME
PLANNED CONDUCTED
1 1 Design A Lexical Analyzer
Implement lexical analyzer using lexical

2 2
analyzer generating tools
Predictive Parser of the
3 3
RECURSIVE DESCENT PARSER
4 4 Design of LALR
5 5 Convert the BNF rules into YACC
6 6 To generate machine code

Iii-I Final Copy 23-7-16 2.00PM

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Iii-I Final Copy 23-7-16 2.00PM

Caricato da

Copyright:

Formati disponibili

Department of CSE

MLR Institute of Technology, Dundigal, Hyd-500043 Page 1

MLR Institute of Technology, Dundigal, Hyd-500043 Page 2

8. III YEAR CSE COURSE STRUCTURE

CODE SUBJECT L T/P/D C

A50511 PRINCIPLES OF PROGRAMMING LANGUAGES 4 - 4

A50017 INTELLECTUAL PROPERTY RIGHTS 4 - 4

A50518 SOFTWARE ENGINEERING 4 - 4

A50514 COMPILER DESIGN 4 - 4

A50510 OPERATING SYSTEMS 4 - 4

A50515 COMPUTER NETWORKS 4 - 4

A50589 OPERATING SYSTEMS LAB - 3 2

A50587 COMPILER DESIGN LAB - 3 2

MLR Institute of Technology, Dundigal, Hyd-500043 Page 3

9. PRINCIPLES OF PROGRAMMING LANGUAGES (A50511)

Course Title PRINCIPLES OF PROGRAMMING LANGUAGES

9.1 COURSE OVERVIEW:

Level Credits Periods/Weeks Prerequisites

9.3. A) MARKS DISTRIBUTION:

MLR Institute of Technology, Dundigal, Hyd-500043 Page 4

9.3 B) Expected Learning Outcomes and Methods for Assessing

S. No Expected Learning Outcomes Assessment method (s)

a Demonstrating the use of scripting languages. Assignment and exercises

9.4 EVALUATION SCHEME:

S. No Component Duration Marks

9.5 COURSE OUTCOMES:

MLR Institute of Technology, Dundigal, Hyd-500043 Page 5

scope, and substitution of variables. in ADA,C++ Languages

BLOOMS LEVEL (BL)

9.6 HOW PROGRAM OUTCOMES ARE ASSESSED:

F An understanding of professional, social and ethical responsibility N .......

M An ability to setup an enterprise. N .......

MLR Institute of Technology, Dundigal, Hyd-500043 Page 6

programming, Logic programming, Programming language implementation – Compilation

MLR Institute of Technology, Dundigal, Hyd-500043 Page 7

9.8 COURSE PLAN:

Introduction, primitive, character.

MLR Institute of Technology, Dundigal, Hyd-500043 Page 8

a program. Short circuit evaluation mixed mode

MLR Institute of Technology, Dundigal, Hyd-500043 Page 9

MLR Institute of Technology, Dundigal, Hyd-500043 Page 10

Implementation – of Syntax and Semantics

MLR Institute of Technology, Dundigal, Hyd-500043 Page 11

MLR Institute of Technology, Dundigal, Hyd-500043 Page 12

MLR Institute of Technology, Dundigal, Hyd-500043 Page 13

Blocks: Fundamentals student will identify concepts

MLR Institute of Technology, Dundigal, Hyd-500043 Page 14

functions program names, design

MLR Institute of Technology, Dundigal, Hyd-500043 Page 15

Subprogram level student will identify concepts

MLR Institute of Technology, Dundigal, Hyd-500043 Page 16

9.9 MAPPING COURSE OBJECTIVES LEADING TO THE ACHIEVEMENT OF

Course Course Outcomes

9.10 MAPPING COURSE OUTCOMES LEADING TO THE ACHIEVEMENT OF

Course Program Outcomes

MLR Institute of Technology, Dundigal, Hyd-500043 Page 17

9.11 OBJECTIVE BITS

MLR Institute of Technology, Dundigal, Hyd-500043 Page 18

MLR Institute of Technology, Dundigal, Hyd-500043 Page 19

MLR Institute of Technology, Dundigal, Hyd-500043 Page 20

MLR Institute of Technology, Dundigal, Hyd-500043 Page 21

MLR Institute of Technology, Dundigal, Hyd-500043 Page 22

MLR Institute of Technology, Dundigal, Hyd-500043 Page 23