Question Bank: B.Tech Iii Year - I Sem (R17) (2019-20)

QUESTION BANK
B.TECH III YEAR – I SEM (R17)

(2019-20)
DEPARTMENT OF
COMPUTER SCIENCE AND ENGINEERING
MALLA REDDY COLLEGE OF ENGINEERING &

TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
Recognized under 2(f) and 12 (B) of UGC ACT 1956
(Affiliated to JNTUH, Hyderabad, Approved by AICTE - Accredited by NBA & NAAC – ‘A’ Grade - ISO 9001:2015 Certified)
Maisammaguda, Dhulapally (Post Via. Hakimpet), Secunderabad – 500100, Telangana State, India
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
Permanently Affiliated to JNTUH, Approved by AICTE-Accredited by NBA & NAAC- A-Grade; ISO
9001:2008 Certified
B.Tech III Year I Semester Examinations
COMPILER DESIGN (A50514)

Time : 3.00 Hours MODEL PAPER -1 Max.Marks: 70
____________________________________________________________________________________
Answer any 5 questions (5x14 = 70 Marks)
Section -1
1. Discuss the phases of a compiler indicating the inputs and outputs of each phase in translating
the statement “amount = principle + rate * 36.0 ” [14M]
OR
2. Define an LL(1) grammar. Is the following grammar LL(1). G:S → iEtS | iEtSes |a , E → b.
Also write the rules for computing FIRST() and FOLLOW(). [14M]
Section -2
3. What is an LALR(1) grammar?. Construct LALR parsing table for the following grammar:
S→ CC, C → cC , C → c|d . [14 M]
OR
4. Explain the usage of YACC parser generator in construction of a Parser. [14M]
Section -3
5. What are different intermediate code forms? Discuss different Three Address code types and
implementations of Three Address statements. [14 M]
OR
6. With a neat diagram explain the format of the Symbol Table. And discuss the tree structures
representation of scope information. [14 M]
Section -4
7. Explain the following code optimization techniques with examples . [5M+4M+5M]
a) Constant propagation b) Strength reduction c) Code Motion
8. a) What is an induction variable? Explain with an example. [7 M]
b) Discuss how induction variables can be detected and eliminated from the given [7 M]
intermediate code
B2: i:= i+1
t1:=4*j
t2:=a[t1]
if t2<10 goto B2
Section -5
9. Explain various issues in the design of the code generation. [14M]
OR
10. a). Explain the code generation algorithm in detail. [7M]
b). Write short notes on peephole optimization. [7M]

9001:2008 Certified

____________________________________________________________________________________
Answer any Five questions (5x14 = 70 Marks)
Section -1
1. List out the functions of a Lexical Analyzer? State the reasons for the Separation of Analyses
programs into Lexical, Syntax, and Semantic Analyses. [14 M]
OR
2. Define a Parser. What is the role of grammars in Parser construction? Construct the Predictive
parsing table for the grammar G : E → E+T |T , E →T*F |F , F →(E) |id. [14M]
Section -2
3. What is an LR(0) item? Construct an SLR parsing table for the grammar
G: S→ L=R |R, L → *R | id, R → L. Is it SLR(1) grammar? [14 M]
OR
4. Construct SLR parsing table for the following grammar: R-> R’|’R|RR|R*|(R)|al b [14 M]
Section -3
5. What do you mean by attributed grammars? Discuss the a translation scheme for Converting
an infix expression to its equivalent postfix form. [14 M]
OR
6.a) Define activation records.
b)Explain how it is related with runtime storage allocation. [7 M+7M]

Section -4
7. What is the role of code Optimizer in compiler? Is it a mandatory phase? [14 M]
8. What is DAG and flow graph? Explain their role in compilation process. [14 M]
Section -5
9 a) Explain why next-use information is required for generating object code? [7M+7M]
b) Explain the main issues in code generation.
OR
10. a) Define code generation . [4 M+10M]
b) Generate code for the following C program using any code generation algorithm.
main()
Int I;
Int a[10];
while(i<=10)
a[i]=0;
}
9001:2008 Certified

____________________________________________________________________________________
Section -1
1.a)What is LEX? [4M+10M]
b)Discuss the usage of LEX in Lexical Analyzer generation.
OR
2.a) Write a note on the parse generator '_ YACC. [7M+7M]
b) Write the YACC specification of a simple desk calculator as given:

