Ref:

NELLIANDAVARINSTITUTE OF TECHNOLOGY
PUDHUPALAYAM, ARIYALUR-621704
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Revision:
COURSE PLAN
Date:

Name of the Course Instructor: S.RAJESHWARI Class: II CSE

Course Code & Name: CS3401&ALGORITHMS Semester: IV

VISION of NAIT MISSON of NAIT

 Our vision is to mould the  To build a strong centre of learning
youngsters to acquire sound and research in engineering and
knowledge in technical and technology.
scientific fields to face the future  To facilitate the youth to learn and
challenges by continuous up imbibe discipline, culture and
gradation of all resources and spirituality
processes for the benefit of  To produce quality engineers,
humanity. dedicated scientists and leaders.
 To encourage entrepreneurship.
To face the challenging needs of
the global industries
PART-I

DEPARTMENT VISION DEPARTMENT MISSON

 To produce highly competent and  To impart quality education by
innovative computer professionals to creative teaching learning process.
meet the global demands  To be technically competent,
ethical and socially responsible
throughout the professional career.
 To inculcate leadership qualities
and entrepreneurship culture to
meet the global standards.

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Program Educational Objectives:

The Program Educational Objectives of the Computer Science andEngineering Degree

Program
Apply their technical competence in computer science to solve real world problems,
PEO 1
with technical and people leadership
 PEO 2 Conduct cutting edge research and develop solutions on problems of social relevance
Work in a business environment, exhibiting team skills, work ethics, adaptability and
PEO 3
lifelong learning.

PROGRAM OUTCOMES:

PO’S PROGRAM OUTCOMES

PO1 Engineering knowledge:Apply the knowledge of mathematics, science, engineering

fundamentals, and engineering specialization to the solution of complex engineering problems.
PO2 Problem analysis: Identify, formulate, review research literature, and analyze
complexengineering problems reaching substantiated conclusions using first principles
ofmathematics, natural sciences, and engineering sciences
PO3 Design / development of solutions: Design solutions for complex engineering
problems and design systemcomponents or processes that meet the specified needs
with appropriateconsideration for the public health and safety, and the cultural,
societal, andenvironmental considerations.
PO4 Conduct investigations of complex problems:Use research-based knowledge and research
methods including design ofexperiments, analysis and interpretation of data, and synthesis of the
information toprovide valid conclusions.
PO5 Modern tool usage:Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex engineeringactivities
with an understanding of the limitations.
PO6 The engineer and society: Apply reasoning informed by the contextual knowledge to assess
societal,health, safety, legal and cultural issues and the consequent responsibilities relevant
to the professional engineering practice.
PO7 Environment and sustainability: Understand the impact of the professional engineering
solutions in societaland environmental contexts, and demonstrate the knowledge of, and need
forsustainable development.
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilitiesand norms
of the engineering practice.
PO9 Individual and team work:Function effectively as an individual, and as a member or leader in
diverseteams, and in multidisciplinary settings.
PO10 Communication:Communicate effectively on complex engineering activities with the
engineeringcommunity and with society at large, such as, being able to comprehend and
writeeffective reports and design documentation, make effective presentations, and giveand
receive clear instructions
PO11 Project management and finance:Demonstrate knowledge and understanding of the engineering
andmanagement principles and apply these to one’s own work, as a member and leaderin a team,
to manage projects and in multi-disciplinary environments.
PO12 Life- long learning:Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.
PROGRAMME SPECIFIC OUTCOMES:
PSO 1: Exhibit design and programming skills to build and automate business solutions using
cutting edge technologies.
PSO 2 Strong theoretical foundation leading to excellence and excitement towards research, to
provide elegant solutions to complex problems.
PSO 3 Ability to work effectively with various engineering fields as a team to design, build and
develop system applications.

PART-II
CS3401 ALGORITHMS

Ref:
NELLIANDAVARINSTITUTE OF TECHNOLOGY
PUDHUPALAYAM, ARIYALUR-621704
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Revision:
COURSE PLAN
Date:

Name of the Course Instructor: S.RAJESHWARI Class: II CSE

Course Code & Name: CS3401& Semester: IV

VISION of NAIT MISSON of NAIT

 Our vision is to mould the  To build a strong centre of learning
youngsters to acquire sound and research in engineering and
knowledge in technical and technology.
scientific fields to face the future  To facilitate the youth to learn and
challenges by continuous up imbibe discipline, culture and
gradation of all resources and spirituality
processes for the benefit of  To produce quality engineers,
humanity. dedicated scientists and leaders.
 To encourage entrepreneurship.
