Design Algorithms

*Graph(BEST LECTURE LINK )

1.DFS ( Link1,Link2,Link3

2.BFS (Link1,Link2,Link3,Link4)

*Spinning Tree (Link)

-Prim's Algorithm ( Link)

*Time Compelxity (Link1,Link2,Link3)

*Dynamic Programming

1.Minimum Edit Distance ( Link1,Link 2,Link3,Link4)

2. Knap sack/Counting Money (Link1,Link 2,link3,Link4)

3.chain matrix (Link1)

*Greedy Algorithm

1.activity Selection Problem ( Link1,Link2

2.Huffman Encoding Algorithm ( Link1,Link2

*Shortest Path

1.Dijstra algo ( Link1,Link2,Link3)

2.Bellman-Ford Algorithm (Link1,Link2)

3.Single sourse shortest paths indirected acyclic graph ( Link1)

4.Floyd-Warshall Algorithm ( Link1,Link2,Link3,Link4)

COMPILER CONSTRUCTION

*Ambiguous Grammer

*Ambiguous Grammar to Unambiguous conversion

* Sytax directrd Tree (Link1,infix to postfix , Link2,Link3)

*Left Recursion (Link1)

*Left FActoring (Link1)

*first and follow set (Link1)

*LL(1) table (Link1,Link2)

*Actions (LiNK)

NUMERICAL ANALYSIS

* Trapezoidal rule, Simpson's rule → Click here

*Bisection Method → Click Here

*Newton raphson Method → Click here

*Method of Fasle Position(regula falsi Method) → Click Here

*Interpolation (forward & backword) → ( Forward & backward )

*Lagranges interpolation → Click here

*Newton Divided difference → Click here

*Tylor's Series → Click Here

*Maclaurnies Series → Cick Here

* Euler Method → Click Here

*Runge-Kutta method → Click Here

*Jakob's Method → Click Here

*Gauss-Seidel Method → Click Here

OPERATING SYSTEM

* Linux/Ubantu (Shell) Tutorials ( LINK )

* Online Ubantu/Linux IDE ( LINK )

* Basic Concepts ( LINK)

*Semaphores (LINK)

*Banker's Algorithm (LINK)

*FCFS, SRTF,Round Robbin

*After Mids Topics (LINK)

*FIFO,LRU,OPTIMAL ALGORITHM