Download Model question papers & previous years question papers
Submit Previous Years University Question Papers
Posted Date: 18 Jan 2021 Posted By:: Jannane.M Member Level: Gold Points: 3 (₹ 2)
2020 Computer Bharathidasan University,B.C.A. Degree Examination,Data Structure and Algorithms,Fifth Semester,Nov 2020. Question paper
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,Fifth Semester exam conducted in Nov 2020. Feel free to download the question paper from here and use it to prepare for your upcoming exams.
S.No. 15126 D 16SCCCA5/16SCCCS5/16SCCIT5
(For Candidates admitted from 2016-17 onwards)
B.C.A DEGREE EXAMINATION, NOV 2020.
Part III - Computer Applications/Computer Science/Information Technology
DATA STRUCTURES AND ALGORITHMS
Time : Three Hours Maximum: 75 marks
SECTION A - (10×2=20)
Answer all questions
1. Where can insert and delete an element at queue?
2. Define Singly linked list.
3. What is a tree data structure?
4. What is a spanning tree?
5. List out any Two sorting techniques. Write the purpose of sorting an element.
6. What is an algorithm?What is algorithm used for?
7. What is meant by feasible solution?
8. What is meant by optimal merge patterns?
9. Define Backtracking?
10. What is meant by graph colouring?
SECTION B - (5×5=25)
Answer all questions choosing either (a) or (b)
11.a) Implement typical multiple stack operation when stacks are represented using array.
b) Describe the static and dynamic representation of linked list.
12.a) Explain briefly the in order and pre orde traversal with diagram.
b) What is a graph? How a graph is represented. Explain directed graph with example.
13.a) Describe the steps in Quick sort algorithm with example.
b) Describe the binary search algorithm with example.
14.a) Describe the general characteristics of greedy algorithm.
b) Explain briefly the job sequencing with deadline problem.
15.a) Explain briefly the back track programming with example.
b) Explain subset-sum problem and discuss the possible solution strategies using back tracking.
SECTION C - (3×10=30)
Answer any Three questions out of Five questions.
16.Explain the step by step addition of 2 polynomials using linked list.
17.Explain the following
a) Connected components and spanning trees
b) Shortest path and transitive closure
18. Write the algorithm to find the minimum and maximum elements of the given set of numbers.Discuss it's performance.
19. Discuss the greedy algorithm for knapsack problem in detail.
20. What is backtracking in 8 Queen problem?Explain the all solutions in 8 Queen problem.
Return to question paper search
Related Question Papers:
Bharathidasan University, B.C.A Degree Examination, Digital Computer Fundamentals,Fifth Semester, Nov 2020
Bharathidasan university, B.C.A Degree Examination, Soft Skills Development, Nov 2020
Bharathidasan university, B.C.A Degree Examination, Office Management Tools, Nov 2020
Bharthidhasan University, Computerised accounting, B.com (C.A)degree Examination, Sixth semester, April 2019.
Bharthidhasan University,Computerised accounting,B.com(C.A) degree Examination, Sixth semester, April 2018.
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.