Second Semester Courses (Session: 2023-24)

Institute for Advancing Intelligence

Course Name: Combinatorics

Instructors: Anupam Mondal and Sajal Kr. Mukherjee

Course Content:

1. Basic combinatorial notions: Bijections, Double counting, Recurrence relation, Inclusion-

exclusion principle, Möbius inversion, Stirling numbers, Catalan numbers.

2. Generating functions: Ordinary generating functions, Exponential generating functions

(EGF), Composition formula, Fundamental theorem of EGF, Theory of combinatorial
species.

3. Combinatorial approach to matrix algebra: Cayley–Hamilton theorem, Cauchy–Binet

formula, Counting on determinants, Lindström–Gessel–Viennot lemma and its applications.

4. Discrete calculus: Discrete differentiation and integration, Difference operators, Stirling

numbers of first and second kind, Stirling inversion, Discrete vector calculus, Vector
calculus on graphs, Various combinatorial applications.

5. Formal power series: Basic algebraic properties, Diagrammatic calculus, Extensive study
of ordinary and exponential series, Newton’s binomial series, Generalized Chu–
Vandermonde identity, Lagrange inversion, Various combinatorial applications.

6. Enumeration of matchings: Enumeration of matchings in planar bipartite graphs,

Kasteleyn’s theorem.

References:

[1] Martin Aigner. Combinatorial Theory (reprint of the 1st edition). Springer, 1996.

[2] Miklós Bóna. A Walk Through Combinatorics: An Introduction to Enumeration and

Graph Theory (3rd edition). World Scientific Publishing Co Pte Ltd., 2011.

[3] Richard A. Brualdi and Herbert J. Ryser. Combinatorial Matrix Theory (1st edition).
Cambridge University Press, 1991.

[4] Ronald Graham, Donald Knuth and Oren Patashnik. Combinatorial Theory (2nd edition).
Addison–Wesley, 1994.
Course Name: Graph Theory

Instructors: Anupam Mondal and Sajal Kr. Mukherjee

Course Content:

1. Basic graph theoretic notions: Graphs and subgraphs, Vertex and edges, Degree of a
vertex, Complete graphs, Complement of graphs, Paths and cycles, Trees and forests,
Regular graphs, Bipartite graphs, Line graph, Graph isomorphism.

2. Linear algebraic notions: Vertex and edge space, Cycle space, Cut space, Adjacency
matrix, Incidence matrix, Laplacian matrix, Tree counting using matrix tree theorem.

3. Connectivity: Connected and disconnected graphs, Vertex and edge connectivity,

Menger’s theorem.

4. Graph embedding: Planarity, Crossing number, Genus of a graph.

5. Graph colouring: Colouring vertices and edges, Chromatic numbers, Perfect graphs,
Chromatic polynomial.

6. Matching: Matching in bipartite graphs, Kőnig–Egerváry theorem, Hall’s marriage

theorem, Matching in general graphs, Tutte theorem.

7. Flows: Flows in networks, Max-flow min-cut theorem and its applications.

8. Eulerian and Hamiltonian graphs: Basic notions and results, Fleury’s and Hierholzer’s
algorithm, Sufficient conditions for Hamiltonicity, Toughness.

9. Extremal graph theory and Ramsey theory: Basic notions, Forbidden subgraphs and
minors, Mantel’s and Turán’s theorem, Ramsey’s theorem, Ramsey numbers.

References:

[1] Ravindra B. Bapat. Graphs and Matrices (2nd edition). Springer, 2014.

[2] Bela Bollobas. Modern Graph Theory (1st edition, corr. 2nd printing). Springer, 2002.

[3] Reinhard Diestel. Graph Theory (4th edition, corr. 3rd printing). Springer, 2012.

[4] Douglas B. West. Introduction to Graph Theory (2nd edition). Pearson, 2000.
Course Name: TOPOLOGY - 2

Instructor: Goutam Mukherjee

Course Content:

1. Singular Cohomology Theory; Eilenberg-Steenrod Axioms; Mayer-Vietoris Exact

Sequence.

2. Universal Coefficient Theorem.

3. Betti numbers and Euler characteristic.

4. Cup and Cap product.

5. Topological Manifold,

6. Orientation of Manifold

7. Poincare Duality Theorem

8. Cross product and Statement of Kunneth theorem.

9. Computations and Applications

References:

[1] A. Hatcher, Algebraic Topology, Cambridge University Press (2002).

