University of Madras Question Papers of MCA

I am studying at University of Madras. My semester exam will held in December. Would you please give me the question papers of MCA second year exam of DBMS?

Here I am providing you the M.C.A., Second Year question paper of DATA BASE MANAGEMENT SYSTEMS
MAY 1999.it consists of 2 parts

PART A - (5 x 5 = 25 marks)

Answer ALL questions.
All questions carry equal marks.

1. (a) Define and explain the terms Data Base and Data Base Management System.
Or

(b) What are entity and entity sets? Explain with examples.

2. (a) Compare and contrast the conventional file system with DBMS.

Or
(b) Explain one to one, one to many and many to many relationships with examples.

3. (a) What are the three common types of data models? Explain briefly one of them.
Or
(b) When will you use each of the following relational algebraic operations : Select, Project, Join?

4. (a) Draw the diagram of DBTG Codasyl model and explain.
Or

(b) What is plex structure? What are its special features?

5. (a) Discuss Query interpretation.
Or
(b) Explain concurrency control.

PART B - (5 x 10 = 50 marks)

Answer any FIVE questions.
All questions carry equal marks.

6. What are the objectives and purposes of a Data Base Management system? Describe the ANSI/SPARC architecture of a Data Base Management system.

7. Explain the various possible associations between entities with suitable examples. What is E-R diagram? Explain with an example.

8. How are Relational Algebra and Relational Calculus employed in DBMS? Explain the various operations performed by them.

9. Explain the four forms of normalization employed in relational database with appropriate examples.

10. Describe the different steps in the design of a relational database. Discuss also the pitfalls.

11. Compare and contrast the three popular data models with respect to their structure and implementation.

12. Explain DBTG data structure and architecture. Also discuss the DBTG data retrieval facility.

13. Write short notes on :
(a) Data Base security and integrity
(b) Query Processing.

Can you please provide me MCA question paper of University of Madras- Institute of Distance Education???

Here I am sharing the MCA question paper of University of Madras- Institute of Distance Education


1. (a) Explain the concept of sum of subset
problem.
Or
(b) Write short notes on Hamiltonian cycles.

2. (a) Discuss on LC – Search.
Or
(b) Write short notes on Branch and Bound.

3. Explain merge sort. Write the algorithm and analyse it.
4. Explain Quick sort with example.
5. Write the algorithm to find the maximum and minimum values from a set of n elements.
6. Explain Kruskal’s minimum cost spanning tree algorithm.
7. Explain greedy strategy Knapsack problem.
8. Explain multistage graph with example.
9. Describe the 8 - queens problem.
10. Explain travelling sales person problem in Branch and Bound method.

Rest of the Questions are attached in below file which is free of cost for you

Address:
Institute Of Distance Education
University Of Madras,
IDE Building,
Chepauk Campus,
Wallajah Road entrance,
Adams St,
Triplicane,
Chennai,
Tamil Nadu 600005 ‎
Ph: 044 2539 3453 ‎

Map:

Attached Files Available for Download

	(University of Madras MCA - Design and Analysis of Algorithms Question paper).pdf (37.9 KB, 58 views)
	(University of Madras MCA - Programming in JAVA).pdf (35.3 KB, 47 views)

University of Madras (Madras University) is a public state university and was incorporated on 5 September 1857 by an act of the Legislative Council of India.

Here I am sharing the previous year MCA Question paper for University of Madras - Institute of Distance Education (UnoM IDE)

PART A — (5 5 = 25 marks)
Answer ALL questions.
1. (a) Write down the procedure for sort ‘n’ series of
numbers using merge sort with an example.
Or
(b) Explain in brief about time complexity
analysis using relevant examples.

2. (a) Discuss the procedure for optical storage on
tapes.
Or
(b) How to solve Knapsack problem using greedy
method?

3. (a) Write short notes on biconnected
components.
Or
(b) Describe the method of depth first search
traversal with an illustration.

4. (a) Write notes on method of backtracking.
Or
(b) Discuss about Hamiltonian cycle.

5. (a) Define Branch and Bound – Explain.
Or
(b) Write an algorithm to solve travelling
salesperson problem.

PART B — (5 10 = 50 marks)
Answer any FIVE questions.
6. Write detailed notes on various asymptotic
notations used in performance analysis.

7. Explain the procedure of binary search using
divide and conquer method with an example.

8. How to solve minimum spanning tree problem?
Illustrate.

9. Give an algorithm to solve single source shortest
path problem.

10. Illustrate the method of solving O/I Knapsack
problem using dynamic programming.

11. Write notes on various traversal techniques.

12. Describe 8 queens problem.

13. Explain the procedure for finding sum of subsets.

Address:
University of Madras
चेपॉक, चेन्नई 600005 ‎
044 2539 9422 ‎

Map:



Image:

__________________
Answered By StudyChaCha Member

I am studying at University of Madras. My semester exam will held in December. Would you please give me the question papers with answer of MCA first year exam of statistics?