code no: r22054 r10 set - 1 ii b. tech ii semester ... · code no: r22054 ii b. tech ii semester...

29
||''''|||''|'''||''| Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC) Time: 3 hours Max. Marks: 75 Answer any FIVE Questions All Questions carry Equal Marks ~~~~~~~~~~~~~~~~~~~~~~~~~ 1. a) What addressing mode is used by each of the following instructions for the 8085 micro processor? i) MOV r1,r2 ii) LXI rp,Γ iii) SPHL iv) ACI n v) JUMP Γ b) Explain in detail about 8085 microprocessor instruction set. (8M+7M) 2. a) Design an interface for an input device which has binary address 10101010. Whose computer system uses isolated I/O. b) Explain about different types of memories in memory subsystem. (8M+7M) 3. a) Define micro-operation. Discuss in detail about implementation of micro-operation XY. b) Show the RTL and hardware to implement a shuffle operation on 8-bit register X when α=1. A shuffle of the sequence ABCDEFGH would produce the result AEBFCGDH. (8M+7M) 4. a) Show the logic needed to generate the control signals for registers PC,TR and IR of the Relatively Simple CPU. b) Describe about different ways of reducing the number of microinstructions needed by the control unit in detail. (8M+7M) 5. a) For numbers in unsigned two’s complement notation, show that adding two numbers with different sign always produces a valid result. b) Show the trace of the RTL code for Booth’s algorithm for X=0110 and Y=1011. (8M+7M) 6. a) Elucidate about cache memory with set associative mapping for Relatively Simple CPU in detail. b) A computer system has a cache with T c =8 ns and Physical memory with T p =65 ns. If the hit ratio is 75 percent, what is the average memory access time? (8M+7M) 7. a) Discuss in detail about timing diagram and implementation for the source initiated data transfer without handshaking. b) Explain about different modes of DMA transfer in detail. (8M+7M) 8. a) Explain instruction pipelining with neat Time Space diagram. b) Explain in detail about the Flynn’s classification for multiprocessor systems. (8M+7M) 1 of 1 SET - 1 R10

Upload: doannhan

Post on 06-Sep-2018

230 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22054

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

COMPUTER ORGANIZATION (Com. to CSE, ECC)

Time: 3 hours Max. Marks: 75

Answer any FIVE Questions

All Questions carry Equal Marks

~~~~~~~~~~~~~~~~~~~~~~~~~

1. a) What addressing mode is used by each of the following instructions for the 8085 micro

processor?

i) MOV r1,r2 ii) LXI rp,Γ iii) SPHL iv) ACI n v) JUMP Γ

b) Explain in detail about 8085 microprocessor instruction set. (8M+7M)

2. a) Design an interface for an input device which has binary address 10101010. Whose computer

system uses isolated I/O.

b) Explain about different types of memories in memory subsystem. (8M+7M)

3. a) Define micro-operation. Discuss in detail about implementation of micro-operation X�Y.

b) Show the RTL and hardware to implement a shuffle operation on 8-bit register X when α=1.

A shuffle of the sequence ABCDEFGH would produce the result AEBFCGDH. (8M+7M)

4. a) Show the logic needed to generate the control signals for registers PC,TR and IR of the

Relatively Simple CPU.

b) Describe about different ways of reducing the number of microinstructions needed by the

control unit in detail. (8M+7M)

5. a) For numbers in unsigned two’s complement notation, show that adding two numbers with

different sign always produces a valid result.

b) Show the trace of the RTL code for Booth’s algorithm for X=0110 and Y=1011. (8M+7M)

6. a) Elucidate about cache memory with set associative mapping for Relatively Simple CPU in

detail.

b) A computer system has a cache with Tc=8 ns and Physical memory with Tp=65 ns. If the hit

ratio is 75 percent, what is the average memory access time? (8M+7M)

7. a) Discuss in detail about timing diagram and implementation for the source initiated data

transfer without handshaking.

b) Explain about different modes of DMA transfer in detail. (8M+7M)

8. a) Explain instruction pipelining with neat Time Space diagram.

b) Explain in detail about the Flynn’s classification for multiprocessor systems. (8M+7M)

1 of 1

SET - 1 R10

Page 2: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22054

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

COMPUTER ORGANIZATION (Com. to CSE, ECC)

Time: 3 hours Max. Marks: 75

Answer any FIVE Questions

All Questions carry Equal Marks

~~~~~~~~~~~~~~~~~~~~~~~~~

1. a) Discuss about different addressing modes in detail and describe in detail about how the

Address is generated in each of these modes.

b) Describe in detail about 8085 microprocessor register set. (8M+7M)

2. a) Explain in detail with diagram about configuration of a Relatively simple computer.

