MATH 263 - Discrete Mathematics II

Institution:

Community College of Philadelphia

Subject:

Mathematics

Description:

Discrete Mathematics II is a continuation of the study of discrete structures. It includes algorithms and algorithm efficiency; big-O,big-Omega,big-Theta and little-o notation, average and worst-case speed; sorting algorithms; graphs, adjacency and incidence matrices, paths, connectedness, bipartite graphs, isomorphism, Euler and Hamilton paths, shortest paths, Dijkstra's algorithm, planarity, Euler's formula, graph coloring; trees, tree traversal, prefix, infix and postfix notation, spanning trees and minimum spanning trees (Prim, Kruskal). Formal languages, finite state machines and automata may also be discussed.

Credits:

4.00

Credit Hours:

Prerequisites:

MATH 163 (Grade of C or Better)

Corequisites:

Exclusions:

Level:

Instructional Type:

Multiple

Notes:

4-0-4

Additional Information:

Historical Version(s):

Institution Website:

www.ccp.edu

Phone Number:

(215) 751-8000

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.