Number of slides and many questions :S

by **BIT0107-Toma** Fri May 07, 2010 4:33 am

I have collected the slides from forum. The statistics is:
1. 2 slides for LP
2. 9 slides for Graph.
3. 1 slide for NP

Now my questions are:
1. Does network flow exist in syllabus?
2. Is there any need to read Matching?
3. Has sir given slide on Warshall algorithm?

Note: I have not included network flow and matching in the statistics.

by **BIT0122-Amit** Fri May 07, 2010 5:07 am

syllabus of the subject 301 is given by Khaled sir himself in group mail.
But I am quoting it here for you:

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

About first question, I guess so.
about second, no idea.
about third, after being telling others to upload as well and not exactly seeing any positive reaction from most... I stopped giving concentration on these things.
Tabassum knows though.

by **BIT0129-Tabassum** Fri May 07, 2010 5:12 am

Thanks both of you.

And Toma I haven't found warsall's slide.

by **BIT0107-Toma** Fri May 07, 2010 5:27 am

I have seen the syllabus given by sir. But there is no network flow [You must be registered and logged in to see this image.] . So how it is included in the syllabus? [You must be registered and logged in to see this image.]