COMPUTER GRAPHICS CS2401 ANNA UNIVERSITY QUESTION PAPER |CS2401 CG NOVEMBER/DECEMBER 2011 PREVIOUS YEAR QUESTION PAPER

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

Seventh Semester

Computer Science and Engineering

CS 2401 — COMPUTER GRAPHICS

(Common to Information Technology)

(Regulation 2008)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. Write down any two line attributes.
2. Differentiate window and viewport.
3. What are spline curves?
4. Define quadric surfaces.
5. What is animation?
6. Define keyframes.
7. What do you mean by shading of objects?
8. What is texture?
9. Define fractals.
10. Differentiate Mandelbrot and Julia sets.

PART B — (5 × 16 = 80 marks)

11. (a) Write down and explain the midpoint circle drawing algorithm. Assume 10 cm as the radius and co-ordinate origin as the centre of the circle.

Or

(b) Explain in detail the Cohen-Sutherland line clipping algorithm with an example.
12. (a) Differentiate parallel and perspective projections and derive their projection matrices.

Or

(b) With suitable examples, explain all 3D transformations.
13. (a) Write notes on RGB and HSV color models.

Or

(b) Discuss the following:
(i) Methods to draw 3D objects. (8)
(ii) Basic OPENGL operations. (8)
14. (a) Explain the following:
(i) Adding texture to faces. (8)
(ii) Adding shadows of objects. (8)

Or

(b) Write down and explain the details to build a camera in a program.
15. (a) Write notes on Peano curves.

Or

(b) Write about random fractals in detail.
—————————

ADVANCED COMPUTER ARCHITECTURE CS2354 NOVEMBER/DECEMBER 2011 ANNA UNIVERSITY QUESTION PAPER | CS2354 ACA PREVIOUS YEAR QUESTION PAPER

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

Sixth Semester

Computer Science and Engineering

CS 2354 — ADVANCED COMPUTER ARCHITECTURE

(Regulation 2008)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. What is instruction level parallelism?
2. What are the advantages of loop unrolling?
3. What are the limitations of VLIW?
4. What is the use of branch-target buffer?
5. Distinguish between shared memory multiprocessor and message-passing multiprocessor.
6. Differentiate multithreading computers from multiprocessor systems
7. Define the terms cache miss and cache hit.
8. What is RAID?
9. What is a multi-core processor?
10. What is a cell processor?

PART B — (5 × 16 = 80 marks)

11. (a) (i) Explain the data and name dependencies with suitable example. (10)
(ii) Discuss about the benefits and limitations of static branch prediction and dynamic branch prediction (6)

Or

(b) Briefly explain how to overcome data hazards with dynamic scheduling using Tomasula’s approach. (16)
12. (a) (i) Describe the architecture of Itanium processor with the help of a block diagram. (8)
(ii) Explain how ILP is achieved in EPIC processors (8)

Or

(b) (i) Describe the architectural features of IA64 processor in detail.(8)
(ii) What are the advantages and disadvantages of software-based and hardware-based speculation mechanism? (8)
13. (a) (i) Briefly compare instruction level parallelism with thread-level parallelism. (8)
(ii) Explain the basic architecture of a distributed memory multiprocessor system. (8)
Or
(b) (i) Explain various memory consistency models in detail. (10)
(ii) What is multithreading and what are the advantages of multithreading? (6)
14. (a) What is meant by cache coherence problem? Describe various protocols for cache coherence. (16)

Or

(b) Briefly explain various I/O performance measures. (16)
15. (a) (i) Describe the architecture of typical CMT processor. (8)
(ii) Discuss the design issues for simultaneous multithreading. (8)

Or

(b) (i) Explain the architectural features of IBM cell processor in detail. (10)
(ii) Briefly compare SMT and CMP architectures. (6)

MICROPROCESSORS AND MICROCONTROLLERS CS2252 ANNA UNIVERSITY QUESTION PAPER | CS 2252 MICROPROCESSORS AND MICROCONTROLLERS NOVEMBER/DECEMBER 2011 QUESTION PAPER DOWNLOAD

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