b) Show how the following values are stored in memory in big endian and little endian formats.

Each value starts at location 22H. (8M+7M)

i) 103B21 H ii) 432C21 H

3. a) Give the syntax of VHDL and discuss in detail about the primary sections of VHDL design

code.

b) Describe in detail about complete design of the system to implement the RTL code using a

bus and tri-state buffers. (8M+7M)

4. a) Discuss about fetching instructions from memory and decoding instructions for a simple

CPU.

b) Explain about the shortcomings of the Simple CPU s in detail. (8M+7M)

5. a) Show the trace of the BCD multiplication algorithm for the following values of X and Y.

All magnitudes are two digits.

i) X=+17 and Y=+23

ii) X=+71 and Y=-32

iii) X=-39 and Y=-10

b) Explain about the implementation of two-stage arithmetic pipeline to implement the program

loop. (9M+6M)

6. a) A computer system using the Relatively Simple CPU is to include a 1K associative cache

with a line size of 2 bytes.

i) How many bits are in each location of the cache?

ii) What mask value is needed for the associative memory?

b) Explain in detail about the conversion of logical address to physical address using the page

table. (8M+7M)

7. a) What is handshaking? Describe in detail about timing diagram and implementation for the

source initiated data transfer with handshaking.

b) Explain about internal configuration of universal asynchronous receiver /transmitter.

(8M+7M)

8. a) Describe in detail about parallelism in uniprocessor systems

b) Explain in detail about register windowing and renaming in a CPU. (8M+7M)

1 of 1

SET - 2 R10

Page 3: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22054

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

COMPUTER ORGANIZATION (Com. to CSE, ECC)

Time: 3 hours Max. Marks: 75

Answer any FIVE Questions

All Questions carry Equal Marks

~~~~~~~~~~~~~~~~~~~~~~~~~

1. a) Discuss in detail about the design issues for instruction set architectures.

b) Explain in detail about data operation instructions for the 8085 micro processor. (8M+7M)

2. a) Design a 32 × 8 memory subsystem with split interleaving (one high-order bit and one low-

order bit are interleaved) using 8 × 4 memory chips for a computer system with an 8-bit

address bus.

b) Explain about I/O subsystem organization and interface circuitry of CPU in detail. (8M+7M)

3. a) What is micro operation? Explain arithmetic and logical micro operations.

b) Discuss in detail about complete design of the digital system to implement the RTL code

using a bus and multiplexer. (8M+7M)

4. a) Explain about hardwired control unit for the Very Simple CPU.

b) Discuss about the design and implementation of a Relatively Simple Micro sequencer.

(8M+7M)

5. a) What is the result of the following operations on unsigned two’s complement numbers?

i) 1101101.1101-0111011.0101

ii) 00111000-11001101

iii) 100010.111-011011.001

iv) 01110100-10001011

b) Discuss in detail about Wallace tree multiplier for multiplying two 4-bit numbers. (8M+7M)

6. a) What is the primary reason for including cache memory in a computer? Explain.

b) A computer system has a cache with Tc=10 ns and a hit ratio is 80 percent and the average

memory access time TM=240 ns .What is the access time for Physical memory? (8M+7M)

7. a) Distinguish between synchrnous and asynchronous data transfer.

b) Explain about system configuration incorporating an I/O Processor in detail. (8M+7M)

8. a) Explain about communication in multiprocessor systems.

b) Compare RISC Vs CISC computing in detail. (8M+7M)

1 of 1

SET - 3 R10

Page 4: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22054

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

COMPUTER ORGANIZATION (Com. to CSE, ECC)

Time: 3 hours Max. Marks: 75

Answer any FIVE Questions

All Questions carry Equal Marks

~~~~~~~~~~~~~~~~~~~~~~~~~

1. a) What addressing mode is used by each of the following instructions for the 8085 micro

processor?

i) SUB r

ii) ORA M

iii) RAL

iv) CMC

v) XRI n

b) Explain in detail about instruction formats in assembly language. (8M+7M)

2. a) Show the internal organization of a 16 × 4 memory chip; make the array of memory cells as

square as possible.

b) Explain with neat diagram about CPU internal organization in detail. (8M+7M)

3. a) What are the states for the toll Booth controller and discuss in detail about the design of a

toll booth controller with state diagram and state table.

b) Describe in detail about VHDL design with a high level of abstraction for Modulo 6

Counter. (8M+7M)

4. a) Describe in detail about generic CPU state diagram and discuss about the sequence of

operations performed by the CPU.

b) Discuss about Micro programmed Control Vs Hardwired control in detail. (8M+7M)

5. a) Describe in detail about the numeric format of floating point numbers and also discuss about

its numeric characteristics.

