Scribd
Upload
10 views2 pages

Internal Assessment on Algorithms for CSE

This document outlines the internal assessment for the fourth semester B.E Computer Science and Engineering course on Design and Analysis of Algorithms. It includes course outcomes, a breakdown of questions in three parts, and specifies the knowledge and course outcome levels for each question. The assessment covers various algorithmic concepts such as Divide and Conquer, Quick Sort, Knapsack Problem, and more.

Uploaded by

priya
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views2 pages

Internal Assessment on Algorithms for CSE

This document outlines the internal assessment for the fourth semester B.E Computer Science and Engineering course on Design and Analysis of Algorithms. It includes course outcomes, a breakdown of questions in three parts, and specifies the knowledge and course outcome levels for each question. The assessment covers various algorithmic concepts such as Divide and Conquer, Quick Sort, Knapsack Problem, and more.

Uploaded by

priya
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Register Number:……………..

CHRIST THE KING ENGINEERING COLLEGE


INTERNAL ASSESSMENT-I
(Regulation 2017)
Fourth Semester
B.E COMPUTER SCIENCE AND ENGINEERING
CS8451 – Design and Analysis of Algorithms
COURSE OUTCOMES
CO1: To understand and apply the algorithm analysis techniques.
CO2: To understand and apply the algorithm analysis techniques.
CO3: To critically analyze the efficiency of alternative algorithmic solutions for the same problem
CO4: To understand different algorithm design techniques.
CO5: To understand the limitations of Algorithmic power.
Time: Three Hours Maximum Marks: 100
Answer all the Questions:-
PART A (10 x 2 = 20 Marks)
(Answer not more than 40 words)
1. Write the Brute force algorithm to string matching Algorithm (Text, Pattern) CO2 [K1]
2. What is exhaustive search CO2 [K1]
3. Give the General Plan for Divide and Conquer Algorithms CO2 [K1]
4. What is Knapsack problem? CO2 [K1]
5. What is the quick sort and write the analysis for the quick sort. CO2 [K1]
6. Write about traveling salesperson problem. CO2 [K1]
7. State the Principle of Optimality CO2 [K1]
8. What does Floyd’s Algorithm do? CO3 [K1]
9. State the Assignment Problem CO3 [K2]
10. Define digraph and adjacency matrix by one example CO3 [K1]

Answer any FIVE Questions


PART B (5 x 13 = 65 Marks)
(Answer not more than 400 words)
11. a) Explain Divide and Conquer Method with one example . (13) CO2 [K2]
(OR)

b) Explain Merge Sort with suitable example. (13) CO2 [K2]


12. a) Discuss Quick Sort Algorithm and Explain it with example. Derive Worst (13) CO2 [K2]
case and Average

PAGE 1 OF 2
Case Complexity.
(OR)

b) Explain in detail about Travelling Salesman Problem using exhaustive search (13) CO2 [K2]

13. a) Explain in detail about Knapsack Problem. (13) CO2 [K2]

(OR)

b) Write algorithm to find closest pair of points using divide and conquer and (13) CO2 [K2]
explain it with example. Derive the worst case and average case time
complexity.

14. a) What is Convex hull problem? Explain the brute force approach to solve (13) CO2 [K2]
convex-hull with an example. Derive time complexity.
(OR)

b) construct the heap sort for the following nodes 5,16,22,45,10,18,30,50,12,1 (13) CO2 [K2]
15. a) Explain in detail about Binary search tree with one example (13) CO3 [K2]

(OR)

b) Given coins of denomination 2,4 and 5 with amount to be pay is 7. Find (13) CO3 [K2]
optimal number of coins and sequence of coin used to pay given amount
using dynamic method
Answer any ONE Questions
PART C (1x15=15 marks)
16. a) Explain in detail about warshall and Floyd's algorithm with one example. (15) CO3 [K2]

************

Please indicate knowledge level (K1toK6) and Course Outcome level (CO1 to CO5)
against each question for each subdivision.

PAGE 2 OF 2

You might also like