Fourth Semester

Computer Science and Engineering

CS 2252 – MICROPROCESSORS AND MICROCONTROLLERS

(Common to Information Technology)

(Regulation 2008)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. Identify the addressing mode of the following 8085 instruction.
(a) SHLD 2500H
(b) DCR E
2. Name the machine cycles needed to execute the 8085 instruction MVIB,4FH.
3. What are the general purpose registers in 8086?
4. Give the importance of the assembler directive EVEN.
5. What are the features of closely coupled multiprocessor systems?
6. What do you mean by CCW in an I/O processor?
7. How many address lines and data lines are necessary for accessing 32Kx8 memory?
8. What is DMA?
9. What are the differences between a microprocessor and a microcontroller?
10. How is the selection of particular register bank done in 8051?

PART B —(5 × 16 = 80 marks)

11. (a) Explain the Intel 8085 Microprocessor architecture with neat diagram. (16)

Or

(b) (i) Discuss the different groups of instruction set of 8085 with suitable examples.(8)
(ii) Write an 8085 ALP to find the largest number in a array of 10 data. Starting address of the array of data is 4250H. (8)
12. (a) (i) Explain the various addressing modes of 8086 processor with suitable examples. (10)
(ii) Compare macro and procedure. (6)

Or

(b) (i) Write an 8086 ALP to find the sum of numbers in the array of 12 elements. (8)
(ii) What is BIOS? Discuss the various BIOS function calls. (8)
13. (a) (i) Draw the block diagram of 8087 numeric Data processor and explain. (10)
(ii) Discuss briefly the data types supported by 8087 Numeric Data Processor. (6)

Or

(b) (i) Explain the block diagram of 8089 I/O processor. (10)
(ii) Discuss the schemes used to solve the bus arbitration problem in multiprocessors (6)
14. (a) Explain the 8251 USART with neat block diagram. Also explain its mode word, command word and status word. (16)
Or
(b) Describe the block diagram of 8259 Programmable Interrupt Controller and its priority modes. (16)
15. (a) (i) Draw the pin diagram of 8051 microcontroller and explain the functions of each pin. (10)
(ii) Discuss briefly the various registers in 8051 microcontroller. (6)
Or
(b) (i) Explain the interfacing of 4×4 matrix keyboard to the 8051 microcontroller with neat diagram. (10)
(ii) Briefly write about the IE and IP register in 8051 microcontroller. (6)

SOFTWARE ENGINEERING AND QUALITY ASSURANCE IT2251 ANNA UNIVERSITY MODEL QUESTION PAPER | SEQA IT 2251 PREVIOUS YEAR QUESTION PAPER NOVEMBER/DECEMBER 2011

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

Fourth Semester

Information Technology

IT 2251 – SOFTWARE ENGINEERING AND QUALITY ASSURANCE

(Regulation 2008)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. What is meant by Independent Verification and Validation?
2. Differentiate Waterfall model with V-Model.
3. Name the components of CASE tools for structured methodology.
4. List the steps involved in requirements elicitation and analysis.
5. What is meant by heuristic evaluation?
6. List out the steps involved in real time software design.
7. What is meant by Boundary value analysis?
8. Define the term process maturity.
9. Name any four quality control tools.
10. State the benefits of QFD.

PART B — (5 × 16 = 80 marks)

11. (a) (i) Describe the process model which defines a network of activities. (8)
(ii) State as to why the first system is always a throw away system? Explain the concept with advantages and disadvantages. (8)

Or

(b) (i) Draw a system engineering hierarchy diagram and explain the concept. (8)
(ii) Explain the process model that combines the elements of waterfall and iterative fashion. (8)
12. (a) Give a brief description of software prototyping and briefly discuss the various prototyping techniques. (16)

Or

(b) With an example describe the three process steps for transforming a dataflow diagram to a structure chart. (16)
13. (a) (i) Draw a translating diagram for analysis model into a software design Specification. (8)
(ii) Give a complete template for documentation design specification. (8)

Or

