Searching…

University Catalog

Print Page



CSCI 201. Computer Science 1

Credits: 4
Department: Computer Science
Description: Data abstraction, elementary data structures, and dynamic data structures. Sorting and searching. Error handling and recovery. Time and space analysis of algorithms and big-O notation. Linked and sequential implementations of the list, stack, queue, set, and matrix abstract data types. Time management.
Prerequisites: MATH 112 or equivalent and either CSCI 200, ECE 102, CNA 267, IS 251 or permission of instructor
Semester Offered:
  • Fall
  • Spring
Grading Method: ABCDF
Lab: Lab

Student Learning Outcomes

1. Apply basic programming constructs---selection, iteration, subprograms--in complete, syntactically correct programs.
2. Design and implement applications that use two or more data abstractions (ADTs) and one main program.
3. Design and implement programs that apply simple sorting algorithms and binary search.
4. 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.
5. Write design and user documentation for programs of simple to moderate complexity.
6. Communicate both technical and non-technical aspects of their work in formal and informal situations.
7. 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.
8. 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.






The contents in this catalog and other university publications, policies, fees, bulletins or announcements are subject to change without notice and do not constitute an irrevocable contract between any student and St. Cloud State University.