To face the challenging needs of
the global industries
PART-I
DEPARTMENT VISION DEPARTMENT MISSON
 To produce highly competent and  To impart quality education by
innovative computer professionals to creative teaching learning process.
meet the global demands  To be technically competent,
ethical and socially responsible
throughout the professional career.
 To inculcate leadership qualities
and entrepreneurship culture to
meet the global standards.
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Program Educational Objectives:

The Program Educational Objectives of the Computer Science andEngineering Degree

Program
Apply their technical competence in computer science to solve real world problems,
PEO 1
with technical and people leadership
PEO 2 Conduct cutting edge research and develop solutions on problems of social relevance
Work in a business environment, exhibiting team skills, work ethics, adaptability and
PEO 3
lifelong learning.

PROGRAM OUTCOMES:

PO’S PROGRAM OUTCOMES

PO1 Engineering knowledge:Apply the knowledge of mathematics, science, engineering

fundamentals, and engineering specialization to the solution of complex engineering problems.
PO2 Problem analysis: Identify, formulate, review research literature, and analyze
complexengineering problems reaching substantiated conclusions using first principles
ofmathematics, natural sciences, and engineering sciences
PO3 Design / development of solutions: Design solutions for complex engineering
problems and design systemcomponents or processes that meet the specified needs
with appropriateconsideration for the public health and safety, and the cultural,
societal, andenvironmental considerations.
PO4 Conduct investigations of complex problems:Use research-based knowledge and research
methods including design ofexperiments, analysis and interpretation of data, and synthesis of the
information toprovide valid conclusions.
PO5 Modern tool usage:Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex engineeringactivities
with an understanding of the limitations.
PO6 The engineer and society: Apply reasoning informed by the contextual knowledge to assess
societal,health, safety, legal and cultural issues and the consequent responsibilities relevant
to the professional engineering practice.
PO7 Environment and sustainability: Understand the impact of the professional engineering
solutions in societaland environmental contexts, and demonstrate the knowledge of, and need
forsustainable development.
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilitiesand norms
of the engineering practice.
PO9 Individual and team work:Function effectively as an individual, and as a member or leader in
diverseteams, and in multidisciplinary settings.
PO10 Communication:Communicate effectively on complex engineering activities with the
engineeringcommunity and with society at large, such as, being able to comprehend and
writeeffective reports and design documentation, make effective presentations, and giveand
 receive clear instructions
PO11 Project management and finance:Demonstrate knowledge and understanding of the engineering
andmanagement principles and apply these to one’s own work, as a member and leaderin a team,
to manage projects and in multi-disciplinary environments.
PO12 Life- long learning:Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.

PROGRAMME SPECIFIC OUTCOMES:

PSO 1: Exhibit design and programming skills to build and automate business solutions using
cutting edge technologies.
PSO 2 Strong theoretical foundation leading to excellence and excitement towards research, to
provide elegant solutions to complex problems.
PSO 3 Ability to work effectively with various engineering fields as a team to design, build and
develop system applications.

PART-II
CS3401 ALGORITHMS

UNIT I INTRODUCTION 9
Algorithm analysis: Time and space complexity - Asymptotic Notations and its properties Best case,
Worst case and average case analysis – Recurrence relation: substitution method - Lower bounds –
searching: linear search, binary search and Interpolation Search, Pattern search: The naïve string-
matching algorithm - Rabin-Karp algorithm - Knuth-Morris-Pratt algorithm. Sorting: Insertion sort –
heap sort
UNIT II GRAPH ALGORITHM
9
Graph algorithms: Representations of graphs - Graph traversal: DFS – BFS - applications
- Connectivity, strong connectivity, bi-connectivity - Minimum spanning tree: Kruskal’s
and Prim’s algorithm- Shortest path: Bellman-Ford algorithm - Dijkstra’s algorithm -
Floyd-Warshall algorithm Network flow: Flow networks - Ford-Fulkerson method –
Matching: Maximum bipartite matching
UNIT III ALGORITHM DESIGN TECHNIQUES 9
Divide and Conquer methodology: Finding maximum and minimum - Merge sort - Quick sort
Dynamic programming: Elements of dynamic programming — Matrix-chain multiplication -
Multi stage graph — Optimal Binary Search Trees. Greedy Technique: Elements of the
greedy strategy - Activity-selection problem –- Optimal Merge pattern — Huffman Trees.
UNITIV STATE SPACE SEARCH ALGORITHMS
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 ALGORITHM
9
Distributed Tractable and intractable problems: Polynomial time algorithms – Venn
diagram representation - NP- algorithms - NP-hardness and NP-completeness – Bin
Packing problem - Problem reduction: TSP – 3- CNF problem. Approximation
Algorithms: TSP - Randomized Algorithms: concept and application - primality testing -
randomized quick sort - Finding kth smallest number
 COURSEOUTCOMES:

CO1 Analyze the efficiency of algorithms using various frameworks

CO2 Apply graph algorithms to solve problems and analyze their efficiency.
CO3 Make use of algorithm design techniques like divide and conquer, dynamic
programming and greedy techniques to solve problems
CO4 Use the state space tree method for solving problems.
CO5 Solve problems using approximation algorithms and randomized algorithms

TEXTBOOKS:

T1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein,
"Introduction to Algorithms", 3rd Edition, Prentice Hall of India, 2009.
T2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran “Computer Algorithms/C+
+” Orient Blackswan, 2nd Edition, 2019.

REFERENCES

R1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, 3rd Edition, Pearson
Education, 2012.
R2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, "Data Structures and Algorithms",
Reprint Edition, Pearson Education, 2006.
R3. S. Sridhar, “Design and Analysis of Algorithms”, Oxford university press, 2014.

PART-III
Hr. Syllabus topics Planned Actual Teaching Book & page Reason Remark
No date date methodolo for and
gy & Book Page No deviation signature
teaching of the
aid used HOD
with date

UNITI INTRODUCTION
1. Time and space complexity 6/2/23 6/2/2 L & CB
3 T1

2. Asymptotic Notations and its 7/2/23

properties PPT T1
3. Best case,Worst case, 7/2/23
average case analysis, L & CB T2
4. Recurrence relation: 8/2/23
substitution method L & CB T2
5. Lower bounds ,linear 9/2/23
search
L & CB T1
6. binary search,Interpolation 10/2/23
Search L & CB T1
7. The naïve string- 10/2/23 L & CB
matching algorithm T2
8. Rabin-Karp algorithm - 11/2/23
Knuth-Morris-Pratt algorithm L & CB T2
9. Insertion sort – heap sort 13/2/23 L & CB T1

UNITII GRAPH ALGORITHMS

10. Representations of graphs 20/2/23
L & CB T2

11. Graph traversal: DFS – 21/2/23 L & CB T2

BFS, applications

12. Connectivity, strong 21/2/23 L & CB T2

connectivity, bi-
connectivity

13. Minimum spanning tree: 22/2/23 T2

Kruskal’s and Prim’s L & CB
algorithm

14. Shortest path: Bellman- 23/2/23 L & CB T2

Ford algorithm -

15. Shortest path: Dijkstra’s 24/2/23 L & CB T2

algorithm

16. Floyd-Warshall algorithm 24/2/23 L & CB T2

17. Network flow: Flow networks 25/2/23 PPT T1

- Ford-Fulkerson method

18. Matching: Maximum bipartite 27/2/23 L & CB T2

matching

UNITIII ALGORITHM DESIGN TECHNIQUES

19. Divide and Conquer 4/3/23 T1

methodology: Finding L & CB
maximum and minimum
20. Merge sort - Quick sort 6/3/23 T1
L & CB
21. Dynamic programming: 7/3/23 L & CB T1
Elements of dynamic
programming
22. Matrix-chain multiplication 7/3/23 T1
L & CB
23. Multi stage graph 8/3/23 T1
L & CB
24. Optimal Binary Search 9/3/23 L & CB T1
Trees
25. Greedy Technique: 10/3/23 T1
Elements of the greedy L & CB
strategy
26. Activity-selection problem 10/3/23 PPT T1

27. Optimal Merge pattern 11/3/23 L & CB T1

28. Huffman Trees. 11/3/23 L & CB T2

UNITIV STATE SPACE SEARCH ALGORITHMS

29. Backtracking: n-Queens 20/3/23 T2

problem L & CB
30. Hamiltonian Circuit Problem 21/3/23 T2
L & CB
31. Subset Sum Problem 21/3/23 L & CB T2

32. Graph colouring problem 23/3/23 L & CB T2

33. Branch and Bound 24/3/23 T1

L & CB
34. Solving 15-Puzzle problem 24/3/23 T1
L & CB
35. Assignment problem 25/3/23 PPT T1

36. Knapsack Problem 25/3/23 T1

L & CB
37. Travelling Salesman Problem 27/3/23 T1
L & CB
UNITV NP-COMPLETE AND APPROXIMATION ALGORITHM

38. Tractable and intractable 31/3/23 L & CB T2

problems: Polynomial time
algorithms
39. Venn diagram representation 31/3/23 T2
L & CB
40. NP- algorithms 1/4/23 T2
L & CB
41. NP-hardness and NP- 3/4/23 PPT T2
completeness
42. Bin Packing problem 5/4/23 T1
L & CB
43. Problem reduction: TSP 6/4/23 T1