(b) (i) Which is a measure of interconnection among modules in a program structure?Explain. (8)
(ii) What is the difference between Level-0 and Level-1 DFD? Draw a Level-0 and Level-1 DFD for safe Home Security System. (8)
14. (a) (i) What are all the formulas for cyclomatic complexity? Calculate cyclomatic Complexity for greatest of three numbers. (8)
(ii) How would you derive test cases for the given project? Explain in detail. (8)

Or

(b) (i) Narrate the path testing procedure in detail with a sample code.(8)
(ii) Explain the different integration testing approaches. (8)
15. (a) Explain how software process assessment helps software organizations to improve themselves. (16)
Or
(b) Write detailed notes on ISO9000 series of quality management standards. (16)

DESIGN AND ANALYSIS OF ALGORITHMS CS2251 ANNA UNIVERSITY PREVIOUS YEAR QUESTION PAPER | CS 2251 DAA NOVEMBER/DECEMBER 2011 QUESTION PAPER

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

Fourth Semester

Computer Science and Engineering

CS 2251 — DESIGN AND ANALYSIS OF ALGORITHMS

(Regulation 2008)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. What do you mean by linear search?
2. What is the properties of big-Oh notation.
3. What greedy algorithms?
4. What Knapsack problem?
5. What is traveling salesperson problem?
6. What do you mean by multistage graphs?
7. State the general backtracking method?
8. What is graph cloning?
9. What is spanning tree? Give an example.
10. What is NP Completeness?

PART B — (5 × 16 = 80 marks)

11. (a) (i) Define Asymptotic notations. Distinguish between Asymptotic notation and conditional asymptotic notation. (10)
(ii) Explain how the removing condition is done from the conditional Asymptotic notation with an example. (6)

Or

(b) (i) Explain how analysis of linear search is done with a suitable illustration. (10)
(ii) Define recurrence equation and explain how solving recurrence equations are done. (6)
12. (a) What is divide and conquer strategy and explain the binary search with suitable example problem.

Or

(b) Distinguish between Quick sort and Merge sort, and arrange the following numbers in increasing order using merge sort. (18, 29, 68, 32, 43,37, 87, 24, 47, 50)
13. (a) (i) Explain the multistage graph problem with an example. (8) 
          (ii) Find an optimal solution to the knapsack instance n = 7, m= 15 (p1, p2, p3, ….p7) = (10, 5, 15, 7, 6, 18, 3) and (w1, w2, w3, ... w7) (2, 3, 5, 7, 1, 4, 1) (8)

Or

(b) Describe binary search tree with three traversal patterns? Give suitable example with neat diagram for all three traversal of binary search tree.. (16)
14. (a) (i) How does backtracking work on the 8 Queens problem with suitable example? (8)
(ii) Explain elaborately recursive backtracking algorithm? (8)

Or

(b) What is Hamiltonian problem? Explain with an example using backtracking. (16)


15. (a) Write a complete LC branch-and-bound algorithm for the job sequencing with deadlines problem. Use the fixed tuple size formulation. (16)

Or

(b) Write a non-deterministic algorithm to find whether a given graph contains a Hamiltonian cycle. (16)

OBJECT ORIENTED ANALYSIS AND DESIGN CS2353 ANNA UNIVERSITY NOVEMBER/DECEMBER 2011 QUESTION PAPER | OOAD CS 2353 PREVIOUS YEAR MODEL QUESTION PAPER

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

Sixth Semester

Computer Science and Engineering

CS 2353 — OBJECT ORIENTED ANALYSIS AND DESIGN

(Common to Information Technology)

(Regulation 2008)

Time : Three hours                                                                     Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. List out any four reasons for the complexity of software.
2. What do you mean by use cases and actors?
3. Give the hint to identify the attributes of a class.
4. Define swim lane.
5. What do you mean by sequence diagram? Mention its use.
6. What do you mean by sequence number in UML? Where and for what it is
used?
7. Distinguish between coupling and cohesion.
8. Write a note on Patterns.
9. Define component with an example.
10. How will you reflect the version control information in UML diagram?

