CPSC 301 - Data Structures
Fall 2026
Department of Computer Science
Example University
Instructor
| Name |
Prof. Jane Doe |
| Office |
ICT 523 |
| Email |
jane.doe@example.edu |
| Office Hours |
Tuesday 2:00–4:00 PM or by appointment |
Course Description
This course introduces fundamental data structures and algorithms used in
computer science. Topics include algorithm analysis, recursion, linked
lists, stacks, queues, trees, hash tables, heaps, graphs and basic
algorithmic techniques.
Prerequisites
- Introduction to Programming
- Discrete Mathematics
Course Information
Announcements
- Sept. 8 — Welcome to the course.
- Sept. 12 — Lecture 2 slides uploaded.
- Sept. 20 — Assignment 1 released.
- Oct. 3 — Midterm review session announced.
Lecture Schedule
| Week |
Date |
Topic |
Material |
| 1 |
Sept 8 |
Course Introduction |
Slides |
Notes
|
| 2 |
Sept 15 |
Complexity Analysis |
Slides |
Notes
|
| 3 |
Sept 22 |
Linked Lists |
Slides
|
| 4 |
Sept 29 |
Stacks and Queues |
Slides
|
Assignments
Labs
- Lab 1 – Development Environment
- Lab 2 – Linked Lists
- Lab 3 – Trees
- Lab 4 – Hash Tables
Examinations
| Exam |
Date |
Location |
| Midterm |
October 17 |
ICT 101 |
| Final |
TBA |
TBA |
Grading
| Assignments |
30% |
| Labs |
15% |
| Midterm |
20% |
| Final Exam |
35% |
Reading Material
- Required textbook
- Recommended textbook
- Lecture notes
- Research papers (optional)
Useful Software
Frequently Asked Questions
Can assignments be submitted late?
Late submissions incur a 10% penalty per day unless otherwise specified.
Can I work with another student?
Discussion is encouraged, but submitted work must be your own.
Previous Exams
Additional Resources
- Programming Style Guide
- Coding Standards
- Sample Programs
- Algorithm Visualizations
- Academic Integrity Policy