Scribd
Upload
4 views2 pages

Alg Blooms

The document outlines the internal assessment tests for the Algorithms course at Ganesh College of Engineering, detailing the structure and content of two assessments. Each test consists of multiple-choice questions and descriptive questions, focusing on algorithm analysis, graph algorithms, and specific algorithms like Dijkstra's and Kruskal's. The assessments are designed to evaluate students' understanding and application of algorithm concepts, with a total of 50 marks for each test.

Uploaded by

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

Alg Blooms

The document outlines the internal assessment tests for the Algorithms course at Ganesh College of Engineering, detailing the structure and content of two assessments. Each test consists of multiple-choice questions and descriptive questions, focusing on algorithm analysis, graph algorithms, and specific algorithms like Dijkstra's and Kruskal's. The assessments are designed to evaluate students' understanding and application of algorithm concepts, with a total of 50 marks for each test.

Uploaded by

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

GANESH COLLEGE OF ENGINEERING GANESH COLLEGE OF ENGINEERING

Department of computer science Engineering Department of computer science Engineering


Internal Assessment Test – I Internal Assessment Test – II
Year/ Semester: II/IV Time : 1½ hrs Date: Max. Mark: 50 Year/ Semester: II/IV Time : 1½ hrs Date: Max. Mark: 50
Subject Code/ Title: CS3401/ALGORITHMS Subject Code/ Title: CS3401/ALGORITHMS
CO1: To understand and apply algorithm analysis. CO1: To understand and apply algorithm analysis.
CO2: To analyse the efficiency of graph algorithm. CO2: To analyse the efficiency of graph algorithm.

ANSWER ALL QUESTIONS ANSWER ALL QUESTIONS


PART A (10 x 2=20) PART A (10 x 2=20)
S.NO QUESTIONS MARK S.NO QUESTIONS MARK
1. Define time complexity of an algorithm CO1 K1 2 1. Define time complexity of an algorithm CO3 K2 2
2. List the types of asymptotic notations in CO1 K1 2 2. List the types of asymptotic notations in CO3 K1 2
analysing complexity of algorithms. analysing complexity of algorithms.
. .
3. Define recursion relation. CO1 K1 2 3. Define recursion relation. CO3 K2 2
4. Discuss the time and space complexity of CO1 K2 2 4. Discuss the time and space complexity of CO3 K1 2
Insertion sort. Insertion sort.
5. Explain about knuth-morris-pratt Algorithm. CO1 K2 2 5. Write about knuth-morris-pratt Algorithm. CO3 K2 2
6. State the minimum spanning tree. CO2 K1 2 6. State the minimum spanning tree. CO4 K1 2
7. Define bipartite graph. CO2 K1 2 7. Define bipartite graph. CO4 K1 2
8. List the data structures that are used for CO2 K1 2 8. List the data structures that are used for CO4 K1 2
representing graphs representing graphs
9. Identify the strongly connected graph.. CO2 K2 2 9. Identify the strongly connected graph.. CO4 K2 2
10. Define dijkstra’s algorithm CO2 K1 2 10. Discuss about dijkstra’s algorithm CO4 K2 2
ANSWER ALL QUESTIONS ANSWER ALL QUESTIONS
PART B (3x10=30) PART B (3x10=30)
S.NO QUESTIONS MARK S.NO QUESTIONS MARK
11. a)Explain an algorithm to perform linear CO1 K2 10 11. a)Explain an algorithm to perform linear CO1 K2 10
search on an array of 'N numbers. search on an array of 'N numbers.
Illustrate the best case, average case and Illustrate the best case, average case and
worst case complexity of the linear search worst case complexity of the linear search
algorithm with an example. algorithm with an example.
(OR) (OR)
b)Examine a naive string matching CO1 K4 10 b)Explain naive string matching algorithm CO1 K4 10
algorithm with an example. with an algorithm.
12. a)Investigate about Kruskal and prim’s CO2 K6 10 12. a) Investigate about Kruskal and prim’s CO2 K6 10
algorithm with an example. algorithm with an example
(OR) (OR)
b)Demonstrate and explain the pseudo CO2 K3 10 b) Demonstrate and explain the pseudo CO2 K3 10
code for floyd warshall algorithm . code for floyd warshall algorithm .

13 a)examine about the asymptotic notation CO1 K4 10 13 a)examine about the asymptotic notation CO1 K4 10
and its properties and its properties
(OR) (OR)
b)Discuss about dijikstras algorithm with CO2 K1 10 b)Discuss about dijikstras algorithm with CO2 K1 10
an example an example

LOTS (40%) HOTS (60%) LOTS (40%) HOTS (60%)


Bloom’s Remember Understanding Applying Analyzing Evaluating Creating Total Bloom’s Remember Understanding Applying Analyzing Evaluating Creating Total
ing (K1) (K2) (K3) (K4) (K5) (K6) ing (K1) (K2) (K3) (K4) (K5) (K6)

Percentage 15 25 25 22.5 - 12.5 100 Percentage 15 25 25 22.5 - 12.5 100

Subject-Staff QP Coordinator HOD Director-IQAC Principal Subject-Staff QP Coordinator HOD Director-IQAC Principal

You might also like