[2] W.S.Massey, A basic course in algebraic topology, GTM (127), Springer (1991).

[3] E. Spanier, Algebraic Topology, Springer-Verlag (1982).

[4] J. Vick, Homology Theory, Springer.

Course Name: TOPOLOGY - 3

Instructor: Apratim Chakraborty

Course Content:

1. Smooth manifolds.

2. Partition of unity.

3. Regular and critical values.

4. Sard’s theorem.

5. Vector fields.

6. Morse Theory.

7. Poincare-Hopf index theorem.

8. Transversality.

9. Embedding, Immersion, Submersion.

10. Thom-Pontryagin theory.

11. Vector bundles.

12. Principal bundles, Associated bundles.

13. Characteristics classes : Steifel—Whitney class, Euler class, Pontryagin class,

Computation on manifolds

References:

[1] Guillemin—Pollack, Differential Topology.

[2] Milnor, Morse Theory

[3] Milnor-Stasheff, Characteristic Classes.

Course Name: Introduction to Riemannian Geometry

Instructors: Somnath Hazra & Kuldeep Saha

Course Content:

1. Differentiable Manifolds.

2. Riemannian metrics.

3. Affine connections.
4. Riemannian connections.

5. Geodesics.

6. Convex neighborhoods.

7. Curvature.

8. Jacobi fields.

9. Isometric immersions.

10. Complete manifolds.

11. Hopf-Rinow Theorem.

12. Hadamard Theorem.

References:

[1] M. P. do Carmo, Riemannian Geometry.

Course Name: Introduction to Algebraic Geometry

Instructors: Suratno Basu

Course Content:

1. Affine Varieties: Algebraic sets and the Zariski topology, irreducibility and the dimension
of a topological space, basic dictionary between algebra and geometry, Hilbert
Nullstelenzatz;
2. Regular functions and morphisms of affine varieties, Rational functions and rational maps
between affine varieties; Affine varieties as a ringed space.

3. Projective Varities: projective spaces and projective varieties; Regular functions and
morphisms on projective varieties, Cones and projective Nullstelenzatz, projective varieties
as a ringed space, product of varieties.
4. Dimension of affine and projective varieties, Zariski tangent space, non singular varieties,
blowing up, intersection in projective space, Hilbert polynomial.

5. Algebraic curves: Bezout’s theorem, non singular projective curves over complex
numbers, Riemann-Hurwitz formula (geometric idea to show how the formula works);
Riemann-Roch theorem statement and applications (a brief indication of cohomological
interpretation of the theorem and how basic cohomology machinary can be used to prove it).

6. Where to go? Broad problems and goals in algebraic geometry; overview of certain topics
where research in modern algebraic geometry takes place.

Prerequisite: Basic familiarity with algebra and topology. Main background materials in
commutative algebra will be covered in the course.

References:

[1] Algebraic Geometry, Robin Hartshorne, Graduate Texts in mathematics, Springer.

[2] Basic Algebraic Geometry, I. I. R Shafarevich, Springer.

[3] Algebraic curves, W. Fulton.

Course Name: An Introduction to Commutative Algebra

Instructor: Mitra Koley

Course Content:

1. Prime and maximal ideals.

2. Nilradical and Jacobson radical.

3. Operations on ideals, extensions, and contractions.

4. Modules and module homomorphism submodules, quotient modules, finitely generated

modules and Nakayama's lemma, exact sequences, tensor products of modules.

5. flatness and faithfully flatness. Associated primes and primary decompositions, rings and
modules of fractions.

6. Integral dependence, Going up theorem, Integrally closed integral domains, Going down
theorem, Noether's Normalization, valuations.

7. Chain conditions, Noetherian and Artinian Rings, Hilbert’s basis theorem, Hilbert
Nullstellensatz.

8. Graded rings and modules, dimension theory.

Prerequisite: Basic familiarity with ring theory.

References:

[1] M. F. Atiyah and I. G. MacDonald, Introduction to commutative algebra, Addison-

Wesley Publishing Co., Reading Mass.-London-Don Mills, 1969.

[2] H. Matsumura, Commutative ring theory, 2nd ed., Cambridge Studies in Advanced
Mathematics, Cambridge University Press, Cambridge, 1989.

[3] D. Eisenbud, Commutative algebra with a view towards algebraic geometry, Graduate
Texts in Math. 150, Springer, New York, 1995.
Course Name: Introduction to knot theory and low dimensional topology

