KTU 2024 Scheme · Semester 4 · Group A
Mathematics for Computer and Information Science 4 (Graph Theory) (GAMAT401) Syllabus
Official KTU 2024 Scheme syllabus for Mathematics for Computer and Information Science 4 (Graph Theory), Semester 4, Group A (Computer Science and Engineering).
Course Code
GAMAT401
Credits
3
Teaching Hours
3:0:0:0 (L:T:P:R)
CIE Marks
40
ESE Marks
60
Exam Duration
2 Hrs 30 Min
Prerequisites
None
Semester
Semester 4
Course Objective
To provide a comprehensive understanding of fundamental concepts of graph theory, including paths, cycles, trees, graph algorithms, connectivity, and matrix representations, emphasizing their applications across various disciplines.
Module-wise Syllabus
Module 1
9 contact hoursIntroduction to Graphs: basic definitions, applications of graphs, finite and infinite graphs, incidence and degree, isolated vertex, pendant vertex and null graph. Isomorphism, subgraphs, walks, paths and circuits, connected graphs, disconnected graphs and components.
Module 2
9 contact hoursEuler graphs, operations on graphs, Hamiltonian paths and circuits, Travelling Salesman Problem, directed graphs, types of directed graphs.
Module 3
9 contact hoursTrees: properties, pendant vertices, distance and centres in a tree, rooted and binary trees, counting trees, spanning trees, Prim's algorithm and Kruskal's algorithm, Dijkstra's shortest path algorithm, Floyd-Warshall shortest path algorithm.
Module 4
9 contact hoursCut set and its properties, connectivity, edge connectivity, vertex connectivity. Matrix representation of graphs: adjacency matrix, incidence matrix, circuit matrix, path matrix.
Course Outcomes
- CO1Understand the fundamental concepts of graph theory such as types of graphs, degree of a vertex, graph isomorphism, connectedness.
- CO2Understand the concepts of Euler graphs, Hamiltonian graphs and directed graphs.
- CO3Apply Prim's and Kruskal's algorithms for finding minimum cost spanning tree and Dijkstra's and Floyd-Warshall algorithms for finding shortest paths.
- CO4Illustrate various representations of graphs using matrices and understand the concepts of connectivity.
Assessment Pattern (CIE: 40 marks, ESE: 60 marks)
Continuous Internal Evaluation (CIE)
| Attendance | 5 |
| Assignment / Microproject | 15 |
| Internal Examination 1 (Written) | 10 |
| Internal Examination 2 (Written) | 10 |
End Semester Examination (ESE)
Total 60 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
- Graph Theory with Applications to Engineering and Computer Science — Narsingh Deo (Prentice Hall India Learning Private Limited, 1974)
Reference Books
- Introduction to Graph Theory, 2e — Douglas B. West (Pearson Education India, 2nd edition, 2015)
- Introduction to Graph Theory — Robin J. Wilson (Longman Group Ltd., 5th edition, 2010)
- Graph Theory with Applications — J.A. Bondy and U.S.R. Murty (Elsevier Science Publishing Co., Inc, 1976)
Frequently Asked Questions
How many credits is KTU Mathematics for Computer and Information Science 4 (Graph Theory) (GAMAT401)?
3 credits, with 3:0:0:0 (L:T:P:R) teaching hours per week, under the KTU 2024 Scheme.
How many modules are in the GAMAT401 syllabus?
4 modules, 36 total contact hours.
What is the CIE and ESE mark split for this course?
CIE (Continuous Internal Evaluation): 40 marks. ESE (End Semester Examination): 60 marks, 2 Hrs 30 Min. Total: 100 marks.
What are the recommended textbooks for GAMAT401?
Graph Theory with Applications to Engineering and Computer Science (Narsingh Deo).
Is this syllabus specific to one branch, or common to others too?
This Semester 4 course is listed under Group A at KTU under the 2024 Scheme — check the course header above for which branches it's common to.
Need help with KTU Graph Theory?
Learnizo offers live, 1-on-1 online tuition for KTU engineering mathematics — matched to your exact module and semester.
Explore KTU Maths Tuition