Scribd
Upload
68 views3 pages

Algorithms Modeexam Qp-Nba

The document is a model exam for an Algorithms course with 16 questions worth 100 marks. It is divided into 3 parts - Part A with 10 multiple choice questions worth 2 marks each, Part B with 2 long answer questions worth 13-15 marks each, and Part C with 2 long answer questions worth 15 marks each. The questions cover different topics related to algorithms like graph algorithms, sorting, dynamic programming, approximation algorithms, NP-complete problems, and analyze their time and space complexities. It also provides the course outcomes tested by each question and distribution of questions based on Bloom's taxonomy levels.

Uploaded by

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

Algorithms Modeexam Qp-Nba

The document is a model exam for an Algorithms course with 16 questions worth 100 marks. It is divided into 3 parts - Part A with 10 multiple choice questions worth 2 marks each, Part B with 2 long answer questions worth 13-15 marks each, and Part C with 2 long answer questions worth 15 marks each. The questions cover different topics related to algorithms like graph algorithms, sorting, dynamic programming, approximation algorithms, NP-complete problems, and analyze their time and space complexities. It also provides the course outcomes tested by each question and distribution of questions based on Bloom's taxonomy levels.

Uploaded by

ragunath
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

REGISTER NUMBER

NELLIANDAVAR INSTITUTE OF TECHNOLOGY , PUDHUPALAYAM


DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
MODEL EXAM
COURSE CODE &TITLE: CS3401-ALGORITHMS DURATION:3 HOURS
MARKS : 100 SEM : IV DATE: 23 -05-2023

BT
Q.NO. QUESTION M CO
LEVEL
A
R
K
S
PART - A
1 Give the Euclid algorithm for computing gcd(m, n). 2 CO1 BT1
2 Write the recursive Fibonacci algorithm and its recurrence relation. 2 CO1 BT2
3 Define the single source shortest paths problems 2 CO2 BT1
4 What is maximum cardinality matching? 2 CO2 BT2
5 Define multistage graphs. Give an example 2 CO3 BT1
6 Devise an algorithm to make for 1655 using the greedy strategy. the coins 2 CO3 BT3
available are {1000,500,100,50,20,10,5}
7 What are the factors that influence the efficiency of the backtracking 2 CO4 BT1
algorithm?
8 Give a template for a generic backtracking algorithm. 2 CO4 BT2
9 Define P and NP problems 2 CO5 BT2
10 What do you mean by primality testing? 2 CO5 BT2
PART- B
11.a) (i)Prove that if g(n) is Ω(f(n)) then f(n) is O(g(n)). (5) 5 CO1 BT5

(ii) Discuss various methods used for mathematical analysis of recursive 8 CO1 BT1
11.a) algorithms.
OR
(i)Find the time complexity and space complexity of the following problems.
Factorial using recursion and Compute nth Fibonacci number using Iterative 6 CO1 BT3
11.b) statements.
11.b) (ii) Solve the following recurrence relations:
1)T(n) = { 2 2T ( n 2 ) + 3n > 2 n = 2 7 CO1 BT3
2)T(n) = { 2T ( n 2 ) + cn n > 1 a n = 1 Where a and c are constants.

i)Write an algorithm for all pairs shortest path algorithm and what are the time
12. a) and space complexity of the algorithm 5 CO2 BT2

12. a) ii)Explain Floyd algorithm with example. Write down and explain the
algorithm to solve all pairs shortest paths problem
8 CO2 BT3

OR
i)Explain Dijkstra’s algorithm using the following graph. Find the
12.b) shortest path between v1, v2, v3, v4, v5, v6 & v7 6 CO2 BT3
V1 V2
4 1 3 10
V3 2 V4 7 V5
5 8 4 6
V6 V7
12.b) ii)Determine the max-flow in the following network.
7 CO2 BT6

13.a) i)Define divide and conquer to apply the technique in binary search algorithm BT1
and to analysis it 8 CO3
13.a) ii)Distinguish between Quick sort and Merge sort, and arrange the following 5 CO3 BT2
numbers in increasing order using merge sort. (18, 29, 68, 32, 43, 37, 87, 24, 47,
50)
OR
i)Write the Huffman’s Algorithm. Construct the Huffman’s tree for the
13.b) following data and obtain its Huffman’s Code.
Characters A B C D E -
1 CO3
_ 3 BT3
Probability 0.5 0.35 0.5 0.1 0.4 0.2

14.a) i)write a recursive backtracking algorithm to find al the hamiltonien cycles of a


given graph. 8 CO4 BT3
14.a) ii)Explain graph cooring in detail with an example 5 CO4 BT2
OR
14.b) i) using backtracking find the optimal solution to a knapsack problem for the 1 CO4 BT4
knapsack instance n=8,m=110.(p1….p7)=11,21,31,33,43,53,55,65. 3
(w1….w7)=1,11,21,33,43,53,55,65.
15.a) Elaborate on the nearest-neighbor algorithm and multi fragment-heuristic 13 CO5 BT2
algorithm for TSP.
OR
15.b) Discuss the approximation algorithm for NP-had problem 13 CO5 BT2
PART- C
Write an algorithm to solve the travelling salesman problem and prove that it
16.a) is a time approximation algorithm. 15 CO4 BT6
OR
16.b) Write the algorithm for quick sort. Provide a complete analysis of quick sort 15 CO3 BT6
for the given set of numbers 12,33,23,43,44,55,64,77 and 76.
COURSE OUTCOMES:
SL.NO QUESTION NUMBER CO'S
1 1,2,11a(i),11a(ii),11b(i),11b(ii) CO1
2 3,4,12a(i),12a(ii),12b(i)12b(ii) CO2
3 5,6,13a(i),13a(ii),13b,16b CO3
4 7,8,14a(i),14a(ii),14b CO4
5 9,10,15a,15b15b,16a CO5
BLOOM’S TAXONOMY:
BT1-Remember, BT2- Understand , BT3 –Apply, BT4- Analyze, BT5-Evaluate, BT6 - Create
Level BT1 BT2 BT3 BT4 BT5 BT6
Percentage 21% 36% 24% 4% 4% 11%

COURSE INSTUCTOR HOD PRINCIPAL

You might also like