Courses

This course offers all of the Algebra with Applications curriculum with the addition of remedial material. This course is 3 credit hours, but meets 5 days per week. The S-section is intended for students with math placement 0.

Syntax and data structures, algorithm development, and data plotting using currently relevant technical computing programing language(s). Prior knowledge of programming is not required, but the course is appropriate for students with prior programming experience. Prerequisite(s) with concurrency: MATH 125 or MATH 145

Fundamental aspects of algorithmic algebra. Noetherian rings. Theory of Groebner bases. Hilbert Nullstellensatz. Elimination theory. Applications to graph theory and algebraic geometry. 2188 Mathematics - MATH

Modules. Groebner bases for modules and syzygy computations. Improved Buchberger's algorithm. Computation of Ext. Groebner bases over rings. Primary decomposition of ideals. Dimension theory.

Theory and algorithms for solving computational problems in graphs and hypergraphs. The topics may include minimum transversals, maximum matchings, trees and bipartite graphs, chordal graphs, planar graphs and graph coloring, hypertrees, chordal hypergraphs, planar hypergraphs and hypergraph coloring, colorability, perfection, and chromatic spectrum.

Theory and algorithms for solving computational problems in graphs and hypergraphs. The topics may include minimum transversals, maximum matchings, trees and bipartite graphs, chordal graphs, planar graphs and graph coloring, hypertrees, chordal hypergraphs, planar hypergraphs and hypergraph coloring, colorability, perfection, and chromatic spectrum. Prerequisite(s): MTH 2220, MTH 4420, or MTH 5520, or permission of the instructor

Techniques for design and analysis of algorithms; efficient algorithms for sorting, searching, graphs, and string matching; and design techniques such as divide-and-conquer, recursive backtracking, dynamic programming, and greedy algorithms.

Investigation of various properties of algorithms and their corresponding data structures, such as lists, stacks, queues trees, and B-trees. Some emphasis on comparable efficiencies of these tools. Languages that may be used for these types of applications include Java or C++.

Project oriented hands-on approach to accompany CS 303. CS 330. Computer Organization and Assembly Language Programming. 3 Hours. Register-level architecture of modern digital computer systems, digital logic, machine-level representation of data, assembly-level machine organization, and alternative architectures.

Algorithms for standard computational problems; design and implementation of efficient algorithms; mathematical analysis of algorithm efficiency.