Difference between revisions of "CMSC475 - Combinatorics and Graph Theory"

From CS 400 Level Course Wiki
(Created page with "'''Course Information''' <br> General enumeration methods, difference equations, generating functions. Elements of graph theory, matrix representations of graphs, applications...")
 
 
Line 21: Line 21:
  
 
''' Languages Used ''' <br>
 
''' Languages Used ''' <br>
 
+
You will be taught LaTeX, and prior experience is not required.
  
 
''' Recommended Prior Experience ''' <br>
 
''' Recommended Prior Experience ''' <br>
 
+
A STRONG proof background.
  
 
''' Projects, Exams, or other Assessments ''' <br>
 
''' Projects, Exams, or other Assessments ''' <br>
 
+
All homework is to be typed up in LaTeX.
  
 
''' Misc Info ''' <br>
 
''' Misc Info ''' <br>
 +
If you have NOT taken MATH 310 or CMSC 250, or are CURRENTLY taking either course, it is not recommended to take CMSC 475.

Latest revision as of 12:29, 24 October 2016

Course Information
General enumeration methods, difference equations, generating functions. Elements of graph theory, matrix representations of graphs, applications of graph theory to transport networks, matching theory and graphical algorithms.

Instructor Section Day & Time Location
Wiseley Wong 0101 MWF 10:00AM - 10:50AM MTH 0303

Course Prerequisite(s)
Prerequisite: MATH240 and MATH241; and permission of CMNS-Computer Science department. Or must be in the (Computer Science (Doctoral), Computer Science (Master's)) program. Also offered as: MATH475.

Class Webpage


Hours Per Week


Languages Used
You will be taught LaTeX, and prior experience is not required.

Recommended Prior Experience
A STRONG proof background.

Projects, Exams, or other Assessments
All homework is to be typed up in LaTeX.

Misc Info
If you have NOT taken MATH 310 or CMSC 250, or are CURRENTLY taking either course, it is not recommended to take CMSC 475.