b) Discuss about the multiplier implemented using a lookup ROM. (8M+7M)

6. a) Explain in detail about cache memory with associative mapping.

b) A computer system has a cache with Tc=10 ns and Physical memory with Tp=55 ns and

physical memory with access time TM=40 ns . What is the hit ratio? (8M+7M)

7. a) Describe in detail about the types of interrupts and processing interrupts.

b) Discuss and compare different serial communication standards in detail. (8M+7M)

8. a) Describe about memory organization in multiprocessor systems.

b) Explain in detail about instruction pipeline conflicts. (8M+7M)

1 of 1

SET - 4 R10

Page 5: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22053

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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) Explain the Database Languages and differentiate between DDL and DML.

b) What is a transaction? What guarantees does a DBMS offer with respect to transactions.

2. a) What is an ER model? Explain features of ER model.

b) Give us a case study according to ER model.

3. a) What is a view? How it can be created? Describe with an example

b) Briefly describe SELECT, PROJECT, UNION with examples.

4. Describe Nested and Correlated Nested Queries and explain difference between them.

5. a) Explain the properties of decompositions completely.

b) Explain the differences between lossless-join & dependency preserving decomposition.

6. Explain about concurrent executions, seralizability and recoverability.

7. a) Briefly compare the I/O costs of available file organizations.

b) Briefly describe primary and secondary Indexes.

8. Explain ISAM and working strategies of this method.

1 of 1

R10 SET - 1

Page 6: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22053

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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 is a data model? What is the relational data model? What is data independence and

how does a DBMS support it?

b) With a neat diagram, briefly describe database system structure

2. Name the main steps in database design and what is the goal of each step and in which step the

ER model mainly used

3. Explain how the concept relational algebra process by using its operators.

4. a) Describe about Aggregate operators including its subset operators with an example.

b) Describe correlated nested queries and set comparison operators with example.

5. What is normalization? Discuss first, second and BCNF normal forms?

6. a) Briefly describe failure classifications.

b) How to implement atomicity in transactions? Explain

7. a) Explain about file organization and indexing.

b) Describe the concepts primary and secondary indexes.

8. Describe about Tree structured Indexing.

1 of 1

R10 SET - 2

Page 7: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22053

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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 benefits of using DBMS to manage data in applications involving extensive

data access?

b) Explain the roles of

i) Database administrators

ii) Application programmers

iii) End users of a data base.

2. Explain briefly about conceptual design for large Enterprises.

3. a) Define all variations of the join operation? Why is the join operation given special attention?

b) Describe the set operations of relational algebra including union (u), intersection (n), set-

difference (-) and cross product(*) with an example.

4. a) What are Null values? Write the comparision using null values.

b) Write the SQL expression for the following relational databases.

Sailor schema (sailor id, Boat id, sailor name, rating, age)

Reserves (sailor id, Boat id, Day)

Boat schema (boat id, Boat name, color)

i) Find the age of youngest sailor for each rating level?

ii) Find the No. of reservations for each blue boat.

iii) Find the average age of sailors for each rating level that at least 2 sailors.

5. a) Explain about the concept Normalization and explain Decomposition into BCNF.

b) Describe decomposition into 3NF and differentiate BCNF & 3NF.

6. a) What is Recoverability? Briefly describe recovery algorithm.

b) Define serializability? Compare concurrent execution and serializability with an example

transaction

7. a) Briefly describe Primary and Secondary Indexes.

b) Write short notes on File organization and Indexing.

8. a) Explain about Indexes and Performance tuning.

b) Describe hash based & tree based Indexing.

1 of 1

R10 SET - 3

Page 8: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22053

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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 is Data Abstraction? What are the views of data?

b) Briefly describe storage manager and query processor.

2. a) Write short notes on addition features of ER-Model.

b) Construct an F-R diagram for hospital management system.

3. a) In Logical database design explain how the following

i) Translating relationship sets with key constraints

ii) Translating relationship sets with participation constraints

b) What is a key constraint? Briefly describe key constraints for ternary relationships.

4. a) Describe the form of basic SQL Query with an example? Write about Logical connectivity.

b) What is FDS? Briefly describe Lossless join Decomposition

5. a) Explain about dependency preserving decomposition.

b) Describe about schema refinement in data base design?

6. a) What are ACID properties? How Atomicity and Durability are implemented given an

example

b) What is serializability? Write short notes on testing for serializability

7. Explain briefly about hash based Indexing.

8. a) Explain the concepts involved in B+ trees.

b) Describe about Dynamic Index Structure.

1 of 1

R10 SET - 4

Page 9: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22055

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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) Define a finite state machine and explain model of finite automaton?

b) Find the language accepted by following finite automaton: (9M+6M)

