AP Computer Science A from Purdue University. 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.
Class Deals by MOOC List - Click here and see EdX's Active Discounts, Deals, and Promo Codes.
We are looking forward to helping you explore this exciting new world!
What you'll learn
- Polymorphism
- super keyword
- Abstract classes and methods
- Exceptions
- try-catch-finally structure
- throws keyword
- Handled and unhandled exceptions
- ArrayLists
- Generics
- Big-O notation
- Algorithm analysis
- Searching
- Sorting
Course Syllabus
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
Prerequisites
Some basic algebra needed. Students should have taken:
CS180.1x - AP Computer Science A: Java Programming
CS180.2x - AP Computer Science A: Java Programming Data Structures and Loops
[CS180.3x - AP Computer Science A: Java Programming Classes and Objects]()