Instructor: Apratim Chakraborty

Course Content:

1. Basics of knot theory: Basic definitions and concepts involving knots and links,
Reidemeister moves, knot invariants, fundamental group of a knot and Wirtinger
presentation, Braids and representations of the braid group.

2. 3-manifolds and Dehn surgery: Heegaard splittings, the mapping class group, surgery on
links in S^3, surgery description of lens spaces and Seifert manifolds, Lickorish–Wallace
theorem, Kirby moves and the linking matrix

3. Invariants of knots and links: Seifert surface, Seifert form, Alexander polynomial,
signature and determinant of a knot, slice knots, Jones polynomial, Khovanov homology and
a glimpse of invariants bounding genus and slice genus of a knot.

Prerequisite: Basics of algebraic topology.

References:

[1] Savilev, N. Lectures on the Topology of 3-Manifolds: An Introduction to the

Casson Invariant. De Gruyter, 2012.

[2] Prasolov, V.V., & Sossinsky, A.B. Knots, Links, Braids and 3-Manifolds: An
Introduction to the New Invariants in Low-Dimensional Topology. American
Mathematical Society, Providence, 154.
Course Name: Advanced Complex Analysis

Instructor: Suratno Basu

Course Content:

1. The definition of Riemann Surfaces, Elementary Properties of Holomorphic mappings,

Homotopy of curves. The fundamental group branched and unbranched coverings, The
universal cover and covering transformations, sheaves, analytic continuation, algebraic
functions, diffrential forms, the integration of of differential forms.

2. Study of compact Riemann surfaces: Cohomology groups, Dolbeault’s Lemma, A

finiteness theorem, The exact Cohomology sequence, The Riemann-Roch Theorem, The
Serre duality theorem, Functions and Differential forms with prescribed principal parts,
Harmonic Differential Forms, Abel’s Theorem, The Jacobi Inversion Problem.

3. Study of non-compact Riemann Surfaces: The Dirichlet Boundary value problem,

countable topology, Weyl’s Lemma, The Runge Approximation Theorem, The theorems of
Mittag-Leffer and Weierstrass, The Riemann Mapping Theorem, line and vector bundles,
the Riemann-Hilbert problem.

References:

[1] Lectures on Riemann surfaces, Otto Forster.

Course Name: Combinatorial Optimization

Instructors: Sajal Mukherjee, Mitra Koley & Anupam Mondal

Course Content:

1. Algorithms: Dijkstra’s shortest path algorithm, BFS and DFS, Hungarian method and
Hopcroft–Karp algorithm for maximum matching, Ford–Fulkerson method and Dinitz’s
algorithm.

2. Linear and integer programs: Basic notions, Simplex and ellipsoid method, Primal-dual
methods.

3. Polyhedral combinatorics: Polyhedra and polytopes, Integer polyhedra, Polyhedral

methods in combinatorial optimization.

4. Algebraic techniques: Gröbner basis techniques in integer linear programming.

References:

[1] William W. Adams and Philippe Loustaunau. An Introduction to Gröbner Bases. AMS,
1994

[2] Alexander Schrijver. Combinatorial Optimization – Polyhedra and Efficiency. Springer,

2002.

[3] David A Cox, John Little and Donal O’Shea. Ideals, Varieties, and Algorithms – An
Introduction to Computational Algebraic Geometry and Commutative Algebra (4th edition).
Springer, 2015.
Course Name: Advanced Functional Analysis and Noncommutative Geometry

Instructor: Sayan Chakraborty

Course Content:

1. Review of functional analysis.

2. C*-algebras, States, GNS construction.

3. Noncommutative spaces and examples.

4. A gentle introduction to K-theory of C*-algebras.

5. Morita equivalence of C*-algebras.

6. Noncommutative tori and their classification.

Course Name: Topics in Algebra

Instructor: Satyendra Kumar Mishra

Course Content:

1. Modules: Rings and Modules, Local Property, Sums and Products of Modules, Free and
Projective Modules, Dualization, Injective Modules, Cofree Modules.

2. Categories and Functors: Products and Coproducts, Universal Constructions, Pull-backs

and Pushouts, Adjoint Functors, Abelian Categories, Projective, Injective, and Free Objects.

3. Extension of Modules: Extensions of Modules, The Functor Ext, Ext Using Injective,
Computation of some Ext-Groups, The Tensor Product, The Functor Tor.

