![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||||||||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
|
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||||||||
SPRING 2010
|
GENERAL INFORMATION15-121 is an introduction to data structures and algorithmic analysis using the Java programming language. Object-oriented programming techniques, data aggregates, data structures (e.g., linked lists, stacks, queues, trees, and graphs), and an introduction to the analysis of algorithms that operate on those data structures. Prerequisities/Entrance Requirements15-100/110, AP CS A with a score of 5, or prior programming experience in a high-level language and advisor approval. NOTE: If you have not taken a programming course using Java or a language similar to Java and have not written code using methods, loops, arrays, and object-oriented principles, you should NOT enroll in 15-121 and instead enroll in 15-110 or 15-117. TextbookData Structures: Abstraction and Design using Java (2nd Ed.) by Elliot B. Koffman. |
![]() |
||||||||||||
COURSE INFO | CALENDAR | LECTURES | ASSIGNMENTS | LABS | HELP |
||||||||||||||