2. a) Design a Finite State Acceptor to accept the language of all binary strings that do not include

the substring 1011.

b) Design a Moore machine to determine the residue mod 5 for each binary string treated as

integer. (7M+8M)

3. a) Convert the following finite automata to regular expressions

b) Using pumping lemma, show the following language is not regular:

{ }squareperfect a is ws0' of 10 numberthewL |)( *+∈= (10M+5M)

1 of 2

R10 SET - 1

1

0

Start q r s

0,1

0,1

a

1

2 a

b b

a 2 1

a

a,b

b

3

b

Page 10: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22055

4. a) Obtain a Right Linear Grammar for the language

L = {anb

m |n ≥ 2, m ≥ 3 }

b) Recognize the context free language for the following CFG:

S�aB|bA

A�a|aS|bAA

B�b|bS|aBB (6M+9M)

5. a) What is Greibach Normal Form? Write the procedure to convert CFG into Greibach Normal

form.

b) Convert the following CFG into Chomsky Normal Form:

S�ABA

A�aA|∈

B�bB|∈ (7M+8M)

6. a) Design a PDA for the language { })()(|)(| *wnwandbawwL

b>+∈= an

b) Discuss in detail about different approaches for acceptance of language by Push down

Automata. (7M+8M)

7. a) Differentiate between recursive and recursively enumerable languages.

b) Give a Turing machine that shifts the input string, over the alphabet {0,1} by one position

right by inserting ‘#'as the first character. (7M+8M)

8. a) Define Post correspondence problem and Modified PCP. What is the difference between

PCP and MPCP?

b) For a given recursively enumerable language, it is undecidable to determine whether it is

empty or not. Justify your answer.

(7M+8M)

2 of 2

R10 SET - 1

Page 11: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22055

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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) Give DFA‘s accepting the following languages over the alphabets{0,1}: The set of all

strings beginning with a 1 that ,when interpreted as a binary integer, is a multiple of 5 .For

example, strings 101,1010and 1111are in the language; 0,100 and 111 are not.

b) Define DFA and NFA. Explain the difference between them with an example. (7M+8M)

2. a) For the following NFA with ∈ moves convert it into an NFA without ∈ moves and show

that NFA with ∈ -moves accepts the same language as shown in Figure 2 below.

b) Describe in detail about conversion of Moore to Mealy machine. (7M+8M)

3. a) Explain about pumping lemma for regular sets.

b) Give a regular expression for the set of all strings over {a, b} accepting all strings which

have number of a’s divisible by 6 and number of b’s divisible by 8. (6M+9M)

1 of 2

R10 SET - 2

a

1

2 ∈

3

6

4

8

5 7

a

a

Page 12: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22055

4. a) Show that id+id*id can be generated by two distinct left most derivations in the grammar

E�E+E|E*E|(E)|id

b) What is left linear and right linear grammars? Discuss in detail about conversion from left

linear to right linear grammar. (7M+8M)

5. a) Explain pumping lemma for CFL .Consider the following language L={anb

nc

n | n≥1},using

pumping lemma show that L is not CFL.

b) Check whether the given grammar is ambiguous or not

S�iCtS

S�iCtSeS

S�a

C�b (7M+8M)

6. a) Define Push Down Automata and explain its model with a neat diagram.

b) Construct PDA for the following grammar:

S�AB

A�CD

B�b

C�a

D�a (7M+8M)

7. a) Design a Turing Machine that accepts the set of all even palindromes over {0,1}.

b) What is Turing machine? What are various types of Turing machines? Describe in detail

about various representations of Turing machines. (7M+8M)

8. a) Show that the following post correspondence problem has a solution and give the solution.

b) Discuss in detail about P problems and NP problems. (10M+5M)

2 of 2

I List A List B

1 11 11

2 100 001

3 111 11

R10 SET - 2

Page 13: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22055

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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) Define NFA with 0-transition. Is the NFA’s with 0-transitions are more powerful that the

NFA’s without 0 -transition? Explain.

b) Draw the transition diagram for below FA.

M= { {A,B,C,D}, {0,1}, δ,C, {A,C} }

δ (A,0) = δ (A,1) = {A,B,C}

δ(B,0) = B, δ(B,1) = { A, C }

δ(C,0) = {B,C}, δ(C,1) ={ B, D }

δ (D,0) = { A, B, C, D }

δ(D,1) = {A}. (7M+8M)

2. a) Reduce the Moore machine:

b) State and explain Myhill-Nerode theorem. (9M+6M)

3. a) Find a Regular expression corresponding to each of the following subsets over {0,1}*.

i) The set of all strings containing no three consecutive 0’s.

ii) The set of all strings where the 10th

