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

Boolean algebra, simplification of Boolean expressions, digital circuits, disjunctive normal form, Karnaugh maps, graph theory, 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, B-tree, sorting algorithms.