MTH 4320 - Fundamental Algorithms

Institution:

CUNY Bernard M Baruch College

Subject:

Description:

4 hours; 3 credits This course covers basic combinatorial procedures used in various applications of computer science. Some of these are searching (sequential, binary), sorting (bubble, quick, Shell, bucket, heap), and merging of files. These are followed by computer representations and traversing of graphs, spanning trees, minimal path, and Hamiltonian circuits. For each topic an algorithm will be designed, programmed, and run on the computer. The results will be analyzed in terms of efficiency. Prerequisites: MTH 3300 (STA 3300) or CIS (STA) 2359 and CIS (STA) 3362.

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.baruch.cuny.edu

Phone Number:

(646) 312-1000

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.