symbol from right end is a 1.

iii) The set of all strings over {0,1} having even number of 0’s and odd number of 1’s.

iv) The set of all strings over {0,1} in which the number of occurrences 1 is divisible by 3

b) Describe in detail about algebraic laws for regular expressions. (8M+7M)

4. a) Give an equivalent left linear grammar for the following right linear grammar

A0�aA1

A1�bA1

A1�a

A1�bA0

b) Construct the CFG for the language containing at least one occurrence of aa. (7M+8M)

1 of 2

R10 SET - 3

0 A/x

1

B/y

C/y D/x

1 1 1

0

0

0

Page 14: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22055

5. a) Convert the following CFG into Chomsky Normal Form:

S�aaaaS

S�aaaa

b) Explain in detail about pumping lemma for Context Free languages. (8M+7M)

6. a) Let G be a CFG with the following productions.

S � a B c

A � a b c

B �a A b

C �A B

C � c

Construct a PDA M such that the language generated by M and G are equivalent.

b) What is the additional feature PDA has when compared with NFA? Is PDA superior over

NFA in the sense of language acceptance? Justify your answer. (9M+6M)

7. a) Give a Turing machine for the following that computes ones complement of a binary

number.

b) State and explain Church’s hypothesis in detail. (7M+8M)

8. a) What is Halting problem of a Turing machine? Is it decidable or undecidable? Explain.

b) Write about Universal language? Describe about structure of universal Turing machine and

about operation on Turing machine. (7M+8M)

2 of 2

R10 SET - 3

Page 15: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22055

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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? Discuss in detail about the properties of relations.

b) Give DFA ‘s accepting the following languages over the alphabets{0,1}: The set of strings

such that the number of 0’s is divisible by five and the number of 1’s is divisible by 3.

(7M+8M)

2. a) Design a Mealy machine that uses its state to remember the last symbol Read and emits

output ‘y’ whenever current input matches to previous one, and emits ‘n’ otherwise.

b) Describe in detail about conversion of NFA with ∈ - transitions to NFA without ∈ -

transitions. (7M+8M)

3. a) What is regular expression? Describe in detail about operations and applications of regular

expressions.

b) Give the English description and NFA for the following regular expressions.

i) r=(1+01+001)*(+0+00)

ii) r=[00+11+(01+10)(00+11)*(01+10)]* (7M+8M)

4. a) Construct the CFG for the language L=anb

2n where n≥1

b) Define grammar. Explain in detail about different types of grammars. (7M+8M)

5. a) Eliminate the ∈ -productions from the CFG’s given below:

i) A�0B1|1B1

B�0B|1B|∈

ii) S�aSa|bSb|∈

b) Remove the useless symbols from the following grammar:

S�aA|a|Bb|cC

A�aB

B�a|Aa

C�cCD

D�ddd (8M+7M)

1 of 2

R10 SET - 4

Page 16: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22055

6. a) Design push down automata that checks the well-formedness of parenthesis.

b) Explain the procedure for construction of PDA from CFG. (7M+8M)

7. a) Design the Turing machine to compute following function f(x,y)=xy where x and y are

positive integers represented in unary.

b) Explain the steps involved in construction of Turing machine in detail. (8M+7M)

8. a) Find whether the post correspondence problem P={(10,101),(011,11),(101,011)} has a

match. Give the solution.

b) Show that if L and L1 are recursively enumerable, and then L is recursive. (8M+7M)

2 of 2

R10 SET - 4

Page 17: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22052

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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) What is method binding? Explain with an example.

b) Write a sample java program that prints the name of all the months in a year and no of days

in that month using switch statement. (7M+8M)

2. a) Explain the usage of “this” keyword with example

b) What is multiple inheritance? Is it possible to implement in Java? If so, explain with an

example program. (5M+10M)

3. a) Explain any three methods to modify a string.

b) Explain the usage of static variables and static methods? (8M+7M)

4. a) What are the abstract classes? How do they differ from interfaces?

b) What is a package? Explain creation and accessing a package. (8M+7M)

5. a) Explain the thread life cycle.

b) What is an exception? Explain the class hierarchy of exceptions. (7M+8M)

6. a) Design an applet to display three buttons “Red”, “Green”, and “Blue”. The color of

background should change according to the button pressed by the user. Also include HTML

code to display the applet.

b) Briefly describe Applet lifecycle. (10M+5M)

7. a) Explain the class hierarchy of AWT components

b) Explain the Border, Card, and Grid AWT Layout Managers with example. (7M+8M)

8. a) Explain MVC architecture?

b) Design a java front end for login page using a Japplet. (5M+10M)

1 of 1

R10 SET - 1

Page 18: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22052

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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) What are the various data types used in Java?

