Syllabus for Final

Here I am giving the syllabus of Combinatorial Optimization.

Syllabus:

1. Linear Programming
2. Graph
3. NP

Though it looks very small syllabus, actually its not. Graph covers a huge area

thanx......

Thnx

You are most welcome

assa...........er sathe j MATCHING or Network Flow ase, ogulao ki syllabus e ase????

Matching r Network flow GRAPH er moddhe pore...

graph mane ki 22-26....????

tora keu chapter gula bolis na keno ??????????????
Please chapter gula likha dis.

thanx TOMA.......but, need actually Chapter gula bolle ektu subidha hoy
coz, sir exercise korte bolse

what about Floyd-Warshall?? oitar upor ki sir kono slide disilo???

The syllabus includes:

1. Linear Programming
2. Graph Algorithms
(Slides are: BFS, DFS, Topological Sort, Strongly connected components,
Articulation point, MST Prim, MST Kruskal, Dijkastra, Bellman Ford,
Warshall)
3. Non-deterministic Polynomials

BR///Khaled

--
Shah Mostafa Khaled
Lecturer
Institute of
Information
Technology
University of Dhaka
Mob: 01812698789
URL: [You must be registered and logged in to see this link.]
.com/in/shahmost afakhaled

Thanks Saiful

but, warshall er slide kothay Miss tabassum???

May be Network flow is also in the syllabus. Sir made a mistake to mention it. Warshall's slide will be here within tomorrow(hoping [You must be registered and logged in to see this image.] )

yaaaaaaah.......