Course Syllabus Template

Course Code / Course Name SM402

Course Instructor Name(s) Dr. Amit Chattopadhyay
Hours Component
4 Lecture (1hr = 1 credit)
Credits (L:T:P) 0 Tutorial (1hr = 1 credit)
(Lecture : Tutorial : Practical) 0 Practical (2hrs = 1 credit)
L:T:P = 4:0:0 Total Credits = 4
Grading Scheme X 4-point scale (A,A-,B+,B,B-,C+,C,D,F)
(Choose by placing X against
appropriate box) Satisfactory/Unsatisfactory (S / X)
Area of Specialization (if applicable)
(Choose by placing X in box against not more than two areas from the list)
Theory and Systems for Computing Networking and
and Data Communication
Artificial Intelligence and Machine Digital Society
Learning
VLSI Systems Cyber Security
General Elective
Programme / Branch Course is restricted to the following programmes / branch(es):
(Place X appropriately. More than one is okay)
Programme: Branch:
X iMTech X CSE
X M.Tech X ECE
M.Sc. Digital Society
Course Category Select one from the following:
(Place X appropriately)
Basic Sciences
CSE Core
ECE Core
X CSE Branch Elective
ECE Branch Elective
Engineering Science and Skills
HSS/M
General

Course Pre-Requisites (Where applicable, state exact course code/name)

Mathematics I, II, III

Algorithms and Data-Structure

Template Version 4.0

Template Date April 4, 2021
Additional Focus Areas
Select zero or more from the following and write one sentence explaining the how the focus areas covered as part of
the course.[NAAC criteria 1.1.3, 1.3.2].

Yes /
Focus Area Details
No
No This course focuses on basic skill
Direct focus on employability development on computational topology
Yes The course helps in developing basic skills
Focus on skill development required for Topological Data Analysis
Focus on entrepreneurship No
Provides value added / life skills No
(language, writing, communication, etc.)

Course Context and Overview

[Provide introduction to the course]
Topology is a branch of mathematics that studies global properties of shapes, e.g. its connected
components, tunnels or higher-dimensional holes. Topological properties play important roles in
machine learning (Topological Machine Learning) and data analysis (Topological Data Analysis).
Computational topology develops algorithms for solving computational problems in topology.

The aim of this introductory course is to give a solid background on basic topology (and some
parts of algebraic topology) and their applications in developing algorithms for solving
computational problems. This course will be a prerequisite for doing the course on “Topological
Data Analysis”.

Course Outcomes and Competencies

[Course Outcomes are to be stated using appropriate terminology and taxonomy as required by NAAC
and/or NBA. For every course credit, about 2-3 outcomes are recommended.]

PO/ Class Tut

Id Course Outcome
PSO
CL KC
(Hrs) (Hrs)
CO1 Understand how to build a topological space. PO1 U C, 4
P
CO2 Understand how to show two topological spaces PO1, U, C, 4
are equivalent. PSO4 Ap P
CO3 Analyse how to show two topological spaces are PO1, U, C, 4
not equivalent by choosing appropriate invariants. PSO4 Ap P
CO4 Understand constructing new topological spaces PO1, U, C, 4
from old ones using product and quotient PSO4 Ap P
operations.
Template Version 4.0
Template Date April 4, 2021
 CO5 Understand classification of compact surfaces PO1, U, C, 4
PSO4 Ap P
CO6 Understand different techniques of representing a PO1, U, C, 4
topological space using a complex, e.g., simplicial PSO4 Ap P
complex, convex set system, Delaunay complex
and alpha complex.
CO7 Evaluate (Compute) number of holes of different PO1, U, C, 12
dimensions in a Topological Space. PSO4 Ap P
CO8 Evaluate (Compute) topology of surfaces using PO1, U, C, 12
Morse theory. PSO4 Ap P
CO9 Evaluate (Compute) persistent diagram of a data PO1, U, C, 12
set. PSO4 Ap P

Legend: PO/PSO: Programme Outcomes / Programme Specific Outcomes; CL: Cognitive Level (from Revised
Bloom’s Taxonomy); KC: Knowledge Category (from Revised Bloom’s Taxonomy); Class (Hrs): Number of hours
of instruction; Tut (Hrs): Number of hours of tutorial session (where applicable)

