Courses

Courses Taught

Course 1: CS C342 Advanced Computer Organisation (2012-13 IInd Sem, 2011-12 IInd Sem)

Objective: This course aims at introducing the concept of computer architecture and organization. It involves design aspects, and deals with the current trends in computing architecture. System resources such as memory technology and I/O subsystems needed to achieve proportional increase in performance will also be discussed.

Course 2: CS C471/IS F311 Computer Graphics (2022-23 Ist Sem, 2020-21 IInd Sem, 2019-20 IInd Sem, 2018-19 Ist Sem, 2017-18 Ist Sem, 2016-17 Ist Sem, 2015-16 Ist sem, 2014-15 Ist Sem, 2013-14 Ist Sem, 2012-13 IInd Sem, 2012-13 Ist Sem)

Objective: is to introduce the concepts of computer graphics through theoretical, algorithmic and advanced modeling aspects along with, applications in 3D graphics and visualization. This course is also covering part of OpenGL for graphics. After successful completion of the course student should be able to apply the concepts and techniques to various problem domain and visualization of data sets and processes.

Course 3: CS G526 Advanced Algorithms & Complexity (2021-22 Ist Sem, 2019-20 Ist Sem, 2015-16 Ist sem, 2014-15 Ist Sem, 2013-14 Ist Sem, 2012-13 Ist Sem)

Objective: is to enable students to explore advanced topics in algorithmic and complexity theory; engage in analysis and design of complex algorithms for real-world problems in application domains; learn and evaluate advanced / novel algorithm design strategies (Randomized algorithms mostly) and techniques; and understand sturdy / open problems in algorithmic or complexity theory by analyzing known approaches and their limitations.

Course 4: IS F242 Computer Organization (2013-14 IInd sem)

Objective: The course aims at understanding the important components of a computing system, how these components are interrelated. Also it attempts to look at the problems and methods of designing computers like pipelining, RISC architectures and parallel processing architectures. The treatment on the architecture is general and not specific to a particular processor.

Course 5: CS F364 Design and Analysis of Algorithms (2022-23 IInd Sem, 2021-22 IInd Sem, 2020-21 IInd Sem, 2019-20 IInd Sem, 2018-19 IInd Sem, 2014-15 IInd sem, 2013-14 IInd sem)

Objective: The objective of the course is to introduce students to different paradigm of algorithms and various techniques to analyze them. The analysis is of the correctness of the algorithm and the time complexity (also space complexity). They will also learn about the computational intractability; a class of NP-complete problems and techniques to prove NP-completeness. They will learn major techniques to deal with such computationally intractable set of problems.

Course 6: CS F111 Computer Programming (2021-22 Ist Sem, 2017-18 IInd Sem, 2016-17 IInd Sem, 2015-16 IInd Sem, 2014-15 IInd Sem)

Objective: The primary goals of the course are to introduce:

Basic representation of data and how to process data using the representation inside a computer.
Techniques for specifying data, operations on data, and problem solving using a programming language.
Systematic techniques and approaches for constructing programs.

Course 7: CS F214 Logic in Computer Science(2022-23 Ist Sem, 2021-22 Ist Sem, 2019-20 Ist Sem, 2018-19 Ist Sem, 2017-18 Ist Sem, 2016-17 Ist Sem)

Objective: The objectives of the course are to

Describe basic notions of logic that are important in computer science.
Describe the significance of different logical representations such as propositional and predicate logic in computer science
Impart proof writing skills
Enable them to write proofs for program verification.

Course 8: CS F402 Computational Geometry (2020-21 Ist Sem, 2018-19 IInd Sem, 2017-18 IInd Sem)

Objective: The objective of the course is to impart students with state of the art data structures and algorithms in computational geometry. The students at the end of the course will be able to

To identify suitable algorithms or data structure to apply for a given geometric problem.
Will be able to argue about the time complexity of geometric algorithms.
Will be able to write the proof of correctness of geometric algorithms.
Will be able to understand the intricacies involved in implementing such algorithms.
Will get acquainted with state of the art computational geometric algorithm libraries.
Will be able to implement computational geometric algorithms

Course 9: CS F211 Data Structures and Algorithms (2017-18 Summer Term)

Objective: The main objective of this course is to introduce structures for storing data and algorithms for

retrieving/manipulating data. It incorporates techniques for designing such structures. The course covers design,

implementation and applications of data structures including linked lists, stacks, queues, heaps, hash tables,

balanced binary search trees, and graphs. This course also introduces mathematical and experimental techniques

for analyzing the complexity of algorithms. The course discusses sorting and searching algorithms with detailed

analysis on complexity of algorithms. The course introduces algorithm design techniques like Divide and

Conquer, Greedy, Dynamic Programming to solve various interesting problems.

Course 10: CS F441 Selected Topics From Computer Science (2016-17 IInd Sem, 2015-16 IInd Sem)

In this course I taught Computational Geometry. This course was formally introduced as an elective course CS F402.

BITS Pilani

Courses

Courses

Quick Links