STUDY MATERIALS DESCRIPTION |
DEPARTMENT NAME |
MODULE NAME |
TOPIC NAME |
YOUR PREVIOUS STUDY MATERIALS |
Computer Science |
Asymptotic Complexity Analysis of Algorithms |
Space and Time Complexity, Efficiency of an algorithm, Growth of Functions, Polynomial and Exponential Complexity, Asymptotic Notations: Big O Notation and Small o notation, Big Ω and Small ω, Big Θ Notation, Properties: Best case/worst case/average case analysis of well-known algorithms. |
CLICK HERE FOR VIEW |
Computer Science |
Algorithm Design Techniques |
Concepts and simple case studies of Greedy algorithms |
CLICK HERE FOR VIEW |
Computer Science |
Algorithm Design Techniques |
Greedy Algorithm : Cormen pdf |
CLICK HERE FOR VIEW |
Computer Science |
Algorithm Design Techniques |
Dynamic programming |
CLICK HERE FOR VIEW |
Computer Science |
Algorithm Design Techniques |
Dynamic programming |
CLICK HERE FOR VIEW |
Computer Science |
Algorithm Design Techniques |
Divide and Conquer Algorithm |
CLICK HERE FOR VIEW |
Computer Science |
Algorithm Design Techniques : Dynamic Programming |
Matrix Chain Multiplication |
CLICK HERE FOR VIEW |
Computer Science |
Algorithm Design Techniques : Dynamic Programming |
Matrix Chain Multiplication |
CLICK HERE FOR VIEW |
Computer Science |
Operating Systems: Introduction |
Basic OS functions, types of operating systems- batch processing, multiprogramming, time sharing, multiprocessing, distributed and real time systems. |
CLICK HERE FOR VIEW |
Computer Science |
Operating System Organization |
Processor and user modes, kernels, system calls and system programs. |
CLICK HERE FOR VIEW |