Concept Map of the Course (Optional)

Course Content
[Provide list-wise topics]
● Topological Spaces: Motivation -- Topology, Neighbourhood and open set in
Euclidean space, Abstract definition of topological spaces based on neighbourhoods
and open sets, Examples of spaces. Basis of a topological Space, Subspace or
Induced topology, Refinement, Closed sets, Continuous functions, Homeomorphism,
Metric space topology, Hausdorff space, Compactness and Connectedness, Product
Spaces, Identification/ Quotient Space.

● Surfaces: Two-dimensional manifolds, Orientability, Orientable and non-orientable

manifolds, Connected sum and cross-caps, Classification theorem for compact 2-
manifolds, Triangulations of 2-manifolds, Euler characteristic and genus of compact
2-manifolds.

● Complexes: 1. Simplicial Complexes, 2. Convex Set Systems: Nerves, Čech

complexes, Vietoris-Rips complexes, 3. Delaunay Complexes: Voronoi diagram,
Delaunay triangulation, 4. Alpha Complexes.

● Simplicial Homology: Chain complexes, Cycles and boundaries, Homology groups

and Betti numbers and Euler Characteristics, Incremental Computation of Betti
numbers.

Template Version 4.0

Template Date April 4, 2021
● Morse Theory: Smooth Surfaces, Generic smooth functions on surfaces, Morse
functions on surfaces, Morse lemma, Attaching cells, Morse theory and Homology.

● Persistent Homology: The Elder Rule, Filtrations, Persistent Homology Groups,

Persistence Diagram, Bottleneck and Wasserstein Distances, Stability.

Instruction Schedule
[Provide session-wise schedule]
Section/Topic Week CO Mapping
Topological Spaces Week - 1, 2, 3 CO1, CO2, CO3, CO4

Surfaces Week - 4, 5 CO5

Complexes Week - 6, 7 CO6
Simplicial Homology Week - 8, 9, 10 CO7
Morse Theory Week - 11, 12 CO8
Persistent Homology Week – 13, 14, 15 CO9

Learning Resources
[Mention text books, reference books and other learning resources required as part of the course]
1. Topology- a first course, James R. Munkres
2. Basic Topology, M.A. Armstrong
3. Computational Topology: An Introduction-Herbert Edelsbrunner, John Harer, American
Mathematical Society, 2010.
4. Effective Computational Geometry for Curves and Surfaces, Chapter 7: Computational
Topology: An Introduction, by Gu n ̈ ter Rote and Gert Vegter.

Assessment Plan
[List grade distribution in terms of % across multiple assessment types (assignments, quizzes, mid-term,
end-term, project, etc.)]
Mid-term: 35%
End-term: 35%
Quiz: 20%
Attendance: 10%

Assignments / Projects
[List exact number of assignments or projects included (provide generic description)]
S. No. Focus of Assignment / Project CO Mapping

Template Version 4.0

Template Date April 4, 2021
Evaluation Procedures
Provide details of how evaluations will be done, how students can look at the evaluations. Generic
evaluation procedures included below. Add additional evaluation procedures / criteria as needed

The course uses one or more of the following evaluation procedures as part of the course:
• Automatic evaluation of MCQ quizzes on Moodle or other online platforms
• Manual evaluation of essay type / descriptive questions

Students will be provided opportunity to view the evaluations done where possible either in
person or online

Late Assignment Submission Policy

State any penalty policy for late submission

As per institute policy

Make-up Exam/Submission Policy

State if any specific policy derived from institute policy is applicable. Otherwise leave it as given

As per institute policy

Citation Policy for Papers (if applicable)

[If course includes reading papers and citing them as part of activities, state the citation policy. Mention
“Not applicable” if section is not applicable to the course]

Academic Dishonesty/Plagiarism
State if any specific policy derived from institute policy is applicable. Otherwise leave it as given

As per institute policy

Accommodation of Divyangs
[State any enabling mechanisms for accommodating learners with special needs]

As per institute policy

Template Version 4.0

Template Date April 4, 2021