|
Courses
3 hours lecture (3 credit hours)
Instructor: David Daugherty
Prerequisite: ITEC 120 (Grade of "C" or better) and MATH 121, or MATH 140 or MATH 145 or MATH 1551 or MATH 155.
An introduction to discrete mathematical concepts including set theory, finite state machines, and induction.
Goals and Objectives of the Course:
- To introduce certain theoretical concepts of discrete mathematics which are especially pertinent to computer science.
- To further acquaint students with the methods of mathematical problem solving in general.
- To apply mathematical theory to aid in designing computer programs.
Detailed Description of Content of Course:
- 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 O notation.
Three hours lecture, two hours lab (4 credit hours)
Instructor: David Daugherty
Prerequisite: ITEC 120 (Grade of "C" or better)
Continuation, from ITEC 120, of the development of a disciplined approach to programming, with emphasis on data abstraction.
Goals and Objectives of the Course:
- To introduce more advanced principles of computer programming and problem solving.
- To teach algorithm and program development and construction techniques that make use of abstraction, information hiding and more advanced data structures.
- To provide a foundation for further studies in information technology.
|