M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.

Similar documents
(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY

1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram?

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

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75

1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.

M.C.A. FIRST YEAR DEGREE

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

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I

(DMTCS 01) Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False:

2) Explain in detail about different AVL rotation applied on unbalanced trees.

Table of Contents. Chapter 1: Introduction to Data Structures... 1

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75

R13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)

1) What is information system? Describe the basic concepts of information systems.

Madhya Pradesh Bhoj (Open) University, Bhopal

PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8)

Time : 03 Hours Maximum Marks : 75

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \

Code No: R Set No. 1

Note: Select one full question from each unit

COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

BRONX COMMUNITY COLLEGE of the City University of New York DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE. Sample Final Exam

(PGDCA 01) ASSIGNMENT -1 PG DIPLOMA DEGREE EXAMINATION, DECEMBER 2017 COMPUTER APPLICATIONS Information Technology

DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT)

INFORMATION TECHNOLOGY

DYNAMIC MEMORY ALLOCATION AND DEALLOCATION

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May

ASSIGNMENTS. Progra m Outcom e. Chapter Q. No. Outcom e (CO) I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n))

LESSON PLAN B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER

End-Term Examination Second Semester [MCA] MAY-JUNE 2006

JAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit:

SECOND SEMESTER BCA : Syllabus Copy

JAIPUR NATIONAL UNIVERSITY, JAIPUR

DATA STRUCTURES THROUGH C++

STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR

LOGIC AND DISCRETE MATHEMATICS

Rajiv GandhiCollegeof Engineering& Technology, Kirumampakkam.Page 1 of 10

P.G.D.C.A. EXAMINATION, 2009

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register

F453 Module 7: Programming Techniques. 7.2: Methods for defining syntax

ADMINISTRATIVE MANAGEMENT COLLEGE

CS301 - Data Structures Glossary By

Draw a diagram of an empty circular queue and describe it to the reader.

Answer any Five Questions. All questions carry equal marks.

ONE MARKS QUESTION AND ANSWERS

VALLIAMMAI ENGINEERING COLLEGE

DATA STRUCTURE : A MCQ QUESTION SET Code : RBMCQ0305

Question Paper Code : 97044

Second Semester - Question Bank Department of Computer Science Advanced Data Structures and Algorithms...

Answer any Five Questions. All questions carry equal marks.

Computer Science 302 Fall 2009 (Practice) Second Examination, October 15, 2009

Bharati Vidyapeeth s College Of Engineering for Women Pune-43 Department E & TC. SE- Unit Test I Subject-DS

BCA (Part II) EXAMINATION, 2009 C++ PROGRAMMING Time allowed: Three Hours Maximum Marks: 50 Attempt any five questions

ASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 First Year COMPUTER SCIENCE Data Structures MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS

Seth Jai Parkash Polytechnic, Damla

Syllabus for Bachelor of Technology. Computer Engineering. Subject Code: 01CE0301. Subject Name: Data Structure. B.Tech. Year - II

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

Fundamentals of Discrete Mathematical Structures

School of Distance Education University of Kerala M.Sc Computer Science Assignment Topics

Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms

MAHARAJA KRISHNAKUMARSINHJI BHAVNAGAR UNIVERSITY NAAC Accreditation Grade B (With effect from Academic Year: )

Course Name: B.Tech. 3 th Sem. No of hours allotted to complete the syllabi: 44 Hours No of hours allotted per week: 3 Hours. Planned.

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)

About the Author. Dependency Chart. Chapter 1: Logic and Sets 1. Chapter 2: Relations and Functions, Boolean Algebra, and Circuit Design

3. According to universal addressing, what is the address of vertex d? 4. According to universal addressing, what is the address of vertex f?

SAURASHTRA UNIVERSITY

SYLLABUS. M.Sc. I.T. Ist Year

Fundamental of I.T. (c) Application of computer *************

Introduction to Algorithms Third Edition

1. a) Discuss primitive recursive functions with an example? 15M Or b) Statements and applications of Euler s and Fermat s Theorems?

Subject: OBJECT ORIENTED PROGRAMMING WITH C++ Paper (U.G): BCA -231 S. No. Course Outcomes

CSE 20 DISCRETE MATH. Fall

Reg. No. : Question Paper Code : 27157

Dept. of Computer Sc., SDP College for Women, Ludhiana

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS

DISCRETE MATHEMATICS

CSE 20 DISCRETE MATH. Winter

MNPE In Collaboration with. Karnataka State Open University. Manasagangotri, Mysore-6. Syllabus. Diploma in Computer Application

5. Give any three parts of the structure of business letter.

FINALTERM EXAMINATION Fall 2009 CS301- Data Structures Question No: 1 ( Marks: 1 ) - Please choose one The data of the problem is of 2GB and the hard

COURSE STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING HELD ON JULY TO BE EFFECTIVE FROM THE ACADEMIC YEAR

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May

Duration: 2 hours Max. Marks: 60

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION MH 1301 DISCRETE MATHEMATICS TIME ALLOWED: 2 HOURS

