Guidelines for CS310 Final Examination

1. The final examination is a close-book test.  

2. The questions will be organized based on topics,
   rather than difficult levels.

3. All materials discussed in the class will be covered,
   The main topics are listed below:

   Chapter 1: Propositional logic
              Predicate logic
              Proofs

   Chapter 2: Sets
              Functions
              Sequences and summations
              Arithmetic progressions, geometric progressions
              Cardinality of sets

   Chapter 4: Sections 4.1, 4.2, and 4.3
              Number theory
              Divisibility and modular arithmetic
              Integer representations and algorithms
              Primes
              LCM, GCD
              The Euclidean algorithm for finding GCD

   Chapter 5: Sections 5.1, 5.2, 5.3
              Mathematical inductions
              Recursive definitions and structured induction

   Chapter 9: Relations, their properties, their representations
              Closures of relations
              Equivalence relations and partitions
              Partial orderings 

   Chapter 10: Sections 10.1 - 10.7
               Graphs, their properties and representations
               Euler and Hamilton Paths
               Shortest-path
               Planar graphs

   Chapter 11: Trees
               Applications of trees
               Tree traversal
               Spanning trees and minimum spanning trees

   Chapter 12: Sections 12.1 - 12.2
               Boolean algebra
               Boolean functions
               Representation of Boolean functions
                 sum-of-product expansion (disjunctive normal form)
                 product-of-sum expansion (conjunctive normal form)

Good luck with your examinations.