This course is about Operating Systems. This course covers the classical internal algorithms and structures of operating systems,
including CPU scheduling, memory management, and device management.So, it covers topics including file systems, virtual memory,
disk request scheduling, concurrent processes, deadlocks, security, and
integrity.
The objective of the course is to make the participants aware of the structures and algorithms used in object oriented programming languages. The course also aims to cover various aspects of data representation their use in problem solving methodologies.
This course develops techniques used in the design and analysis of
algorithms. The classic algorithms are discussed, emphasizing on the
problems that arise in computer applications. This course covers
basically four techniques (greedy method, divide and conquer, dynamic
algorithms, backtracking), Number Theory and NP-Completeness. At the
end, it also discusses about approximation algorithms.
This course is about basics of C programming.
This course is about basics of C programming.
- Teacher: Manoj Shakya