Anna University CSE Question Papers

I am looking for previous years question papers of Anna University 5th semester B. Tech CSE for preparation so please provide me the same?

[Quick Sam]

Here I am providing you previous years question papers of Anna University 5th semester B. Tech CSE for preparation.


B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.
Fifth Semester
Computer Science and Engineering
CS 2301 — SOFTWARE ENGINEERING
PART A — (10 × 2 = 20 marks)
1. For the scenario described below, which life cycle model would you choose? Give the reason why you would choose this model. You are interacting with the MIS department of a very large oil company
with multiple departments. The have a complex legacy system. Migrating the data from this legacy system is not an easy task and would take a considerable time. The oil company is very particular about processes, acceptance criteria and legal contracts.
2. Differentiate verification and validation. Give an example.
3. Name the metrics for specifying Non-functional requirements.
4. Draw the DFD notations for the following.
(a) External entity
(b) Data items.
5. Explain the qualitative criteria for measuring independence.
6. Distinguish fan in and fan out.
7. In unit testing of a module, it is found for a set of test data, at maximum 90% of the code alone were tested with the probability of success 09. What is the reliability of the module?
8. What is the purpose of Regression testing? What are the two main activities of Regression testing?
9. State the need for software configuration review.
10. List any five CASE tools classified by function in the taxonomy of CASE tools.
PART B — (5 × 16 = 80 marks)
11. (a) (i) Describe at least one scenario where
(1) RAD model would be applicable and not the waterfall model. (5)
(2) Waterfall model is preferable to all other models. (5)
(ii) Compare and contrast the different life cycle models. (6)
Or
(b) Write short notes on :
(i) Business Process Engineering. (8)
(ii) Product Engineering. (8)
12. (a) An independent truck company wants to track and record its drivers driving habits. For this purpose the company has rented 800 phones numbers and has printed the numbers on the front, back and sides of all trucks owned by the company. Next to the 800 numbers a message is written “PLEASE REPORT ANY DRIVER OR TRUCK PROBLEM BY CALLING THIS NUMBER”. The hacking company waits for you to develop a system that :
(i) Collects information from caller about the driver performance and behaviour as well as truck condition,
(ii) generates daily and monthly reports for each driver and truck management.
(iii) reports problems that require immediate action to an on-duty manager. Analyse the problem statement and list major functions to be incorporated with the SRS document.
Or
(b) How does the analysis modeling help to capture unambiguous and consistent requirements? Discuss several methods for requirements validation.

13. (a) Explain clearly the concepts of coupling and cohesion? For each type of coupling give an example of two components coupled in that way?
Or
(b) Write short notes on
(i) Architecture design. (8)
(ii) Data acquisition system. (8)
14. (a) Write a program for sorting of n numbers. Draw the flow chart, flow graph, find out the Cyclomatic complexity.
Or
(b) Design a black box testing for an Under Water submarine.
15. (a) (i) With a suitable example explain the Change Control Process in detail. (8)
(ii) Why are CASE tools usually costly? Explain. (8)
Or
(b) (i) With a neat sketch draw the architecture model for an integration framework for CASE tool and explain them. (8)
(ii) Calculate the effort and duration using the above details for basic COCOMO model. (8)
Given,
Number of user inputs = 15
Number of user outputs = 3
Number of external interfaces = 11
1 function point = 20 LOC (as fourth generation language is used). Values of constant used in basic COCOMO model. a = 2.4, b = 1.05, c = 2.5, d = 0.38.


B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.
Fifth Semester
Computer Science and Engineering
CS 2304 — SYSTEM SOFTWARE
(Common to Information Technology)
1. Define system software.
2. Write the abbreviation for the following :
(a) SIC (b) XE (c) CISC (d) RISC.
3. Distinguish assembler and interpreter.
4. What do you mean by literal?
5. What are the functions of loader and linker?
6. Define relocation.
7. Write any two basic macroprocessor functions.
8. Briefly write about MASM macro processor.
9. Define text editor
10. What do you mean by debugger?
PART B — (5 × 16 = 80 marks)
11. (a) Explain the SIC machine architecture in detail.
Or
(b) Describe the following in VAX architecture
(i) Memory
(ii) Registers
(iii) Data formats
(iv) Instruction formats
(v) Addressing modes
(vi) Instruction set and
(vii) Input/output.
12. (a) Discuss in detail the assembler design options.
Or
(b) Explain machine dependent assembler features in detail.
13. (a) Describe machine dependent loader features in detail.
Or
(b) Explain the following in detail :
(i) Linkage editor
(ii) Dynamic linking
(iii) Bootstrap loaders.
14. (a) Explain the features of machine independent macro processor in
detail.
Or
(b) Describe the following in detail :
(i) Conditional macro expansion
(ii) MASM macro processor
(iii) ANSI C macro language.
15. (a) Explain the editor structure with neat diagram.
Or
(b) Discuss interactive debugging systems in detail.


PDF’s Question Papers of Anna University 5th Semester B. Tech CSE:

Anna University 5th Sem CSE Paper 1
1.Define Automaton?
2.What is the principle of mathematical Induction?
3.Construct a DFA for the regular expression aa*/bb*..
4.Construct a DFA over ∑=(a,b) which produces not more than 3 a’s.
5.Let S->aB/bA
A->aS/bAA/a
B->bS/aBB/b
Derive the string aaabbabba as left most derivation.
6. What is meant by empty production removal in PDA.?
7.State the Pumping lemma for CFG.
8. Define turing machine
9.What is meant by halting problem.
10.What is post correspondence problem?
PART B (5 x 16 = 80)
11. (a ) (i) Prove that for every integer n>=0 the number 42n+13n+2 is a multiple of 13
(ii)construct a DFA that will accept strings on{a,b}where the number of b’s divisible by 3
(or)
(b) (i) Construct a finite automaton that accepts the set of all strings in {a,b,c}* such that the last
symbol in input string appears earlier in the string
12 (a) (i) Construct the regular expression to the transition diagram.
Diagram
(or)
(b)Construct a NFA for regular expression (a/b)*abb and draw its equivalent DFA.
13. (a) Construct a CFG accepting L={ambn/n
(or)
(b)Convert the grammar with productions into CNF A->Bab/λ.
14.(a) Design a deteministicturing machine to accept the language L={aibici/i>=0}
(or)
14. (b)Determine whether the language given byL={An2/N>=1} is a context free or not.
15. (a)Prove that the function fadd (x,y)=x+y
is a primitive recursive
(or)
15. (b)Show there existsaTM for which the halting problem is unsolvable

Anna University 5th Sem CSE Paper 2