CS 014: Introduction to Data Structures and Algorithms

← 2010-11 2011-12 2012-13 →
← 2010-11 ← 2010-11 changes (lax) changes (strict) ▾ 2012-13 → 2012-13 →

Units: 4

Hours: Lecture, 3 hours; laboratory, 3 hours

Catalog page 205

Prerequisites: CS 012 with a grade of "C" or better or CS 013 with a grade of "C" or better; proficiency in C++

Description: Topics include basic data structures such as arrays, lists, stacks, and queues. Covers dictionaries (including binary search trees and hashing) and prior- ity queues (heaps). Offers an introductory analysis of algorithms, sorting algorithms, and object-oriented programming including abstract data types, inheri- tance, and polymorphism. Explores solving complex problems through structured software development.

Enrollment History (from UCR Banner, not catalog)
Year F W S Su Total
2019-20 89/122 89/ 96 244/250 45/64 467/532
2018-19 99/120 76/ 80 150/194 17/30 342/424
2017-18 88/120 54/ 90 139/190 17/22 298/422
2016-17 93/118 65/100 150/172 13/30 321/420