From this page you can download the presentation of the different topic of different subject. View these presentation and share with your friends..
In this slide the following topic are Covered: What is Greedy Algorithms Spanning TreesM Graph Theory
It was published in its currently recognized form by Robert Floyd in 1962 The algorithm is an example of dynamic programming.
When it is impossible to install wires and cables or cabling is expensive then you can use Wireless Medias. Wireless media generate higher electromagnetic frequency, such as radio wave, microwave, & infrared.
Strassen showed that 2x2 matrix multiplication can be accomplished in 7 multiplication and 18 additions or subtractions. .(2log27 =22.807) This reduce can be done by Divide and Conquer Approach.
In this presentation we Learn about Advanced Object Oriented programming Using Java
it is the second phase of compiler In this phase of compilation process hieratical tree structure is generated from available tokes. In this phase , an appropriate text is assign to each tokens.