Students majoring in other academic fields who wish to complete a minor in computer science must complete at least 18 hours of computer science, of which at least 6 semester hours must be at or above the 3000 level. The content of the course work for the minor must include the equivalent of
A broad introduction to many Computer Science topics including: algorithms, problem solving, operating system concepts, computer architecture, and programming languages.
This course is a continuation of COSC 1435, completing the syntax of the language used as the programming tool in COSC 1435 and providing an introduction to basic data structures. It includes the intermediate study of the basic concepts of problem solving. Topics covered include basic one- and two-dimensional array handling, recursion, basic searching and sorting algorithms, abstract data types, and dynamic data structures.
This course provides a thorough study of standard structures used in the storing and retrieving of data and the processes by which these structures are created and manipulated. Topics include: object oriented design, linked lists, classes, trees, graphs, hashing, stacks, queues, sorting, searching, and recursion.
It is assumed that the student has completed all mathematics prerequisites and corequisites for this course.
Any 3000 level COSC course will satisfy except: