Fundamentals of Computer Science II (CSC-152 97F)
CS 152 is our second course in Computer Science. Its primary goal
is to introduce you to key issues in data structures and algorithms.
It is also intented to help you expand your ability to solve problems
on the computer.
The course's goal,s as stated in the department's planning document for the
- Students should expand their problem-solving abilities, becoming more
comfortable with both iterative and recursive algorithms.
- Students should learn principles of data encapsulation and modularity,
using separately compilable modules.
- Student should understand some fundamental abstract data types.
- Students should master some basic algorithms, including standard ADT
implementations and classical sorting algorithms.
- Students should develop facility with pointers and pointer structures.
- Students should understand some mathematical aspects of computer science,
including the analysis of algorithms and computational complexity
- Students should understand standard mechanisms of data representation.
Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.
Source text last modified Tue Aug 26 13:20:21 1997.
This page generated on Tue Oct 14 09:49:48 1997 by SamR's Site Suite.
Contact our webmaster at firstname.lastname@example.org