E->E+T/T T->T*F /F F -> (E) | digit where digit between 0 to 9.
Section -2
3. a) Obtain the directed acycJic graph for the expression : x+x*(y+ z)+(y+z)* w [7M+7M]
.
b) Explain the following with example: i) Quadqaples ii) Triples iii) Indirect triple
OR
4. Compare and contrast SLR with LALR. Define Kernel items and Non-kernel items. [14 M]
Show the following grammar is LALR(1)
S-> Aa | bAc | dc | bda
A-> d
Section -3
5. Generate the three address code for the following code fragment. [14 M]
a=b+1 x=y+3 y=a/b a=b+c
OR
6. Write a note on simple type checker and list the different types of type checking [14 M]
Section -4
7. What is the role of code Optimizer in compiler? Is it a mandatory phase? [14 M]
OR
8. a) Construct a DAG for the expression: a+a*(b-c)+(b-c)*d [7M+7M]
b) Explain various machine independent code optimization techniques.
Section -5
9. a) Discuss Global Register Allocation in code generation. [7 M+7M]
b) Generate code for the following C statements: i) x=f(a)+f(a) ii) y=x/5;.
OR
10. Consider the following basic block of 3-address instructions: [14M]
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.
9001:2008 Certified

____________________________________________________________________________________
Section -1
1. What is LEX? Discuss the usage of LEX in Lexical Analyzer generation. [14 M]
OR
2. State the various phases of a compiler and explain them in detail. [14 M]
Section -2
3. Prepare a canonical parsing table for the given grammar: [14 M]
S-> CC
C-> cC / d OR
4. Compare and contrast SLR with LALR. Define Kernel items and Non-kernel items. [14 M]
Show the following grammar is LALR(1)
S-> Aa | bAc | dc | bda
A-> d
Section -3
5. Generate the three address code for the following code fragment. [14 M]
while(a>b)
if(c<d)
x=y+z;
else
x=y-z;
OR
6. Explain the use of symbol table in compilation process. List out the various attributes for
implementing the symbol table. [14 M]
Section -4
7. Explain the different storage allocation strategies. [14 M]
OR
8. Explain the role of DAG in optimization with example. [14 M]
Section -5
9. Generate code for the following: a) x=f(a)+f(a)+f(a) ii) x=f(f(a))
b) i) x=++f(a) ii) x=f(a)/g(b,c) [7M+7M]
OR
10. Explain the following terms: i) Register Descriptor ii) Address Descriptor iii) Instruction
Costs [14 M]
Computer Graphics(R17A0517)
MODEL QUESTION PAPER-I
III CSE I Semester
Duration: 3hrs Max Marks: 70
ANSWER ANY FIVE QUESTIONS 5*14=70M
SECTION -I
1 a) What are the application areas of computer graphics? Explain briefly? [7+7]
b)Explain about video display devices?
OR
2.Consider a raster display system with resolution of 800 by 400. How many pixels could
be accessed per second by a display controller that refreshes the screen at the rate of 60
frames per second? [14]
SECTION -II
3.Give the transformation matrix for the following? [7+7]

i)To shift left by 2 units and due to rotate by 450 clockwise.
ii) To reflect with respect to y=-x axis.
OR
4.Derive the transformation matrices for rotation and translation in 2-D Cartesian
coordinate system? [14]
SECTION -III
5 a)Define the blending function for B-spline curve? [7+7]

b)List various polygon rendering methods?
OR
6. Write a short notes on [5+5+4]
a) Quad tree b) BSP trees c) Boundary representation of solids
SECTION -IV
7 .What are the steps involved in depth buffer algorithm? [14]

OR
8 Explain the Warnock’s algorithm? [14]
SECTION -V
9 what are the various types of interpolation used in animation? [14]

OR
10 What are the characteristics of key frame animation? [14]
MODEL QUESTION PAPER-II
III CSE I Semester
ANSWER ANY FIVE QUESTIONS 5*14=70
SECTION -I
1a)Explain briefly about the video display device? [7+7]

b)Explain briefly about the construction of plasma panel display?
OR
2.Explain briefly about the basic transformations? [14]
SECTION -II
3 With an example explain cohen-sutherland line clipping algorithm? [14]

OR
4 .Explain Sutherland Hodgeman polygon clipping? [14]
SECTION -III
5 .Write short notes on parallel and perspective projections?. [14]