DATA STRUCTURES AND ALGORITHMS

WITH C+ + William Ford University of the Pacific. William Topp University of the Pacific. Prentice Hall, Englewood Cliffs, New Jersey 07632

MLR INSTITUTE OF TECHNOLOGY DUNDIGAL , HYDERABAD QUESTION BANK

PRACTICAL LIST FOR EVEN SEMESTERS (PGDCA/MCA/MSC (CS))

SECOND SEMESTER JAVA PROGRAMMING

Section 5.5. Left subtree The left subtree of a vertex V on a binary tree is the graph formed by the left child L of V, the descendents

Transcription:

Paper I INFORMATION TECHNOLOGY Answer any THREE of the following. 1. Explain Architecture of computer in detail. 2. Explain in detail about Input and Output technologies. 3. What is MODEM? What factors do you consider to buy a MODEM? What are the uses of a MODEM? 4. (a) What are the Applications of Software? (b) Explain different types of modulation techniques. 5. What is Internet? What are the different protocols available on the internet? Explain how TCP/IP works. SECTION B (5 5 = 25 marks) Answer any FIVE of the following. 6. Explain Components of Data communication. 7. What is ISDN? What are the advantages of ISDN? 8. Explain about traditional file management system and its advantages. 9. What is the difference between high level language and low level language? 10. Applications of Telecommunications. 11. What is memory? Explain in detail about types of memory 12. Explain different organization levels. 13. What is http? Explain how does it works.

Answer ALL the questions. 14. What is file? 15. What is protocol? 16. What is Datawarehouse? 17. What is intranet? 18. What is data and information? (DMCA 102) Paper II PROGRAMMING WITH C++ Answer any THREE questions. 19. (a) What are the advantages and disadvantages of object oriented programming? 1. (b) What is scope resolution operator? Explain with an example. 20. What are the problems associated with accessing base class methods in hybrid Inheritance? How can one solve them? 21. (a) What are the advantages of new operator as compared to the function malloc ( )? 2. (b) Write a program to generate Fibonacci series by using constructor to indicate data members. 22. Create a class FLOAT that contains one float data member. Overload all the four arithmetic operators so that they operate on the objects of FLOAT. 23. (a) Discuss run-time polymorphism and compile time polymorphism. 3. (b) Discuss the mechanism of references in the C++ with examples. 2

SECTION B (5 5 = 25 marks) Answer any FIVE questions. 24. Write a C++ program to compute the sum of first N odd integers. 25. Explain the meaning of method overloading. 26. Write Exception handling in C++. 27. Discuss File handling in C++. 28. Why do we need access specifiers? Explain. 29. Explain with an example, how would you create space for an array of objects using pointer? 30. Create a class to implement stack with PUSH and POP function. 31. What are dynamic allocation operators? Give example. Answer ALL questions. 32. What are the benefits of OOP? 33. Why do we need preprocessor directive # include<iostream.h>? 34. How can you create reference variables in C++? 35. What is a Stream? 36. What is an abstract class? (DMCA 103) Paper III COMPUTER ORGANIZATION 3

Answer any THREE questions. 37. Explain Floating point representation. 38. Describe features of auxiliary memory. 39. List different types of instruction formats and explain. 40. Explain different types of interrupts with examples. 41. Explain seven RAID levels. SECTION B (5 5 = 25 marks) Answer any FIVE questions. 42. Write short note on Addressing modes. 43. Describe Magnetic Tape. 44. Differentiate RISC and CISC. 45. What are the various components of a computer? Explain briefly. 46. Explain functions of ALU. 47. Explain various memories. 48. What is stored program organisation? 49. Briefly explain the PCI bus features. Answer ALL questions. 50. What is reverse polish notation? 51. What is register? 52. What is program control? 53. What are peripheral devices? 54. What is Bus? (DMCA 104) 4

Paper IV DATA STRUCTURES Answer any THREE questions. 55. (a) Explain the Top-Down approach to algorithm development. 4. (b) Explain the memory management of arrays. 56. (a) What is a circular queue? Write an algorithm for addition and deletion of elements into a circular queue. 5. (b) What is a sparse matrix? Write an algorithm to multiply the sparse matrices. 57. (a) Represent a Tree as a Binary Tree, using the representation write an algorithm to determine the depth of the tree and the number of leaves. 6. (b) Discuss Binary search. 58. Explain the Heap sort with an example. 59. Explain preorder, postorder and inorder traversals of a tree. 60. Write an algorithm for linear search. 61. Explain garbage collection. SECTION B (5 5 = 25 marks) Answer any FIVE questions. 62. How are collisions handled in a Hash table? Explain. 63. What is an algorithm? Explain the chief characteristics of an algorithm. 64. Explain various applications of Binary and Binary search trees. 65. Explain threaded binary trees and their representation. 66. Explain Bubble sort. 67. Write a non-recursive procedure to perform Binary Tree inorder traversal. 68. Explain Datatypes. 69. What is a stack? 70. Define a tree. Answer ALL questions. 5

