Scribd
Upload
32 views1 page

Adsa Int2 QP

This document is an internal assessment test for a computer science course. It contains 3 parts with multiple choice and written answer questions. Part A has 10 multiple choice questions worth 2 marks each on topics like feasible solutions, greedy algorithms, dynamic programming, NP-hard and NP-complete problems. Part B has two long answer questions worth 14 marks each, one on dynamic programming and one on Huffman coding. Part C has two algorithm implementation questions worth 12 marks each, one applying Floyd's algorithm and one applying Dijkstra's algorithm to find shortest paths in graphs. The test assesses 3 course outcomes related to algorithm design and analysis of problem complexity.

Uploaded by

ninetaalice
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
32 views1 page

Adsa Int2 QP

This document is an internal assessment test for a computer science course. It contains 3 parts with multiple choice and written answer questions. Part A has 10 multiple choice questions worth 2 marks each on topics like feasible solutions, greedy algorithms, dynamic programming, NP-hard and NP-complete problems. Part B has two long answer questions worth 14 marks each, one on dynamic programming and one on Huffman coding. Part C has two algorithm implementation questions worth 12 marks each, one applying Floyd's algorithm and one applying Dijkstra's algorithm to find shortest paths in graphs. The test assesses 3 course outcomes related to algorithm design and analysis of problem complexity.

Uploaded by

ninetaalice
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
You are on page 1/ 1

MARTHANDAM COLLEGE OF ENGINEERING AND TECHNOLOGY

M.E. (Computer Science & Engineering) Degree Examinations


I Year – I Semester
INTERNAL ASSESSMENT TEST- II
Credit: Sub code & Sub name :CP4151-Advanced Datastructures and Algorithms R-2021
Date: SET – I Maximum marks: 60
Time: 9.30am Answer all the questions Duration: 1Hr. 45 Min.
Q. No. Part- A (10 x 2 = 20 Marks) Blo COs
1 Define feasible solution om’
RE CO4
2 Define Greedy algorithm RE CO4
3 Stae the general characteristics of greedy algorithm RE CO4
4 Difference between Greedy technique and dynamic programming RE CO4
5 Give any two properties of dynamic programming approach RE CO4
6 Define NP hard and NP completeness RE CO5
7 List any three problems that have polynomial time algorithm RE CO5
8 Write the properties of NP complete problem RE CO5
9 When a problem is said to be NP hard RE CO5
10 Define exact and approximation algorithm RE CO5
Part- B (14 x 2 = 28 Marks)
a) Explain Matrix chain multiplication using dynamic programming and analyse their efficiencies
AN CO4
(14)
11 (OR)
b)Apply Huffman coding algorithm and convert encoding and decoding technique
AP CO4
with an example (14)
a) Explain NP complete problems (14) UN CO5
12 (OR)
b) Compare the relationship between NP complete and NP hard problems (14) UN CO5
Part- C (12 x 1 = 12 Marks)
a)Apply Floyds algorithm and find shortest path in the graph using dynamic
AP CO3
programming. (12)
13 (OR)
b) Apply Dijikstra algorithm to find the shortest path in directed acyclic graph
AP CO3
(12)
The following course outcome are assessed: -
COURSE OUTCOME MARKS

CO3
Design algorithms using graph structure to solve real-life problems 12

CO4
Design one’s own algorithm for an unknown problem 24

CO5 24
Discuss about any NP completeness problem
Bloom’s level Keyword Marks
Remembering RE 20 Approved by
Prepared by
Understanding UN 32
Applying AP 32
Scrutinized by Analyzing AN 16
Evaluating EV
Creating CR
HOD/CSE
100
TOTAL
(Including Choices)

ACD/12 Issue No: 1 &Date: 01.10.06 Rev. No: 1 & Date: 18.03.2017

You might also like