OR
6.Explain in detail about 3D window to viewport coordinate transformations?[14]
SECTION –IV
7.Explain Back face detection method and painters algorithm? [14]

OR
8.Explain depth buffer algorithm for hidden surface removal? [14]
SECTION –V
9.Write about different computer animation languages? [14]

OR
10 . Explain the steps in the design of animation sequence?. [14]
MODEL QUESTION PAPER-III
III CSE I Semester

SECTION -I
1.Explain the mathematical procedure in deciding the points on the periphery of the
ellipse using mid point ellipse algorithm [14]
OR
2.What are the steps involved in the DDA line drawing algorithm [14]
SECTION -II
3.What is the principle of cyrus-Beck algorithm for clipping polygon? Illustrate with an
example. [14]
OR
4.What are the stages involved in the window to viewport coordinate transformation.
Explain about each stage. [14]
SECTION -III
5.Explan Gouraud shading? [14]

OR
6.Derive the matrices for rotation about three principle axis in 3-D graphics [14]
SECTION -IV
7.Discuss about the scan line method for visible surface detection. [14]
OR
8. Which algorithms are suitable for hidden surface removal of objects with non-planar
surface .justify?
[14]
SECTION -V
9.Discuss about the techniques used to achieve the simple animation effects. [14]
OR
10.List the typical tasks for which the animation functions are defined in animation
languages. [14]
MODEL QUESTION PAPER-IV
III CSE I Semester

SECTION -I
1. a)What are the application areas of computer graphics? Explain briefly? [7+7]
b)describe the bresenham line drawing algorithm with an example?
OR
2.a)describe about the flat pnnel display devices [7+7]
b)draw the flowchart for midpoint circle generation algorithm?
SECTION -II
3.a)Scale the polygon with co ordinates A(2,5),B(7,10)and C(10,2) by 2 units in X

direction and 2 units in y direction [7+7]
b)Explain about the midpoint subdivision line clipping algorithm with an example?
OR
4.Explain how transformation can be performed between coordinate systems? [7+7]
b)Explain about Sutherland Hodgeman polygon clipping algorithm?
SECTION -III
5.a) Explain polygon rendering methods? [7+7]

b)Differentiate between parallel and perspective projections?
Or
6.a) what is the blending function for the B-Spline cuve. Construct the B-Spline curve of
order 4 and with 4 polygon vertices A(1,1),B(2,3),C(4,3) and D(6,4) [7+7]
b)compare various basic transformation matrices in 2D and 3D graphics?
SECTION -IV
7.Explain about the BSP –TREE Method? [7+7]

b)Explain how area sub division algorithm works for visible surface detection?
OR
8.a) write an algorithm for depth sorting? [7+7]
b)differentiate between the object space and image space hidden surface algorithms?
SECTION -V
9.a)Explain the functions of computer animation? [7+7]
b)Explain about the motion specifactions?
OR
10.a) what are the issues for designing an animation sequence? [7+7]
b)Describe about the key frame systems?
R17
Code No: R17A0514
TECHNOLOGY
III B.Tech I Semester Model Question Paper – 1
Computer Networks
(CSE)
Time: 3 hours Max. Marks: 70

