Detailed Course Information |
Fall 2024
Jan 18, 2025 |
|
 |
||
 | Click the Schedule Type to find available offerings of the course on the Schedule of Classes. |
| DL 0061M - Data Structure Algorithms II |
|
This Data Structures & Algorithms course extends beyond linear data structures to the nonlinear and hierarchical data structures. The course begins by explaining Binary Trees and two subgroups: Binary Search Trees (BSTs) and Binary Heaps. You will program BSTs, their operations, and traversal algorithms, while investigating different collision strategies and implement one. A short Java review is presented on topics relevant to new data structures is also covered in this course.
The course design has several components and is built around modules. A module consists of a series of short (3-5 minute) instructional videos. In between the videos, there are textual frames with additional content information for clarification, as well as video errata dropdown boxes. All modules include an Exploratory Lab that incorporates a Visualization Tool specifically designed for this course.
5.000 Continuing Education Units 50.000 Lecture hours Syllabus Available Grade Basis: Z PE Computing Division Professional Education Department Course Attributes: PE edX Course, PE-LI Online | Asynchronous |
| Return to Previous | New Search |
|