Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
597 views

M.C.A Data Structures Question Paper: Madras University

This document contains the question paper for an MCA Data Structures exam given by Madras University. The exam is 3 hours long and consists of 2 parts. Part A contains 5 short answer questions worth 5 marks each on topics like time complexity, primitive data types, queue operations, linked lists, trees, and indexing structures. Part B contains 5 long answer questions worth 10 marks each, requiring algorithms and explanations for binary search, array representations, multiple queue operations, doubly linked lists, dynamic memory management, tree traversals, and breadth-first search. It also includes questions on hashing techniques and multilists.

Uploaded by

Atul Galande
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
597 views

M.C.A Data Structures Question Paper: Madras University

This document contains the question paper for an MCA Data Structures exam given by Madras University. The exam is 3 hours long and consists of 2 parts. Part A contains 5 short answer questions worth 5 marks each on topics like time complexity, primitive data types, queue operations, linked lists, trees, and indexing structures. Part B contains 5 long answer questions worth 10 marks each, requiring algorithms and explanations for binary search, array representations, multiple queue operations, doubly linked lists, dynamic memory management, tree traversals, and breadth-first search. It also includes questions on hashing techniques and multilists.

Uploaded by

Atul Galande
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Madras University

M.C.A Data Structures Question paper

Time: Three hours

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.
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.

You might also like