Alagappa University Alagappa University, Distance Education, B.Sc Degree Examination, Data Structures and Algorithms,Dec 2020. model question papers

Posted Date: 20 Mar 2021      Posted By:: Jannane.M    Member Level: Gold  Points: 3 (₹ 2)

# 2020 Alagappa University B.Sc Computer Science (Honours) Alagappa University, Distance Education, B.Sc Degree Examination, Data Structures and Algorithms,Dec 2020. Question paper

 Course: B.Sc Computer Science (Honours) University/board: Alagappa University

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

D-4770

Distance Education

B.sc (Computer Science) Degree Examination, Dec 2020

DATA STRUCTURES AND ALGORITHMS

Time : Three Hours Maximum : 75 marks

PART A - (10×2=20 marks)

1. Define Time Complexity.

2. What is an array?

3. Define Queue.

4. What are the applications of stack?

5. Define the term tree.

6. What are the different types of Binary tree?

7. Define Linear search.

8. List out the uses of hashing techniques.

9. State the divide and conquer method.

10. Define Selection sort.

PART B - ( 5×5=25 marks)

Answer all questions choosing either (a) or (b)

11.a) Give detailed notes on primitive data types.

Or

b) List and explain about the different types of array.

12.a) Write an algorithm for stack operation.

Or

b) Compare the single and double linked list.

13.a) Write about the evaluation of expression polish notion.

Or

b) Give notes on Binary tree representation.

14.a) Write on algorithm binary search tree.

Or

b) Explain about Hashing technique in detail.

15.a) What is Radix sort? Explain

Or

b) Write an algorithm for merge sort.

PART C - ( 3×10=30 marks)

16. Define data structure.Briefly explain any one of its types.

17. Elaborate the circular queue data structure with its operation.

18. Explain about the insertion and deletion operation of binary tree.

19. Write down the procedures for in order ,pre order and post order traversals with an example.

20. Illustrate quick sort algorithm with an example.

### Related Question Papers:

• Alagappa University, Distance Education, B.A English Degree Examination, Victorian Literature, Third Semester, Dec 2020.

• Alagappa University, Distance Education, B.sc (Information Technology) Degree Examination, Internet and Java Programming, Third Semester, Dec 2020.

• Alagappa University, Distance Education, B.A History Degree Examination, History of Europe, Third Semester, Dec 2020.

• Alagappa University, Distance Education, B.com (CA) Degree Examination, Principles of C Programming, Third Semester, Dec 2020.

• Alagappa University, Distance Education, B.B.A. Degree Examination, Organisational Behaviour, Dec 2020.

• ### 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 2021 - 2022 Academic Year?

Top Contributors
TodayLast 7 Daysmore...