Select the desired Level or Schedule Type to find available classes for the course. |
CSCI 271 - Data Structures |
An in-depth presentation of recursion, collections and iterators, fundamental techniques in graphics, and threading. Students implement linked lists, stacks, queues, trees, heaps, graphs, hash tables and related algorithms. Students implement a significant programming project. NOTE: Students cannot receive credit for both this course and CSCI 252 Computer Science II Using Java.
Prerequisites: Completion of CSCI 215 Computer Science II Using Java with a minimum grade of C- (1.70) and MATH 180 Precalculus.
1.000 Credit hours 4.000 Lecture hours Levels: Non-Matriculated, Post-Baccalaureate Tchr Lcnse, Undergraduate Schedule Types: Directed Study, Lecture Computer Science Department Course Attributes: Undergraduate Level Course Restrictions: May not be assigned one of the following Student Attributes: DGCE Student Prerequisites: PREREQ for CSCI 271 General Requirements: ( May not be taken concurrently. ) or ( May not be taken concurrently. ) or ( Course or Test: CSCI 252 Minimum Grade of C- May not be taken concurrently. ) or ( Course or Test: CSCI 215 Minimum Grade of C- May not be taken concurrently. ) or ( Course or Test: CSCI 215 Minimum Grade of P May not be taken concurrently. ) and ( Course or Test: MATH 180 to 221 Required Courses: 1 May not be taken concurrently. ) or ( May not be taken concurrently. ) or ( May not be taken concurrently. ) |
Return to Previous | New Search |