CS 3050 - Computer Science 3

4(4 + 0)

Prerequisite: CS 2050 with grade of “C” or better, and Permission of the Department of Mathematical and Computer Sciences

This course, a continuation of CS 2050, includes graphs, digraphs, balanced binary search trees, red-black trees, B-trees, B*-trees, B+-trees, and hashing. Students will write a variety of programs and some of these will include event-driven programming and graphical user interfaces. Two programming languages will be used in this course.