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)

DATABASE MANAGEMENT SYSTEMS CS2255 MODEL QUESTION PAPER | CS 2255 DBMS QUESTION PAPER NOVEMBER/DECEMBER 2011

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

Fourth Semester

Computer Science and Engineering

CS 2255 — DATABASE MANAGEMENT SYSTEMS

(Common to Information Technology)

(Regulation 2008)

Time : Three hours                                                             Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. What is a data model?
2. With an example explain what a derived attribute is?
3. Consider the following relation :
EMP (ENO, NAME, DATE_OF_BIRTH, SEX, DATE_OF_JOINING, BASIC_PAY, DEPT) Develop an SQL query that will find and display the average BASIC_PAY in each DEPT.
4. List the two types of embedded SQL SELECT statements.
5. Consider the following relation :
R (A, B, C, D, E)
The primary key of the relation is AB. The following functional
dependencies hold :
A →C
B →D
AB → E 
Is the above relation in second normal form?
6. Consider the following relation : R(A, B, C, D)
The primary key of the relation is A. The following functional dependencies
hold :
A →B,C 
B →D 
Is the above relation in third normal form?
7. List the two commonly used Concurrency Control techniques.
8. List the SQL statements used for transaction control.
9. What are ordered indices?
10. Distinguish between sparse index and dense index.

PART B — (5 × 16 = 80 marks)

11. (a) (i) Construct an E-R diagram for a car-insurance company whose customers own one or more cars each. Each car has associated with it zero to any number of recorded accidents. State any assumptions you make. (6)
(ii) A university registrar’s office maintains data about the following entities :
(1) Courses, including number, title, credits, syllabus, and prerequisites;
(2) Course offerings, including course number, year,
semester, section number, instructor, timings, and classroom;
(3) Students, including student-id, name, and program; and
(4) Instructors, including identification number, name,
department, and title. Further, the enrollment of students in courses and grades awarded to students in each course they are enrolled for must be appropriately modeled. Construct an E-R diagram for the registrar’s office. Document all assumptions that you make about the mapping constraints. (10)

Or

(b) (i) With a neat sketch discuss the three-schema architecture of a DBMS. (8)
(ii) What is aggregation in an ER model? Develop an ER diagram using aggregation that captures the following information : 
Employees work for projects. An employee working for a particular project uses various machinery. Assume necessary attributes. State any assumptions you make. Also discuss about the ER diagram you have designed. (2 + 6)
12. (a) (i) Explain the distinctions among the terms primary key, candidate key, and super key. Give relevant examples. (6)
(ii) What is referential integrity? Give relevant example. (4)
(iii) Consider the following six relations for an Order-processing Database Application in a Company :
CUSTOMER (CUSTNO, CNAME, CITY)
ORDER (ORDERNO, ODATE, CUSTNO, ORD_AMT)
ORDER_ITEM (ORDERNO, ITEMNO, QTY)
ITEM (ITEMNO, ITEM_NAME, UNIT_PRICE)
SHIPMENT (ORDERNO, ITEMNO, WAREHOUSENO,
SHIP_DATE)
WAREHOUSE (WAREHOUSENO, CITY)
Here, ORD_AMT refers to total amount of an order; ODATE is the date the order was placed; SHIP_DATE is the date an order is shipped from the warehouse. Assume that an order can be shipped from several warehouses. Specify the foreign keys for
this schema, stating any assumptions you make. (6)

Or

(b) With relevant examples discuss the various operations in Relational Algebra. (16)
13. (a) Define a functional dependency. List and discuss the six inference rules for functional dependencies. Give relevant examples. (16)
Or
(b) (i) Give a set of Functional dependencies for the relation schema R(A,B,C,D,E) with primary key AB under which R is in 2NF but not in 3NF. (5)
(ii) Prove that any relation schema with two attributes is in BCNF.(5)
(iii) Consider a relation R that has three attributes ABC. It is decomposed into relations R1 with attributes AB and R2 with attributes BC. State the definition of lossless-join decomposition with respect to this example. Answer this question concisely by
writing a relational algebra equation involving R, R1, and R2. (6)
14. (a) (i) Define a transaction. Then discuss the following with relevant examples : (8)
(1) A read only transaction
(2) A read write transaction
(3) An aborted transaction
(ii) With a neat sketch discuss the states a transaction can be in. (4)
(iii) Explain the distinction between the terms serial schedule and serializable schedule. Give relevant example. (4)

Or