b) Write a java program to print inverse of a matrix with help of multidimensional arrays.

(5M+10M)

2. a) Explain the usage of “super” keyword in the constructors.

b) What is an abstract class? Why do you need them in Java? (7M+8M)

3. a) Explain method overriding with an example.

b) Discuss polymorphism. Explain runtime polymorphism with a program. (7M+8M)

4. a) Explain the implementation of interfaces with an example.

b) Write a sample exception class to illustrate the concept of user defined exceptions.

(8M+7M)

5. a) What are the differences between multi threading and multi tasking?

b) Explain the synchronization of multiple threads with example. (8M+7M)

6. a) What are the various methods called during the execution of an applet.

b) What are the differences between applets and applications? (8M+7M)

7. a) Explain the delegation event model.

b) What are the Adapter classes? Explain with example. (7M+8M)

8. a) Write a java program to illustrate the concept of check boxes, combo boxes, text field and

buttons.

b) Discuss the limitations of AWT. (7M+8M)

1 of 1

R10 SET - 2

Page 19: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22052

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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 need for object oriented paradigm.

b) Write a sample java program to print the Fibonacci numbers from 1 to 1000. (7M+8M)

2. a) What is recursion? Write a java program to find the factorial of ‘n’ using recursion.

b) Explain various access control specifiers used in Java? (7M+8M)

3. a) Explain the usage of “super” key word with an example.

b) What is dynamic method dispatch? Explain with an example. (7M+8M)

4. a) What is class path? How to set the class path for a new package?

b) Explain how interfaces help in handling multiple inheritance with an example. (5M+10M)

5. a) What is exception hierarchy? Explain any four exception classes.

b) Explain synchronization of multiple threads with example. (8M+7M)

6. Explain the concept of applet to applet communication with a program. (15M)

7. a) Explain grid bag layout with an example.

b) Explain with an example program to handle mouse events. (7M+8M)

8. a) What are the various methods in URL class? Explain their usage.

b) Write a short note on

i) Tabbed panes

ii) Check boxes. (8M+7M)

1 of 1

R10 SET - 3

Page 20: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22052

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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 Object Oriented Programming concepts.

b) Write a sample java program to find the GCD of two numbers. (8M+7M)

2. a) Explain the parameter passing with respect to objects and primitive data types in java

programming.

b) What is garbage collection? Explain how to call the garbage collector explicitly with an

example. (7M+8M)

3. a) Write the java code to show the usage of “final” keyword in all aspects.

b) Write a java program for banking example which shows all types of inheritance. (5M+10M)

4. a) What is an interface? How is it different from classes?

b) Discuss the significance of CLASSPATH for java packages. (7M+8M)

5. a) Write code to define instantiate and start new threads using thread class.

b) What is the exception hierarchy? Explain any four exception classes (8M+7M)

6. a) Define a java method to find the greatest among three numbers. Write a java applet that

obtains three numbers from the users and display the largest using the method.

b) How to pass the parameters to an Applet? Explain with example. (8M+7M)

7. Design a java front end for a login page using swing components with the following layout

managers:

a) Border layout b) Grid Layout (15M)

8. a) Explain Jtree Swing components with suitable example.

b) Explain the creation and manipulation of menus. (8M+7M)

1 of 1

R10 SET - 4

Page 21: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22056

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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) Why to study programming languages? Explain?

b) Explain about bootstrapping? What is meant by P-code? (8M+7M)

2. Consider the following pseudo code.

X: integer

Procedure set_x(x:integer)

X:=n

Procedure print_x

Write_integer(x)

Procedure first

Set_x(1)

print_x

Procedure second

X:integer

set_x(2)

print_x

set_x(0)

first()

print_x

second()

print_x

What does this program print if the language uses static scoping? What does it print with

dynamic scoping? Why? (5M+5M+5M)

3. a)What does it mean for an attribute grammar to be S-attributed? L-attributed? Explain with

example?

b) What is the role of semantic analyzer? (8M+7M)

4. a) Describe the jump code implementation of short circuit Boolean evaluation?

b) Describe three different search strategies that might be employed in implementation of a

case statement and the circumstance in which each would be desirable? (8M+7M)

1 of 2

SET - 1 R10

Page 22: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22056

5. a) How does inline subroutine differ from a macro?

b) Describe four common parameter passing modes. How does a programmer can choose

which one to use when? (8M+7M)

6. a) Compare Java final method with C++ non-virtual methods. How are they same? How are

they different?

b) Explain why in-line subroutine are particularly important in object-oriented languages.

(8M+7M)

7. a) Define functional programming languages? List several distinguishing characteristics of

functional programming languages.

b) What is the difference between normal-order and applicative-order evaluation? What is lazy

