Fundamental data structures and algorithms of computer science; basic algorithm analysis; recursion; sorting and searching; lists, stacks, queues, trees, hashing; object-oriented data abstraction.
Course Objectives »
| Credits: | 3 |
|---|---|
| Prerequisites: | CS 142 |
| 2010 | 2011 | 2012 | 2013 | ||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Win | Spr | Sum | Fall | Win | Spr | Sum | Fall | Win | Spr | Sum | Fall | Win | Spr | Sum | Fall |
| Offerings from the past year | |||||
|---|---|---|---|---|---|
| Semester | Instructor | Website | |||
| Spring 2010 | — | ||||
| Winter 2010 | — | ||||
| Fall 2009 | Giraud-Carrier, Christophe | http://seth.cs.byu.edu/~cs235/fall2009 | |||
| Fall 2009 | Barker, Cory | http://seth.cs.byu.edu/~cs235/fall2009 | |||
| Summer 2009 | grad, cs | http://students.cs.byu.edu/~ma...ummer2009/ | |||