1-Teaching Boolean algebra and graph structures 2-Teaching Euler and Hamiltonian paths and circuits 3-Teaching Prim’s and Dijkstra’s algorithms 4-Teaching tree structures and sorting algorithms

Propositions, conditional propositions, logical equivalence, inverse proposition, proofs, arguments, proof by induction, numbers and number systems, binary, octal and hexadecimal number systems, conversion between number systems, algorithm, program, decision structures, loop structures, sets, character strings, relations, partial order relation, total order relation, equivalence relation, functions, domain, range, one-to-one and onto functions, Boolean algebra.