15CS56P: Design and Analysis of Algorithms Lab Computers 5th Sem Syllabus for Diploma DTE Karnataka C15 Scheme

Design and Analysis of Algorithms Lab detail DTE Kar Diploma syllabus for Computer Science And Engineering (CS), C15 scheme is extracted from DTE Karnataka official website and presented for diploma students. The course code (15CS56P), and for exam duration, Teaching Hr/week, Practical Hr/week, Total Marks, internal marks, theory marks, duration and credits do visit complete sem subjects post given below. The syllabus PDFs can be downloaded from official website.

For all other computers 5th sem syllabus for diploma c15 scheme dte karnataka you can visit Computers 5th Sem Syllabus for Diploma C15 Scheme DTE Karnataka Subjects. The detail syllabus for design and analysis of algorithms lab is as follows.

Pre-requisites:

Knowledge of Data Structures.

Course Objectives:

1. Write sorting programs using Divide-and-Conquer techniques.
2. Implement to find the minimum cost spanning tree and shortest path using different Greedy techniques.
3. Construct DFS, BFS programs and topological ordering using Decrease-and-Conquer technique.
4. Implement knapsack, travelling salesperson

Course Outcomes:

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

List of Graded Practical Exercises

1. Sort a given set of elements using the Quick sort method and determine the time required to sort the elements. Repeat the experiment for different values of n
2. Sort a given set of elements using merge sort method and determine the time required to sort the elements. Repeat the experiment for different of values of n
3. Write a program to obtain the topological ordering of vertices in a given digraph.
4. Implement travelling salesman problem.
5. Implement the knapsack problem (0/1).
6. Print all the nodes reachable from a given starting node in a digraph using BFS method.
7. Check whether a given graph is connected or not using DFS method.
8. Write a program to implement binary search using divide and conquer technique
9. Write a program to implement insertion sort using decrease and conquer technique
10. Find minimum cost spanning tree of a given undirected path using a Prim’s algorithm.
11. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra’s algorithm.

Note: Use any programming tools like C/Java/Python to execute the above exercises.

Reference Books:

1. Introduction to the Design and Analysis of Algorithms ,3rd edition, Anany Levitin, Pearson Publication, ISBN: 9789332583771

Suggested List of Student Activities:

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

Course Delivery:

The course will be delivered through Demonstration and Practices

Scheme of Valuation for End Examination

1. Record 05
2. Writing two programs 20
3. Execution of any one program 15
4. Viva Voce 10

**Evaluation should be based on the screen output only. No hard copy required.

**Change of question is allowed only once. Marks of 05 should be deducted in the given question.

Resource requirements for Design and Analysis of Algorithms Lab (For an Intake of 60 Students [3 Batches])

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.

For detail syllabus of all other subjects of BE Computers, C15 scheme do visit Computers 5th Sem syllabus for C15 scheme.

Dont forget to download iStudy Syllabus App for latest syllabus and results, class timetable and more.