Go to Main Content

Georgia Tech

 

HELP | EXIT

Syllabus Information

 

Fall 2024
Sep 19, 2024
Transparent Image
Information Use this page to maintain syllabus information, learning objectives, required materials, and technical requirements for the course.

Syllabus Information
DL 0061M - Data Structure Algorithms II
Associated Term: Fall 2024
Learning Objectives: Mature Java programming skills by using recursion in tree ADTs The different nonlinear, linked data structures: Trees, Heaps, SkipLists, and HashMaps The significant uses and applications of hierarchical tree structures Tree properties and categorizing based on shape and order How to design and implement the binary trees: BSTS and Heaps How to compute amortized analysis for BSTs, Heaps, HashMaps, and SkipLists
Required Materials: Recommended Pre-Requisite: Basic knowledge of the Java programming language, object-oriented principles, and the introductory data structures: arrays, linkedlists, stacks, queues, and deques. Required Materials: Internet connection (DSL, LAN, or cable connection desirable)
Technical Requirements:


Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.7.2.4GT