B.E./B.Tech.

DEGREE EXAMINATION, APRIL/MAY 2010 Fourth Semester Computer Science and Engineering CS2252 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. Assume that the accumulator contains data bytes 82H and the instruction MOV C, A (4FH) is fetched. List the steps in decoding and executing the instruction. 2. What are the second bytes in the instruction IN and OUT of 8085 microprocessor? 3. Draw the 8086 flag register format. 4. List different types of 8086 hardware interrupts. 5. Compare closely coupled configuration with loosely coupled configuration. 6. Mention the need for co-processor in a microprocessor based system. 7. Can an input port and an output port have the same port address? Justify. 8. Why is each channel in DMA controller restricted to 16K bytes of data transfer? 9. With XTAL = 11.0592 MHz, what value should be loaded into TH1 to have 9600 baud rate? 10. How do you select the register bank in 805l microcontroller? PART B (5 16 = 80 Marks)

11. (a) (i) Write an 8085 assembly language program with flowchart for the following: Six bytes are stored in memory locations starting at XX50H. Add all the data bytes. Use register B to save any carry generated while adding the data bytes. Store the sum at two consecutive memory locations, XX70H and XX7IH. Data (H): A2, FA, DF, E5, 98, 8B. (Marks 8) (ii) Write a program to generate a continuous square wave with the period of 500 s . Assume the system clock period is 325ns and use bit D0 to output the square wave. (Marks 8) Or (b) (i) Explain the following 8085 instructions with an example JP, JPO, CM, RPE. DAA, XCHG. SPHL and PCHL. (Marks 8) (ii) Draw the timing diagram for the instruction MVI A, 32h and OUT 01h. (Marks 8) 12. (a) (i) Draw the internal block diagram of 8086 microprocessor and explain. (Marks 8) (ii) Explain any eight assembler directives of 8086 microprocessor. (Marks 8) Or

(b) (i) Give three examples for the following 8086 microprocessor instructions: String Instructions, Process Control Instructions, Program Execution Transfer Instructions and Bit Manipulation Instructions. (Marks 12) (ii) How does one define and Call Macro parameters of 8086 microprocessor? (Marks 4) 13. (a) (i) Draw the internal block diagram of 8087 Co-processor and explain it with 8087 control word and status word formats. (Marks 12) (ii) Give two examples for packed decimal data transfers and integer data transfers of an 8087 Co-processor. (Marks 4) Or (b) Draw the architecture of 8089 I/O Co-processor and explain. (Marks 16) 14. (a) Draw the block diagram of 8279 Keyboard/Display controller and explain how to interface the Hex Key Pad and 7-segment LEDs using 8279. (Marks 16) Or (b) (i) Draw the functional block diagram of 8254 timer and explain the different modes of operation. (Marks 8) (ii) Draw the block diagram of 8259A and explain how to program 8259A. (Marks 8) 15. (a) (i) Explain the memory structure of an 8051 Microcontroller. (Marks 8) (ii) How does one interface a 16 2 LCD Display using 8051 Microcontroller? (Marks 8) Or (b) (i) Explain the on-chip timer modes of an 8051 Microcontroller. (Marks 8) (ii) Explain how to interface an 8-bit ADC with 8051 Microcontroller. (Marks 8)

B.E./B.Tech. DEGREE EXAMINATIONS, MAY/JUNE 2010. FOURTH SEMESTER COMPUTER SCIENCE AND ENGINEERING CS 46 DATA BASE MANAGEMENT SYSTEMS (Common to Information Technology) (REGULATIONS 2008) Time :Three hours Maximum : 100 marks Answer ALL questions. PART A (10 x 2 = 20 marks) 1. Differentiate File systems and Database management system. 2. What is logical data independence? 3. Write the Tuple relational calculus expression to find the number of employees working in Sales department in the given relation Employee. Employee (SSN-No, Name, Department) 4. Define triggers. 5. When is a functional dependency said to be trivial? 6. What are the pitfalls of Database design? 7. What are ACID properties? 8. What are the facilities available in SQL for Database recovery? 9. What is stripping and mirroring? 10. Differentiate static and dynamic hashing. PART B (5 x 16 = 80 marks) 11. (a) (i) Explain the Database Management System architecture with a neat diagram. (10) (ii) What are the need for the development of relational databases? (6) Or (b) Draw the ER-diagram to design a system for a Publishing Company that produces scientific books on various subjects. The books are written by authors who specialize in one particular subject. The company employs editors who not necessarily being specialists in a particular area, each take sole responsibility for editing one or more publications. A publication covers essentially one of the specialist subjects and is normally written by a single author. When writing a particular book, each author works with editor, but may submit another work for publication to be supervised by other editors. To improve their competitiveness, the company tries to employ a variety of authors, more than one author being a specialist in a particular subject. 12. (a) (i) Explain briefly about various relational algebra expressions with examples. (8) (ii) Discuss about the evolution of distributed database. Compare with client/server mode. (8) Or (b) Consider the relational table given below and answer the following SQL queries. Employee(SSN-No, Name, Department, Salary) (i) List all the employees whose name starts with the letter 'L'. (ii) Find the maximum salary given to employees in each department. (iii) Find the number of employees working in 'accounts' department. (iv) Find the second maximum salary from the table. (v) Find the employee who is getting the minimum salary. 13. (a) What is normalization?fExplain first, second and third normal forms with an example describing the advantages of normalization. Or (b) Explain briefly about Armstrong rules on functional dependency and write the algorithm to compute functional dependency closure.