PART B — (5 × 16 = 80 marks)

11. (a) What do you mean by Unified Process in OOAD? Explain the phases with suitable diagrams. (16)

Or

(b) By considering the Library Management system, perform the Object Oriented System Development and give the use case model for the same (use include, extend and generalization). (16)
12. (a) Explain the relationships that are possible among the classes in the UML representation with your own example. (16)

Or

(b) Explain the following with an example :
(i) Conceptual class diagram
(ii) Activity Diagram. (8 + 8)
13. (a) With a suitable example explain how to design a class. Give all possible representation in a class (name, attribute, visibility, methods, responsibilities). (16)

Or

(b) What do you mean by interaction diagrams? Explain them with a suitable example. (16)
14. (a) What is GRASP? Explain the design patterns and the principles used in it. (16)
Or
(b) What is design pattern? Explain the GoF design patterns. (16)
15. (a) Explain the state chart diagram with a suitable example. Also define its components and use. (16)

Or

(b) Consider the Hospital Management System application with the following requirements
(i) System should handle the in-patient, out-patient information through receptionist.
(ii) Doctors are allowed to view the patient history and give their prescription.
(iii) There should be a information system to provide the required information.
Give the state chart, component and deployment diagrams.(6 + 6 + 4)

ENVIRONMENTAL SCIENCE AND ENGINEERING GE2021 NOVEMBER/DECEMBER 2011 MODEL QUESTION PAPER | GE2021 EVS NOV/DEC PREVIOUR YEAR ANNA UNIVERSITY QUESTION PAPER

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

Fifth Semester

Mechanical Engineering

GE 2021 — ENVIRONMENTAL SCIENCE AND ENGINEERING

[Common to Sixth Semester – Petroleum Engineering, Fifth Semester –

Aeronautical Engineering, Automobile Engineering, Electronics and

Communication Engineering and Production Engineering – Third Semester –

Computer Science and Engineering, Civil Engineering and Information

Technology and Fourth Semester – Biomedical Engineering]

(Regulation 2008)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. Differentiate between food chain and food web.
2. Define Genetic diversity and species diversity.
3. Classify the sources of Air pollution.
4. What is marine pollution?
5. Define Food security.
6. What are the factors that contribute to land degradation?
7. What is sustainable development?
8. State the effects of Acid rain?
9. Define the term doubling time in connection with population growth.
10. Differentiate between HIV and AIDS.

PART B — (5 × 16 = 80 marks)

11. (a) (i) Explain the role of producers, consumers and decomposers in an ecosystem. (8)
(ii) What are the major factors that are responsible for the loss of biodiversity? Explain. (8)
Or
(b) Explain the characteristic features of
(i) Forest eco system. (8)
(ii) Aquatic ecosystem. (8)
12. (a) (i) Explain the activated sludge process with a flow diagram. (8)
(ii) What is BOD? Explain how BOD is determined for a wastewater. (8)

Or

(b) (i) What is noise? How is noise pollution controlled? Suggest suitable steps. (8)
(ii) Discuss the role of an individual in pollution prevention. (8)
13. (a) (i) Explain the environmental effects of Deforestation. (8)
(ii) Discuss the benefits and problems of dams. (8)

Or

(b) (i) Enumerate the adverse effects of Modern Agriculture on soil and water sources. (8)
(ii) What is renewable energy? Write a brief note on any two renewable energy sources. (8)
14. (a) (i) Discuss the ways to minimize radiation exposure in case of a nuclear accident. (8)
(ii) Explain the salient features of the Environment (Protection) Act, 1986. (8)

Or

(b) (i) Discuss the chemistry of ozone depletion. (8)
(ii) What is rain water harvesting? How are the rain water harvesting methods classified? Briefly explain. (8)
15. (a) (i) Draw a typical population pyramid of developing country and discuss. (8)
(ii) Explain the Environmental problems posed by population explosion. (8)

Or

(b) (i) Explain the steps that are being taken in India to impart value education. (8)
(ii) Discuss the role of Information Technology in the protection of Environment and Human Health. (8)

