STUDY MATERIALS DESCRIPTION |
DEPARTMENT NAME |
MODULE NAME |
TOPIC NAME |
YOUR PREVIOUS STUDY MATERIALS |
COMPUTER SCIENCE |
WEEK 1 |
Introduction to Algorithms and Asymptotic Complexity Analysis of Algorithms |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
Algorithm Design Techniques |
Divide and Conquer |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
Algorithm Lab Day 1 |
Instructions |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
Algorithm Lab Week 1 |
Basic Searching and Sorting Algorithms |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
Algorithm Design Techniques |
Greedy Algorithms |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
Algorithm Design Techniques |
Dynamic Programming |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
Graph Representation and Algorithm |
Graph traversal algorithms |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
Classification of Problems |
P and NP problems |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
Algorithm Lab Week 2 |
Divide and Conquer approaches |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
Algorithm Lab Week 3 |
Single Spanning Tree Generation using - BFS, DFS |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
Algorithm Lab Week 4 |
Minimal Spanning Tree Generation using - Prim's Algorithm, Kruskal’s Algorithm |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
Algorithm Lab Week 5 |
Shortest Path finding using – Bellman Ford Algorithm, Floyd-Warshall Algorithm |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
Algorithm Lab Week 6 |
Shortest Path finding using – Dijkstra's Algorithm Graph Colouring Algorithm using backtracking |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
CMS-A-DSE-B--1-TH: Operation Research (O.R.) |
Chapter 1- Introduction |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
CMS-A-DSE-B--1-TH: Operation Research (O.R.) |
Chapter 2- LPP |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
CMS-A-DSE-B--1-TH: Operation Research (O.R.) |
Chapter 3- Simplex Method in LPP |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
CMS-A-DSE-B--1-TH: Operation Research (O.R.) |
Chapter 4- Simplex Method in LPP (Minimization) |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
CMS-A-DSE-B--1-TH: Operation Research (O.R.) |
Chapter 5- Solving Minimization Problem in LPP using M-Method |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
CMS-A-DSE-B--1-TH: Operation Research (O.R.) |
Chapter 6- Problem of Degeneracy in LPP |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
CMS-A-DSE-B--1-TH: Operation Research (O.R.) |
Chapter 7- Transportation Problem |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
CMS-A-DSE-B--1-TH: Operation Research (O.R.) |
Chapter 8- Optimality test Transportation Problem |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
CMS-A-DSE-B--1-TH: Operation Research (O.R.) |
Chapter 9- Assignment Problem |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
CMS-A-DSE-B--1-TH: Operation Research (O.R.) |
Chapter 10- Game Theory |
CLICK HERE FOR VIEW |
COMPUTER SCIENCE |
CMS-A-DSE-B--1-TH: Operation Research (O.R.) |
Chapter 11- Network Scheduling |
CLICK HERE FOR VIEW |