Scribd
Upload
6 views

3ceit102 Computer Algorithm

Ca

Uploaded by

abbhatla1703
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

3ceit102 Computer Algorithm

Ca

Uploaded by

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

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY


Programme Master of Technology Branch/Spec. Computer Engineering,
Information Technology
Semester I Version 2.0.0.1
Effective from Academic Year 2023-24 Effective for the Batch admitted in July 2023
Course Code 3CEIT102 Course Name Computer Algorithms
Teaching Scheme Examination Scheme (Marks)
(Per Lecture (DT) Practical (Lab.) Total CE SEE Total
week)
L TU P TW
Credit 3 0 1 - 4 Theory 40 60 100
Hours 3 0 2 - 5 Practical 30 20 50
Pre-requisites
Basic knowledge of Data Structure and C language.
Course Outcomes
On successful completion of the course, the students will be able to:
CO1 analyze the efficiency of algorithms by calculating time and space complexity.
CO2 apply algorithmic design paradigms and methods like Divide & Conquer, Dynamic Programming and
Greedy algorithms to real world problems
CO3 design and develop the solution of the problem by choosing the appropriate algorithm technique
CO4 explain and compare the classes P, NP, and NP Complete class problems
Theory Syllabus
Unit Content Hrs.
1 Introduction to Algorithms: Characteristics of Algorithms, Efficiency of Algorithms, 02
Analysis of Algorithms. Asymptotic notations and their significance, Time and Space
Complexity analysis of algorithms.
2 Solving Recurrences : Homogeneous recurrences, Inhomogeneous recurrences, Change of 08
variable, Substitution method, Iteration method, Recurrence trees, Master’s theorem.
3 Algorithmic Paradigms: Brute-Force, Heuristics, Divide & Conquer, Dynamic 15
Programming, Greedy algorithms, Branch and bound and Backtracking.
4 Graph and Tree Algorithms: Introduction of Graph, Types of Graph, Depth First Search 12
(DFS) and Breadth First Search (BFS), Topological Ordering, Minimum cost Spanning
Trees, Single source shortest paths (Dijsktra’s Algorithm, Bellman Ford Algorithm), All-
pairs shortest paths (Floyd-Warshall Algorithm), Tree: Binary Search Tree and its
operation, B and B+ Tree, AVL Tree and its operations, Red Black Tree, Splay Tree.
5 Computational Complexity: Computational classes, P, NP, NP-Hard, NP-Complete. 08
Cook’s Theorem, Standard NP-complete problems and Reduction techniques.
Advanced Topics: Approximation Algorithms, Randomized Algorithms, Design of some
classical problems using Randomized and Approximation algorithms. Class of problems
beyond NP – P SPACE, Introduction to Quantum Algorithms, Amortized Algorithms.
Practical Content
Practical, assignments and tutorials are based on the syllabus.
Text Books
1 Introduction to Algorithms, By T.H. Cormen, C.E. Leiserson, R.L. Rivest, McGraw Hill, 1994.
Reference Books
1 Fundamentals of computer algorithms, by Ellis Horowitz, SartajSahni, Computer Science Press.
2 Fundamentals of Algorithmics, by Brassard & Bratley, Prentice Hall of India.
3 Computer Algorithms: Introduction to Design and Analysis, by Sara Baase, Addison Wesley
4 Algorithm Design: Foundations, Analysis & Internet Examples, by Michael T Goodrich &
Roberto Tamassia John Wiley.
5 Algorithms on Strings, trees and Sequences, by Dan Gusfield, Cambridge.
ICT/MOOCs Reference
1 https://nptel.ac.in/courses/106101060/
2 https://nptel.ac.in/courses/106106131/

Mapping of CO with PO and PSO:


P P P P P P
P P P P P P P P P
O O O S S S
O O O O O O O O O
1 1 1 O O O
1 2 3 4 5 6 7 8 9
0 1 2 1 2 3
CO1 3 3 1 3 0 0 0 0 1 1 0 2 3 2 1
CO2 3 3 3 3 3 0 0 0 2 1 0 2 3 2 2
CO3 3 3 3 3 3 0 0 0 1 1 0 2 3 2 2
CO4 3 3 1 3 2 0 0 0 1 1 0 2 3 2 1

You might also like