- Information
- AI Chat
Design-AND- Analysis-OF- Algorithms-2021.-bca question paper
Bachelor of Computer Applications (BCA2020)
Mahatma Gandhi University
Recommended for you
Students also viewed
- Cropyyyy
- Basic Statistics and Introductory Probability Theory,BCA 1st Semester
- Bca 3 sem advanced statistical methods 21100700 mar 2021
- Java Labcycle 4 - Simple(Basic) Java Programs with outputs for each.
- Java Labcycle 3 - Simple(Basic) Java Programs with outputs for each.
- Java Labcycle 1 - Simple(Basic) Java Programs with outputs for each.
Preview text
QP CODE: 21100809 Reg No : .....................
Name : .....................
B/BCA DEGREE (CBCS) EXAMINATION, MARCH 2021
Fourth Semester
Core Course - CS4CRT09 - DESIGN AND ANALYSIS OF ALGORITHMS
(Common for B Information Technology Model III, Bachelor of Computer Application) 2017 Admission onwards 78765EF Time: 3 Hours Max. Marks : 80 Part A Answer any ten questions. Each question carries 2 marks.
- What is space complexity?
- What is worst-case complexity?
- Describe binary search method.
- Describe the recurrence relation of mergesort.
- Discuss the part of partiitioning algorithm in quicksort algorithm.
- Write the control abstraction of the greedy strategy.
- What is spanning tree? Give example.
- What are the features of dynamic programming?
- What is 0/1 knapsack problem?
- List the applications of Travelling Sales Persons Problem.
- How do you determine the efficiency of Backtracking programs?
- What is graph coloring? (10×2=20) Part B Answer any six questions. Each question carries 5 marks.
21100809
Page 1/2 Turn Over
Explain the characteristics for an algorithm.
Briefly explain the different algorithm design techniques.
Discuss with justification that Strassen's Matrix Multiplication brings the improvement over the ordinary matrix multiplication.
State the Greedy Knapsack Problem.
Find an optimal solution to the knapsack instance n=7 objects and the capacity of knapsack m=15, (p1,p2,p3.)=(10,5,7,6,18,3) and (w1,w2,w3..) (2,3,5,7,1,4,1).
Explain multistage graph backward method with algorithm.
What is single source shortest path? Explain with algorithm.
Explain biconnected components and DFS.
Write a recursive algorithm to find all the hamilitonian cycles of a given graph. (6×5=30) Part C Answer any two questions. Each question carries 15 marks.
Explain in detail Algorithm performance analysis.
Explain the divide and conquer method. With an algorithm explain anyone application.
What is Minimum Cost Spanning tree? Explain the Prim's algorithm with suitable example.
Explain with alogrithm the breadth-first search and depth-first search graph traversal methods. (2×15=30)
Page 2/
Design-AND- Analysis-OF- Algorithms-2021.-bca question paper
Course: Bachelor of Computer Applications (BCA2020)
University: Mahatma Gandhi University
This is a preview
Access to all documents
Get Unlimited Downloads
Improve your grades
Why is this page out of focus?
Students also viewed
- Cropyyyy
- Basic Statistics and Introductory Probability Theory,BCA 1st Semester
- Bca 3 sem advanced statistical methods 21100700 mar 2021
- Java Labcycle 4 - Simple(Basic) Java Programs with outputs for each.
- Java Labcycle 3 - Simple(Basic) Java Programs with outputs for each.
- Java Labcycle 1 - Simple(Basic) Java Programs with outputs for each.