(b) (i) Discuss the ACID properties of a transaction. Give relevant example. (8)
(ii) Discuss two phase locking protocol. Give relevant example. (8)
15. (a) (i) When is it preferable to use a dense index rather than a sparse index? Explain your answer. (4)
(ii) Since indices speed query processing, why might they not be kept on several search keys? List as many reasons as possible.(6)
(iii) Explain the distinction between closed and open hashing. Discuss the relative merits of each technique in database applications. (6)

Or

(b) Diagrammatically illustrate and discuss the steps involved in processing a query.(16)

EMBEDDED SYSTEMS IT2354 NOVEMBER/DECEMBER 2011 QUESTION PAPER | IT2354 EMBEDDED SYSTEMS PREVIOUS YEAR QUESTION PAPER

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

Sixth Semester

Information Technology

IT 2354 — EMBEDDED SYSTEMS

(Common to Computer Science and Engineering)

(Regulation 2008)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. Find the timer’s clock frequency and its period for 8051. Assuming that XTAL = 11.0592 MHz.
2. What are the challenges in embedded computing system design?
3. What are the stages in an ARM pipeline?
4. When would you prefer to use busy-wait I/O over interrupt-driven I/O?
5. Define thread.
6. What is scheduling policy? Mention the scheduling states of a process.
7. What is the function of locator?
8. Write short notes on in-circuit-emulator.
9. List the levels of CMM.
10. What are the requirements for embedded system design?

PART B — (5 × 16 = 80 marks)

11. (a) Explain the major levels of embedded system design process with an example. (16)

Or

(b) Explain the instruction sets and condition codes of ARM processor with an example for each. (16)
12. (a) Explain the following memory systems :
(i) Two-level cache (5)
(ii) Direct-mapped cache (5)
(iii) Set-associative cache. (6)

Or

(b) Draw a UML sequence diagram for copying characters from an input to an output device using interrupt-driven I/O. The diagram should include the two devices and the two I/O handlers. (16)
13. (a) For the periodic processes given below, find a valid schedule
(i) Using standard RMS, and
(ii) Adding one unit of overhead for each context switch. (16) 
Process CPU time Dead line
P1   2  30
P2   4  40
P3   7 120
P4   5 60
P5   1 15

Or

(b) Explain the following :
(i) Blocking interprocess communication (5)
(ii) Nonblocking interprocess communication (5)
(iii) Shared memory communication. (6)
14. (a) Explain the multi-state systems and function sequences. (16)

Or

(b) Explain the following :
(i) ROM Emulators (8)
(ii) Remote Debuggers. (8)
15. (a) (i) Explain the case study of Audio players. (8)
(ii) Explain the design example of software modem. (8)

Or

(b) Explain the advanced techniques for specification with an example. (16)

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)

DATA STRUCTURES AND ALGORITHMS EE2204 NOV/DEC 2011 ANNA UNIVERSITY QUESTION PAPER | EE2204 DSA ANNA UNIVERSITY QUESTION PAPER

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

Third Semester

Electrical and Electronics Engineering

EE 2204 — DATA STRUCTURES AND ALGORITHMS

(Common to Electronics & Instrumentation Engineering and Instrumentation &

Control Engineering)

(Regulation 2008)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. What is Abstract data type?
2. List any two applications of queue.
3. Define non linear data structure.
4. Define complete binary tree.
5. Define AVL trees.
6. Define load factor of a hash table.
7. What is a forest?
8. Define Biconnectivity.
9. List any two applications that use greedy algorithm.
10. Define Skip Lists.

PART B — (5 × 16 = 80 marks)

11. (a) (i) Explain in detail the linked stack and linked queue. 
(ii) Given two sorted lists, L1 and L2, write procedure to compute L1 U L2 and L1 using only the basic list operations.

Or

(b) What is a doubly linked list? Write an algorithm for inserting and deleting an element from Doubly linked list.
12. (a) How do you represent binary tree in a list? Write an algorithm for finding Kth element and deleting an element.
Or
(b) Construct an expression tree for the following expression (a + b*c)+(d*e + f)*g.
13. (a) Write the functions to insert and delete elements from the AVL tree.

Or

(b) What is meant by open addressing? Explain the collusion resolution strategies in detail.
14. (a) Compare Prim’s algorithm with Kruskal’s algorithm.

Or

(b) List any two applications of DFS. Explain in detail.
15. (a) State the running time equation theorem of divide and conquer algorithms and prove it.
Or
(b) Prove that the travelling salesman problem is NP complete.