1-Teaching propositions, logic, and proofs 2-Teaching number systems and conversions of them 3-Teaching algorithms, decision, and loop structures 4-Teaching character arrays, sets, relations, and functions 5-Teaching Boolean algebra and graph structures 6-Teaching Euler and Hamiltonian paths and circuits 7-Teaching Prim’s and Dijkstra’s algorithms 8-Teaching tree structures and sorting algorithm

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, algorithms, 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, simplification of Boolean expressions, digital circuits, disjunctive normal form, Karnaugh maps, graph structures, isomorphisms of graphs, paths, and circuits, Euler path and circuit, Hamiltonian path and circuit, trees, minimum spanning tree, Prim’s algorithm, minimum distance paths, Dijkstra’s algorithm, movement within a tree, binary search tree, sorting algorithms.