*****COURSES ARE SUBJECT TO CHANGE*****
Teaches students to implement common data structures and the algorithms associated with each data structure, through progressively difficult exercises. Topics include big "O" notation; pointers, recursion (induction), and dynamic allocation; linked lists and list processing; stacks, queues, binary trees and binary search trees; simple sorting techniques and simple search techniques. Students will gain a working knowledge of the elements of the Java and C programming languages. Prior experience with Unix is assumed. Prerequisite(s): course 11 or 12A or Computer Engineering 13. Concurrent enrollment in course 12M required. (General Education Code(s): IN, MF - Mathematical and Formal Reasoning)
5 Credits
Year | Fall | Winter | Spring | Summer |
---|---|---|---|---|
2018-19 |
|
|
|
|
2017-18 |
|
|
|
|
2016-17 |
|
|
|
|
2015-16 |
|
|
|
|
2014-15 |
|
|
|
|
2013-14 |
|
|
|
|
2012-13 |
|
|
| |
2011-12 |
|
|
| |
2010-11 |
|
|
| |
2009-10 |
|
|
| |
2008-09 |
|
|
| |
2007-08 |
|
|
| |
2006-07 |
|
|
| |
2005-06 |
|
|
| |
2004-05 |
|
|
|
|
2003-04 |
|
|
|
|
2002-03 |
|
|
|
|
2001-02 |
|
|
| |
1998-99 |
|
While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.