Computer Science and Engineering

CSE15 Introduction to Data Structures

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. (Formerly Computer Science 12B.)

Requirements

Prerequisite(s): CSE 11 or CSE 14 or CSE 13E or CSE 13S. Concurrent enrollment in CSE 15L is required.

Credits

5

General Education Code

MF

Quarter offered

Fall

Instructor

The Staff, Patrick Tantalo, Wesley Mackey, Darrell Long, Seshadhri Comandur