evaluation? (8M+7M)

8. a) What are dangling references? How are they created and why are they a problem?

b) Why was automatic garbage collection so slow to be adopted by imperative programming

languages? (8M+7M)

2 of 2

SET - 1 R10

Page 23: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22056

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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 phases of the compilation with neat sketch? b) Differentiate between interpretation and compilation? What are the comparative advantages

and disadvantages of the two processes? (8M+7M)

2. a) Explain the distinction between the life time of a name-to-object binding and its visibility? b) 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 (*)? (8M+7M)

3. a) Explain about Action Routines with example? b) Why cannot action routines be placed at arbitrary location within the right hand side of

productions in an LR CFG? (8M+7M)

4. a) Why do most languages not allow the bounds or increment of an enumeration controlled loop to be floating point numbers? b) Give an example in which a midtest loop results in more elegant code than does a pretest or

post test loop. Explain? (8M+7M)

5. a) Describe the parameter modes of Ada. How do they differ from the modes of other modern languages?

b) What is the principle purpose of generics? In what sense do generics serve a broader purpose in C++ and Ada than they do in Java and c#? (8M+7M)

6. a) What is an Abstract class? Explain the distinction between redefining and overriding a method?

b) Explain in detail about shared and replicated inheritance with example? (8M+7M)

7. a) How one can accommodate I/O in purely functional model? What is currying? b) What is a Horu clause? Briefly describe the process of resolution in logic programming?

(8M+7M) 8. a) Summarize the distinction between records and types in ML. How do these compare to the

records of languages like C and Ada? b) Discuss the significance of ‘’holes “in records. Why do they arise? What problems do they

came? (8M+7M) 1 of 1

SET - 2 R10

Page 24: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22056

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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) Give the derivation and alternative derivation tree for the expression to generate the string

‘’ slope * x + intercept’’.

b) What is meant by ambiguous grammar and explain with examples? (7M+8M)

2. a) Explain static and stack based allocation of storage management?

b) Explain Aliases with example? (7M+8M)

3. a) Translate a *- (b+c) into prefix form?

b) Give two examples of reasonable semantic rules that cannot be checked at reasonable cost,

either statically or by compiler generated code at run time.

c) What is meant by decorating a syntax tree? (5M+7M+3M)

4. a) Explain precedence and associativity with the following Fortran example.

((((a+b)*c)**d)**e)/f

b) why do imperative languages commonly provide a case statement in addition to if—than—

else? (7M+8M)

5. a) Explain why it is useful to define exceptions as class in C++ , Java and C#?

b) Describe three alternative means of allocating co-routine stacks. What are their relative

strengths and weaknesses? (7M+8M)

6. a) What is a meta class in Smalltalk? Explain the difference between initialization and

assignments in C++?

b) Summarize the fundamental argument for dynamic method binding? Why do C++ and C#

use static method binding by default? (7M+8M)

7. a) What is a unification? Why is it important in logic programming?

b)What are clauses, terms, and structures in prolog? What are facts, rules and queries?

(7M+8M)

8. a) Discuss the differences among the denotational, constructive and abstraction based views of

types?

b) Explain the distinction between derived types and subtypes in ADA? (8M+7M)

1 of 1

SET - 3 R10

Page 25: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22056

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

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) Give the scanner design for operators, assignment, number and keywords in a language?

b) Consider the following grammar.

G-> S$$

S-> AM

M->S| є

A-> a E |bAA

E-> aB| bA |є

B-> bE | aBB

i) Describe in English the language that the grammar generates?

ii) Show the parse tree for the string abaa. (7M+4M+4M)

2. a) Explain nested subroutines with example?

b) Explain overloading with an example? (8M+7M)

3. a) What is an attribute grammar? What is the difference between synthesized and inherited

attributes?

b) Describe in detail about evaluating attributes for the expression 23 * 5 + 4 $ (7M+8M)

4. a) Explain about structured alternatives to goto in detail?

b) What is a tail recursive function? Why is tail recursion important? Write a tail recursive

function scheme to compute n factorial (n!) . (7M+8M)

5. a) Describe in detail about implementing synchronization.

b) What is a monitor? How do monitor condition variables differ from those of semaphores?

(7M+8M)

6. a) What is the purpose of the private, protected as a part of an object interface? Why these are

required?

b) Explain the significance of these parameters in object oriented languages? (7M+8M)

7. a) What is the closed world assumption? What problems does it cause for logic programming?

b) Explain in detail how control flow and assignment expressions are defined in scheme with

examples. Also briefly discuss on the concept of program as lists in scheme. (7M+8M)

8. a) Discuss the comparative advantages of structural and name equivalence for types. Name

