Scribd
Upload
5 views

23CS312 Syllabus

Uploaded by

saranya.cse
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views

23CS312 Syllabus

Uploaded by

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

23CS31 DESIGN AND ANALYSIS OF ALGORITHMS L T P C

2 3 0 2 4
COURSE OBJECTIVES:
 To understand and apply the algorithm analysis techniques on
searching and sorting algorithms
 To critically analyze the efficiency of graph algorithms
 To understand different algorithm design techniques
 To solve programming problems using state space tree
 To understand the concepts behind NP Completeness, Approximation
algorithms and randomized algorithms

UNIT I INTRODUCTION 9
Time and space complexity - Asymptotic Notations – Solving
Recurrences: substitution method - Lower bounds - hash function -
searching: linear search, binary search and Interpolation Search, String
Matching: The naïve string - matching algorithm - Rabin-Karp algorithm
- Sorting: Insertion sort, heap sort

UNIT II GRAPH ALGORITHMS 9


Representations of graphs - Graph traversal: DFS - BFS - Minimum
spanning tree: Kruskal’s and Prim’s algorithm - Shortest path: Bellman -
Ford algorithm - Dijkstra’s algorithm - Maximum flow: Flow networks -
Ford-Fulkerson method - Maximum bipartite matching.

UNIT ADVANCED DESIGN AND ANALYSIS 9


III TECHNIQUES
Divide and Conquer methodology: Merge sort - Quick sort- Dynamic
programming: Elements of dynamic programming - Matrix-chain
multiplication - Multi stage graphs. Greedy Technique: Elements of the
greedy strategy - Activity-selection problem - Huffman Trees

UNIT STATE SPACE SEARCH ALGORITHMS 9


IV
Backtracking : n-Queens problem - Hamiltonian Circuit Problem - Subset
Sum Problem - Graph colouring problem Branch and Bound : Solving
15-Puzzle problem - Assignment problem - Knapsack Problem -
Travelling Salesman Problem.

UNIT V NP-COMPLETE AND APPROXIMATION 9


ALGORITHM
Tractable and intractable problems: Polynomial time algorithms - Venn
diagram representation – Non Deterministic algorithms - NP-hardness
and NP-completeness - Problem reduction: TSP - 3 CNF problem.
Approximation Algorithms: Bin Packing problem - Randomized
Algorithms: concept and application - primality testing - randomized
quick sort.
TOTAL: 45
PERIODS

PRACTICAL EXERCISES: 30 PERIODS


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, the number of elements in
the list to be sorted. The elements can be read from a file or can
be generated using the random number generator.
2. Implement a Merge Sort algorithm to sort a given set of elements
and determine the time required to sort the elements. Repeat the
experiment for different values of n, the number of elements in
the list to be sorted. The elements can be read from a file or can
be generated using the random number generator.
3. (A) Obtain the Topological ordering of vertices in a given digraph.
(B) Compute the transitive closure of a given directed graph using
Warshall's algorithm.
4. Implement 0/1 Knapsack problem using Dynamic Programming.
5. From a given vertex in a weighted connected graph, find shortest
paths to other vertices using Dijikstra’s algorithm
6. Find Minimum Cost Spanning Tree of a given undirected graph
using Kruskal’s algorithm.
7. (A) Print all the nodes reachable from a given starting node in a
digraph using BFS method. (B) Check whether a given graph is
connected or not using DFS method.
8. Find a subset of a given set S = {s1, s2,….., sN} of n positive
integers whose sum is equal to a given positive integer d. For
example, if S= {1, 2, 5, 6, 8} and d = 9 there are two solutions
{1,2,6}and{1,8}.A suitable message is to be displayed if the
given problem instance doesn't have a solution.
9. Implement any scheme to find the optimal solution for the
Traveling Salesperson problem and then solve the same problem
instance using any approximation algorithm and determine the
error in the approximation.
10. Find Minimum Cost Spanning Tree of a given undirected graph
using Prim’s algorithm.
11. Implement All-Pairs Shortest Paths Problem using Floyd's
algorithm.
12. Implement N Queen's problem using Back Tracking
COURSE OUTCOMES:
At the end of the course the students will be able to
CO1: Apply first law of thermodynamics to solve problems
related to open and closed systems
CO2: Apply the second law of thermodynamics to Engineering
devices.
CO3: Estimate the efficiency and performance of various air
standard cycles
CO4: Determine efficiency and performance of vapor power cycle.
CO5: Calculate thermodynamics problems related to
conduction, convention and radiation
CO6: Determine the jet engine performance by applying
thermodynamics properties.

You might also like