-
Institution:
-
Metropolitan State University of Denver
-
Subject:
-
-
Description:
-
4 (4 + 0) Prerequisite: CS 2050 with grade of "C" or better, and Permission of the Department of Mathematical and Computer SciencesThis 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.
-
Credits:
-
5.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(303) 556-3058
-
Regional Accreditation:
-
North Central Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.