Scribd
Upload
904 views

CS6201 - Discrete Structures 2

The course introduces the students to matrices and determinants: counting techniques; abstract algebra; groups and semi-groups; graphs theories; trees; network models; algebraic structures and their application in computer science.

Uploaded by

Rohmer Roi Alejandrino Bujawe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
904 views

CS6201 - Discrete Structures 2

The course introduces the students to matrices and determinants: counting techniques; abstract algebra; groups and semi-groups; graphs theories; trees; network models; algebraic structures and their application in computer science.

Uploaded by

Rohmer Roi Alejandrino Bujawe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

AMA Education System

Academic Affairs Department

COURSE SYLLABUS

Course Code: CS6201


Course Title: Discrete Structures 2
Credit Units: 3 units

Course Description
The course introduces the students to matrices and determinants: counting techniques; abstract
algebra; groups and semi-groups; graphs theories; trees; network models; algebraic structures
and their application in computer science.

Course Objective
At the end of the term, the student is expected to be familiar with the underlying principles and
theories and applications of advanced discrete structures. Specifically, the student should be
able to:
1. Apply the concepts of graphs and trees.
2. Be familiar with the terminologies and characteristics of trees.
3. Enumerate and discuss the different network models.
4. Identify the properties of combinatorial circuits.
5. Understand Boolean algebras, Boolean functions and synthesize circuits.6.Understand
computational geometry.

Course Outline
I. Graph Theories
1. Introduction
2. Paths and cycles
3. Hamiltonian cycles
4. Shortest-path algorithm
5. Representation of graphs
6. Isomorphisms of graphs
7. Planar graphs

Quiz 1

II. Trees
1. Introduction
2. Terminology and characteristics of trees
3. Spanning trees
4. Minimal spanning Trees
5. Binary trees
6. Tree traversals
7. Decision trees and the minimum time for sorting
8. Isomorphisms of trees

Quiz 2
Prelims Examination

III. Network Models and Petri nets


1. Network models
2. A maximal flow algorithm
3. The Max Flow, Min Cut Theorem
4. Matching
5. Petri Nets

Quiz 3
IV. Boolean Algebras and Combinatorial Circuits
1. Combinatorial Circuits
2. Properties of combinatorial circuits
3. Boolean algebras
4. Boolean functions and synthesis of circuits
5. Applications

Quiz 4
Midterm Examination

V. Automata, Grammars and Languages


1. Sequential circuits and finite-state machines
2. Finite-state automata
3. Languages and grammars
4. Nondeterministic finite-state automata
5. Relationships between languages and automata

Quiz 5

VI. Computational Geometry


1. The closest-pair problem
2. A lower bound for the closest-pair problem
3. An algorithm to compute the convex hull

Quiz 6
Final Examination

Textbooks & References


1. Discrete Mathematics, 3rd
Ed., Richard Johnsonbaugh, 1993
2. Discrete Mathematical Structures for Computer Science, 2nd
Ed., Bernard Kolman & Robert C. Busby, 1992

You might also like