(DMCA 101) M.C.A.(Previous) DEGREE EXAMINATION, MAY 2006 PAPER - I - INFORMATION TECHNOLOGY

Size: px

Start display at page:

Download "(DMCA 101) M.C.A.(Previous) DEGREE EXAMINATION, MAY 2006 PAPER - I - INFORMATION TECHNOLOGY"

Lawrence Pierce
5 years ago
Views:

1 1 (DMCA 101) PAPER - I - INFORMATION TECHNOLOGY 1. What is a computer based information system? Discuss the general technological trends for information technology. 2. (a) Describe the four main types of primary storage. (b) Describe the computer Hierarchy interms their roles. 3. What is systems software? Explain different types of systems software. 4. What is DBMS? What are the relative advantages and disadvantages of hierarchical, network and relational databases? 5. How the Internet works? Explain services provided by the Internet. 6. Describe the hierarchical structure of organisations. 7. Describe the role of the ISD in an organisation. 8. How CPU works? What are advances in microprocessor design? 9. Explain any secondary storage devices. 10. What are the advantages of Object-Oriented languages? 11. What are the advantages of Data ware housing? 12. Explain communication medias and channels. 13. Differentiate INTERNET and INTRANETS. 14. What is an Information System? 15. Mention different types of memories. 16. What is Data mining? 17. What is WWW? 18. What is Extranet? Answer ALL of the following.

2 2 (DMCA 102) PAPER - II - PROGRAMMING WITH C++ SECTION A - (3 X 15 = 45 marks) 1. (a) What is call by value and call by reference? Explain each with an example. (7) (b) Write a C++ program to multiply two matrices. (8) 2. (a) What is overloading and overriding? Explain with an example. (7) (b) Write about any five string library functions along with system and usage. (8) 3. (a) What are Virtual functions and Abstract classes? Explain with an example. (8) (b) What are pointers and dynamic arrays? Explain with an example. (7) 4. (a) What are class templates and function templates? Differentiate with an example (b) Write C++ program explaining binary search. 5. (a) Explain about various conditional statements in C++ with an example. (7) (b) Write a program to overload ++ operator. (8) 6. (a) Explain what is the use of copy constructor with the example. (7) (b) Explain what is object oriented concepts are available in C++. (8) 7. Write a C++ program to find the area of a triangle given three sides a, b, c by validating sides. 8. Write a C++ program for bubble sort. 9. Discuss about continue and break statements in C++ and differentiate. 10. Write a program using functions to find permutation function n! P( n, k) ( n k)! 11. What are static data members and static member functions? Explain. 12. Write a program to append a string to another string. 13. What is iterator class? Explain with an example. 14. List and explain about any four library functions of mathematical and string each. SECTION C - (5 X 1 = 5 marks) 15. What is inline function? 16. What is the difference between reference and pointer variable? 17. What is protected data? 18. What is composition? 19. What is vector? Give an example.

3 3 (DMCA 103) PAPER - III - COMPUTER ORGANISATION 1. Distinguish between integer representation and floating-point representation. 2. What is RAID? Why there is a need for different levels of RAID? 3. Explain the typical desktop system using PCI configuration. 4. Discuss the evolution of Pentium and Power PC computers. 5. Draw IAS computer structure and explain various units in it. 6. Explain the various elements of Bus Design. 7. Describe how instruction cycle helps the computer in executing an instruction. 8. Discuss some of the disk system developments. 9. Explain how different registers work in a Pentium processor. 10. Discuss how multiple interrupts are handled. 11. Explain the various characteristics of disk systems. 12. Get the product of (-11) and (12) using Booth s algorithm. 13. Draw and explain the hardware block diagram for addition and subtraction. 14. Name the key concepts on which von Neumman machine is based on. 15. Draw the state diagrams of : (a) Instruction cycle (b) Instruction cycle with interrupts. 16. Distinguish between different methods of Arbitration. 17. For what purpose NMI is used? 18. Represent - 18 in (a) Signed representation (b) Signed 1 s complement representation. (c) Signed 2 s complement representation using 8-bits as their length.

4 4 (DMCA 104) PAPER - IV - DATA STRUCTURES Maximum: 100 marks SECTION A - (3 X 15 = 45 marks) 1. (a) Describe about the various data structures and the operations performed on them. (8) (b) Write an algorithm to find the largest element in an array of numbers. (7) 2. (a) Explain how are the strings stored in various types of structures. (8) (b) Write the bubble sort algorithm and explain it with an example data. (7) 3. (a) Write an algorithm to transform Infix Expression into postfix expression using stack data structure. (8) (b) What are two-way lists? Explain the different operations performed on two-way lists with appropriate examples. (7) 4. (a) What is a Queue? Write down the algorithms for different operations performed on a queue. (7) (b) Describe the method of bulding a Huffman tree with an example. Explain the implementation of Huffman s algorithms. (8) 5. (a) Write the merge Sort algorithm and explain its time complexity. (8) (b) Explain the binary search procedure with an example data. (7) 6. What is a sub algorithm? Explain the different categories of sub algorithms. 7. Explain how to measure the efficiency of an algorithm. 8. Write an algorithm to replace every occurrence of a pattern P in tent T by another pattern Q. 9. What are linear arrays? Explain how to represent linear arrays in memory. 10. What are linked lists? Explain how the linked lists are represented in memory. 11. What is a stack? Explain the operations performed on stacks. 12. What is a binary search tree? Explain the insertion procedure with an example. 13. Compare the time complexities of different sorting algorithms. 14. What is a Priority queue? 15. What are the applications of binary search trees? 16. What is the time complexity of Quick Sort? 17. What is a recursion? 18. What is a sparse matrix?