Note: This question paper Consists of 5 Sections. Answer FIVE Questions, Choosing ONE
Question from each SECTION and each Question carries 14 marks.
*********
SECTION – I
1. (a)Compare and contrast a circuit-switched network and a packet-switched network [7]
(b) Explain OSI reference model and compare it with TCP/IP. ? [7]
(OR)
2. (a)Explain CSMA/CD protocol? [7]
(b)Explain selective repeat protocol with neat diagram [7]
SECTION – II
3. (a) What are the services provided to the Network Layer by Data Link Layer? Explain.
[7]
(b) Given 1101011011 data frame and generator polynomial G(x) = x4 + x + 1. Derive the
transmitted frame. [7]
(OR)
4. Describe the significance of error detection and error correction mechanisms in data link
layer. [14]
SECTION – III
5. Explain distance vector routing algorithm and what is count to infinity problem provide
solutions [14]
(OR)
6 (a) Discuss the IP addressing methods. [7]
(b) .Write short notes on ARP. [7]
SECTION – IV
7. Explain TCP connection management with neat diagram. [14]
(OR)
8. Explain the congestion control in TCP. [14]
SECTION – V
9 Describe how SMTP protocol is used in E-mail applications [14]
(OR)
10. (a)Explain the features of FTP and its operation. [10]
(b) Discuss the features of TELNET. What is the need for network virtual terminal? [4]
*****
R17
Code No: R17A0514
TECHNOLOGY
III B.Tech I Semester Model Question Paper – 2
Computer Networks
(CSE)
*********
SECTION – I
1. (a)Explain different types of switching techniques along with their advantages and
disadvantages. [7M]
b) Explain Guided media with neat diagrams.[7M]
(OR)
2 (a) Write short notes on TCP/IP model. [7M]
(b) Explain the OSI reference model. [7M]
SECTION – II
3 Compare various sliding window protocols of data link layer. [14M]
(OR)
4 What is the purpose of CSMA/CD? And also explain it. [14M]
SECTION – III
5 Explain the various congestion control mechanisms. [14M]
(OR)
6 (a)What is Classless Inter Domain Routing. [7M]
(b)Explain The Address Resolution Protocol. [7M]
SECTION – IV
7 Explain Crash Recovery in Transport Layer. [14M]
(OR)
8 Explain the TCP segment header and TCP connection establishment. [14M]
SECTION – V
9 Describe how SMTP protocol used in Email application. [14M]
(OR)
10 (a)Explain (i ) HTTP (ii) TELNET. [7M]
(b) Explain Domain Name System. [7M]
******
Code No: R17A0514
R17
TECHNOLOGY
III B.Tech I Semester Model Paper - 3
Computer Networks
(CSE)

*********
SECTION – I
1 A) What are the different types of error detection methods? Explain the CRC error
detection technique using generator polynomial x4+x3+1 and data 11100011 [7M]
B) Explain about various guided transmission media in physical layer with a neat sketch.[7]
(OR)
2 A) Explain how are OSI and ISO related to each other. [5M]
B) Suppose a computer sends a frame to another computer on a bus topology LAN., the
physical destination address of the frame is corrupted during the transmission. what
happens to the frame how can the sender be informed about the situation [9M]
SECTION – II
3 Write in detail about sliding window protocols. [14M]
(OR)
4 A) What are the functions of medium access control layers protocol? Explain. [7M]
B) Compare and contrast a controlled access protocol with a channelizing protocol [7M]
SECTION – III
5 A) Derive the optimality principle with a suitable example [6M]
(B) Explain various congestion control mechanisms in detail [8M]
(OR)
6 A) Describe Dijkstra shortest path algorithm. Also show working of Dijkstra algorithm
with the help of an example. [7M]
B) Describe the problem and solutions associated with distance vector routing. [7M]
SECTION – IV
7 A) Describe three way hand shaking protocol to establish the transport level connection.
(B). Describe TCP header format [5M+9M]
(OR)
8 What happens when large packet wants to travel through network with smaller
maximum packet size? Explain [14M]
SECTION – V
9 What is cryptography and explain RSA algorithm with an example [14M]
(OR)
10 A) What is electronic mail? Describe in brief about sending and receiving e-mail. [9M]
(b) Write short notes on: [3+2=5M]
a) DNS
b) FTP
*****
Code No: R17A0514 R17
TECHNOLOGY
III B.Tech I Semester Model Paper - 4
Computer Networks
(CSE)
*********
SECTION – I
1 (a) Discuss about Internet standards [7M]
(b) Compare and contrast the OSI and TCP/IP reference models ? [7M]
(OR)
2 (a) Explain about Go Back ‘N’ Sliding Window Protocol? [7M]
(b) Explain the algorithm for CRC method of error checking [7M]
SECTION – II
3 Explain about the following: [7+7]
a) Spanning Tree Bridge b) Remote bridge.
(OR)
4 (a) Explain fast Ethernet and gigabit Ethernet. [7M]
(b) Illustrate the frame structure of IEEE 802.3 [7M]
SECTION – III
5 (a) What are the advantages of adaptive routing approach over non adaptive routing?
[4M]
(b) Explain various congestion control mechanisms in detail.[10M]
(OR)
6 Describe Dijkstra shortest path algorithm. Also show working of Dijkstra
algorithm with the help of an example. [14M]
SECTION – IV
7 (a). Illustrate the connection establishment and release in transport layer. [7M]
(b). Explain in detail about crash recovery. [7M]
(OR)
8 Explain the elements of a Transport protocol [14M]
SECTION – V
9 (a) Explain FTP protocol [7M]
(b) What are the services provided by transport layer to the upper layers [7M]
(OR)
10 What is DNS? What are the services provided by DNS and explain how it works
[14M]
11 *****
R17
Code No: xxxxxx
III B.Tech I Semester, Model Paper-I
Operating Systems
(CSE & IT)
Roll No

