Topics.Midterm.I - Arithmetic)/// Sctn 3.4 (pp201-205),...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Midterm I, Topics Covered: You are advised to study the “Lecture Notes” since our exposition of some topics has been different from that of the book . If you have problems reading the handwriting on the web (which is understandable!!!) take notes from a friend who attends classes regularly. In any case we have covered the following (referring to the corresponding pages from the book/// s), not necessarily in the same order; 5 th ed //// 6 th ed Section 2.1 Algorithms, pp120-129/// Sectn 3.1, pp 167-175 Section 2.2 pp 131-142/// Sctn 3.2 Section 2.3 Complexity of Algorithms /// Scn 3.3 Section 2.4 Integers pp153-158 (INCLUDING proof of the Fundamental Thm of
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Arithmetic)/// Sctn 3.4 (pp201-205), Sctn 3.5 Section 2.5 Euclidean Algorithm pp177-179/// Sctn 3.6, pp227-229 Section 2.6 pp181-184 /// Sectn 3.7, pp 231-235 Diffie-Hellman Key Exchange (not in the book- see lecture notes) Section 3.2 Sequences pp225-231 /// Sctn 2.4 Countability of Rational Numbers; p234/5. Example 19./// Sectn 2.4 Section 3.3 Induction pp238-246 /// Sctn 4.1 pp 263-275 Some more exercises: 6 th ed: p.192. 52, 57, 58. pp 259-266: 13, 24, 25, 28, 29, 32, 40. 5 th ed: p.144. 52, 57, 58. Pp 209-211: 13, 24, 25....
View Full Document

This note was uploaded on 03/16/2012 for the course FENS 101 taught by Professor Selçukerdem during the Fall '12 term at Sabancı University.

Ask a homework question - tutors are online