AP Computer Science A: Java Programming Polymorphism and Advanced Data Structures

AP Computer Science A from Purdue University

( 0 Reviews )

Created by: Phil Sands

Quality Score

Content Quality

Video Quality

Qualified Instructor

Course Pace

Course Depth & Coverage

Overall Score : 0 / 100

Course Description

This computer science course covers advanced OOP strategies, including polymorphism, abstract classes, super keyword, exceptions, generics, sorting and searching algorithms.
This course is for anyone interested in taking a first-level computer-programming course, particularly those who attend a school that does not provide a similar class.
We are looking forward to helping you explore this exciting new world!
Unit Name or Timeframe: Polymorphism (3 weeks)
Polymorphism and the relationship of parent and child classes
Calling parent constructor and casting with super keyword
Abstract class and interfaces and the use of late binding
Abstract methods
Unit Name or Timeframe: Exceptions (1 weeks)
Generic Exception class
Arithmetic, ArrayIndexOutOfBounds, NullPointer, ClassCast, IllegalArgument
The try-catch structure
The throws keyword
Handled vs unhandled exceptions
Unit Name or Timeframe: Dynamic data structures (3 weeks)
Use List reference and by extension the ArrayList classes
Generics
Traversals, insertions, deletions
Swap operations
Bubble sort, Selection sort, Insertion sort and Merge sort
Binary search and Linear search
Big-O Notation and algorithm analysis

Beginner Level

Time: 6 Weeks - 8-10 hours per week

Instructor Details

Phil Sands

0.0 Rating
0 Reviews

Phil is the K-12 Outreach Coordinator for Computer Science at Purdue University. Previously, Phil spent 6 years as a software engineer and 7 years teaching computer programming and statistics at high schools in Washington D.C. and Michigan. He is currently working on his PhD at Michigan State University, and completed his undergraduate degree in Computer Engineering at the University of Michigan in 2001.