Discrete Math

ITEC122 is an introduction to the mathematical methods used in computer science. Topics include:

Logic and sets: basic concepts, combinatorial circuits, Boolean algebra, mathematical induction and recursion
Counting principles: basic techniques, combinations, permutation, notation, the binomial theorem
Recurrence relations
Graph theory: trees, binary trees, search algorithms, shortest path algorithms, spanning trees, connectedness, matching, cycles, applications
Complexity of algorithms: time and space, big-Oh notation

This and some other information is at the catalog curriculum.

Course pages, past and present

2018spring: Braffitt.
2017fall: Braffitt; Shing.
2017spring: Braffitt.
2016fall: Braffitt.
2016spring: Braffitt.
2015fall: Braffitt.
2008fall: Barland.
2007fall: Barland; Shing.
2007spring: Shing

Can't find (much) info for a particular semester? This might be due to that particular section using Blackboard (WebCT) or Desire2Learn (D2L). (Such pages are available only for the current semester, and only to enrolled students).

©2017, Ian Barland, Radford University
Last modified 2018.Jan.12 (Fri) Please mail any suggestions
(incl. typos, broken links)
to ibarlandradford.edu