AT Computer Science
This course is equivalent to a second or third semester college data structures course. Students learn algorithms regarding how to store data to maximize both memory and time efficiency. Students will explore and employ Linked Lists, Stacks, Queues, PriorityQueues, Trees, Heaps, Hash Tables, and a large dose of recursion. This course is challenging and highly rewarding.
What are the major projects you will complete in this course?
Students use their knowledge to delve into something of their choosing. Past projects have ranged from World Cup Predictions to Compression Algorithm Analysis to a Scrabble computer player.
Course Details
Thomas Rudwick
"You should take this course if you enjoyed AP Computer Science, and loved the independent parts of solving problems that are not initially obvious. You will turn into a super programmer after this course!"
AT Computer Science: Data Structures
ID: 44540 Grade: 11-12 Length: Year
Credit: Elective
Prerequisite: Semester I grade of B or higher in AP Computer Science.
Note: The Advanced Topic (AT) designation indicates a course is at university level, putting it at or above the level of a traditional Advanced Placement (AP) course. This course has a grade point weighting of 0.5.
This course is a standard college course on algorithms and data structures in an object- oriented environment. The sorting algorithms include selection, insertion, merge, quick, and heap. The data structures include arrays, linked lists, stacks, queues, trees, sets, maps, and graphs. Additional topics include recursion, the Java Collections framework, Big-O analysis, unit testing, and class design. The programming language is Java. Students taking this course should be independent thinkers able to spend a significant amount of time at a computer outside of class. This course goes well beyond the material tested by the College Board’s Advanced Placement Computer Science A exam. This course is project-based and very hands-on, and emphasizes a use of real world data whenever possible. The course requires rigorous study and emphasizes in-depth research.
What Our Students Say
As a course that builds on an AP class, AT Computer Science is often challenging as it constantly tests students’ problem solving abilities. After being taught the fundamental theory for a unit, class time is spent actually tackling problems. These include using various data structures to write algorithms that allow students to solve logic problems from completing a maze to simulating a restaurant. Students who plan on taking this class need to be persistent and patient, especially for the more complex problems. As an AT course, this class has clear foundational connections with AP Computer Science, allowing those who are interested in the subject to explore it in a manner which is simply not possible when preparing for a standardised test.”Anika Agarwal,
Class of 2020