Posted Date: 13 Feb 2022      Posted By:: Jannane.M    Member Level: Gold  Points: 3 (₹ 3)

# 2021 Bharathidasan University Bharathidasan University, M.C.A Degree Examination, Computer Applications, Data Structures and Algorithms, Nov 2021. Question paper

 Course: M.C.A University/board: Bharathidasan University

Are you looking for the old question papers from Bharathidasan University of Data Structures and Algorithms paper? Here is the previous year question paper from Bharathidasan University. This is the original question paper of Data Structures and Algorithms exam conducted in Nov 2021. Feel free to download the question paper from here and use it to prepare for your upcoming exams.

M.C.A. DEGREE EXAMINATIONS.No. 4320

P 20 MCA 3

(For candidates admitted from 2020–2021 onwards)

M.C.A. DEGREE EXAMINATION, NOVEMBER 2021.

Computer Applications

DATA STRUCTURES AND ALGORITHMS

Time : Three hours

Maximum : 75 marks

SECTION A — (10 × 2 = 20)

1.
Explain linear data structures with an example.

2.
Define Queue. Explain its operations.

3.
What is pre-order traversal?

4.
What is the purpose of non linear data structure?

5.
Define time and space complexity of an algorithm.

6.
What is Quick Sort?

7.
Define Spanning Tree.

8.
Differentiate Backtracking and Branch and Bound.

9.
What is multi stage graph?

10. Write short note on optimal binary search tree.

SECTION B — (5 × 5 = 25)

Answer ALL questions, choosing either (a) or (b)
in each.

11. (a) Explain in detail about Arrays.

Or

(b) What is a stack? Explain its operations with examples.

12. (a) Explain in detail about binary tree operations.

Or

(b) Write about AVL trees with example.

13. (a) Describe the recursive algorithms.

Or

(b) Explain quick sort algorithm in detail.

14. (a) Explain the knapsack problem using greedy method with algorithm.

Or

(b) Describe the concept of job sequencing with deadlines.

15. (a) Write a note on all pair shortest paths with an example.

Or

(b) Discuss the multi stage graph in detail.

SECTION C — (3 × 10 = 30)

16. Discuss in detail about array implementation of priority queue.

17. Describe the circular doubly linked list.

18. Explain merge sort with example.

19. Explain the minimum cost spanning tree. Write its application and also write the
algorithm for finding minimal spanning trees.

20. Explain the traveling salesman problem using branch and bound method.

### Related Question Papers:

• Bharathidasan University, M.A Degree Examination , History, Archives Keeping, Nov 2021.

• Bharathidasan University, M.A Degree Examination, History, Human Rights, Nov 2021.

• Bharathidasan University, M.Sc Degree Examination, Micro biology , General Biochemistry, Nov 2021.

• Bharathidasan University, M.com Degree Examination, Commerce, Retail Management, Nov 2021.

• Bharathidasan University, M.H.R.M Degree Examination, Organizational Behaviour, Nov 2021.

• ### Categories

Submit Previous Years University Question Papers and make money from adsense revenue sharing program

Are you preparing for a university examination? Download model question papers and practise before you write the exam.

Looking for University or College admissions in India for 2023 - 2024 Academic Year?

Top Contributors
TodayLast 7 Daysmore...