Computer Science 1
General
Prefix
CSCI
Course Number
201
Course Level
Undergraduate
Department/Unit(s)
College/School
College of Science and Engineering
Description
Data abstraction, elementary data structures, library classes, pointers and files. Sorting and searching. Error handling and recovery. Time and space analysis of algorithms. Standard representations (e.g. UML) of classes and objects.
Prerequisites
Credits
Min
4
Max
4
Repeatable
No
Goals and Diversity
MN Goal Course
No
Cultural Diversity
No
Learning Outcomes
Outcome
Apply basic programming constructs---selection, iteration, subprograms--in complete, syntactically correct programs.
Outcome
Design and implement applications that use two or more data abstractions (ADTs) and one main program.
Outcome
Design and implement programs that apply simple sorting algorithms and binary search.
Outcome
Develop a program in multiple stages; use stubs to test the system as a whole; use drivers to carry out unit testing for functional components and for data abstractions.
Outcome
Write design and user documentation for programs of simple to moderate complexity.
Outcome
Communicate both technical and non-technical aspects of their work in formal and informal situations.
Outcome
Analyze the time complexity of simple algorithms in terms of the big-O notation, and choose among competing algorithms on the basis of their big-O behaviors.
Outcome
Maintain a record of time devoted to the component tasks in the completion of programming projects. Design test cases for programs and write a document reporting on those tests.
Dependencies
Courses
CSCI201
is a
prerequisite
for:
Programs
CSCI201
is a
completion requirement
for: