MCA DEGREE EXAMINATION, May / June 2009 First Semester MC1601 COMPUTER ORGANIZATION (Regulation 2005) Time : 3 hours

s PART A (10 x 2 = 20 MARKS ) 1. What is the need for Boolean algebra? 2. Reduce the expression into minimum SOP pqr + pqr + pqr + pqr 3. Give examples where the following shift register is applied? (a) Serial in Serial out (b) Serial in parallel -out 4. Draw the block diagram for serial data transfer from register A to register B 5. Write the phases in instruction cycle 6. List down the task that the service routing has to perform when some interrupt occurs 7. Write the disadvantages of strobe method in data transfer 8. Define priority interrupt 9. What is meant by content addressable memory 10. Write a 3 address instruction to evaluate X = (A+B) * (C+D). PART B (5 x 16 = 80 MARKS ) 11. (a) (i) Design a 2 bit binary counter using JK flip-flop. (ii) Using K map fine the minimum solution F(A,B,C,D) = ? M (1,7,10,11,13) + ?d (5,8,15) OR (b) Find the minimum SOP using Qunine-Mc Cluskey method F(W,X,Y,Z) = ? M (2,5,7,8,10,13,15) 12. (a) Construct a 32 way active high decoder using 4 way decoders OR (b) Design a decade counter using JK flip-flop Maximam Marks:100

13. (a) (i) Write short notes on usage (ii) Write a subroutine to move a block of data OR (b) Describe the design of a basic computer

of

subroutines

14. (a) Explain the data transfer in DMA OR (b) Describe the various types of asynchronous data transfer and the actions involved in it. 15. (a) Explain the various addressing modes with example OR (b) Discuss about virtual memory

MC1604 DATA STRUCTURES (Regulation 2005) Time : 3 hours Maximam Marks:100 PART A (10 x 2 = 20 MARKS ) 1. Write the applications of stack? 2. Differentiate the linear list and linked list 3. Define sibling, height of a tree. 4. What is tree traversal? Write the routine for inorder traversal 5. Write the time complexity for merge and radix sort 6. Why do we go for double hashing? 7. what is transitive closure? Write its worst

case complexity 8. Define single source and all-pairs shortest path problem? 9. What is garbage collection? How is it performed 10. Write the need for compaction PART B (5 x 16 = 80 MARKS ) 11. a) The problem: It has n people, numbered from 1 to n, are sitting in a circle. Starting at person 1, a hot potato is passed. After m passes the person holding the potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. Thus, if m=1 and n=5, player 3 wins and the order of elimination is 2,4,1,5. Use suitable data structure to solve this problem OR b) Discuss and Write the routines to implement two Stacks using only one array. Your stack routine should not declare an overflow unless every slot in the array is used 12. a) Explain Huffman coding algorithm with example and write the routines to generate Huffman trees OR b) Construct a Binary Search Tree using 10 distinct keys. Write the procedure to sort the keys in increasing order using proper tree traversal ii) Write short notes on threaded binary tree 13. a) Write the routines to sort n elements using merge and insertion sort.

ii) Ascent the data 2, 7, 4, 5, 9, 3, 1, 6, using the above algorithms OR (b) Briefly explain the various hashing techniques ii) Given input (371. 323, 173, 199, 344, 679, 989) and hash function h(x) = x mod 10, show the resulting. ii) Given input (371. 323, 173, 199, 344, 679, 989) and hash function h(x) = x mod 10, show the resulting. b) Closed hashing using linear probing, quadratic probing and double hashing h2(x) = 7 (x mod 7) 14. a) Write the routines for Prims and Kruskals algorithm to find the minimum spanning tree of the graph G ii) Find the minimum spanning tree for the following graph using Prims and Kruskals algorithm OR b) Discuss in detail about flow problem with proper example and write the routine for Ford-Fulkerson algorithm 15. a) Discuss in detail about Automatic list Management OR b) Write the routines to check whether the given string is Palindrome or not. Use the basic operations of doubly linked list to perform the same.

Time : 3 hours PART A (10 x 2 = 20 MARKS )

Maximam Marks:100

