Embed Size (px)
Citation preview
|''
||||'|'
'||'''
|''|
Co
de
No
: R
22
05
4
II B
. T
ech
II
Sem
est
er
Reg
ula
r E
xa
min
ati
on
s A
ug
ust
- 2
01
4
CO
MP
UT
ER
OR
GA
NIZ
AT
ION
(C
om
. to
CS
E,
EC
C)
Tim
e: 3
ho
urs
Max.
Mark
s: 7
5
An
swer
an
y F
IVE
Qu
esti
on
s
All
Quest
ion
s ca
rry E
qu
al
Mar
ks
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~
1.
a)
Ex
pla
in t
he
inst
ruct
ion
set
arc
hit
ect
ure
of
80
85.
b)
What
ad
dre
ssin
g m
ode
is u
sed
by t
he
foll
ow
ing i
nst
ructi
on
s fo
r th
e re
lati
vel
y s
imp
le C
PU
?
i)
MV
AC
ii)
CL
AC
iii)
JM
PZ
�
(8M
+7
M)
2.
a) E
xp
lain
an
d d
raw
nea
t ti
min
g d
iagra
ms
for
Mem
ory
Rea
d a
nd M
emo
ry W
rite
oper
atio
ns.
b)
Des
ign
an i
nte
rfac
e fo
r an
in
pu
t d
evic
e w
hic
h b
inar
y a
dd
ress
10
10
10
10.I
ts c
om
pu
ter
syst
em
use
s is
ola
ted I
/O.
(7
M+
8M
)
3.
a) E
xp
lain
bri
efly
ab
ou
t th
e sh
ift
mic
ro o
per
atio
n.
b)
Wri
te t
he
RT
L s
tate
men
ts f
or
the
foll
ow
ing t
ran
siti
on
s. A
ll r
egis
ters
are
1-b
it w
ide.
i) I
F �
= 1
TH
EN
co
py X
to W
an
d c
op
y Z
to Y
ii)
IF �
= 0
TH
EN
co
py X
to W
(8
M+
7M
)
4.
a) D
isti
ngu
ish
bet
wee
n H
ard
wir
ed c
on
tro
l u
nit
an
d M
icro
pro
gra
mm
ed C
ontr
ol
un
it.
b)
Dra
w a
nd e
xp
lain
bri
efly
ab
ou
t F
etch a
nd D
ecod
e cy
cle
s fo
r th
e S
imp
le C
PU
.
(
5M
+1
0M
)
5.
Des
ign
th
e R
TL
co
de
for
the
shif
t-ad
d m
ult
ipli
cati
on
UV
<--
X.Y
fo
r X
=9 a
nd
Y=
14
.
(1
5M
)
6.
a) D
isti
ngu
ish
bet
wee
n L
og
ical
ad
dre
ss a
nd P
hysi
cal
ad
dre
ss w
ith a
n e
xam
ple
.
b)
A c
om
pu
ter
syst
em u
sin
g t
he
rela
tivel
y s
imp
le C
PU
is
to i
ncl
ude
a 1
k a
sso
cia
tive
cache
wit
h
a li
ne
size
of
2 b
yte
s.
i) H
ow
man
y b
its
are
in e
ach l
oca
tio
n o
f th
e ca
che?
ii)
Wh
at m
ask v
alu
e is
nee
ded
fo
r th
e ass
oci
ativ
e m
emo
ry?
(7M
+8
M)
7.
a) D
isti
ngu
ish
bet
wee
n S
yn
chro
no
us
data
tra
nsf
er a
nd A
syn
chro
no
us
dat
a tr
an
sfer.
b)
What
is
an I
nte
rru
pt?
Ex
pla
in a
bo
ut
dif
fere
nt
typ
es
of
Inte
rru
pts
.
(
5M
+1
0M
)
8.
a) E
xp
lain
the
form
ats
use
d b
y t
he
32
-bit
SP
AR
C C
PU
.
b)
Ex
pla
in F
lyn
n's
Cla
ssif
icati
on o
f para
llel
co
mp
ute
rs.
(7M
+8
M)
1 o
f 1
SE
T -
1
R1
0
Code No: R22054
II B. Tech II Semester Regular Examinations August - 2014
COMPUTER ORGANIZATION (Com. to CSE, ECC)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
1. a) Explain about various addressing modes in Assembly Language Instructions.
b) Write the instruction code formats for Assembly language programs and Machine code to
calculate A=B+C for two-operand and zero-operand instructions (8M+7M)
2. a) Explain about the different types of Memory Chips.
b) Construct a 16 X 2 memory subsystem constructed from two 8 X 2 ROM chips with high-
order interleaving. (7M+8M)
3. Explain VHDL file to implement modulo 6 counter using high level of abstraction. (15M)
4. a) Explain the generic Micro instruction Formats.
b) Explain Micro Sequencer for the relatively simple CPU with micro subroutines. (5M+10M)
5. a) Construct a 3 × 3 multiplexer using a Carry-Save Adder.
b) Explain about overflow generation in unsigned two's complement Addition. (8M+7M)
6. a) Differentiate Cache memory Vs Virtual memory.
b) Explain about External fragmentation in physical memory caused by Segmentation.
(8M+7M)
7. a) Explain the concept of Handshaking technique.
b) Explain I/O Processor with a neat diagram. (5M+10M)
8. Explain Instruction Pipelines and its conflicts with Examples. (15M)
SET - 2 R10
Code No: R22054
II B. Tech II Semester Regular Examinations August - 2014
COMPUTER ORGANIZATION (Com. to CSE, ECC)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
1. a) Explain about Data transfer instructions in Assembly Language Instructions.
b) What addressing mode is used by the following instructions for the 8085 micro processor?
i) SPHL ii) CMC iii) JUMP � (8M+7M)
2. a) Distinguish between SRAM and DRAM.
b) Explain the CPU internal Organization. (7M+8M)
3. a) Draw the State diagram for modulo 6 counter.
b) What is a hardware description language? Explain the features of VHDL. (10M+5M)
4. Draw and explain the Generic Hardwired Control unit. (15M)
5. a) Show the Wallace tree to perform 6 × 6 Multiplication.
b) What is the result of the following operations on unsigned non-negative numbers using 1’s
complement.
i) 1011 0100 – 0111 0111
ii) 1000 1011 + 0111 0100
iii) 10101.101+11011.001 (8M+7M)
6. a) Explain about Locality of Reference.
b) Explain cache memory with Direct Mapping technique. (5M+10M)
7. a) Explain about Daisy Chaining.
b) Explain incorporating Direct Memory Access into a computer system. (5M+10M)
8. a) Compare RISC and CISC processors.
SET - 3 R10
Code No: R22054
II B. Tech II Semester Regular Examinations August - 2014
COMPUTER ORGANIZATION (Com. to CSE, ECC)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
1. a) Explain about Instruction Set Architecture Design.
b) Write a program for relatively Simple CPU to add the ten values in memory locations 1001H
through 100AH and store the result in memory location 1000H.Assume the result will
always be less than 256. (8M+7M)
2. a) Show the internal two dimensional configuration of a 32 × 2 Memory chip.
b) Show how the following values are stored in memory in big endian and little endian formats.
Each value starts at location 22H. i) 0927H ii) 5551212H (8M+7M)
3. a) Explain the operation of Toll Booth Controller.
b) Show the hardware to implement shl(x) micro-operation. X consists of four D flip-flops.
Each micro-operation occurs when � = 1. (8M+7M)
4. a) Explain briefly about micro sequencer operations.
b) Show the logic to generate the control signals for data register, address register and
instruction register of the relatively simple CPU. (8M+7M)
5. Explain the Hardware implementation of Booth's multiplication algorithm. Discuss with an
example and draw the flow chart. (15M)
6. What is paging? Explain the conversion of logical address to physical address using the page
table. (15M)
7. a) Distinguish between memory mapped I/O and I/O mapped I/O.
b) Explain the internal configuration of UART. (5M+10M)
SET - 4 R10
|''
||||'|'
'||'''
|''|
Co
de
No
: R
22
05
3
II
B.
Tec
h I
I S
emest
er
Reg
ula
r E
xa
min
ati
on
s A
ug
ust
- 2
01
4
DA
TA
BA
SE
MA
NA
GE
ME
NT
SY
ST
EM
S
(Co
m.
to C
SE
, IT
) T
ime:
3 h
ou
rs
Max
. M
ark
s: 7
5
An
swer
an
y F
IVE
Qu
esti
on
s A
ll Q
ues
tio
ns
carr
y E
qu
al
Mar
ks
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
1.
a) W
hat
is
dat
a m
od
el?
Lis
t an
d e
xp
lain
dif
fere
nt
dat
a m
od
els.
b)
Ex
pla
in t
he
dif
fere
nce
bet
wee
n e
xte
rnal
, in
tern
al,
and c
once
ptu
al s
chem
as.
Ho
w a
re t
hes
e
d
iffe
ren
t sc
hem
a la
yer
s re
late
d t
o t
he
conce
pts
of
logic
al a
nd p
hysi
cal
dat
a in
dep
enden
ce?
(8M
+7
M)
2.
a) D
iscu
ss i
n d
etai
l ab
ou
t th
e m
ain s
tep
s in
the
dat
abas
e des
ign
an
d c
lear
ly f
ocu
s in
det
ail
abo
ut
th
e go
al o
f ea
ch s
tep?
In w
hic
h s
tep
s is
the
ER
mod
el m
ain
ly u
sed?
b)
Dra
w a
nd e
xp
lain
E-R
dia
gra
m o
f an
Air
lin
e re
serv
atio
n s
yst
em?
(8M
+7
M)
3.
a) D
iscu
ss i
n d
etai
l ab
ou
t in
tegri
ty c
on
stra
int
over
rel
atio
ns.
b)
What
is
join
op
erat
ion i
n r
elat
ion
al a
lgeb
ra?
Dis
cuss
in d
etai
l ab
ou
t var
ian
ts o
f jo
ins.
(8M
+7
M)
4.
a) C
on
sid
er t
he
foll
ow
ing r
elat
ion
al s
chem
a. A
n e
mp
loyee
can
wo
rk i
n m
ore
th
an o
ne
d
epar
tmen
t; t
he
pct
tim
e fi
eld
of
the
Wo
rks
rela
tion
sh
ow
s th
e p
erce
nta
ge
of
tim
e th
at a
giv
en
em
plo
yee
wo
rks
in a
giv
en d
epar
tmen
t.
E
mp
(eid
: in
teger
, en
ame:
str
ing,
age:
in
teg
er,
sala
ry:
real
)
W
ork
s(ei
d:
inte
ger
, did
: in
teger
, pct
tim
e: i
nte
ger
)
D
ept(
did
: in
teg
er,
bu
dget
: re
al,
man
ager
id:
inte
ger
)
W
rite
th
e fo
llo
win
g q
uer
ies
in S
QL
:
i)
Pri
nt
the
nam
es a
nd
ages
of
each
em
plo
yee
wh
o w
ork
s in
bo
th t
he
Har
dw
are
dep
artm
ent
an
d t
he
So
ftw
are
dep
artm
ent.
ii
) F
or
each
dep
artm
ent
wit
h m
ore
th
an 2
0 f
ull
-tim
e-eq
uiv
alen
t em
plo
yee
s (i
.e.,
wh
ere
the
p
art-
tim
e an
d f
ull
-tim
e em
plo
yee
s ad
d u
p t
o a
t le
ast
that
man
y f
ull
-tim
e em
plo
yee
s),
pri
nt
t
he
did
to
get
her
wit
h t
he
nu
mb
er o
f em
plo
yee
s th
at w
ork
in t
hat
dep
artm
ent.
ii
i)
Pri
nt
the
nam
e o
f ea
ch e
mp
loyee
wh
ose
sal
ary e
xce
eds
the
bu
dget
of
all
of
the
dep
artm
ents
th
at h
e o
r sh
e w
ork
s in
.
iv
) F
ind
th
e m
anag
er i
ds
of
man
ager
s w
ho
man
age
on
ly d
epar
tmen
ts w
ith
bu
dg
ets
gre
ater
th
an
$
1,0
00,0
00
.
v)
Fin
d t
he
enam
es o
f m
anag
ers
wh
o m
anag
e th
e dep
artm
ents
wit
h t
he
larg
est
bu
dg
et.
b)
Wh
at is
a
trig
ger
? W
hat
ar
e th
e th
ree
par
ts?
Dif
fere
nti
ate
row
-lev
el an
d st
atem
ent-
level
tr
igger
s.
(8
M+
7M
)
1
of
2
R1
0
SE
T -
1
Code No: R22053
5. a) What is join dependency? How is it different to that of multi-valued dependency and
functional dependency? Give an example for join dependencies and multi-valued
dependencies.
b) Contrast 3NF decomposition method with BCNF decomposition method illustratively.
(8M+7M)
6. a) What is a serializable schedule? What is a recoverable schedule? What is a schedule that
avoids cascading aborts? What is a strict schedule?
b) Discuss in detail about the phases the recovery manager proceeds when the system is restarted
after a crash. (8M+7M)
7. a) Describe in detail about algorithms for updating single level indices.
b) Give comparison of different file organizations. (8M+7M)
8. Describe a B+ tree for the following set of key values:(2,3,5,7,11,17,19,23,29,31)
Assume that the tree is initially empty and values are added in ascending order.
i) Construct B+ tree for the case where the number of pointer that will fit in one node is four.
ii) Show the step involved to find records with a search-key value of 11. (8M+7M)
R10 SET - 1
Code No: R22053
II B. Tech II Semester Regular Examinations August - 2014
DATA BASE MANAGEMENT SYSTEMS
(Com. to CSE, IT)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~
1. a) What are the responsibilities of a DBA? If we assume that the DBA is never interested in
running his or her own queries, does the DBA still need to understand query optimization?
Why?
b) Which of the following plays an important role in representing information about the real
world in a database? Explain briefly about:
i) The data definition language.
ii) The data manipulation language.
iii) The buffer manager.
iv) The data model. (7M+8M)
2. a) Describe in detail about conceptual design with ER model.
b) Construct E-R diagram for a banking enterprise. (8M+7M)
3. a) Using the following schema represent the following queries using Tuple relational calculus :
PROJECT (Projectnum, Project Name, Project Type, Project Manager)
EMPLOYEE ( Empnum, Empname)
ASSIGNED_TO (Projectnum, Empnum)
Find Employee details working on a project name starts with ‘L’
List all the employee details who are working under project manager “Clevee”
List the employees who are still not assigned with any project.
R10 SET - 2
Code No: R22053
4. a) What are nested queries? What is correlation in nested queries? How would you use the
operators IN, EXISTS, UNIQUE, ANY and ALL in writing nested queries? Why are they
useful? Illustrate your answer by showing how to write the division operator in SQL.
b) Compare constraints and triggers and also give examples for each. (8M+7M)
5. a) Consider a relation R with five attributes ABCDE. You are given the following dependencies:
A � B, BC � E, and ED � A.
List all keys for R.
Is R in 3NF?
Is R in BCNF?
b) What is decomposition? Describe problems related to decomposition. (9M+6M)
6. a) Is every conflict serializable schedule is serializable? Explain.
b) Explain different types of failures that arise due to loss of non-volatile storage. (8M+7M)
7. a) What is an index? Discuss important properties of an index that affect the efficiency of
searches using the index.
b) Describe in detail about different RAID levels. (8M+7M)
8. a) What are the main differences between ISAM and B+ tree indexes?
b) Describe a B+ tree for the following set of key values:(2,3,5,7,11,17,19,23,29,31) Assume that
the tree is initially empty and values are added in ascending order. Construct B+ tree for the
case where the number of pointer that will fit in one node is six. (6M+9M)
R10 SET - 2
Code No: R22053
II B. Tech II Semester Regular Examinations August - 2014
DATA BASE MANAGEMENT SYSTEMS
(Com. to CSE, IT)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~
1. a) What are application programs? Discuss in detail about database access for application
programs.
b) Explain the difference between logical and physical data independence. What is logical data
independence and why is it important? (8M+7M)
2. a) A university database contains information about professors (identified by social security
number, or SSN) and courses (identified by courseid). Professors teach courses; each of the
following situations concerns the Teaches relationship set. For each situation, draw an E-R
diagram that describes it (assuming that no further constraints hold).
Professors can teach the same course in several semesters, and each offering must be
recorded.
Professors can teach the same course in several semesters, and only the most recent such
offering needs to be recorded.
Every professor must teach some course.
Every professor teaches exactly one course (no more, no less).
Every professor teaches exactly one course (no more, no less), and every course must be
taught by some professor.
b) Explain the difference between weak entity and strong entity set? How to represent the strong
entity and weak entity set through E-R diagram. (10M+5M)
3. a) What is the difference between a candidate key and the primary key for a given relation? What
is a super key?
b) Discuss in detail about integrity constraints over relations. (8M+7M)
4. a) Discuss the strengths and weaknesses of the trigger mechanism. Contrast triggers with other
R10 SET - 3
Code No: R22053
5. a) Consider the following relation R(A,B,C,D,E)
And FD’s
A�BC C�A D�E F�A E�D
Is the decomposition of R into R1(A,C,D), R2(B,C,D) and R3(E,F,D) lossless? Explain the
requirements of lossless decomposition.
b) Explain in detail about Dependency-Preserving Decomposition. Explain why it is important.
(8M+7M)
6. a) What overheads are associated with lock-based concurrency control? Discuss blocking and
aborting overheads specifically?
b) Define these terms: atomicity, consistency, isolation, durability, schedule, blind write, dirty
read, unrepeatable read, serializable schedule, recoverable schedule, avoids-cascading- aborts
schedule. (8M+7M)
7. a) What are the causes of bucket overflow in a hash file organization? What can be done to
reduce the occurrence of bucket overflows?
b) Discuss about multilevel indices in detail. (8M+7M)
8. a) Explain main characteristics of a B+ tree in detail. Discuss operations on B+ trees.
b) Describe a B+ tree for the following set of key values:(2,3,5,7,11,17,19,23,29,31)
Assume that the tree is initially empty and values are added in ascending order. Construct B+
tree for the case where the number of pointer that will fit in one node is six. (6M+9M)
R10 SET - 3
Code No: R22053
II B. Tech II Semester Regular Examinations August - 2014
DATA BASE MANAGEMENT SYSTEMS
(Com. to CSE, IT)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~
1. a) Why would choose a database system instead of simply storing data in operating system files?
When would it make sense not to use a database system? b) Shows the structures of a typical DBMS based on the relational data model and explain in detail. (8M+7M)
2. a) Construct an E-R diagram for a university registrar’s office. The office maintains data about
each class, including the instructor the enrollment, and the time and place of the class meetings. For each student-class pair, a grade is recorded. Document all assumptions that you make about the mapping constraints. b) Explain the difference between weak entity and strong entity sets? How to represent the strong and weak entity set through E-R diagrams. (8M+7M)
3. a) What restrictions are necessary to ensure that view is updatable? State any three advantages
and three disadvantages of views. b) Discuss in detail about the set operations of relational algebra and explain with examples. (8M+7M)
4. a) The following relations keep track of airline flight information: Flights(flno: integer, from: string, to: string, distance: integer, departs: time, arrives: time, price: integer) Aircraft(aid: integer, aname: string, cruisingrange: integer) Certified(eid: integer, aid: integer) Employees(eid: integer, ename: string, salary: integer) Note that the Employees relation describes pilots and other kinds of employees as well; every pilot is certified for some aircraft, and only pilots are certified to fly. Write each of the following queries in SQL. i) Find the names of aircraft such that all pilots certified to operate them earn more than
80,000. ii) For each pilot who is certified for more than three aircraft, find the eid and the maximum
cruisingrange of the aircraft that he (or she) is certified for. iii) Find the names of pilots whose salary is less than the price of the cheapest route from Los
R10 SET - 4
Code No: R22053 5. a) What is schema refinement? Discuss the problems caused by redundancy.
b) Give a set of FDs for the relation schema R(A,B,C,D) with primary key AB under which R is in 2NF but not in 3NF. (8M+7M)
6. a) Explain various types of lock based concurrency control with a neat sketch and examples.
b) Describe in detail about shadow paging recovery technique. Under what circumstances does it not require a log? (8M+7M)
7. a) Explain the distinction between closed and open hashing. Discuss the relative merits of each
technique in database applications. b) On what factors techniques for indexing and hashing must be evaluated? Explain. (8M+7M)
8. Explain all the operations on B+ tree by taking a sample example. (15M)
R10 SET - 4
|''
||||'|'
'||'''
|''|
Co
de
No
: R
22
05
5
II B
. T
ech
II
Sem
este
r R
egu
lar
Ex
am
ina
tio
ns
Au
gu
st –
20
14
FO
RM
AL
LA
NG
UA
GE
S A
ND
AU
TO
MA
TA
TH
EO
RY
(C
om
pu
ter
Scie
nce
an
d E
ngin
eeri
ng)
Tim
e: 3
ho
urs
Max
. M
ark
s: 7
5
An
swer
an
y F
IVE
Qu
est
ion
s
All
Quest
ion
s car
ry E
qu
al
Mark
s
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~
1.
a)
Ho
w N
FA
is
dif
fere
nt
from
DF
A? E
xp
lain
wit
h a
n e
xam
ple
.
b)
Desi
gn
a D
FA
wh
ich a
ccepts
all
the
stri
ngs
wit
h e
ven
nu
mber
of
0’s
an
d o
dd n
um
ber
of
1’s
over
an a
lph
abet
{0,1
}
2.
a)
Sta
te a
nd p
rove t
he
min
imiz
ati
on o
f D
FA
wit
h a
n e
xam
ple
.
b)
Ex
pla
in t
he
finit
e au
tom
ata
wit
h o
utp
uts
Mo
ore
an
d m
ealy
mac
hin
es w
ith
sim
ple
exam
ple
s.
3.
a)
What
is r
egu
lar
exp
ress
ion? E
xp
lain
the
op
erat
ion
s an
d a
pp
lica
tio
ns
of
regu
lar
exp
ress
ion
s.
b)
Co
nver
t th
e giv
en
regu
lar
exp
ress
ion l
(l|d
)*l
over
an a
lph
abet
{l,
d} i
nto
NF
A.
Use
ex
ten
ded
tran
siti
on
s.
4.
a)
What
is C
onte
xt-
sen
siti
ve
lan
gu
age?
Ho
w L
inea
r B
ou
nd
ed A
uto
mat
a is
rel
ate
d w
ith i
t?
Ex
pla
in.
b)
Ex
pla
in t
he
pro
ced
ure
fo
r th
e in
ter
co
nver
sio
n o
f re
gu
lar
gra
mm
ars
and f
init
e au
tom
ata
wit
h
an e
xam
ple
.
5.
Min
imiz
e th
e gra
mm
ar G
giv
en i
nto
eq
uiv
alen
t gra
mm
ar b
y r
em
ovin
g u
sele
ss s
ym
bo
ls a
nd
pro
du
cti
on
s fr
om
it.
An
d a
lso e
xp
lain
th
e re
aso
ns
for
min
imiz
atio
n o
f gra
mm
ar.
S� ���
aA
a
A� ���
Sb
|bcc
|Da
A
C� ���
ab
b|D
D
E� ���
ac
D� ���
aD
A
6.
a)
Def
ine
Pu
sh D
ow
n A
uto
mat
a (P
DA
). D
iscu
ss a
bo
ut
the
lan
gu
ages
acc
epte
d b
y P
DA
b)
Desi
gn
No
ndet
erm
inis
tic
PD
A f
or
the
lan
gu
age L
= {
0n
1n| n
>=
1}
7.
Ex
pla
in t
he
foll
ow
ing:
a)
Typ
es
of
Tu
rin
g m
ach
ines
use
d f
or
com
pu
table
fu
nct
ion
s.
b
) U
nre
stri
cted
gra
mm
ars.
c)
Rec
urs
ive
and r
ecu
rsiv
ely e
nu
mer
ab
le l
angu
ages
.
8.
a)
Ex
pla
in w
hat
is
un
deci
dab
le p
rob
lem
an
d p
ost
co
rres
po
nd
ence
pro
ble
m?
b
) C
on
sider
th
e gra
mm
ar G
: E� ���
+E
E |*
EE
|-E
E |x
|y
. C
on
stru
ct t
he
left
mo
st a
nd r
igh
t m
ost
par
se t
rees
fo
r th
e st
rin
g +
*-x
yxy
1 o
f 1
R1
0
SE
T -
1
Code No: R22055
II B. Tech II Semester Regular Examinations August – 2014
FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science and Engineering)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
1. a) What is a relation? Explain representation and properties of relations.
b) Design DFA which accepts all the strings ending with 101 over an alphabet {0,1}
2. a) Describe the formal notation for NFA with epsilon closure and the uses of epsilon closure.
b) For regular expression (0|1)*011, draw the NFA with �-closures and convert it into NFA.
3. a) How to find out equivalence of two DFA’s. Explain with an example.
b) Explain the closure properties of regular expressions.
4. a) What is regular grammar? How to convert left linear grammar into right linear grammars
b) Derive left and right most derivations for the input string a=b*c+d/e for the given grammar
E����E+E|E-E|E*E E����E/E E����(E)|id
5. a) What is ambiguous grammar? Explain how to eliminate the ambiguity from following the
grammar E����E+E| E-E|E*E|E/E|(E)|id
b) What is left recursion and left factoring in Context Free Grammars explain with examples?
6. Explain PDA definition model and Construct the PDA that accepts the language
L={an
bn
| n >=1}. Give the graphical representation for PDA obtained. Show the instantaneous
description of the PDA on the input string aaaabbbb
7. a) Explain with neat diagram working of Turing machine and the types of Turing machines.
b) Design Turing machine to accept all set of palindromes over {0, 1}*. And also write the
transition diagram and instantaneous description on the string 10101
8. Write short notes on the following.
R10 SET - 2
Code No: R22055
II B. Tech II Semester Regular Examinations August – 2014
FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science and Engineering)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
1. Explain the following:
a) Operations on strings and languages
b) Finite State Machines
c) DFA for formal language which does not contain 100 as substring over an alphabet {0, 1}.
2. Design NFA to recognize the set of strings such as lab, calb, dabl over an alphabet
{a, b, c, d, l} and convert each NFA to equivalent DFA
3. a) Explain the algebraic laws of regular expressions.
b) Explain the procedure for the conversion of DFA into regular expression like
(1|0)*110(1|0)* over an alphabet {0,1}.
4. a) What is Context-Free grammar? Explain each tuple in its representation.
b) What is derivation? Explain the types of derivations for the grammar which defines
arithmetic expressions.
5. a) Differentiate Chomsky and Greibach Normal forms.
b) Convert the following grammar G into CNF
S�aAD A�aB|bAB B�b D�d
6. a) Convert the following Grammar G to PDA that accepts the same language by empty
stack S����0S1|A A����A0|S|�
b) Explain the graphical notation of PDA with an example and acceptance of context free
languages by PDA.
7. a) Define Turing machine. Explain with diagram, general structure of multi tape Turing
machine.
R10 SET - 3
Code No: R22055
II B. Tech II Semester Regular Examinations August – 2014
FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science and Engineering)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
1. a) What is finite automaton model? How it is useful for the acceptance of strings and languages
explain with an example.
b) Design a language recognizer which consists of any number of 0’s followed by number of
1’s followed by number of 2’s.
2. a) State and prove the theorem for equivalence of NFA and DFA.
b) Design a finite state machine to find out the residues of 3.
3. Draw and explain the basis construction of regular expressions and also convert the regular
expression (01|1)* into equivalent DFA over an alphabet {0,1}
4. a) Explain the Chomsky hierarchy of languages.
b) Differentiate right linear and left linear grammars with an example.
5. a) Explain and prove the usage of Pumping Lemma for Context free languages?
b) What is ambiguous grammar? Check out ambiguity for the given grammar G and consider
the input string as aaabab
S����AbB A����aA|� B����aB|bB|�
6. a) Obtain PDA for the following grammar
S����AS|� A����0A1|A1|01
b) What is deterministic PDA? Differentiate acceptance by final state and acceptance by empty
state.
7. a) Explain the general structure of multi tape and non deterministic Turing machines and show
that these are equivalent to basic Turing machines.
b) Design Turing machine and its transition diagram to accept the language L = {an
bn
| n >=1}
R10 SET - 4
|''
||||'|'
'||'''
|''|
Co
de
No
: R
22
05
2
II B
. T
ech
II
Sem
este
r R
eg
ula
r E
xa
min
ati
on
s A
ug
ust
- 2
01
4
OB
JE
CT
OR
IEN
TE
D P
RO
GR
AM
MIN
G T
HR
OU
GH
JA
VA
(C
om
. to
CS
E,
IT,
EC
C)
Tim
e: 3
ho
urs
Max
. M
ark
s: 7
5
An
swer
an
y F
IVE
Qu
est
ion
s
All
Quest
ion
s car
ry E
qu
al
Mark
s
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~
1.
a)
Ex
pla
in t
he
mech
anis
ms
that
help
yo
u t
o i
mple
men
t th
e o
bje
ct-o
rien
ted
mod
el.
b)
Co
mp
are
ob
ject
ori
ente
d p
rog
ram
min
g w
ith s
tru
ctu
red
pro
gra
mm
ing.
(8M
+7
M)
2.
a)
Wh
at
are
the
bit
wis
e o
per
ato
rs s
up
po
rted
by J
ava?
Ex
pla
in e
ach w
ith a
n e
xam
ple
.
b)
Illu
stra
te t
he
usa
ge
of
jum
p s
tate
men
ts i
n J
ava
wit
h a
n e
xam
ple
pro
gra
m.
(8
M+
7M
)
3.
a)
Wit
h a
n e
xam
ple
pro
gra
m e
xp
lain
the
over
load
ing m
eth
od
s an
d c
on
stru
cto
rs.
b)
Ex
pla
in h
ow
fin
al
key
wo
rd i
s u
sed t
o p
reven
t o
verr
idin
g a
nd i
nher
itan
ce.
(8M
+7
M)
4.
Wh
at i
s m
ean
t b
y a
cce
ss p
rote
ctio
n? E
xp
lain
dif
fere
nt
acce
ss s
pec
ifie
rs s
upp
ort
ed
by J
ava w
ith
an e
xam
ple
of
each.
(1
5M
)
5.
a)
Wri
te s
ho
rt n
ote
s o
n J
ava
bu
ilt
in e
xce
pti
on
s an
d c
hai
ned
exce
pti
on
s.
b)
Ex
pla
in t
he
Java
thre
ad m
od
el a
nd i
ts r
elat
ed i
ssues
in d
etai
l.
(8M
+7
M)
6.
a)
Wri
te a
bo
ut
:
i)
Ap
ple
t li
fe c
ycl
e
ii
) D
iffe
ren
ce b
etw
een a
pp
lets
an
d a
pp
lica
tio
ns.
b)
Dev
elo
p a
sim
ple
ban
ner
ap
ple
t u
sin
g r
epain
t()
met
ho
d t
o s
cro
ll a
mes
sag
e fr
om
lef
t to
rig
ht
an
d a
cro
ss t
he
app
let’
s w
ind
ow
.
(8M
+7
M)
7.
a)
Ex
pla
in a
bo
ut
var
iou
s in
terf
aces
def
ined
by t
he
java.
awt.
even
t to
im
ple
men
t ev
ent
list
eners
.
b) E
xp
lain
ab
ou
t th
e la
yo
ut
man
ager
an
d d
iffe
ren
t la
yo
uts
an
d a
lso w
rite
an e
xam
ple
Jav
a
pro
gra
m f
or
an
y 2
lay
ou
ts.
(5
M+
10
M)
8.
a)
Wri
te a
n e
xam
ple
pro
gra
m t
o c
reat
e u
sern
ame
and p
ass
wo
rd s
cree
n u
sin
g T
ex
tFie
ld a
nd
T
extA
rea.
b)
Ex
pla
in t
he
usa
ge
of
swin
g b
utt
on
s w
ith a
pro
gra
mm
ing e
xam
ple
.
(8
M+
7M
)
1 o
f 1
R1
0
SE
T -
1
Code No: R22052
II B. Tech II Semester Regular Examinations August - 2014
OBJECT ORIENTED PROGRAMMING THROUGH JAVA (Com. to CSE, IT, ECC)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
1. a) Explain the fundamental forces that necessitated the invention of Java along with the key
factors involved in moulding the java language.
b) What is meant by class hierarchies in Java? Explain different class hierarchies that Java
supports. (8M+7M)
2. a) Illustrate the usage of arrays in Java with the help of two dimensional arrays multiplication.
b) Explain the usage of constructor and types of constructors in Java. (8M+7M)
3. a) What is the use of super keyword in Java? Explain in detail.
b) What is the importance of abstract classes? Show it with an example. (8M+7M)
4. What is an interface? Explain the definition and implementation of interface in Java. (15M)
5. a) Explain usage of following words in exception handling: throw, throws, finally.
b) Explain different ways defined by Java to create threads. (8M+7M)
6. a) Write in detail about the applet architecture. Explain how it is different from console based
program.
b) Develop an applet program to change the foreground and background colors and to display
the message in the order in which the init(), start() and paint() methods are called. (8M+7M)
7. a) Describe the delegation event model and the roles of event sources and event listeners.
b) Write and explain the Java programs to handle buttons and check boxes. (5M+10M)
8. a) Explain the usage of Lists and choices with an example program.
b) Write a java program to illustrate the usage of Radio buttons (8M+7M)
R10 SET - 2
Code No: R22052
II B. Tech II Semester Regular Examinations August - 2014
OBJECT ORIENTED PROGRAMMING THROUGH JAVA (Com. to CSE, IT, ECC)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
1. a) Explain in detail the fundamental principles of OOPs with respect to Java language.
b) Explain with an example Java program the concepts of method binding. (8M+7M)
2. a) Write a program that illustrates the dynamic initialization, the scope and lifetime of
variables in Java.
b) Explore the concept of string classes with an example program. (8M+7M)
3. a) What is meant by multilevel hierarchy? Explain with an example program in Java.
b) Illustrate the concept of method overriding with an example program. (8M+7M)
4. a) Define package? Explain the process of finding a package.
b) Write a short note on i) Nested Interfaces. ii) Difference between class and interfaces.
(8M+7M)
5. a) Write a program to illustrate the usage of try and catch blocks in Java.
b) What is the need to assign priorities to threads? Explain with an example. (8M+7M)
6. a) Write and explain the fundamentals of an applet with a simple applet program.
b) How to pass parameters to an applet? Explain with an example program. (8M+7M)
7. Explain different classes used in Java’s event handling mechanism. (15M)
8. a) Illustrate the usage of Dialog box with an example program.
b) Write java programs using the following i) JList ii) JScrollPane. (8M+7M)
R10 SET - 3
Code No: R22052
II B. Tech II Semester Regular Examinations August - 2014
OBJECT ORIENTED PROGRAMMING THROUGH JAVA (Com. to CSE, IT, ECC)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
1. a) State and explain the atomic elements of Java program.
b) Explain with an everyday example of usage of classes and objects. (8M+7M)
2. a) Explain the primitive data types supported by Java language.
b) How to overload methods in Java? Explain the concept of ‘Using objects as parameters to
methods. (8M+7M)
3. a) Explain the following i) Access Control ii) “this” Key word
b) In detail explain about Dynamic method dispatching. (8M+7M)
4. a) What is CLASSPATH? Explain its role in finding packages.
b) What cautions need to be taken while importing Explain with an example program for
importing packages? (8M+7M)
5. a) What is an exception? Write about the fundamentals of exception handling used in Java.
b) Explain the process of synchronization provided for multithread programming using Java.
(8M+7M)
6. a) Write about the applet class and the methods defined by it.
b) Illustrate with an example applet program how the applets override the methods defined by
Applet (8M+7M)
7. a) Explain with an example program how to handle mouse and keyboard events.
b) Write a short note on AWT classes contained in java.awi package. (10M+5M)
8. a) How to create menus and menu bars using AWT? Explain.
b) Write programs using the following i) JTable ii) Checkboxes. (8M+7M)
R10 SET - 4
|''
||||'|'
'||'''
|''|
�� Co
de
No
: R
22
05
6
II B
. T
ech
II
Sem
este
r R
eg
ula
r E
xa
min
ati
on
s, A
ug
ust
-2
01
4
PR
INC
IPL
ES
OF
PR
OG
RA
MM
IG L
AN
GU
AG
E
(Co
m.
to C
SE
, IT
)
Tim
e: 3
ho
urs
Max
. M
ark
s: 7
5
An
swer
an
y F
IVE
Qu
est
ion
s
All
Quest
ion
s car
ry E
qu
al
Mark
s
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
1.
a)
Co
mp
are
the
pro
ces
s of
Co
mp
ilati
on a
nd I
nte
rpre
tati
on.
b
) W
hat
is A
ST
? H
ow
it
hel
ps
in d
esig
n t
he
Pro
gra
mm
ing l
angu
age?
Giv
e A
ST
fo
r ex
pre
ssio
n
A =
(B
+C
) * (
D/E
)
(8
M+
7M
)
2.
a)
Def
ine
the
term
s:
i) l
ife
tim
e of
the
var
iab
le
ii)
Sco
pe
and e
xte
nt
b
) W
hat
is s
tati
c b
ind
ing
and
dyn
amic
bin
din
g
(8
M+
7M
)
3.
Wh
at i
s m
ean
t b
y a
ttri
bute
s? D
iscu
ss a
bo
ut
it.
How
sp
ace
can b
e m
anaged
fo
r th
e att
rib
ute
s?
(1
5M
)
4.
a)
Wh
at
is r
ecu
rsio
n? E
xp
lain
its
co
ntr
ol
flo
w w
ith
su
itab
le e
xam
ple
.
b
) E
xp
lain
the
dif
fere
nt
form
s of
stat
emen
t le
vel
seq
uen
ce c
ontr
ol?
(8
M+
7M
)
5.
a)
Wh
at
is a
n a
cti
vati
on r
eco
rd?
What
are
its
co
nte
nt
and u
ses?
b
) W
hy t
yp
e c
heck
ing i
s re
qu
ired
? G
ive
the
alt
ern
ativ
es f
or
typ
e ch
eck
ing.
Ex
pla
in.
(8M
+7
M)
6.
a)
Des
crib
e th
e alg
ori
thm
use
d t
o i
den
tify
an a
pp
ropri
ate
han
dle
r w
hen
an e
xce
pti
on i
s ra
ised
in a
lan
gu
age.
b
) D
iscu
ss a
bo
ut
gen
etic
su
b-r
ou
tin
es
and m
od
ule
s.
(8M
+7
M)
7.
Wit
h r
espec
t to
the
obje
ct o
rien
ted p
rogra
mm
ing,
bri
efly
ex
pla
in t
he
foll
ow
ing:
i) C
lass
an
d i
nst
ance
ii)
Ob
ject
iii)
Vir
tual
fun
ctio
n
iv) I
nh
erit
ance
(1
5M
)
8.
Su
mm
ariz
e P
rolo
g’s
faci
liti
es f
or
dat
abas
e m
anip
ula
tio
n.
Bri
efl
y E
xp
lain
th
e u
sage o
f ass
ert,
retr
act,
an
d c
lau
se.
(1
5M
)
1 o
f 1
SE
T -
1
R1
0
��
Code No: R22056
II B. Tech II Semester Regular Examinations, August -2014
PRINCIPLES OF PROGRAMMIG LANGUAGE (Com. to CSE, IT)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~
1. a) What is the significance of studying programming language?
b) Discuss about Context-free grammar and regular expression? Give the parse tree of a
following statement: A = (B+C) * (D / E) (8M+7M)
2. a) Consider the following pseudo code.
Procedure P (A, B: real)
X: real
Procedure Q (B, C: real)
Y: real
. . .
Procedure R (A, C: real)
Z: real
. . . (*)
. . .
Assuming static scope, what is the referencing environment at the location marked by (*)?
b) Define Macro? How to implement the macro? (8M+7M)
3. Explain the following:
i) Attribute grammar
ii) Action routines (15M)
4. a) What is dangling-else problem? Discuss How it can be handled by the programming
language.
b) Describe the characteristics of structured and unstructured control flow. (8M+7M)
5. a) Briefly explain about the Records and the Sets data structures
b) What are primitive and non-primitive data types? Explain. (8M+7M)
6. a) Explain in detailed about the different forms of parameters.
b) Describe how virtual functions can be used to achieve the effect of subroutine closures.
SET - 2 R10
��
Code No: R22056
II B. Tech II Semester Regular Examinations, August -2014
PRINCIPLES OF PROGRAMMIG LANGUAGE (Com. to CSE, IT)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~
1. a) What are the main features of the programming paradigm with examples?
b) Define CFG? What does it mean for CFG to be ambiguous? (8M+7M)
2. a) Define data object? Briefly explain the attributes to which a data object may bind to?
b) What is scope? How to implement the scope rules for a variable? (8M+7M)
3. Explain the role of semantic analyzer in design of PL (15M)
4. a) Discuss the following term:
i) Dangling pointers
ii) Tail recursion elimination.
b) Briefly explain about Iterative control statements and its control flow. (8M+7M)
5. a) What is meant by type checking? Differentiate between static type checking and dynamic
type checking and give their relative advantages?
b) What is meant by activation record? Briefly explain its elements. (8M+7M)
6. a) Describe three alternative means of allocating co-routine stacks. What are their relative
strengths and weaknesses?
b) Explain early binding and late binding. (8M+7M)
7. Why OOP is required? List and explain the vocabulary of OOP. (15M)
8. a) What is unification with respect to Prolog? Briefly Explain.
b) What is meant by control in Prolog? Briefly explain. (8M+7M)
SET - 3 R10
��
Code No: R22056
II B. Tech II Semester Regular Examinations, August -2014
PRINCIPLES OF PROGRAMMIG LANGUAGE (Com. to CSE, IT)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~
1. a) Explain the two approaches to bridge the gap between High level languages and machine
level languages? Compare.
b) What are the formal methods for describing the syntax of programming languages?
(8M+7M)
2. a) What are the scope rules for designing the programming language
b) Difference between static and dynamic binding. (8M+7M)
3. Discuss about the various attributes of a good language and explain the process of evaluating
attributes with example. (15M)
4. a) Explain the break and continue statements in loops with the help of pseudo code.
b) Explain special cases in loops (8M+7M)
5. a) Discuss the significance of holes in the records. Why they do and what problem do they
cause?
b) Discuss the comparative advantages of structural and name equivalence for types. Name
three languages that use each approach. (8M+7M)
6. a) Explain the various parameter passing methods. Discuss their features.
b) Explain the difference between virtual and non-virtual methods. (8M+7M)
7. a) What is inheritance with respect to OOP? What are its benefits?
b) Differentiate between public and private base classes (8M+7M)
8. Define Functional Programming Language. List the properties of Functional Programming
SET - 4 R10
|''
||||'|'
'||'''
|''|
Co
de
No
: R
22
05
1
II B
. T
ech
II
Sem
este
r R
eg
ula
r E
xa
min
ati
on
s A
ug
ust
- 2
01
4
SO
FT
WA
RE
EN
GIN
EE
RIN
G
(C
om
pu
ter
Sci
en
ce a
nd E
ngin
eer
ing)
Tim
e: 3
ho
urs
Max
. M
ark
s: 7
5
An
swer
an
y F
IVE
Qu
est
ion
s
All
Quest
ion
s car
ry E
qu
al
Mark
s
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
~~
1.
a)
Def
ine
soft
war
e. L
ist
and
ex
pla
in a
bo
ut
the
elem
ents
of
a so
ftw
are
pro
cess
.
b)
Ho
w d
oes
a f
ram
ewo
rk a
cti
vit
y c
han
ge
as t
he
nat
ure
of
the
pro
ject
ch
anges?
2.
a)
Wh
ich
mo
del
co
uple
s th
e it
erati
ve n
atu
re o
f pro
toty
pin
g w
ith
th
e co
ntr
oll
ed a
nd
syst
emat
ic
as
pec
t o
f th
e w
ater
fall
mo
del
? E
xp
lain
its
key
fea
ture
s.
b)
Giv
e th
e cl
ass
ific
atio
n o
f so
ftw
are
syst
em r
equ
irem
ents
.
3.
a)
Wh
at c
hec
ks
are
do
ne
du
rin
g r
equ
irem
en
ts v
alid
atio
n? E
xpla
in v
ari
ou
s te
ch
niq
ues
use
d f
or
re
qu
irem
en
ts v
ali
dati
on.
b)
Wh
ich m
od
el s
ho
ws
ho
w d
ata
flo
ws
thro
ugh
a s
eq
uen
ce o
f p
roce
ssin
g s
tep
s? G
ive
the
dat
a
fl
ow
dia
gra
m o
f o
rder
pro
cess
ing.
4.
a)
Bri
efly
des
crib
e ea
ch o
f th
e fo
ur
elem
ents
of
the
des
ign
mo
del
.
b)
What
is
an a
rch
itec
tura
l p
atte
rn? H
ow
can t
he
arch
itec
tura
l st
yle
be
asse
ssed?
5.
a)
Bri
efly
ex
pla
in t
he
step
s in
use
r in
terf
ace
des
ign
eval
uat
ion c
ycl
e.
b)
Usi
ng
UM
L
gra
ph
ical
n
ota
tio
n
for
obje
ct
clas
ses,
des
ign
th
e fo
llow
ing
ob
ject
clas
ses
id
en
tify
ing a
ttri
bu
tes
an
d o
pera
tio
ns.
-
A B
ank a
cco
un
t
-
An
AT
M
6.
a)
Wh
at
are
th
e
dif
fere
nce
s b
etw
een
al
pha
test
ing,
bet
a te
stin
g,
stre
ss
test
ing
and
sm
ok
e
te
stin
g?
b)
What
is
a go
od
test
? G
ive
the
char
acte
rist
ics
of
test
abil
ity.
7.
a)
Ho
w w
ill
yo
u m
easu
re s
oft
war
e q
ual
ity? E
xpla
in.
b)
Bri
efly
ex
pla
in a
bo
ut
RM
MM
pla
n.
Lis
t var
iou
s co
mp
on
ents
of
risk
in
form
atio
n s
hee
t.
8.
a)
Wh
y is
re
vie
w im
po
rtan
t fo
r as
sess
ing q
uali
ty? L
ist
the
revie
w m
etri
cs th
at ar
e to
be
co
llec
ted f
or
each
rev
iew
that
is c
on
ducte
d.
b)
Can
a p
rogra
m b
e co
rrec
t an
d s
till
no
t be
reli
ab
le? E
xp
lain
.
1 o
f 1
SE
T -
1
R1
0
Code No: R22051
II B. Tech II Semester Regular Examinations August - 2014
SOFTWARE ENGINEERING
(Computer Science and Engineering)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~
1. a) What is software engineering? Briefly explain five generic process frame work activities.
b) What formal techniques are available for assessing the software process? Explain them.
2. a) Briefly explain about various phases of Unified process.
b) What are non functional requirements? List various types in it. Briefly explain about the
metrics used for specifying non-functional requirements.
3. a) What is meant by feasibility study? Give the general process model of the requirements
elicitation and analysis process.
b) Which model describes how a system responds to internal or external events? Give the state
machine model of a simple microwave oven.
4. a) Why is quality so important in software design? Explain with examples.
b) Is it necessary to assess an architectural style that is adopted for design? Justify.
5. a) What is the goal of user interface design? What do we need to know about the environment
as we begin UI design?
b) Using UML graphical notation for object classes, design the following object classes
identifying attributes and operations.
- A Telephone
- An ATM
6. a) What errors are commonly found during unit testing and top-down integration?
b) What is a flow graph? How can cyclomatic complexity be calculated?
SET - 2 R10
Code No: R22051
II B. Tech II Semester Regular Examinations August - 2014
SOFTWARE ENGINEERING
(Computer Science and Engineering)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~
1. a) What is a process model? How do process models differ from one another?
b) Compare and contrast personal and team process models.
2. a) What is the oldest paradigm for software engineering? Why does the waterfall model
sometimes fail?
b) What are system requirements? What notations are used for requirements specifications?
3. a) Briefly explain the requirements engineering process.
b) Based on your experience with a bank ATM, draw a data-flow diagram modeling the data
processing involved when a customer withdraws cash from the machine.
4. a) Discuss the importance of data abstraction in the software design process.
b) List the differences between data flow architecture and data centered architecture.
5. a) Under what circumstances might you develop a design where objects execute concurrently?
b) How do we learn what the user wants from the User Interface?
6. a) What guidelines lead to a successful software testing strategy?
b) What is a test case? How test cases can be derived?
7. a) Describe the differences between project metrics and process metrics.
b) What is risk projection and how the consequences of risk be assessed?
8. a) Explain the differences between an error and a defect? Why can’t we wait until testing to
find and correct all software errors?
SET - 3 R10
Code No: R22051
II B. Tech II Semester Regular Examinations August - 2014
SOFTWARE ENGINEERING
(Computer Science and Engineering)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~
1. a) Why is it important to understand the customer’s problem before creating a software
solution?
b) What is a process? What are the generic framework activities that are present in every
software process?
2. a) Briefly explain about incremental process models.
b) What is Software requirements document? Give the structure of it.
3. a) Explain about the requirements of elicitation and analysis in detail.
b) Develop an object model, including a class hierarchy diagram and an aggregation diagram
showing the principal components of a personal computer system and its system software.
4. a) How are the concepts of coupling and cohesion related to software module size?
b) What is an architectural style? Briefly explain about layered architectures with example.
5. a) Using examples, explain the difference between an object and an object class.
b) How do we determine the format and aesthetics of content displayed as part of the User
Interface?
6. a) What is the overall strategy for software testing? When to stop testing?
b) What is a graph matrix? Explain its usage in testing. How can equivalence classes be defined
for testing?
7. a) What is the difference between metrics and measurements? Give metrics for maintenance.
SET - 4 R10
