Scribd
Upload
8 views2 pages

Algorithm It 2 QP

The document outlines the structure of an internal exam for the Department of Computer Science and Engineering at Arunachala College of Engineering for Women. It includes two parts: Part A consists of nine short answer questions worth 2 marks each, and Part B contains three detailed questions worth 14 marks each with options. The questions cover various topics in algorithms, including dynamic programming, greedy techniques, graph coloring, and optimization problems.

Uploaded by

Amudaria
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
8 views2 pages

Algorithm It 2 QP

The document outlines the structure of an internal exam for the Department of Computer Science and Engineering at Arunachala College of Engineering for Women. It includes two parts: Part A consists of nine short answer questions worth 2 marks each, and Part B contains three detailed questions worth 14 marks each with options. The questions cover various topics in algorithms, including dynamic programming, greedy techniques, graph coloring, and optimization problems.

Uploaded by

Amudaria
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/ 2

ARUNACHALA COLLEGEOF ENGINEEERING FOR WOMEN

MANAVILAI, VELLICHANTHAI- 629 203


DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
INTERNAL EXAM – II

Class: II CSE A & B Total Marks: 60


Subject Name &Code: ALGORITHMS /CS3401
PART A (9*2=18)

Course Cognitive
Q.No Questions
Outcome Level
1 CO1 K1 Differentiate Dynamic Programming and Greedy Technique
2 CO1 K1 Write about optimal merge pattern.
3 CO1 K1 What are the elements of Greedy Strategy.
4 CO2 K1 Differentiate backtracking and Branch and Bound
5 CO2 K1 Write the algorithm for graph coloring
6 CO2 K1 Define subset sum problem
7 CO3 K1 Define tractable and intractable problem.
8 CO3 K1 Write about decision algorithm and Optimization algorithm.
9 CO3 K2 Differentiate P-class and NP-class
PART B (3*14=42)

Course Cognitiv
Q.No Questions
Outcome e Level
10.a) CO1 K2 Explain briefly about Multistage Graph in detail. (14)
(OR)
b) CO1 K2 i) Explain in detail about Activity-selection problem? (7)
ii)Discuss about Huffman Trees with example (7)
11.a) CO2 K2 Explain in detail about Hamiltonian circuit problem with example
(14)

(OR)
b) CO2 K2 Explain in detail about Assignment problem and solve it(14)
12.a) CO3 K2 Explain in detail about Bin Packing Problem (14)

( OR)
b) CO3 K2 Explain in detail about Approximation algorithm. (14)

You might also like