4. Derived Functors: Complexes, The Long Exact (Co) Homology Sequence, Homotopy,
Resolutions, Derived Functors, The Two Long Exact Sequences of Derived Functors, The
Functors Extn Using Projective, Extn and n-Extensions, Another Characterization of Derived
Functors.

5. Cohomology of Groups: The Group Ring, Definition of (Co) Homology, The (Co)
Homology of Finite Cyclic Groups, Second cohomology and Extensions, The Universal
Coefficient Theorem.

6. Cohomology of Lie Algebras: Lie Algebras and their Universal Enveloping Algebra,
Definition of Cohomology, second cohomology and Extensions, The two Whitehead
Lemmas.
Course Name: Advanced Cryptology

Instructors: Avijit Dutta and Subhabrata Samajder

Course Content:

1. Basic Complexity classes, Turing Machines, BPP

2. Introduction to one way function, How to construct PRG and PRF from one way function

3. Bit Commitment Scheme, Vector Commitment Scheme, Functional Commitment Scheme

4. An Introduction to Multi Party Computation and Secret Sharing

5. Introduction to Interactive Proof System and Zero Knowledge Proof, A basic introduction
to SNARK and its usefulness

6. Digital certificates, PKI, KEM - definition, TLS protocol (high-level)

7. KEM: CPA, CCA security, Towards RSA based CPA-secure encryption without ROM and
RSA based CCA-secure KEM in ROM, Fujisaki-Okamoto transform and its security

8. PKE: Public key encrytion (PKE) from trapdoor permuations, Pallier encryption scheme
and it’s generalization (Damgard-Jurik ecnryption scheme), Goldwasser-Micali encryption
scheme, Rabin Ecnryption scheme

9. Threshold encryption scheme: Pallier-based threshold encryption scheme

10. Identity-based encryption scheme (IBE): Boneh-Franklin pairing based encryption

scheme and Cock’s IBE
11. Variants of Signatures: Blind signature, group Signature, ring signature etc.
12. Some advanced topics: Hybrid-IBE (HIBE), Attribute based encryption, Functional
encryption, Broadcast Encryption etc.

References:

[1] Oded Goldreich: Foundation of Cryptographys (Vol: 1)

[2] Sanjit Chatterjee and Palash Sarkar: Identity-Based Encryption.

[3] Relevant Research Papers

Course Name: Introduction to Selected Topics in Cybersecurity

Instructors: Avik Chakraborti, Nilanjan Datta

Course Content:

1. Internet Security: Basics of Networks, Concepts of threat, vulnerability and risk; Basics of
data communication. Various layers of TCP/IP protocol suite. Common threats in data
communication. Concepts of Sniffing and Spoofing; Concepts of Malware and Phishing;
Concepts of DNS and cache poisoning attacks, and Concepts of reconnaissance. Web and
DNS reconnaissance using DNSrecon tools; Concepts of TCP and UDP, various attacks on
TCP and UDP, port scanning techniques using Nmap tools; Network Defense tools –
Firewalls, Intrusion Detection, Filtering; Denial of Service Attacks with various examples.

2. Side-Channel Attack: Concepts, Timing Attack, Example with RSA, Simple and
Differential Power Attacks, An Introduction to Leakage Resilient Cryptography

3. Fault Attack: Concepts (Fixed Faults, Random Faults etc.), Types: Statistical Fault Attack,
Differential Fault Attack, Ineffective Fault Attack, Statistically Ineffective Fault Attack,
Examples with RSA, AES

4. White-Box Crypto: Concepts, Obfuscation, VBB Obfuscation, IO Obfuscation, White-

Box Crypto, Different Security Goals, Example of AES.

References:

[1] Wenliang Du: Computer & Internet Security: A Hands-on Approach.

[2] Kazuo Sakiyama, Yu Sasaki, Yang Li: Security of Block Ciphers – From Algorithm
Design to Hardware Implementation.

[3] Relevant Research Papers

Course Name: Quantum Information and Cryptography

Instructor: Dr. Arpita Maitra

Course Content:

1. Introduction to Quantum Information: (a) States, Operators, Measurements; (b) Quantum

Entanglement: Quantum Teleportation, Super-dense coding; (c) Quantum gates and circuits

2. Quantum Algorithms: Deutsch-Jozsa, Simon, Grover, Shor, and their cryptanalytic

implications: (a) Implication of Grover’s and Simon’s algorithms towards classical
symmetric key cryptosystems; (b) Implication of Shor’s algorithm towards factorization and
Discrete Logarithm based classical public key cryptosystems.

