CSCI 4670: Course Information Sheet
CSCI 4670: Course Information Sheet
CSCI 4670: Course Information Sheet
CSCI 4670
Combinatorics
Brief Course Description
(50-words or less)
CSCI
2610
or
Discrete
Mathematics
for
Computer
Science
MATH 3000
or
MATH 3500
MATH
3200
Intro.
To
Higher
Math
or MATH 3500H
Approved Textbooks
(if more than one listed, the textbook
used is up to the instructors discretion)
Specific Learning Outcomes
(Performance Indicators)
.
Learning
Outcomes
Student Outcomes
a.
b.
c.
d.
a
b
c
d
e
f
g
h
i
j
k
1
2
3
4
5
6
7
An
ability
to
apply
knowledge
of
computing
and
mathematics
appropriate
to
the
discipline.
An
ability
to
analyze
a
problem,
and
identify
and
define
the
computing
requirements
appropriate
to
its
solution.
An
ability
to
design,
implement,
and
evaluate
a
computer-based
system,
process,
component,
or
program
to
meet
desired
needs.
An
ability
to
function
effectively
on
teams
to
accomplish
a
common
goal.
Major Topics Covered
(Approximate Course Hours)
3 credit hours = 37.5 contact hours
4 credit hours = 50 contact hours
Note: Exams count as a major topic
covered
Propositional
logic
(3.5-hours)
Predicate
logic
(3.5-hours)
Proofs:
types
of
proofs
(4-hours)
Sets,
set
logic
and
set
operations
(2-hours)
Functions
(2-hours)
Sequences
and
summations
(2-hours)
Integer
algorithms
(3-hours)
Modular
arithmetic
(.5-hours)
Mathematical
induction
(3.5-hours)
Counting
(2.5-hours)
The
pigeonhole
principle
(.5-hours)
Permutations
and
combinations
(2.5-hours)
Finite
probabilities
(4-hours)
Relations
(2.5-hours)
Using
graphs
to
represent
relations
(1.5-hours)
Each
time
this
course
is
offered,
the
class
is
initially
informed
of
the
Course
Outcomes
listed
in
this
document,
and
they
are
included
in
the
Course Master
Course History