Study%20Tips0.Final%20Exam

# Study%20Tips0.Final%20Exam - Study Tips (Final Exam) Make...

This preview shows pages 1–2. Sign up to view the full content.

Study Tips (Final Exam) Make sure that you know/understand; The algorithms we have covered What “complexity” means, how one finds a O- estimate for it What we mean by “growth of a function” Prime numbers, their properties That, “every integer >1 has a prime factor”, and why it is so. The division algorithm and why it works The Euclidean Algorithm and its uses Some modular arithmetic- what we did in the class and also at the recitation classes What the Fundamental Thm of Arithmetic says, and the proof of it How to prove that there are infinitely may primes How to use the “induction principle” How to use “induction” to prove things! Recursively defined functions, sequences, algorithms etc. What we mean by “recursion”. Why Lamé’s Theorem is interesting. A full binary tree (and why is it called so?), how to use it for solving different types of problems Why Merge-sort is faster Basic rules of counting (sum rule, product rule etc), how to use them

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the 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.

### Page1 / 2

Study%20Tips0.Final%20Exam - Study Tips (Final Exam) Make...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online