Note: This question paper Consists of 5 Sections. Answer FIVE Questions, Choosing ONE Question from
each SECTION and each Question carries 14 marks.
***
SECTION-I
1 a. What is an Operating system? Give its objectives. [7M]
b. Explain the various types of system calls in detail. [7M]
OR
2 Explain Evolution of operating systems. [14M]
SECTION-II
3 a. Explain different types of schedulers and scheduling queues [7M]
b. What is process? Explain different states of process. [7M]
OR
4 What is a monitor? Explain how dinning philosopher’s problem is solved using monitors [14M]
with example pseudo code.
SECTION-III
5 [8M]
a. Explain paging concept with neat diagram.
[6M]
b. Explain about shared pages.
OR
6 Explain LRU, FIFO page replacement algorithms for the following example reference [8M]
1,3,4,0,5,3,2,1,0,4,5,2,1,3,2,5 and frame size=3 and 4 and compare them.
Write short notes on allocation of frames. [6M]
SECTION-IV
7 a. What are different file access methods? [7M]
b. Discuss about free space management. [7M]
OR
8 a. Explain about disk structure. [7M]
b. Discuss about disk attachment. [7M]
SECTION-V
9 a. Write short notes on deadlock detection. [7M]
b. Explain different methods of recovery from deadlocks. [7M]
OR
10 Explain the different implementation methods of access matrix [14M]
**********
R17
Code No: xxxxxx
III B.Tech I Semester, Model Paper-II
Operating Systems
(CSE & IT)
Roll No

***
SECTION-I
1 a. What are the services provided by operating systems? [7M]
b. Explain in detail about virtual machines. [7M]
OR
2 Explain different operating system structures. [14M]
SECTION-II
3 Following is the snapshot of a CPU [14M]
Process CPU Burst Arrival Time
P1 75 0
P2 40 10
P3 25 10
P4 20 80
P5 45 85
Draw the Gantt chart and calculate the turnaround time and waiting time of the
jobs for FCFS (First Come First Served), SJF (Shortest Job First), SRTF (Shortest
Remaining Time First) and RR (Round Robin with time quantum 15) scheduling
algorithms.
OR
4 State and Explain critical section problem. Give software based solution(Peterson’s) for [14M]
critical section problem
SECTION-III
5 Explain different Page table structures with neat diagram. [14M]
OR
6 a. Explain Demand paging. [6M]
b. Discuss about paging with segmentation. [8M]
SECTION-IV
7 a. Explain different directory structures with examples. [10M]
b. Discuss about file mounting. [4M]
OR
8 a. Discuss about disk management. [7M]
b. Explain swap space management. [7M]
SECTION-V
9 a. What are the necessary conditions of deadlocks? [7M]
b. What are the different methods of handling deadlocks? [7M]
OR
10 a. Discuss about access control [6M]
b. Explain the following. [8M]
i. Goals of protection
ii. Principles of protection
**********
R17
Code No: xxxxxx
III B.Tech I Semester, Model Paper-III
Operating Systems
(CSE & IT)
Roll No

