Course Name: 

Discrete Mathematics for AI (AI201)


B.Tech (AI)


Programme Core (PC)

Credits (L-T-P): 

(3-0-2) 4


Fundamentals of Discrete Mathematics: Counting, Logic, Set Theory, Proof Techniques, Relations and Functions: Generating functions, Recursive relations; Introduction to Graph Theory: Vertex degrees, paths, Planar graphs, Trees; Basic Algebra: Groups, Monoids, Rings, Lattice Theory, Applications of DM in AI Systems.


R.P. Grimaldi, B.V. Ramana, Discrete and Combinatorial Mathematics: An Applied Introduction, 5th Edition, Pearson, 2008.
B. Kolman, R.C. Busby, S.C. Ross, Discrete Mathematical Structures, Pearson Education India; 6 edition , 2015.
Kenneth Rossen, Discrete Mathematics and its Application, 7th Edition, McGraw-Hill, 2011.
L. Lovasz, Combinatorial Problems and Exercises, 2nd Edition, North Holland, 1993.


Information Technology

Contact us

Head of the Department,
Department of Information Technology,
National Institute of Technology Karnataka,
SurathkalP. O. Srinivasnagar, Mangalore - 575 025
Ph.:    +91-824-2474056
Email:  hodit [at] nitk [dot] edu [dot] in

Web Admin: Sowmya Kamath S

Connect with us

We're on Social Networks. Follow us & stay in touch.