1. Define algorithm? 2. What is O-notation? 3. Give two glasses market A and B. Glass A is full of raspberry drinks and glass B is full of lemonade. Suggest a way of exchanging the contents of glasses A and B 4. What are the various algorithms available for finding the factoring methods? 5. In what ways does a switch statement differ from an if statement? 6. What are trigraph? How are they useful? 7. How does a structure differ from an array? 8. Write the limitations of using getchar and scanf function for reading strings 9. Distinguish between Malloc ( ) and Calloc ( ) 10. What are the advantages of using macro definition in a program? PART B (5 x 16 = 80 MARKS ) 11.a) Explain the concept of Program verification ii) Write short notes on documentation of Programs. Debugging Program and Program testing. OR b) Explain top down design approach ii) How do you estimate the efficiency of given two algorithms 12. a) Design an algorithm that accepts as input a decimal number and convert it to the binary coded decimal (BCI) representation. In the BCD scheme each digit is represented by a 4-bit binary code ii) Design an algorithm that will find the GCD of n positive non-zero integers OR b) Design and implement an algorithm that finds the smallest positive integer that has n or more divisors ii) Design an algorithm that finds the integer whose square is closed to

but greater than the integer number input as data 13. a) Write a program to find the number of and sum of all integers greater than 100 and less than 200 that divisible by 7 ii) Explain the various input and output operation with an example OR b) Compare in terms of their function, the following pairs of statements. While and do ______ while and for, break and goto and break and continue. ii) write a program that will read a positive integer and determine and print its binary equivalent 14. Write a program which will red a string and rewrite it in the alphabetical order. For example the word STRING should be written as GINRST. ii) Explain the various string handling functions. OR b) Write a program to illustrate the comparison of structure variable. ii) Explain the concepts of recursion with a simple recursion program 15. a) Explain the concept of addition and deletion in a doubly linked list with an example ii) Write a nested macro that gives the minimum of 3 values OR b) Tow files DATA 1 and DATA 2 contain sorted list of integers. Write a program to produce a third file DATA which hold a single sorted, merged list of these two lists. ii) Explain the difference between call by references and be values

Time : 3 hours

Maximam Marks:100

PART A (10 x 2 = 20 MARKS )

1. Write any four major disadvantage of keeping organization information in a file processing system. 2. Define a weak and strong entity set. 3. What is a condition Box in the context of Query By example (QBE). 4. Write the advantage and Disadvantage of 3 NF. 5. Difference between mirroring and striping. 6. What are Bitmap indices? 7. How can you measure the cost of a query? 8. List some of the useful statistical information about database relations as maintained by DBMS catalog. 9. Write any four properties of a transaction. 10. What is fuzzy check point? PART B (5 x 16 = 80 MARKS ) 11. (a) Explain two methods for dealing with the deadlock problem ? (ii) Write short note on shadow paging and buffer management OR (b) Explain the distinction between the terms serial schedules and serializable schedules. (ii) During its execution, a transaction passes through several stages, until it finally commits or aborts. List all possible sequences of stages through which a transaction may pass. 12. (a) Explain various data models with suitable examples for each OR (b) Construct an E-R diagram with all major components for a banking enterprises with entity set customer, branch, loan, payment, account, employee with other own assumption. (i) Write short note on history of database system

13. (a)Explain the fourth Normal Form (ii) Write short note on Embedded SQL OR (b)Explain about Functional Dependencies ii) Write short note on embedded SQL 14. (a) Explain the physical characteristics (ii) What is RAID? Explain all the RAID levels? OR (b) Explain B+ Tree index files of

(4NF)

(FDs)

Disk.

15. (a) What do you mean by external sorting? Explain the merge sort technique and discuss its performance. OR (b) How can you perform heuristic optimization? Explain the various heuristics in query optimization with examples

Madras University M.C.A Data Structures Question paper Time: Three Maximum: 75 marks PART A - [5 x 5 = Marks 25] Answer ALL questions. All questions carry equal marks. 1. (a) Explain the time and space complexity of algorithm. Or (b) What is primitive datatypes? Explain. 2. (a) Write delection algorithm for a circular queue. Or (b) Explain the representation of multiple queues. 3. (a) Write an algorithm to concatenate two singly Or (b) What is linked stacks? Explain.

hours

4. (a) Explain the threaded binary tree. Or (b) What is spanning trees? Explain. 5. (a) Explain the indexing structures. Or (b) What is ISAM? Explain. PART B - [5 x 10 = Marks 50] Answer any FIVE questions. All questions carry equal marks. 6. Write the binary search algorithm. Calculate the time complexity of the above algorithm. 7. Explain the representations of arrays. 8. Write insertion and deletion algorithm for multi-queues. 9. Write insertion and deletion algorithm for the doubly linked lists. 10. Explain the allocation and deallocation algorithms for the dynamic memory management. 11. Write the non recursive binary tree in order traversal algorithm. Explain. 12. Write algorithm for the breadth first search. 13. Explain the following : (a) Hashing techniques for direct files (b) Multilists.