Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
5 views

DAA LAB SYllabus

Uploaded by

hdshb786
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
5 views

DAA LAB SYllabus

Uploaded by

hdshb786
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

Title of Subject: DAA LAB

COURSE CODE: 23MCA35 CIE Marks: 50


SEMESTER: III SEE Marks: 50
Contact Hours: (L:T:P): 0-0-4 Credit: 02 Duration of Exam:
03
Programs offer hands-on experience with various design and analysis of algorithms
and techniques.
1. Develop a program to perform binary search on a sorted array and
evaluate its time complexity.
2. Create functions to implement quicksort algorithms and compare their
efficiency on different datasets.
3. Create functions to implement merge sort algorithms and compare their
efficiency on different datasets.
4. Solve the job sequencing problem with deadlines using a greedy approach.
5. Implement algorithms to find minimum cost spanning trees.
6. Implement algorithms to find single-source shortest paths in a graph.
7. Develop dynamic programming solutions for 0/1 knapsack problem.
8. Solve the travelling salesperson problem using dynamic programming.
9. Implement backtracking algorithms to solve the n-queen problem.
10. Implement Hamiltonian Cycles in a connected undirected Graph G of n
vertices using the backtracking principle.

Scheme of Continuous Internal Evaluation Laboratory (CIE): 25 + 25 = 50


Conduction of laboratory exercises, Lab report & observation & analysis, Lab
Test: TWO LAB tests will be conducted. Each LAB test will be evaluated for 25
Marks.
Scheme of Semester End Examination (SEE) Laboratory for 50 marks:
SEE for practical will be jointly conducted and evaluated by two examiners. The
duration of practical examination is 3 hours and is evaluated for 50 marks. The
break up for conduction of practical examination is (i) Procedure and Write up :
20% of max marks, (ii) Conducting the
practical: 60% of max marks, (iii) Viva Voce: 20% of max marks

Title of Subject: DESIGN AND ANALYSIS OF


ALGORITHM
COURSE CODE: 23MCA31 CIE Marks: 50
SEMESTER: III SEE Marks: 50 Total Hours: 50
Contact Hours: (L:T:P): 4-0-0 Credit: 04 Duration of Exam:
03
Course Outcomes: At the end of the course, the student will be able to
1. Provide understanding of fundamental algorithmic concepts and analysis
techniques, including time and space complexity, and asymptotic notations.
2. Introduction to the greedy algorithmic technique and its applications in
optimization problems like job sequencing, knapsack, minimum spanning
trees, and shortest path problems.
3. Dynamic programming methodology for solving optimization problems such
as matrix chain multiplication, knapsack, shortest path, and travelling
salesperson problems.
4. Implement backtracking and branch and bound algorithms to solve
combinatorial optimization problems like n-queens, sum of subsets, graph
colouring, and Hamiltonian cycles.
5. Computational complexity theory by introducing NP-hard and NP-complete
problems, non-deterministic algorithms, and approximation algorithms for
effective problem-
solving.
MODULE – I: Introduction 10 Hours
Algorithm, analysis, time complexity and space complexity, O-notation, Omega
notation and Theta notation. Mathematical Analysis of Recursive and Non-recursive
methods.
Divide and Conquer: General Strategy, Binary Search, Quick Sort and Merge Sort
MODULE – II: Greedy method 10 Hours
General method, applications - Job sequencing with deadlines, knapsack problem,
Minimum
cost spanning trees, Single source shortest path problem.
MODULE – III: Dynamic Programming 10 Hours
General method, applications-Matrix chain multiplication, Optimal binary search
trees, 0/1 knapsack problem, All pairs shortest path problem, Travelling sales
person problem, Reliability
design.
MODULE – IV: Backtracking 10 Hours
General method, applications-n-queen problem, sum of subsets problem, graph
coloring, Hamiltonian cycles. Branch and Bound: General method, applications -
Travelling sales person problem,0/1 knapsack problem- LC Branch and Bound
solution, FIFO Branch and Bound
solution.
MODULE – V: NP-Hard and NP-Complete problems 10 Hours
Basic concepts, non-deterministic algorithms, NP - Hard and NP Complete
classes, Cook’s
theorem.
Text Books:
Author Names Name of the Text Books Editio Publisher
n
Ellis Horowitz, Fundamentals of Galgotia
-
Satraj Sahni, Computer Algorithms Publications
Rajasekharam Pvt.

You might also like