KTU 2024 Scheme · Semester 5 · Program Core — Information Technology
Algorithm Analysis and Design Lab (PCITL508) Syllabus
Official KTU 2024 Scheme syllabus for Algorithm Analysis and Design Lab, Semester 5, Program Core — Information Technology (Information Technology).
Course Code
PCITL508
Credits
2
Teaching Hours
0:0:3:0 (L:T:P:R)
CIE Marks
50
ESE Marks
50
Exam Duration
2 Hrs 30 Min
Prerequisites
Data Structures Lab (PCITL308)
Semester
Semester 5
Course Objective
To equip students to develop proficiency in algorithmic techniques and data structures, and to design and implement algorithms for solving complex computational problems using the C programming language.
Module-wise Syllabus
Module 1
BFS on an undirected graph; DFS on a directed graph; strongly connected components of a directed graph; topological sorting of a directed graph; divide and conquer algorithm to find minimum and maximum in an array; Merge Sort; Quick Sort; greedy algorithm for the fractional knapsack problem; Kruskal's algorithm for minimum spanning tree; Prim's algorithm for minimum spanning tree; dynamic programming for the Travelling Salesman Problem; dynamic programming for the 0/1 knapsack problem; backtracking for the N-Queens problem; KMP string matching algorithm; Rabin-Karp string matching algorithm.
Course Outcomes
- CO1Implement graph traversals and their applications.
- CO2Implement divide and conquer and greedy techniques.
- CO3Implement dynamic programming and backtracking techniques.
- CO4Implement string matching algorithms.
Assessment Pattern (CIE: 50 marks, ESE: 50 marks)
Continuous Internal Evaluation (CIE)
| Attendance | 10 |
| Preparation / Pre-Lab Work, Experiments, Viva, Timely Completion of Lab Reports / Record (Continuous Assessment) | 20 |
| Internal Examination | 20 |
End Semester Examination (ESE)
Total 50 marks, 2 Hrs 30 Min. See the official KTU syllabus document for the exact Part A / Part B question pattern for this course.
Textbooks & Reference Books
Textbooks
- Introduction to Algorithms — T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein (Prentice-Hall India, 2nd edition, 2001)
- Fundamentals of Computer Algorithms — Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran (Orient Longman Universities Press, 2nd edition, 2008)
- Computer Algorithms, Introduction to Design and Analysis — Sara Baase and Allen Van Gelder (Pearson Education, 3rd edition, 2009)
Reference Books
- A Practical Guide to Analysis and Design of Algorithms — Dr. Deepshikha Agarwal (Notion Press, January 2021)
- Programming in ANSI C — E Balagurusamy (McGraw Hill Education, 8th edition, March 2019)
Frequently Asked Questions
How many credits is KTU Algorithm Analysis and Design Lab (PCITL508)?
2 credits, with 0:0:3:0 (L:T:P:R) teaching hours per week, under the KTU 2024 Scheme.
How many modules are in the PCITL508 syllabus?
1 modules.
What is the CIE and ESE mark split for this course?
CIE (Continuous Internal Evaluation): 50 marks. ESE (End Semester Examination): 50 marks, 2 Hrs 30 Min. Total: 100 marks.
What are the recommended textbooks for PCITL508?
Introduction to Algorithms (T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein); Fundamentals of Computer Algorithms (Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran); Computer Algorithms, Introduction to Design and Analysis (Sara Baase and Allen Van Gelder).
Is this syllabus specific to one branch, or common to others too?
This Semester 5 course is listed under Program Core — Information Technology at KTU under the 2024 Scheme — check the course header above for which branches it's common to.
Need help with KTU Algorithm Analysis and Design Lab?
Learnizo offers live, 1-on-1 online tuition for KTU IT subjects — matched to your exact module and semester.