Test 1 includes Chapters 0,1,2 and 3 and the lab problems. You are allowed to bring notes, your book and calculator.

Do as many problems in the exercises as possible - By solving problems you understand the topics more thoroughly. Make a crib sheet
Topics include
Chapter 0. Algorithms, Definition, Big Oh, Big Omega, Big Theta Notations. Design of simple algorithms and analysis of them. (Know how to compare function growths - Know how to design and analyze simple algorithms).
Chapter 1.Euclidean algorithm, Extended Euclidean Algorithm, Exponentiation, Modular Computation, Modular Exponentiation, Fermat's Little Theorem, Modular inverse, RSA and Hash Function.
Chapter 2. Various Divide and Conquer Algorithms - Merge Sort, Quick Sort, Binary Multiplication, Quick Select. Analysis of Divide and Conquer algorithms, Recurrence relations and their solutions (Expanding and summing an Arithmetic Series or Geometric Series), Master Theorem, recursive Structures - Full Binary Trees and Binary Trees.
Chapter 3. Graphs Definition, Representation, Traversals of Graphs, Pre and Post numbering using DFS, Properties of Graphs using these numbers, Directed Graphs, DFS on directed Graphs
All The problems given in the lab (0 to 4) and variations of the problems. Homework problems and variations on them.