(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC. - 2013 First Year Paper - I : INFORMATION TECHNOLOGY Time : 03 Hours Maximum Marks : 75 Section- A Answer any Three of the following (3 15=45) 1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram? 3) Explain about software and Hardware indetail? 4) Define operating system. Write the functions and features of OS? 5) Write about the following a) CRT b) ISDN c) compiler Section- B Answer any five of the following (5 5=25) 6) Differentiate between RAM & ROM. 7) Write about the following a) Primary memory b) Secondary memory 8) Functions of Internet explorer? 9) Write about TCP/IP? 10) Explain the role of modern in data communication? 11) Distinguish between Intranet and Extranet? 12) Write about number system? 13) Write about generations of computers?
Section- c Answer all of the following (5 1=5) 14) What is e-commerce? 15) Give any two Internet protocols? 16) What is network topology. 17) Define Artificial Intelligence. 18) What is IIS?
(DMCA 102) M.C.A. DEGREE EXAMINATION, DEC. - 2013 First Year Paper - II : PROGRAMMING WITH C ++ Time : 03 Hours Maximum Marks : 75 Section - A (3 15=45) Answer any Three Questions 1) Discuss about variable scope and storage classes 2) Explain various iterative statements with suitable example 3) Define a string. Explain about different string manipulations 4) Explain multiple and multi-level inheritance. Implement these inheritances through programming. 5) What is exception? Discuss about exception handling and its benefits. Section - B (5 5=25) Answer any five questions 6) Describe the structure of a C++ program 7) Explain about different types of access specifiers 8) Distinguish between printer and reference variable in C++ 9) Explain late binding and early binding 10) Write a C++ program using overloaded constructor. 11) Describe various file mode operations available in C++ 12) Write a note on pure virtual function 13) Write a template function min( ) for finding minimum in a list
Section - C (5 1=5) Answer all Questions 14) What is an identifier 15) Write syntax of else-if ladder 16) What do you mean by function call? 17) What is data hiding? 18) What is typecasting
(DMCA 103) M.C.A. DEGREE EXAMINATION, DEC. - 2013 First Year Paper -III: COMPUTER ORGANISATION Time : 03 Hours Maximum Marks : 75 Section - A Answer any Three of the following (3 15=45) 1) Explain the operational component of a computer. 2) Explain various secondary storage devices organizations. 3) Explain about instruction and instruction sequencing in instruction set architecture. 4) Briefly explain cache design parameters and draw the block diagram for Direct mapping cache organization. 5) What is two s complement multiplication and explain Booth s algorithm for two s compliment multiplication. Section - B (5 5=25) Answer any five of the following 6) Write short notes on Dynamic Memory Access(DMA) 7) Explain the standard I/O interfaces with a suitable diagram 8) Discuss about virtual memories management requirements 9) Explain about interface circuits. 10) Explain about Multiplication of Positive numbers. 11) Explain about basic organization of a micro-programmed control unit. 12) Explain about semiconductor RAM memory 13) Explain different RAID techniques.
Section - C (5 1=5) Answer all questions 14) What is cache? 15) What is processor? 16) What is program counter? 17) What is register? 18) What is cycle?
[DMCA 104] M. C.A. DEGREE EXAMINATION, DEC 2013 First Year Paper IV DATA STRUCTURES Time : 3 hours Max. Marks : 75 SECTION A ( 3 x 15 = 45) Answer any THREE questions. 1. Define the concept of data structure. Explain data structures operations with illustrative examples. 2. Write the second pattern matching algorithm. Use this algorithm to find the table and the corresponding graph for the pattern P = ababab. 3. Discuss about Polish notation. Using stack transform A + (B * C (D / E F) * G) * H into its equivalent post fix expression. 4. Write Huffman s algorithm and trace the algorithm on the following: Data item : A B C D E F G H Weight : 22 5 11 19 2 11 25 5 5. Explain the selection sort technique with suitable example SECTION B ( 5 x 5 = 25) Answer any FIVE questions 6. Explain the concept of complexity of algorithms. 7. Discuss about different operations associated with word processing. 8. Explain binary search technique with suitable example. 9. Describe the circular linked list and how do you traverse it. 10. Explain the towers of Hanoi problem and give its recursive solution for n = 4. 11. Find the traversals of the corresponding binary tree of the expression (A + (B C)) * [D E) / (F + G H)]
12. Discuss about the inorder threading of a binary tree. 13. Explain different hashing techniques with suitable examples. SECTION C ( 1 x 5 = 5) Answer ALL questions 14. Define pointer array. 15. Represent two - way linked list 16. Define complete binary tree 17. What is priority queue? 18. What are stack operations?
(DMCA 105) M.C.A. DEGREE EXAMINATION, DEC. - 2013 First Year Paper V : OPERATING SYSTEMS Time : 03 Hours Maximum Marks : 75 SECTION A (3 15 = 45) Answer any three of the following 1) Explain the structure of operating system in detail. 2) Explain about the Interprocess communication in detail with a neat label diagram. 3) Explain the Virtual memory in detail. 4) What is a deadlock? Explain deadlock prevention methods in detail. 5) Explain the optimal phase replacement algorithm in detail. SECTION B (5 5 = 25) Answer any five of the following 6) Differentiate between short term and Medium term scheduler. 7) Write a note on system calls in detail. 8) Write about Race conditions. 9) Write a note on phase tables. 10) Explain Memory mapped files in detail. 11) Explain security and protection issues. 12) Explain about PCB in detail. 13) Explain about Authentication & verification in detail.
SECTION C (5 1 = 5) Answer all the following 14) Sleep and wakeup 15) Semaphores 16) Priority scheduling 17) Define swapping. 18) Disk schedulings.
(DMCA 106) M.C.A. DEGREE EXAMINATION, DEC. 2013 (First Year) Paper VI: DATABASE MANAGEMENT SYSTEMS Time : 03 Hours Maximum Marks : 75 SECTION A [3 x 15 = 45] Answer any three questions 1) Explain each component of database management system and discuss how can you establish economic justification of database system. 2) What is a B-tree? Give an algorithm to construct a B-tree. Construct a B-tree of degree three with the keys: 125, 140, 200, 115, 135, 145, 118, 150, 105, 120, 250, 130, 110, 300. 3) What is Normalization? Explain different normal forms with suitable example. 4) Give a skeleton of the DBD of IMS. List and explain different DL/I commands of IMS. 5) Discuss the importance of database recovery and explain different database recovery procedures. SECTION B [5 x 5 = 25] Answer any Five questions 6) Classify the association between the fields of a file and explain them with suitable example. 7) Illustrate the construction of an indexed sequential file with a suitable example. 8) Explain how will you map conceptual data model into a relational data model. 9) What are the basic actions performed over databases? Explain them in brief. 10) Discuss about different symbols used in database action diagram.
11) List different DML modification commands of IDMS and explain them in brief. 12) Briefly explain about the commands under PC-FOCUS data manipulation. 13) What are special relational operators? Explain them in brief. SECTION C [5 x 1 = 5] Answer all questions 14) What is the state-of-art relationship? 15) What is multi-list data structure? 16) What is LAM? 17) Illustrate the use of GET HOLD UNIQUE. 18) What is timestamp?
(DMCA107) M.C.A. DEGREE EXAMINATION, DEC. - 2013 First Year Paper - VII : ACCOUNTS AND FINANCE Time : 03 Hours Maximum Marks : 75 SECTION-A (3 15 = 45) Answer any Three of the following 1) Explain the concepts used in accounting. 2) State the regulations relating to balance sheet and profit and Loss a/c of a company. 3) What are the essentials of budgetary control? 4) State the tools used in financial analysis. 5) Bring out the limitations of ratio analysis. SECTION-B (5 5 = 25) Answer any five of the following 6) Explain accounting cycle. 7) State different types of cash books. 8) Classify costs. 9) What are the issues in financial decision making? 10) What do you mean by finance function. 11) When does flow of fund take place? 12) State the sources of working Capital 13) Examine the uses of trial balance.
SECTION-C (5 1 = 5) Answer all the following 14) Journal. 15) Budget. 16) Cost concept. 17) Networking capital. 18) Cash concept of fund.
(DMCA 108) M.C.A. DEGREE EXAMINATION, DEC. 2013 (First Year) Paper VIII: DISCRETE MATHEMATICS Time : 03 Hours Maximum Marks : 75 SECTION A [3 x 15 = 45] Answer any THREE of the following 1) a) Show that SVR is logically implied by ( PVQ) ( P R) ( Q S) b) Show that ( x)( P( x) Q( x) ) ( x) P( x) ( ( xq ) ( x) ) 2) a) Define power set of a set and show that the cardinality of the power set of A, P(A) is 2 n if cardinality of A is n. 2 b) Let f ( x) = Sinx, g( x) = x + 4 and hx ( ) = 5x, for x R where R is the set of all real numbers. Find fog, gof, foh, hof, gof, hoh and fogoh. 3) Make logic circuits from the following Boolean expressions: a) AB + ABC+ C + B [7] b) wyz+ wz+ yz+ xyz [8] 4) a) Solve the recurrence relation a 7a + 16a 12a = O for r 3 n n 1 n 2 n 3 a = 1, a = 4 a = 8 Wim 0 1 2 b) Solve the recurrence relation an an 1 an 2 5 + 6 = 0 where a 0 = 2 and a 1= 5 5) a) Show that the Chromatic number of a planar graph is no greater than 4. b) Find the shortest path between A and F of the following weighed graph by using DISJKStals algorithm.
SECTION B [5 x 5 = 25] Answer any Five of the following 6) Prove that ( x)( P( x) Q( x) ) ( x) P( x) ( ( xq ) ( x) ) 7) Define strong mathematical induction. 8) What is Monoid of the Machine? Explain. 9) Find the recurrence relation form the sequence 0, 1, 1, 2, 3, 5, 8, 13, 10) When are the two graphs said to be an Isomorphic. Give an example. 11) Define and explain the Adjacency matrix of the graph. 12) Define order of the recurrence relation. 13) Define Oval of a Planar Graph. SECTION C Answer all the following 14) Define Set 15) Define Recursion 16) Define Lattice 17) What is Karnough Map 18) What is bipartite graph