14. (a) Explain briefly about the working of two phase locking protocol using a sample transaction. Or (b) (i) When is a transaction said to be deadlocked? Explain the deadlock prevention methods with an example. (8) (ii) Explain concurrency control mechanisms. Discuss the need with example. (8) 15. (a) (i) Draw and explain the structure of B+ tree index files. (10) (ii) Write notes on RAID. (6) Or (b) (i) Explain briefly about query processing with examples to perform sort and join operation. (10) (ii) Discuss the approaches of database tuning. (6)

PART-A 1) What is tri state gate? 2) Why is the data bus in most microprocessors bidirectional while the address bus is unidirectional? 3) Perform 1010100-1000100 using 1 s and 2 s complement? 4) Define underflow and overflow? 5) What is pipelining and what are the advantages of pipelining? 6) What is the difference between hardwired control and micro programmed control? 7) List the difference between static RAM and dynamic RAM? 8) Define the terms: spatial locality and temporal locality? 9) What factors influences the bus design decisions? 10)What is priority interrupt?

PART-B 11)a) i) With a neat diagram explain Von-Neumann computer architecture. ii) What are the major instruction design issues? (or)

b) i) Explain various instruction formats in details. ii) What is a stack and what are operations on stack? Give any three applications of stack. 12)a) i) Design a 4-bit binary adder/ subtractor and explain its operation. ii) Give the algorithm for multiplication of signed 2 s complement numbers and . illustrate with an example. (or) b) i) Design an array multiplier that multiplies two 4-bit numbers and explain its operation. ii) Write the algorithm for division of floating point numbers and illustrate with an example. 13)a) i) What is branch hazard? Describe the methods for dealing with the branch hazard. ii) With a suitable diagram describe the sequence of micro operations involved in fetching and executing a typical instruction. (or) b) What is data hazard? Explain the methods for dealing with the data hazards. 14) a) i) Describe the functional characteristics that are common to the devices used to build main and secondary computer memories. ii) Explain various mechanisms of mapping main memory address into cache memory addresses. (or) b) i) Explain how the virtual address is converted into real address in a paged virtual memory system. ii) Describe the working principle of a typical magnetic disk. 15) a) Draw the typical lock diagram of a DMA controller and explain how it is used for direct data transfer between memory and peripherals. (or) b) i) Describe the working principles of USB. ii) Briefly compare the characteristics of SCSI with PCI.

PART-A

1. List five reponsibilities of the DB manager. 2. Give the limitations of ER model? How do you overcome this? 3. Define query language.Give the calssification of query language. 4. Why it is necessary to decompose a relation? 5. Give any two advantages of spare index over dense dense index. 6. Name the different types of joins supported in SQL. 7. What are the types of transperencies that a distributed database must support? why? 8. What benefit is provided by strict-two phase locking? What are the disanvantages result? 9. Briefly write the overall process of dataware housing. 10. What is an active database? PART - B 11 (a) (i) What are the types of knowledge discovered during data mining? Explain with suitable examples. (ii) HIghlight the features of object oriented database. OR (b) (i) What is nested relationls? Give example. (ii) Explain the structure of XML with suitable example.

12 (a) (i) Compare file system with database system. (ii) Explain the architecture of DBMS. OR (b) (i) What are the steps involved in designing a database application? Explain with an example (ii) List the possible types of relations that may exist between two entities. How would you realise that into tables for a binary relation? 13. (a) (i) What are the relational algebra operations supported in SQL? Write the SQL statement for each operation. (ii) Justify the need of normalization with examples OR (b) (i) What is normalization? Explain 1NF,2NF,3NF and BCNF with suitable example. (ii) What is FD? Explain the role of Fd in the process of normalization. 14.(a) (i) Explain the security features provided in commercial query languages. (ii) What are the steps involved in query processing? How would you estimate the cost of the query? OR (b) (i) Explain the different properities of indexes in detail. (ii) Explain various hashing techniques.

