| Computer Science |
Algorithm Design and Programming II |
CS2050 |
A study of fundamental techniques and algorithms for representing and manipulating data structures. Topics include data abstraction, recursion, stacks, queues, linked lists, trees, efficient methods of sorting and searching, and Big-O analysis. |
Sorting algorithms |
| Algorithm Design and Programming II |
CS3050 |
This class surveys fundamental algorithms and data structures that have wide practical applicability, including search trees and graph algorithms. Emphasis is placed on techniques for efficient implementation and good software development methodologies. |
Maze Solver |
| Object Oriented Programming |
CS3330 |
This course focuses on object-oriented programming concepts: abstraction, polymorphism, encapsulation, inheritance, interfaces, abstract classes, files, streams, and object serialization. Topics such as GUI and event-driven programming are also tackled. |
Game store, Audio Visualizer |
| Math |
Calculus III |
Math 2320 |
Vectors, solid analytic geometry, calculus of several variables. Math Reasoning Proficiency course. |
N/A |
| Discrete Mathematical Structures |
Math 2320 |
Sets, functions, logic, relations, induction, recursion, counting techniques, graphs, trees, algorithms. Math Reasoning Proficiency course. |
N/A |
University Of Missouri - Columbia