Baruch College Department of Mathematics | MTH 4320 – Fundamental Algorithms

MENU

MTH 4320 – Fundamental Algorithms

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.

Apply to this course