15.(a) (i) Explain the four important properities of transaction that a DBMS must ensure to maintain database . (ii) What is RAID? List the different levels in RAID technology and explain its features. OR (b) (i) What is concurrenct control? How is it implemented in DBMS? Explain. (ii) Explain various recovery techniques during ttansaction in detail.

PART-A 1) Specify the critical factor to be strictly followed in real time system. 2) List out the three main advantages of multiprocessor system. 3) What is co-operating process? 4) What is bounded waiting in critical section? 5) What are the four necessary conditions a system should possess in order to be termed as deadlock? 6) What is segmentation? 7) Why should we use virtual memory? 8) What is meant by thrashing? 9) Name the entries that make up a File Control Block (FCB)? 10) State any two distinguishing features of UUNIX and Windows. PART-B 11) a) i) Explain the facilities provided by the following operating systems (1) Clustered system and (2) Real time system. ii) List out the services provided by the operating system to programs and to the users of program. (or) b) i) Explain the process creation and process termination on process. ii) Write short notes on co-operating processes and schedulers. 12) a) Describe the following scheduling algorithms (i) Shortest job first scheduling (ii) Round robin scheduling (iii) Real time scheduling (iv) Priority scheduling. (or) b) What is the important feature of critical section? State the dining philosophers problem and show how to allocate the several resources among several

processes in a deadlock and starvation free manner. 13) a) i) How can deadlock be detected? Explain. ii) Write short notes on swapping. (or) b) Discuss the advantages of paging memory management and the conversion of logical address into physical address with necessary hardware. 14) a) Discuss the following page replacement algorithms, giving a suitable page reference string (i) LRU (ii) FIFO (iii) Optimal. (or) b) i) State the various attributes of a file and their purpose.Discuss the various file. operation ii) Discuss about demand paging. 15) a) Describe in detail any three methods of implementing the file system. (or) b) write short notes on: (i) Disk structure (ii) Indexed allocation (iii) Shortest Seek Time First (SSTF) scheduling.

PART A-(10 X 2=20 marks) 1.When will you say an algorithm efficient? Give the notations for time complexity. 2.What is a top-down design? Is C language a top down design? Justify your answer. 3.Why is linked list used for polynomial arithmetic? 4.Write the role of stack in function call. 5.What is the minimum number of nodes in an AVL tree of height 5? 6.What is the use of sentinel value in binary heap? 7.Which is the best way of choosing the pivot element in quick sort?

8.Merge sort is better than insertion sort. Why? 9.Define a graph. How it differs from tree? 10.What is minimum spanning tree? Name any two algorithms used to find MST. PART B-(5 X 16=80 marks) 11.(a).(i).Given two lists L1 and L2, write the routines to compute L1 n L2 using basic operations. (ii).Write the routines for inserting and deleting elements from a queue. Check for the conditions Q-empty and Q-full. (Or) 11.(b).(i).How would you implement a stack of queues? Write routines for creation and inserting of elements into it. (ii).Write routines to insert heterogeneous data into the list. 12.(a).(i).Write the routines to insert and remove a node from Binary Search Tree. (ii).A full node is a node with two children. Prove that the number of full nodes plus one is equal to the number of leaves in a binary tree. (Or) 12.(b).(i).Show the resulting of inserting 2,1,4,5,9,3,6,7 into an empty AVL tree. (ii).Write the procedure to implement single and double rotations while inserting nodes in an AVL tree. 13.(a).Explain with suitable examples the basic heap operations and algorithms for the same. (Or) 13.(b).How will you resolve the collisions, while inserting elements into the hash table using separate chaining and linear probing? Write the routines for inserting, searching and removing elements from the hash table using the above mentioned techniques. 14.(a).(i).Write the routine for sorting n elements in increasing order using heap sort.

(ii).Sort 3,1,4,1,5,9,2,6 in decreasing order using heap sort. (Or) 14.(b).(i).Explain with example about the insertion sort. (ii).What is external sorting? Discuss the algorithms with proper examples. 15.(a).(i).Discuss and write the program to perform topological sorting. (ii).What is single source shortest path problem? Discuss Dijikstras single source shortest path algorithm with an example. (Or) 15.(b).(i).Write an algorithm to find the minimum cost spanning tree of an undirected, weighted graph. (ii).Find the MST for the following graph.