# Principles of Computer Science II

## Computer Science 151

##### Usual Description

This course builds upon the principles introduced in CSCI 150 and provides a general background for further study in Computer Science. The course will cover object-oriented programming concepts; the design and implementation of data structures (linked lists, stacks, queues, trees, heaps, hash tables and graphs) and related algorithmic techniques (searching, sorting, recursion); and algorithm analysis. Students will be expected to complete a number of programming projects illustrating the concepts presented.

##### Course Listings

These are all of the listings of this course recorded in the Oberlin course catalog since the fall of 2007.

Listing | Semester | Professor | |
---|---|---|---|

Computer Science 151 | Taught by John Donaldson | ||

Computer Science 151 | Taught by Roberto Hoyle | ||

Computer Science 151 | Taught by Benjamin Kuperman | ||

Computer Science 151 | Taught by Robert Geitz or Benjamin Kuperman | ||

Computer Science 151 | Taught by Robert Geitz or Benjamin Kuperman | ||

Computer Science 151 | Taught by Benjamin Kuperman | ||

Computer Science 151 | Taught by Benjamin Kuperman | ||

Computer Science 151 | Taught by Steven Crain or Robert Geitz | ||

Computer Science 151 | Taught by Alexa Sharp or Cynthia Taylor | ||

Computer Science 151 | Taught by Benjamin Kuperman | ||

Computer Science 151 | Taught by Benjamin Kuperman | ||

Computer Science 151 | Taught by Benjamin Kuperman | ||

Computer Science 151 | Taught by John Donaldson | ||

Computer Science 151 | Taught by John Donaldson or Alexa Sharp | ||

Computer Science 151 | Taught by Alexa Sharp | ||

Computer Science 151 | Taught by Benjamin Kuperman | ||

Computer Science 151 | Taught by John Donaldson |