Computer Science and Engineering

CSE 101 Introduction to Data Structures and Algorithms

Introduction to abstract data types and basics of algorithms. Linked lists, stacks, queues, hash tables, trees, heaps, and graphs will be covered. Students will also be taught how to derive big-Oh analysis of simple algorithms. All assignments will be in C/C++. (Formerly Computer Science 101 Algorithms and Abstract Data Types.)

Requirements

Prerequisite(s): CSE 13E or CSE 13S; and CSE 16; and CSE 30; and MATH 11B or MATH 19B or MATH 20B or AM 11B; Students may enroll in CSE 101 without having completed CSE 30 and CSE 13S or CSE 13E if they complete CSE 15 and CSE 15L (formerly CMPS 12B/M) by Fall 2019; and CSE 16; and MATH 11B or MATH 19B or MATH 20B or AM 11B; and one course from the following: MATH 21, MATH 22, MATH 23A, AM 10, or STAT 131.

Credits

5

Quarter offered

Fall, Winter, Spring, Summer

Instructor

The Staff, Patrick Tantalo, Manfred Warmuth, Allen Van Gelder, David Helmbold, Seshadhri Comandur, James Davis, Alex Pang