NORTHERN SAMAR COLLEGES

Catarman, Northern Samar

COURSE SYLLABUS
Course Number:
Title:

IT 212
Discrete Structures
(Pre-requisite: IT 110)

Department/Program:
Technology

Bachelor of Science in Information

Semester & School Year:

1st Sem., SY 2011-2012

Instructor:

Lope P. Salvador

Course Description:
The primary goal of this course is to provide an introduction to discrete
structures for information technology. Discrete structure is the study of the
logical and algebraic relationships between discrete objects. The focus will
be on set theory, logic, functions, induction and recursion, elementary
algorithm analysis, counting techniques, relations, graphs, trees, algebraic
structures and finite automata.
Course Objectives (Desirable Objectives):
At the end of the course, the students should be able to:
1. Translate statements into symbolic form using logical connectives
and quantifiers.
2. Use symbolic logic and truth tables to prove the equivalence of
statement and determine the validity of an argument.
3. Identify and correctly use different methods of proof including direct
proof, proof by contradiction and mathematical induction.
4. Perform operations with sets, relations, permutations, matrices and
graphs.
5. Solve problems using counting techniques and combinatorics.
6. Correctly prove statemenst involving properties of the integers and
cardinality of sets
Course Outline and Timeframe:
I.

II.

Topics and Readings

The Foundations: Logic, Sets, and Functions
Logic
Propositional Equivalences
Predicates and Quantifiers
Sets
Set Operations
Functions
Sequences and Summations
The Growth of Functions
The Fundamentals:
Algorithms, The
Integers, and Matrices
Algorithms

Date

Complexity of Algorithm
The Integers and Division
Integers and Algorithms
Applications of Number Theory
Matrices
III. Mathematical Reasoning
Methods of Proof
Mathematical Induction
Recursive Definitions
Recursive Algorithms
Program Correctness
IV. Counting
The Basics of Counting
The Pigeonhole Principle
Permutations and Combinations
Discrete Probability
Probability Theory
Generalized Combinations and Combinations
Generating Permutations and Combinations
V. Graphs
Introduction to Graphs
Graph Terminology
Representing Graphs and Isomorphism
Connectivity
Euler and Hamilton Paths
Shortest Path Problems
Planar Graphs
Graph Coloring
VI. Trees
Introduction to Trees
Application of Trees
Tree Traversals
Trees and Sorting
Spanning Trees
Minimum Spanning Trees
VII. Boolean Algebra
Boolean Functions
Representing Boolean Functions
Logic Gates
Minimization Circuits
Required Reading:
Discrete Mathematics and Its Applications by Kenneth H. Rosen
Discrete Mathematics by Richard Johnsonbough
Course Requirements
1.
2.
3.
4.
5.

Regular Attendance
Active Participation in the Class
Projects/Assignments
Quizzes
Satisfactory result on minor and major exams