3. Quantum True Random Number Generators (QTRNG): (a) Detailed design and issues of
quantumness; (b) Commercial products and applications

4. Quantum key distribution (QKD): (a) BB84, Ekert, Semi-Quantum QKD protocols and
their variations; (b) Issues of Device Independence; (c) Commercial products

5. Other cryptologic issues, such as Quantum secret sharing and multiparty computation.

6. Introductory topics in Post-Quantum Cryptography

References:

[1] M. A. Nielsen and I. L. Chuang: Quantum Computation and Quantum Information,

Cambridge University Press.

[2] P. Kaye, R. Laflamme, and M. Mosca: An Introduction to Quantum Computing, Oxford

University Press, New York

[3] Presskil Lecture notes: Available online: http://www.theory.caltech.edu/ preskill/ph229/

[4] N. David Mermin: Quantum Computer Science, Cambridge University Press

[5] D. Unruh: Quantum Cryptography, Available online: https://courses.cs.ut.ee/all/

MTAT.07.024/2017 fall/uploads/

[6] NIST Post Quantum Cryptography, Available online: https://csrc.nist.gov/projects/ post-

quantum-cryptography/round-2-submissions
Course Name: Optimization Techniques

Instructors: Angshul Majumder Shion Samadder Chaudhury

Course Content:

1. Linear Systems
2. Solutions to over determined and under determined cases

3. Least Squares - closed form and iterative updates

4. Test for convexity

5. Lagrangians

6. KKT conditions

7. Formulation of linear programs

8. Simplex Algorithm
9. Bipartite and Non-bipartite Matching
10. Polyhedral Combinatorics
11. Max Flow, Min Cut
12. Matroids
13. Ellipsoid Algorithm, Karmakar's Algorithm
14. Travelling Salesman problem

References:

[1] Boyd: Convex Optimisation -

[2] B. Korte, J. Vygen, Combinatorial Optimization: Theory and Algorithms (6th Edition)
[3] A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency.
Course Name: Design and Analysis of Algorithms

Instructors: Rana Barua , Laltu Sardar, Ritankar Mandal

Course Content:
1. Introduction: Algorithm, Instance of a problem, Efficiency of algorithm, Growth of
Functions, Asymptotic notation, Worst case, Best case, Average Case time complexity,
Substitution method, Recursion tree method, Masters Theorem

2. Advanced Data Structure: Hash table, Binary Search Tree, Disjoint Set Data Structure

3. Searching and Sorting: Linear and Binary Search, Heap Sort, Quick Sort, Sorting in linear
time.

4. Divide and Conquer Paradigm: Merge Sort, Counting Inversion, Closest Pair of Points.

5. Greedy Algorithms: Interval Scheduling Problem and its variants, Optimal Caching
Problem, Minimum Spanning tree Problem, Huffman Code, Clustering Problem, Fractional
Knapsack problem, Dijkstra Algorithm.

6. Dynamic Programming: Matrix Chain Multiplication, Longest Common Subsequence,

Optimal Binary Search Tree, Segmented Least Square Problem, 0/1-Knapsack Problem,
Subset Sum Problem, Bellman Ford Algorithm.

7. Graph algorithms: (BFS, DFS, Floyd Warshall, Fold Fulkerson).

8. Advanced Topics: P, NP, NPC (Circuit Satisfiability, Vertex Cover, Graph Coloring),
Approximation Algorithm of some NPC Problems, Probabilistic Algorithms.

References:

[1] T. H. Cormen, C. E. Leiserson and R. L. Rivest: Introduction to Algorithms, Prentice

Hall of India, New Delhi, 1998.

[2] A. Aho, J. Hopcroft and J. Ullman: The Design and Analysis of Computer Algorithms, A.
W. L, International Student Edition, Singapore, 1998.

[3] J. Kleinberg, E. Tardos: Algorithm Design, Pearson Education, 2006.

Course Name: Research Ethics

Instructor: Dr. Arpita Maitra

Course Content:

Philosophy & Ethics: Introduction to Philosophy, definition, nature and scope, concepts,
branches, nature of moral philosophy, nature of moral judgements and reactions, Ethics with
respect to science and research, Intellectual honesty and research integrity; Scientific
misconducts: Falsification, Fabrication, and Plagiarism, Redundant publications; duplicate
and overlapping publications, Selective reporting and misrepresentation of data, Conflict of
interest.
Course Name: Deep Learning

