Difference between revisions of "Class notes and slides"
Peter Beerli (talk | contribs) |
Peter Beerli (talk | contribs) |
||
| Line 8: | Line 8: | ||
=== Random Processes === | === Random Processes === | ||
[[Media:lectures_mcmc_1.pdf|Lecture in PDF format]]<br> | [[Media:lectures_mcmc_1.pdf|Lecture in PDF format]]<br> | ||
| + | The slides introduce probability, calculation of probability for combined events, and short exposition of random numbers (historically and with matlab). | ||
Revision as of 05:22, 11 September 2013
I post the class slides here, they appear usually after the class, I encourage you not to depend on the slides but to take old fashioned notes, because the material will be easier to learn that way. Class notes are an amalgamation of my own slides and slides made by Janet Peterson and John Burkart.
Algorithms and Design
Lecture in PDF format
The slides discuss algorithm efficiency, brute force algorithms for sorting and searching, a transform and conquer algorithm for searching, decrease and conquer algorithms for sorting and finding a fake coint; a greedy algorithm for coin changeing, divide and conquer algorithms for sorting, searching, large integer multiplication and matrix multiplication. These lecture notes were originally prepared by Janet Peterson and slightly edited by Peter Beerli.
Random Processes
Lecture in PDF format
The slides introduce probability, calculation of probability for combined events, and short exposition of random numbers (historically and with matlab).