***
SECTION-I
1 a. Explain different components of an operating system. [7M]
b. Discuss about different modes of operations of an operating system. [7M]
OR
2 a. Differentiate between multiprogramming and timeshared operating systems. [7M]
b. Discuss about Operating System Design and Implementation. [7M]
SECTION-II
3 a. Explain about semaphores. [7M]
b. Explain multilevel queue scheduling and multilevel queue feedback [7M]
scheduling.
OR
4 Consider the following four processes, with the length of the CPU burst given in [14M]
milliseconds.
Process Arrival Time Burst Time
P1 0 5
P2 1 6
P3 2 2
P4 3 8
Calculate the average waiting time and average turnaround time for round robin
(time quanta=3), pre-emptive and non pre-emptive SJF.
SECTION-III
5 a. Differentiate between logical and physical address. [6M]
b. Explain about Contiguous memory allocation [8M]
OR
6 Discuss LRU approximation algorithms with examples. [14M]
SECTION-IV
7 a. Describe the following Directory Implementation methods? [7M]
i. Linear List ii. Hash Table
b. Explain the concept of file sharing? What are the criteria to be followed in systems [7M]
which implement file sharing?
OR
8 Consider that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is [14M]
currently serving request at cylinder 143, and the previous request was at cylinder 125.
The queue of pending requests, in FIFO order, is: 86, 1470, 913, 1774, 948, 1509, 1022,
1750, 130 Starting from the current head position, what is the total distance (in
cylinders) that the disk arm moves to satisfy all pending requests for each of the
following disk scheduling algorithms?
A. FCFS
B. SSTF
C. SCAN
D. C-SCAN
E. LOOK
F. C-LOOK
SECTION-V
9 a. Write banker’s algorithm for deadlock avoidance.
b. Consider the following snapshot of a system: [8M]
Processes Allocation Max Available
A B CD A B CD ABCD
P0 0012 0012 2100
P1 2000 2750
P2 0034 6656
P3 2345 4356
P4 0332 0652
Answer the following questions using the banker’s algorithm:
a) What is the content of the matrix Need?
b) Is the system in a safe state? Why?
c) Is the system currently deadlocked? Why or why not?
Which process, if any, or may become deadlocked if this whole request is granted
immediately?
OR
10 a. Explain about Cambridge CAP system. [7M]
b. does the programming language Java support protection? Explain [7M]
**********
R17
Code No: xxxxxx
III B.Tech I Semester, Model Paper-IV
Operating Systems
(CSE & IT)
Roll No

***
SECTION-I
1 a. What are the functions provided by operating system services? [8M]
b. Explain about special purpose systems. [6M]
OR
2 a. Explain different types of system programs. [7M]
b. Discuss about real-time systems and distributed systems. [7M]
SECTION-II
3 a. Differentiate between pre-emptive and non pre-emptive scheduling with [7M]
examples.
b. explain hardware based solutions for critical section problem [7M]
OR
4 Explain different Problems of Synchronization. [14M]
SECTION-III
5 a. Explain about swapping. [6M]
b. Explain segmentation with neat diagram. [8M]
OR
6 a. Explain optimal page replacement algorithm for the following example reference , 2, [8M]
3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6 and frame size=3 and 4 and compare
them.
b. Write a note on thrashing. [6M]
SECTION-IV
7 a. Explain different file allocation methods. [7M]
b. Explain the following file concepts: [7M]
i. File attributes
ii. File operations
iii. File types
iv. Internal file structure.
OR
8 a. A hard disk has 63 sectors per tracks, 10 platters each with 2 recording surfaces and [8M]
1000 cylinders. The address of a sector is given as a triple <c, h, and s> where c is the
cylinder number, h is the surface number and s is the sector number. Thus 0th sector is
addressed as <0, 0, and 0>, the 1st sector is Addressed as <0, 0, and 1> and so on.
Calculate the address of 1050th sector.
b. Explain how disk caching can improve disk performance? [6M]
SECTION-V
9 a. Consider the following snapshot of a system [8M]
Allocation Max Available
A B C D A B C D A B C D
P1 0 0 1 3 0 0 1 2 1 5 2 0
P2 1 0 0 0 1 7 5 0
P3 1 3 5 4 2 3 5 6
Answer the following questions using the banker’s algorithm:
a) What is the content of matrix “Need”?
b) Is the system in a safe state?
If a request from process P1 arrives for (0, 4, 2, 0) can the request be granted
immediately?
b. Write banker’s for deadlock detection. [6M]
OR
10 a. Discuss about domain of protection with example. [7M]
b. Explain Revocation of rights with examples. [7M]
**********
R17
Code No: XXXXXXX
QUESTION PAPER
SOFTWARE ENGINEERING
(CSE)
Roll No