three languages that use each approach?

b) What does it mean for languages to be strongly typed? Statically typed? What prevents, say

C from being strongly typed? (8M+7M)

1 of 1

SET - 4 R10

Page 26: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22051

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

SOFTWARE ENGINEERING (Computer Science and Engineering)

Time: 3 hours Max. Marks: 75

Answer any FIVE Questions

All Questions carry Equal Marks

~~~~~~~~~~~~~~~~~~~~~~~~

1. a) Define Software Engineering and write about characteristics of Software Engineering?

b) What formal techniques are available for assessing the software process patterns?

2. a) Write about the Unified process models in detail.

b) What are the differences between the functional and non functional requirements?

3. Explain the following:

a) Data Models

b) Object Models

4. a) What are the characteristics of a good design?

b) How can the architectural style be accessed? Explain.

5. a) Describe about oriented design process.

b) How to choose the appropriate task set for a project?

6. a) What is the overall strategy for software testing?

b) What is the software testing strategy for Object Oriented Architectures?

7. Write the short notes on the following:

a) Size-Oriented Metrics

b) Function oriented Metrics

8. a) Explain about statistical software quality assurance.

b) Describe about ISO 9000 quality standards.

1 of 1

SET - 1 R10

Page 27: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22051

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

SOFTWARE ENGINEERING (Computer Science and Engineering)

Time: 3 hours Max. Marks: 75

Answer any FIVE Questions

All Questions carry Equal Marks

~~~~~~~~~~~~~~~~~~~~~~~~

1. a) Explain the RAD software process models.

b) Explain the various CMMI levels.

2. a) What is software requirements document?

b) What are system requirements?

3. Write short notes on the following:

a) Data modeling

b) Behavioral modeling

4. a) Explain about creating an architectural design.

b) Delineate about design model.

5. a) What are the Interface design steps?

b) How to conduct the design evaluation?

6. Write short notes on the following:

a) Integration testing

b) System testing

7. a) How to conduct the Risk identifications process?

b) Explain various types of Software Metrics.

8. a) How to measure the software quality?

b) When do we conduct the Formal Technical Reviews? What are the guide lines to be

followed?

1 of 1

SET - 2 R10

Page 28: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22051

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

SOFTWARE ENGINEERING (Computer Science and Engineering)

Time: 3 hours Max. Marks: 75

Answer any FIVE Questions

All Questions carry Equal Marks

~~~~~~~~~~~~~~~~~~~~~~~~

1. a) Explain evolutionary software process models.

b) What are the five generic process framework activities?

2. a) What is unified process? Explain the steps involved in it.

b) Compare the waterfall, incremental process and evolutionary process models with respect to

methodology, advantages and disadvantages.

3. Write short notes on the following:

a) Data modeling

b) Behavioral modeling

4. a) Explain in detail about design quality and why is quality to important in software design.

b) Discuss the taxonomy of architectural styles.

5. a) Explain about golden rules in interface design.

b) Explain the various models of user interface analysis and design.

6. a) What are the basic testing principles? Explain Basis path testing.

b) Write about system testing in detail.

7. a) Explain various types of Software Metrics. How to measure the software quality?

b) How to choose the appropriate task set for a project?

8. a) When do we conduct the Formal Technical Reviews? What are the guide lines?

b) Explain about software reliability in detail.

1 of 1

SET - 3 R10

Page 29: Code No: R22054 R10 SET - 1 II B. Tech II Semester ... · Code No: R22054 II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015 COMPUTER ORGANIZATION (Com. to CSE, ECC)

||''''|||''|'''||''|

Code No: R22051

II B. Tech II Semester Supplementary Examinations Jan/Feb - 2015

SOFTWARE ENGINEERING (Computer Science and Engineering)

Time: 3 hours Max. Marks: 75

Answer any FIVE Questions

All Questions carry Equal Marks

~~~~~~~~~~~~~~~~~~~~~~~~

1. a) Describe in detail about personal and team process models.

b) Give the generic view of process in detail.

2. a) Why does the Waterfall model some times fail?

b) Explain the evolutionary process models

3. Write short notes on the following:

a) Context models

b) Behavioral models

4. a) What are the characteristics of a good design? Explain in detail.

b) What are the fundamental design concepts? Discuss.

5. a) What are the Interface design steps?

b) How to conduct the design evaluation?

6. a) What is the criterion for completion of software testing?

b) What is the software testing strategy for Object Oriented Architectures?

7. Write the short notes on the following:

a) Size-Oriented Metrics

b) Function Oriented Metrics

c) Risk refinement

8. a) Justify the need for software review. List the different types of reviews and explain.

b) Explain the standards associated with software quality.

1 of 1

SET - 4 R10