44. 3- CNF problem 8/4/23 T2

L & CB
45. Approximation 10/4/23 T2
Algorithms: TSP L & CB
46. Randomized Algorithms: 11/4/23 L & CB T2
concept and application
47. primality testing 11/4/23 L & CB T1

48. randomized quick sort 12/4/23 T1

L & CB
49. Finding kth smallest 13/4/23 T1
number L & CB
NO OF HOURS ALLOTED IN SYLLABUS:45
NO OF HOURS REQUIRED AS PER PLAN: 49

Course Instructor Head Of

the Department

PART-IV
Hr. Syllabus topics Planned Actual Teaching Reason Remark
No date date methodology for and
& teaching deviation signature
aid used of the
HOD
with date
50. Implement Linear Search. LAB
Determine the time required
to search for an element.
51. Repeat the experiment for LAB
different values of n
52. The number of elements in LAB
the list to be searched and
 plot a graph of the time
taken versus n.
53. Implement recursive Binary LAB
Search. Determine the time
required to search an element
54. . Repeat the experiment for LAB
different values of n
55. The number of elements in LAB
the list to be searched and
plot a graph of the time taken
versus n.
56. Develop a program to LAB
implement graph traversal
using Breadth First Search
57. Develop a program to LAB
implement graph traversal
using Depth First Search
58. Develop a program to LAB
implement graph traversal
using Depth First Search
59. From a given vertex in a LAB
weighted connected graph,
develop a program to find
the shortest paths to other
vertices using Dijkstra’s
algorithm.
60. From a given vertex in a LAB
weighted connected graph,
develop a program to find
the shortest paths to other
vertices using Dijkstra’s
algorithm.
61. Find the minimum cost LAB
spanning tree of a given
undirected graph using
Prim’s algorithm.
62. Find the minimum cost LAB
spanning tree of a given
undirected graph using
Prim’s algorithm.
63. Implement Floyd’s LAB
algorithm for the All-
Pairs- Shortest-Paths
problem.
64. Implement Floyd’s LAB
algorithm for the All-
Pairs- Shortest-Paths
problem.
65. Compute the transitive LAB
 closure of a given directed
graph using Warshall's
algorithm.
66. Compute the transitive LAB
closure of a given directed
graph using Warshall's
algorithm
67. Develop a program to find LAB
out the maximum numbers in
a given list of n numbers
using the divide and conquer
technique.
68. Develop a program to find LAB
out the minimum numbers in
a given list of n numbers
using the divide and conquer
technique.
69. Implement Merge sort LAB
method to sort an array of
elements and determine the
time required to sort.
70. Repeat the experiment for LAB
different values of n,
71. The number of elements in LAB
the list to be sorted and plot a
graph of the time taken
versus n.
72. Implement Quick sort LAB
method to sort an array of
elements and determine the
time required to sort.
73. Repeat the experiment for LAB
different values of n,
74. The number of elements in LAB
the list to be sorted and plot a
graph of the time taken
75. Implement N Queens LAB
problem using Backtracking.
76. Implement any scheme to LAB
find the optimal solution for
the Traveling Salesperson
problem
77. Solve the traveling LAB
Salesperson problem instance
using any approximation
algorithm
78. Determine the error in the LAB
approximation of traveling
Salesperson problem
 79. Implement randomized LAB
algorithms for finding the kth
smallest number.

Course Instructor Head Of

the Department

NELLIANDAVARINSTIT Ref:

UTE OF TECHNOLOGY Revision:

PUDHUPALAYAM, ARIYALUR-621704
DEPARTMENT OF ELECTRONICS AND
COMMUNICATION ENGINEERING Date:
COURSE assessment matrix

PART-IV
A.COURSE ASSESSMENT MATRIX
Cour P P PO3 PO4 PO5 PO6 PO7 PO8 PO10 PO10 PO11 PO12
se O O
Outc 1 2
omes
CO1 2 2 1 - 2 2 1 1 2 1 1 2
CO2 2 3 3 3 2 1 1 1 2 2 - -

CO3 2 2 2 1 1 1 - - - 1 - -
CO4
CO5

Compentency addresses outcome:- 1=Slightly; 2=Moderately;

3=Substantially

CO1 CO CO CO CO JUSTIFICATION
2 3 4 5
PO1 3 3 3 3 3
PO2 2 2 2 2 2
PSO 1 1 1 1 1
1

A. JUSTIFICATION FOR CONTENT BEYOND SYLLABUS ADDED

Unit Topic JUSTIFICATION

No.

Course Instructor Head Of

the Department