Note:
Question paper Consists of 5 SECTIONS (One SECTION for each UNIT).
Answer FIVE Questions, Choosing ONE Question from each SECTION and each
Question carries 14 marks.
_____________________________________________________________________
SECTION-I
1). Explain iterative waterfall and spiral model for software life cycle and discuss various
activities in each phase.
[14M]
(OR)
2 ) List several software process paradigms. Explain how both waterfall model and prototyping
model can be accommodated in the spiral process model. [14M]
SECTION-II
3. ) Mention Non-functional requirements on software to be developed [14M]
(OR)
4. Explain the ways and means for collecting the software requirements and how are they
organized and represented? [14M]
SECTION-III
5 a) Explain about the various design concepts considered during design? [7M]
b) Write short notes on user interface design process? [7M]
(OR)
6 Describe decomposition levels of abstraction and modularity concepts in software design.
[14M]
SECTION- IV
7). Discuss the differences between black box and white box testing models. Discuss how these
testing models may be used together to test a program schedule. [14M]
(OR)
8. a) What do you mean by system testing? Explain in detail [10m]

b) Explain boundary value analysis. [4M]
SECTION- V
9. a) Justify the statement “Software maintenance is costlier”. [7M]

b) Discuss the concept of software maintenance process. [7M]
(OR )
10. Write short notes on

a) COCOMO estimation criteria. [7M]
b) Software metrics [7M]
***********
R17
Code No: XXXXXXX
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY 8
QUESTION PAPER
(CSE)
Roll No

Note:
_____________________________________________________________________
SECTION-I
1). Explain in detail Boehm's spiral model for software life cycle and discuss various activities in
each phase [14M]
(OR)
2. a) a) What is SPICE? Explain. [7M]
b) Discuss about CBAIPI [7M]
SECTION-II
3. a) Discuss in detail the data modeling activity [7M]
b) Write briefly about the utility of state transition diagram in analysis modeling activity
[7M]
(OR)
4. a) Compare functional and behavioral models. [7M]
b)With a suitable diagram explain the elements of the analysis model [7M]
SECTION-III
5 a) Explain in detail about the characteristics and criteria for a good design. [7M]
b) Describe the golden rules for interface design. [7M]
(OR)
6 a) discuss in detail about the design process in software development process [7M]
b) Justify “Design is not coding and coding is not design”. [7M]
SECTION- IV
7 a) Justify the importance of testing process [7M]

b) Discuss in detail about alpha and beta testing. [7M]
(OR)
8. Explain the integration testing process and system testing process and discuss their
outcomes [14M]
SECTION- V
9. (a) What is a software measure? Explain the importance of it in detail. [7M]

(b) Differentiate between direct and indirect measures in detail. [7M]
(OR )
10. Explain the role of software engineering methods in achieving software quality 14M]
***********
R18
Code No: XXXXXXX
QUESTION PAPER
(CSE)
Roll No

Note:
_____________________________________________________________________
SECTION-I
1. Explain about the Capability Maturity Model Integration and The waterfall model with
Figures [14]
(OR)
2. a) Explain about the Incremental process models with Figure [7M]
b) Explain about the RAD process models with Figure [7M]
SECTION-II
3. Discuss about the Context Models and Behavioral models [14M]
(OR)
4. Explain about the object models and structured methods. [14M]
SECTION-III
5. Explain about the User interface analysis and design [14M]
(OR)
6. Explain about the interface design steps and Design evaluation. [14M]
SECTION- IV
7 .Explain white box testing methods and its advantages and disadvantages. [14M]
(OR)
8. a)Explain about the Black-Box and White- Box testing. [7M]
b) Explain about the Alpha and Beta testing. [7M]
SECTION- V
9. a)Differentiate between Reactive vs. Proactive Risk strategies. [7M]
b) Differentiate between Risk identification and Risk projection. [7M]
(OR )
10. Explain about the Software reliability Growth Models [14M]

***********
R18
Code No: XXXXXXX
QUESTION PAPER
(CSE)
Roll No

Note:
_____________________________________________________________________
SECTION-I
1 a) Which is more important-the product or process? Justify your answer. [7M]
b) Identify the umbrella activities in software engineering process. [7M]
(OR)
2. List several software process paradigms. Explain how both waterfall model and
prototyping model can be accommodated in the spiral process model. [14M]
SECTION-II
3 a) Describe how software requirements are documented? State the
importance of documentation. [7M]
b) Explain the software requirement analysis and modeling.
[7M]
(OR)
4 Explain a typical SRS structure and its parts. [14M]
SECTION-III
5. What are the various model of abstraction? Discuss any two in detail? [14M]
(OR)
6 a) Explain the set of principles for software engineering design? [14M]
SECTION- IV
7a)Explain about the Black-Box and White- Box testing. [7M]