5 5 (DMCA 105) PAPER - V - OPERATING SYSTEMS 1. (a) Explain differences between trap and an interrupt. (b) What is process? Explain the process state transition diagram with examples. 2. Explain how the concurrent processes cooperate by sharing and by communication. 3. Explain various page replacement algorithms. 4. Explain the different file allocation methods. 5. Explain security implementation by password protection. 6. Explain about operating system kernel. 7. Write about process scheduling. 8. Explain about Deadlock Avoidance. 9. Explain paging concept with one example. 10. Explain Types of File system. 11. Write about Device Drivers. 12. Explain different Disk Schedulings. 13. Explain about Authentication. 14. Define Multiprogramming. 15. What is Semaphores? 16. Define segmentation. 17. Define caching. 18. Define RAID.

6 6 (DMCA 106) PAPER - VI - DATABASE MANAGEMENT SYSTEMS 1. Discuss the drawbacks of conventional file processing system. 2. Define a data model. Explain their classification. 3. State and explain the method of designing a relational database. 4. What is hierarchical database? How it is different from relational model? 5. Discuss the query languages that help to Query Relational Database. 6. Define database and DBMS. Give examples. 7. What is relationship? Why it is to be considered? 8. What is entity, attribute? Give examples. Explain their utility. 9. What are update anomalies? Explain. 10. Define and explain Fourth Normal form. 11. What are data structure diagrams of network model? 12. What is key constraint? 13. Explain how SQL helps in retrieving data. 14. Define Relationship. 15. What is BCNF? 16. Define Fifth Normal Form. 17. What are structure diagrams? 18. Who is DBA?

7 7 (DMCA 107) PAPER - VII - ACCOUNTS AND FINANCE 1. What are subsidiary books? Explain purchase and sales books, purchase and sales returns books. 2. Bank Reconciliation Statement prevents errors and misappropriation of bank funds. Examine reasons for differences in pass book and cash book balances. 3. Discuss functional classification of costs into prime, works, office and selling costs. 4. Ratio analysis is an important tool of financial analysis. Explain significance and standard norms of ratios. 5. How do you prepare vertical and horizontal balance sheets? Explain with imaginary figures? 6. What is business entity concept? 7. What is trail balance? Why is it prepared? 8. What are techniques of costing? List them. 9. What is profit maximisation? 10. What is fund flow? Explain. 11. What are inventory turnover and debtors turnover ratios? 12. What are the objectives of financial analysis? 13. The following trial balance is extracted from the books of a trader. Prepare a balance sheet. Rs. Rs. Cah and bank 18,000 Capital 97,000 Goodwill 22,000 Reserve 4,500 Plant & Machinery 80,000 Bills payable 16,000 Trade debtors 46,000 Trade creditors 58,500 Furniture 15,000 Plant depreciation 5, (a) Contra entry (b) Marshalling order (c) Flexible budget (d) Financial analysis (e) Gross profit ratio.

8 8 (DMCA 108) PAPER - VIII - DISCRETE MATHEMATICS 1. (a) Test the validity of the following argument. If I study, then I will not fail mathematics If I do not play basket ball, then I will study. But I failed Mathematics Therefore I must have played basket ball. (b) Find the truth tables for (i) p q (ii) p q 2. (a) For any n N, Let D n ( 0,1/ n), the open interval from O to 1. Find : (b) Let (i) D3 D7 (ii) D3 D20 (iii) D 5 Dt (iv) D Dt 5. f : R R be defined by f ( x) 2x 3. Now f is One-to-one and Onto: hence f has an 1 1 inverse function f. Find a formula for f. 3. (a) Show that every finite semigroup has an idempotent. (b) Let (S,*) be a semigroup and Z S be a left zero. Show that for any x S, x* Z is also a left zero. 4. (a) Explain the properties of binary operations. (b) Determine whether H 1 0,5,10 and H 2 0,4,8,12 are subgroups of Z Let 1,2,3,... linearly ordered. (a) 24,2,6 (b) N 1,2,3 (c) 7 (d) 3,15,5 (e) 2,8,32,4 (f) 15,5,30 N be ordered by divisibility. State whether each of the following subsets of N are 6. Negate each of the following statements: (a) If the teacher is absent, then some students do not complete their homework. (b) All the students completed their homework and the teacher is present. (c) Some of the students did not complete their homework or the teacher is absent. 7. Construct the truth table for p q) p q 8. Consider the group 1,2,3,4,5,6 (. G under multiplication modulo 7. (a) Find the multiplication table of G (b) Find 2,3,6. (c) Find the orders and subgroups generated by 2 and 3. (d) Is G cyclic.

9 9. Define well-ordered sets with example. 10. Suppose 9 P( n) a a n a n... a m n 2 m m has degree m. Prove ( n) O( n ) 11. Explain conjunction and disjunction normal forms. P. 12. Solve the recurrence relation an a 3 2 n an 1 n 3n 1 where a 0 1 by method of substitution. 13. Using arithmetic modulo m=15, evaluate: (a) (b) (c) 4-9 (d) What is symmetric relation? 15. What is composition function? 16. What is Homomorphisms? 17. Define submonoid. 18. What is subalgebra? * * * * * *

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75

M.C.A. DEGREE EXAMINATION, MAY - 2013 First Year Paper - I : INFORMATION TECHNOLOGY (DMCA 101) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following 1) What is the