71. What is sortine? 72. What is the level of a tree? (DMCA 105) Paper V OPERATING SYSTEMS Answer any THREE of the following. 73. (a) Explain tasks performed by Operating system. 7. (b) Explain different types of Operating systems. 74. Explain process state transition diagram in detail. 75. (a) What is semaphore? Write algorithm for BAKERY algorithm. 8. (b) Explain the concept of overlaying. 76. (a) What is deadlock? What are the conditions for deadlock? 9. (b) Write the banker s algorithm and explain. 77. Explain in detail about page replacement algorithms. SECTION B (5 5 = 25 marks) Answer any FIVE of the following. 78. Difference between medium-term and short-term scheduler. 79. What is difference between segmentation and paging? 80. Explain Belady s anomaly with example. 81. Discuss about various file allocation methods. 82. Explain device divers. 83. Explain security and protection issues. 84. Explain virtual memory concept. 85. Explain about PCB. Answer ALL the following. 6

86. Define Operating System. 87. Define Multiprocessing. 88. Define throughput. 89. Explain about interrupts. 90. Define protocol. (DMCA 106) Paper VI DATABASE MANAGEMENT SYSTEMS SECTION A (3 15 = 45 marks) Answer any THREE questions. 91. Write the advantages and disadvantages of Database management system. 92. What is a Relation? Discuss the basic components of a relational data model with an example. 93. Write Inference axioms Explain their importance in relational Design. 94. Write the Syntax and usage of Union, Difference, Intersection and Cartesian product operations. 95. What are ACID Properties?Discuss the properties and their advantages. SECTION B (5 5 = 25 marks) Answer any FIVE questions. 96. Write and discuss the three level architecture of a Database management system. 97. Write the different steps to reduce the E-R schemas to the tables with the help of an example. 98. What is Data Independence? Discuss and distinguish the physical and logical data independence and its importance with example. 7

99. What is Normalization? Why normalization is required? Define and explain the Boyce Codd Normal form. 100. What is a network model? Explain the DBTG data storage and retrieval format in detail. 101. What is Relation Calculus? Explain tuple calculus and domain calculus and their usage. 102. What is transaction? Describe transaction recovery system and SQL facilities. 103. Differentiate SQL with QBE. SECTION C (5 1 = 5 marks) Answer ALL questions. 104. (a) What is database? 10. (b) What is Table and View? 11. (c) What is serializability? 12. (d) Write about Join Normal form JD. 13. (e) Write Extended E-R features. (DMCA 107) Paper VII ACCOUNTS AND FINANCE SECTION A (3 15 = 45 marks) Answer any THREE questions. 105. Examine the role of financial system on Indian economy. 106. What is bank reconciliation? Explain the statement of bank reconilaliation. 107. What is meant by financial system and explain its structure. 108. Define cost. Explain the tools and techniques of cost accounting. 109. Explain the growth and development of working capital management. SECTION B (5 5 = 25 marks) 8

Answer any FIVE questions. 110. Explain the principles of accounting. 111. Discuss the functions of subsidiary books. 112. What is responsibility accounting? 113. State the functions of Finance. 114. Explain the concept of cash flow analysis. 115. What is ratio analysis? 116. Explain the double entry system. 117. Discuss the nature of accounting. SECTION C (5 1 = 5 marks) Answer ALL questions. 118. Master budget. 119. Objective of cost accounting. 120. Sales variances. 121. Instrument centre. 122. Financial decision making. (DMCA 108) Paper VIII DISCRETE MATHEMATICS Answer any THREE of the following. 123. Obtain the DNF and CNF of the following formula : 14. PV ~ Q P ~ Q ~. 124. Let f : R R and g R R and g x x 4 find gof and fog. 125. Solve the following recurrence relation :, where R is the ret of real numbers. If f x x 2 2 9

15. r ar 3ar 1 4ar 2 3 given a, a 2. 0 1 1 126. Show that every finite group of order n is isomorphic to a permutation group of degree n. 127. Minimize the following expressions and represent the K-map 1 1 1 1 1 16. (a) f xyz xyz x yz x y z 1 1 1 1 1 1 17. (b) f xyz xyz xy z x yz x y z. 2 SECTION B (5 5 = 25 marks) Answer any FIVE of the following. 128. Construct the truth table for P Q R P QVR tautology. 129. Prove by induction, 1 2 3 3 2 130. Let 1,2, 3, 4, 5, 6, 7, 8 ~ and verify that it is a 3 n n 1... n. 4 A.Compute the product of (3, 5, 7, 8) 0 (1, 3, 2). 131. Show that the recursive definitions 18. b 1 5h n1 24 for n 0 h defines a function. 132. In how many ways can the letters of English alphabet be arranged so that there are exactly 5 letters between the letters a and b. 133. State and prove Fermat s theorem. 134. Show that the set N of natural numbers is a semi group under the operation *, x y max x, y. where 135. Prove that every chain is a distributive lattice. 136. What is tautology? 137. Define a reflexive relation. 138. What is a permutation? 139. Define a group. 140. What is a lattice? Answer ALL the following. 2 10

11