b)Explain about the Alpha and Beta testing. [7M]
(OR)
8a)Differentiate between Reactive vs. Proactive Risk strategies. [7M]
b) Differentiate between Risk identification and Risk projection. [7M]

SECTION-V
9) Explain about the Software reliability Growth Models [14M]
OR
10) Discuss about the The ISO 9000 quality standards [14M]
***********

Question Bank: B.Tech Iii Year - I Sem (R17) (2019-20)

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Question Bank: B.Tech Iii Year - I Sem (R17) (2019-20)

Uploaded by

Copyright:

Available Formats

QUESTION BANK

B.TECH III YEAR – I SEM (R17)

MALLA REDDY COLLEGE OF ENGINEERING &

B.Tech III Year I Semester Examinations

COMPILER DESIGN (A50514)

Answer any 5 questions (5x14 = 70 Marks)

the statement “amount = principle + rate * 36.0 ” [14M]

S→ CC, C → cC , C → c|d . [14 M]

4. Explain the usage of YACC parser generator in construction of a Parser. [14M]

7. Explain the following code optimization techniques with examples . [5M+4M+5M]

a) Constant propagation b) Strength reduction c) Code Motion

8. a) What is an induction variable? Explain with an example. [7 M]

B2: i:= i+1

9. Explain various issues in the design of the code generation. [14M]

10. a). Explain the code generation algorithm in detail. [7M]

b). Write short notes on peephole optimization. [7M]

B.Tech III Year I Semester Examinations

COMPILER DESIGN (A50514)

Answer any Five questions (5x14 = 70 Marks)

programs into Lexical, Syntax, and Semantic Analyses. [14 M]

G: S→ L=R |R, L → *R | id, R → L. Is it SLR(1) grammar? [14 M]

6.a) Define activation records.

b)Explain how it is related with runtime storage allocation. [7 M+7M]

7. What is the role of code Optimizer in compiler? Is it a mandatory phase? [14 M]

b) Explain the main issues in code generation.

10. a) Define code generation . [4 M+10M]

B.Tech III Year I Semester Examinations

Answer any Five questions (5x14 = 70 Marks)

1.a)What is LEX? [4M+10M]

b)Discuss the usage of LEX in Lexical Analyzer generation.

2.a) Write a note on the parse generator '_ YACC. [7M+7M]

b) Write the YACC specification of a simple desk calculator as given:

Show the following grammar is LALR(1)

S-> Aa | bAc | dc | bda

a=b+1 x=y+3 y=a/b a=b+c

7. What is the role of code Optimizer in compiler? Is it a mandatory phase? [14 M]

8. a) Construct a DAG for the expression: a+a*(b-c)+(b-c)*d [7M+7M]

b) Explain various machine independent code optimization techniques.

9. a) Discuss Global Register Allocation in code generation. [7 M+7M]

b) Generate code for the following C statements: i) x=f(a)+f(a) ii) y=x/5;.

10. Consider the following basic block of 3-address instructions: [14M]

a:=b+c x:=a+b b:=a-d c:=b+c d=a-d y=a-d

B.Tech III Year I Semester Examinations

Answer any Five questions (5x14 = 70 Marks)

3. Prepare a canonical parsing table for the given grammar: [14 M]

Show the following grammar is LALR(1)

S-> Aa | bAc | dc | bda

7. Explain the different storage allocation strategies. [14 M]

8. Explain the role of DAG in optimization with example. [14 M]

9. Generate code for the following: a) x=f(a)+f(a)+f(a) ii) x=f(f(a))

b) i) x=++f(a) ii) x=f(a)/g(b,c) [7M+7M]

ANSWER ANY FIVE QUESTIONS 5*14=70M

3.Give the transformation matrix for the following? [7+7]

5 a)Define the blending function for B-spline curve? [7+7]

7 .What are the steps involved in depth buffer algorithm? [14]

9 what are the various types of interpolation used in animation? [14]

ANSWER ANY FIVE QUESTIONS 5*14=70

1a)Explain briefly about the video display device? [7+7]

3 With an example explain cohen-sutherland line clipping algorithm? [14]

5 .Write short notes on parallel and perspective projections?. [14]

7.Explain Back face detection method and painters algorithm? [14]

9.Write about different computer animation languages? [14]

8. a) Construct a DAG for the expression: a+a(b-c)+(b-c)d [7M+7M]