ANALOG AND DIGITAL COMMUNICATION CS2204 NOVEMBER/DECEMBER 2011.QUESTION PAPER | CS2204 ADC NOV/DEC 2011 ANNA UNIVERSITY PREVIOUS YEAR QUESTION PAPER

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

Third Semester

Computer Science and Engineering

CS 2204 — ANALOG AND DIGITAL COMMUNICATION

(Regulation 2008)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. Define Amplitude modulation.
2. What is modulation index and percentage modulation in AM?
3. What is Shannon limit for information capacity?
4. What is binary phase shift keying?
5. What is the need for sampling?
6. Define inter symbol interference (ISI).
7. List any two data communication standard organization.
8. What is a data modem?
9. List the spread spectrum techniques.
10. What is CDMA?

PART B — (5 × 16 = 80 marks)

11. (a) (i) Explain the principles of amplitude modulation. (8)
(ii) Write a note on frequency spectrum analysis of angle modulated waves. (8)

Or

(b) (i) Explain the band width requirements of anogle modulated waves. (8)
(ii) Compare FM and PM. (8)
12. (a) (i) Discuss the principle of operation of FSK transmitter. (8)
(ii) Write a note on QPSK. (8)

Or

(b) (i) Discuss the principle of operation of FSK receiver. (8)
(ii) Write a note on DPSK. (8)
13. (a) (i) Describe the basic principles of PCM system. (8)
(ii) What is companding? Explain in detail. (8)

Or

(b) (i) Describe in detail the adaptive delta modulation system. (8)
(ii) What is signal to quantitation noise? Explain. (8)
14. (a) (i) Write a note on data communication codes. (8)
(ii) Explain serial and parallel interfaces in detail. (8)

Or

(b) (i) Explain in detail about error detection and correction. (8)
(ii) Write a note on medium and high speed modem. (8)
15. (a) (i) Explain the principle of DS spread spectrum technique. (8)
(ii) Explain the salient features of wireless communication. (8)

Or

(b) (i) Describe the frequency hopping spread spectrum technique in detail. (8)
(ii) Explain the basic principle of TDMA. (8)

OPERATING SYSTEMS CS2254 ANNA UNIVERSITY NOVEMBER/DECEMBER 2011. QUESTION PAPER | CS2254 OS NOV/DEC 2011 MODEL QUESTION PAPER

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

Fourth Semester

Computer Science and Engineering

CS 2254 – OPERATING SYSTEMS

(Common to Information Technology)

(Regulation 2008)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. What does the CPU do when there are no user programs to run?
2. What is the principal advantage of the multiprogramming?
3. Define Mutual Exclusion.
4. What is Semaphore?
5. What is page frame?
6. What is internal fragmentation?
7. A direct or sequential access has a fixed file-size S-byte record. At what
logical location, the first byte of record N will start?
8. Give an example of a situation where variable-size records would be
useful.
9. Writable CD-ROM media are available in both 650 MB and 700 MB
versions. What is the principle disadvantage, other than cost, of the 700
MB version?
10. Which disk scheduling algorithm would be best to optimize the performance of a RAM disk?

PART B — (5 × 16 = 80 marks)

11. (a) (i) Explain the important services of an operating system. (8)
(ii) Discuss in detail the concept of virtual machines, with neat sketch. (8)

Or

(b) Write detailed notes on process control and file manipulation. (16)
12. (a) Explain in detail about any two CPU scheduling algorithms with suitable examples. (16)

Or

(b) (i) What is a deadlock? What are the necessary conditions for a
deadlock to occur? (6)
(ii) How can a system recover from deadlock? (10)
13. (a) Explain about contiguous memory allocation with neat diagram. (16)

Or

(b) What do you mean by paging? Discuss in detail about structure of
page tables with appropriate examples. (16)
14. (a) Write a detailed note on various file access methods with neat sketch.(16)

Or

(b) Discuss the different file allocation methods with suitable example. (16)
15. (a) Describe the important concepts of application I/O interface. (16)

Or

(b) Explain any two disk scheduling algorithms with suitable example. (16)