MIME-Version: 1.0 Content-Type: multipart/related; boundary="----=_NextPart_01C63EB8.70364FF0" This document is a Single File Web Page, also known as a Web Archive file. If you are seeing this message, your browser or editor doesn't support Web Archive files. Please download a browser that supports Web Archive, such as Microsoft Internet Explorer. ------=_NextPart_01C63EB8.70364FF0 Content-Location: file:///C:/A11A4E30/comp3200.htm Content-Transfer-Encoding: quoted-printable Content-Type: text/html; charset="us-ascii" Department of Computer Science

TSU, COLLEGE OF ENGINEERING, TECHNOLOGY & COMPUTER SCIENCE

COURSE DESCRIPTION:  COMP3200, Discrete Mathematics (required)

 

 

COURSE OBJECTIVES AND COMPETENCY 

 <= /o:p>

This course is designed to introduce students to the concepts of discrete mathematics. Students are demanded to learn how <= /o:p>

 to apply mathematical facts and how to solve problems mathematically. The course provides a background for all courses in computer science:

 mathematical reasoning, combinatorial analysis, discre= te structures, algorithmic thinking, and application and modeling. =

 

PREREQUISITE: CS 212(Computer Science II)

&= nbsp;

Top= ics　　&= #12288;　　　　　　　<= u>        =             &nb= sp;  

Course Introduction, and syllabus  

Logic: Propositions, not, conj= unction, disjunction of propositions, truth tables, Bit operations        =             &nb= sp;            =             &nb= sp;            =             &nb= sp;   

Prepos= itional equivalences, pre= positional functions and quantifiers

Sets: definitions, presentations of s= ets. Cartesian products of sets

Set Operations: complement, union, intersection        =             &nb= sp;  

Functions: definition, domain, range, grap= hs of functions        =    

Sequences and summations, grow= th of functions        =                 

Algorithms: definitions and examples        =             &nb= sp;            =          

Complexity of algorithms =

Integers and division        =             &nb= sp;  

Integer and algorithms<= span style=3D'font-size:12.0pt;font-family:Arial;mso-fareast-language:JA'><= /o:p>

Matric= es        =             &nb= sp;            =             &nb= sp;            =                   =        

Mathem= atical reasoning

Mathematical induction        =             &nb= sp;            =             &nb= sp;            =    

Recursive functions and algorithms        =             &nb= sp;            =             &nb= sp;          

Basic = of counting        =             &nb= sp;         =             &nb= sp;            =             &nb= sp;  

Permutations and combinations =

Generalized permutations and combinations        =             &nb= sp;         

Discrete probability        =             &nb= sp;            =             &nb= sp;            =          

Relations: definitions, function as relati= ons

Applications of relations, equivalence relations, partia= l and total ordering   

Introd= uction to graphs, repres= enting graphs (Adjac= ency matrices)

Bipartite graphs and networks, paths and connectivity

Trees: definitions, properties= of trees, binary search trees, tree traversal        =           

------=_NextPart_01C63EB8.70364FF0 Content-Location: file:///C:/A11A4E30/comp3200_files/header.htm Content-Transfer-Encoding: quoted-printable Content-Type: text/html; charset="us-ascii"

1

 

------=_NextPart_01C63EB8.70364FF0 Content-Location: file:///C:/A11A4E30/comp3200_files/filelist.xml Content-Transfer-Encoding: quoted-printable Content-Type: text/xml; charset="utf-8" ------=_NextPart_01C63EB8.70364FF0--