INFO 6205 — Program Structure and Algorithms

4 semester hoursGraduateLectureusually offered: fall, springArlington, VABostonMiami, FLOakland, CAOnlineSeattle, WASilicon Valley, CAToronto, CanadaVancouver, CanadaLive CastOnlineTraditional

Presents data structures and related algorithms, beginning with a brief review of dynamic memory allocation. Discusses the fundamental data structures in detail, including the abstract representation, supporting algorithms, and implementation methods. Focuses on understanding the application of the abstract data structure and the circumstances that affect implementation decisions. Covers lists, stacks, queues, trees, hash tables, and graphs. Covers recursion and searching and sorting algorithms in detail. Emphasizes data abstraction and encapsulation in code design. Explores external storage structures, time permitting.

Prerequisites

Offering history

TermSectionsEnrolledCapacityFullOpen seats/section
Fall 2023731350063%26.7
Spring 20241147061876%13.5
Fall 20241031447666%16.2
Spring 20251351264280%10.0
Fall 2025615026656%19.3
Spring 20261120145544%23.1

Snapshots from scheduled scrapes — not live seat availability. "Full" can exceed 100% when sections over-enroll.

Meeting times

Share of recent sections by weekday: M 9% · T 24% · W 25% · Th 3% · F 22%

Common patterns: U (30% of sections), W (22% of sections), TF (17% of sections), S (9% of sections), T (7% of sections), F (5% of sections) — in patterns, R means Thursday

Professors

Fall

Spring

Percentages are each professor's average share of the season's enrolled students in recent terms.

Unlocks

CSYE 6230, CSYE 7235, CSYE 7550, DAMG 7290, INFO 7110, INFO 7250, INFO 7255, INFO 7610

Courses that list INFO 6205 in their prerequisites.

Links

Official catalog (INFO course descriptions) · Student reviews on RateMyHusky · All INFO courses · Plan it at numap.app