Scribd
Upload
21 views2 pages

Continuous Evaluation Sheet - DAA

The document outlines the continuous and comprehensive evaluation for a Design and Analysis of Algorithm course. It lists 12 programming assignments on algorithm topics and provides a table to record student marks for classwork, lab notebooks, submissions and viva exams.

Uploaded by

prajwalhiremath1357
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
21 views2 pages

Continuous Evaluation Sheet - DAA

The document outlines the continuous and comprehensive evaluation for a Design and Analysis of Algorithm course. It lists 12 programming assignments on algorithm topics and provides a table to record student marks for classwork, lab notebooks, submissions and viva exams.

Uploaded by

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

S. S.

Education Trust’s CET Code: E-175 (UG)/T-942 (PG)


S. G. BALEKUNDRI INSTITUTE OF TECHNOLOGY
Shivabasavanagar, Belagavi- 590 010, Karnataka- India
Office: 0831-2407172, 2554559 Fax: 0831-2407152 Website: www.sgbit.edu.in
Department of Computer Science & Engineering
1SO 21001:2018
(Accredited by NBA)
certified institute Email: [email protected], Dept. Extn.: 532

CONTINUOUS AND COMPREHENSIVE EVALUATION[CCE] [2023-2024]


Design and Analysis of Algorithm (BCS401) IV-SEM (B)
USN Name of the Student
Attendance Journal Marks
and Result and Total
SN Laboratory Date Observation In-time Late Viva 30(CA) Staff
Notebook submission submission 10 Marks Marks Sign
10 Marks 07 Marks 03 Marks
Program to find Minimum Cost
1 Spanning Tree of a given connected
undirected graph using Kruskal's
algorithm
Program to find Minimum Cost
Spanning Tree of a given connected
2 undirected graph using Prim's
algorithm.
a. Program to solve All-Pairs
3 Shortest Paths problem using
Floyd's algorithm
b. Program to find the transitive
closure using Warshal's algorithm
Program to find shortest paths from a
given vertex in a weighted connected
4 graph to other vertices using Dijkstra's
algorithm.
Program to obtain the Topological
5 ordering of vertices in a given digraph.
Program to solve 0/1 Knapsack
6 problem using Dynamic Programming
method
Program to solve discrete Knapsack
7 and continuous Knapsack problems
using greedy approximation method.
Program to find a subset of a given set
8 S = {sl , s2,.....,sn} of n positive
integers whose sum is equal to a given
positive integer d
Program to sort a given set of n integer
9
elements using Selection Sort method
and compute its time complexity.
Program to sort a given set of n integer
10
elements using Quick Sort method and
compute its time complexity
Program to sort a given set of n integer
11
elements using Merge Sort method and
compute its time complexity
Program for N Queen's problem using
12
Backtracking
Average CE marks (30 M)
LAB Test marks (20 M)
Total LAB Marks (50 M) = Average CE marks (30 M) + IA Test (20M)

Course In charge

Prof. Magalwade/Neha Mysore

You might also like