A.Y. 2020-21

This is a course on Advanced Calculus-II offered to students of M.Sc-II of the Department of Mathematics.

The lectures are being uploaded on YouTube channel Math HB.

This is a course offered to M.Sc(IMCA)-III students of Department of Mathematics.

This is a course offered to M.Sc(IMCA)-III year students of Department of Mathematics.

This is a course offered to M.Sc.(IMCA) II year students of the Department of Mathematics

Advanced Algorithms and Quantum Computing:

There are many hard problems with practical significance and useful applications. The course covers several ways of handling them including backtracking, branch and bound, randomized algorithm, approximation algorithm and parallel algorithms. In some cases efficiency can be achieved by changing the computational system. The second part of the course deals with quantum computing and its role in handling complexity.

This is a course on Database Management System for M.Sc.(IMCA)-II year students of the Department of Mathematics.

In this course, we learn the basics of Coding Theory.

In this course, we learn the basic Lattice Theory.

Operations Research (OR) is a branch of knowledge which essentially is very useful in the management and well-functioning of an organization. It is intuitively an analytical, logical and systematic method of problem-solving as well as decision-making at different levels in the system. 

Ackoff's outline of the phases of operations research is well known: 1. Formulating the problem; 2. Constructing the model; 3. Testing the model; 4. Deriving a solution from the model; 5. Testing and controlling the solution; 6. Implementing the solution.

Throughout the contents of the curricula, one has to keep eye on these steps though many a times we directly try to find the solution to a given (already formulated/modeled) problem. As such, the flow of course will take care of different aspects not necessarily at a time but at different types and levels of the methods and problems.

The course also cuts edges of other branches of knowledge including graph theory, discrete mathematics and nonetheless, computer science (networks). Many more aspects can be indulged during the course delivery without emotional entanglement. 

It is a basic course in Enumeration techniques and Discrete Mathematics.

A basic course in Ring theory.

This course is an elective course for M. Sc. (Mathematics) Semester III

This course is an elective course for M. Sc. (Mathematics) Semester III

Theory of Computer Science is one of the most important and necessary course in the curriculum of  Computer Science. This course addresses all concepts of automata, formal languages, grammar, algorithms, computability, and decidability. Always one may ask a question Why study theory when the current focus of Computer Science is on technology. Major parts of this course have some amount of impact on practice e.g. Automata on, compiler design, and search algorithms; Formal Languages and Grammars on compiler design; and Complexity on cryptography.