Instructors: Swagatam Das, Avisek Gupta

Course Content:

1. Multi-layered perceptrons for regression, classification, dimension reduction, and

clustering.

2. Optimization of deep neural networks: Gradient descent, momentum methods, RMSProp,

Adam.

3. Convolution neural networks: Layers, activation functions, regularization and layer

normalization.

4. CNNs in computer vision: Image classification, object detection, and image segmentation.

5. Deep generative models: Variational autoencoders, GANs, diffusion models.

6. Deep learning for sequence data: RNNs, LSTMs, GRUs.

7. Attention in deep learning: Transformers & vision transformers.

8. Graph Neural Networks.

9. Explainable AI in deep learning.

10. Model bias, algorithmic fairness & ethics of deep learning

References:

[1] Aston Zhang, Zachary C. Lipton, Mu Li, and Alexander J. Smola, Dive into Deep
Learning, Cambridge University Press, 2023.

[2] Simon J.D. Prince, Understanding Deep Learning, MIT Press, 2023.

[3] Christopher M. Bishop, Hugh Bishop, Deep Learning Foundations and Concepts,
Springer Cham, 2023.

[4] Ian Goodfellow and Yoshua Bengio and Aaron Courville, Deep Learning, MIT Press,
2016.
Course Name: Computer Vision

Instructor: Sourav Bhaduri

Course Content:

1. Introduction to Computer Vision: Basic concepts of Image formation, Image formation

and Radiometry, Geometric Transformation, Geometric Camera Model, Image
Reconstruction from series of projections

2. Concepts of Image Processing: Fundamentals of image processing, Image Transforms,

Image Filtering, Colour Image Processing, Mathematical Morphology, Image segmentation

3. Image descriptors and Features: Texture descriptors, Colour Features, Edge Detection,
Object Boundary and shape representations, Interest or Corner Point detectors, HOG and
SIFT features, Speeded up Robust Features

4. Machine learning for Computer Vision: Statistical machine learning for different
Computer Vision applications, Artifical and Deep Networks for Computer Vision
applications

5. Applications of Computer Vision: Medical Image Segmentation, Motion estimation and

object tracking, Face recognition, Image Fusion, Gesture recognition

References:

[1] Richard Szeliski. 2022. Computer Vision: Algorithms and Applications (2nd. ed.).
Springer Nature.

[2] Forsyth, D.A. and Ponce, J. (2003) Computer Vision: A Modern Approach. Pearson
Education, Upper Saddle River.

[3] Ballard, D.H., and Brown, C.M. (1982) Computer Vision. Prentice Hall: New York.

[4] Bhuyan, M.K. (2019). Computer Vision and Image Processing: Fundamentals and
Applications (1st ed.). CRC Press.
Course Name: Signal Processing for Machine Learning

Instructor: Md Sahidullah

Course Content:

1. Basics of Signals & Systems: Analog and digital signals, sampling theorem, LTI systems,
impulse response, convolution, stability.

2. Fourier Transform: Discrete Fourier Transform, properties of Fourier Transform, Fourier

analysis of discrete-time signals and systems, spectral density estimation.

3. z-Transform: Definition, region of convergence, and properties of z-Transform.

4. Digital Filters: Concept of filtering, all-pass filters, IIR and FIR filters, design of filters.

5. Introduction to Speech, Audio, and Music Processing: Speech signals, speech production,
perception models, speech feature extraction, acoustic modeling, sequential modeling with
HMM, LSTM, and transformer.

6. Introduction to Natural Language Processing: Basic terminology, text representation (Bag

of Words model, TF-IDF representation), word embeddings, introduction to language
modeling.

7. Case Studies from Emerging Applications: Foundation models for speech and language
processing (Wav2Vec2.0, GPT).

References:

[1] Oppenheim, A. V., Willsky, A. S., Nawab, S. H. (1996). Signals and Systems (2 nd ed). Pearson.

[2] Oppenheim, A. V., Schafer, R. W., & Buck, J. R. (1999). Discrete-Time Signal Processing.
Pearson.

[3] Quatieri, T. F. (2001). Discrete-Time Speech Signal Processing: Principles and Practice.
Pearson.

[4] Jurafsky, D., & Martin, J. H. (2020). Speech and Language Processing. PHI.

[5] Goldberg, Y. (2017). Neural Network Methods for Natural Language Processing. Springer
Cham.