AAALLLL The slides!!! (2010)

Here you shall find all the slides needed for final exam. Download from here(3 mb)... [You must be registered and logged in to see this link.]
It includes..
1. 2 slides from linear programming
2. 10 slides from graph algorithms
3. 1 slide from NP
I guess thats all.

Wow Good work

And topic title changed to AAALLLL The slides!!! (2010)

Erm, but if you think the previous title was better, feel free to edit it yourself :p
Edit:
Did I say... rep++ ?

valo valo..............etai to chassilam
but, what about Network Flow and Matching??
If we think about Graph Section, it is ok that Network Flow is included, but where Matching...
plz make it more clear...

@ift..i got no idea about complete syllebus.
@amt..hm..it sounds more cinematic.

It is just that all the slides will come up again in next coming semesters.
So I decided to make it more search friendly :p

Very good work Hasan Iqbal.
rep +++

Efat--> Flow and Matching both are in the syllabus.

I am requesting everyone to make a detailed syllabus version. I mean, make a new thread that will include the details of this exam syllabus.

Here, by details, I mean topics, or books.
For example, in LP, we only need to read the books 3,4,6,7.
In NP, we only need to read something like err... till slide 23 or something?

Anyway, The current syllabus includes only the generalized subject and I am confused about what I need to read from where.

Someone please help

I think we will have to read:
Chapter 22, 23, 26 & section 24.1, 24.3, 25.2 from Corman for graph.
Chapter 34 for NP