AP Computer Science A: Java Programming Polymorphism and Advanced Data Structures
Offered By: Purdue University via edX
Course Description
Overview
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!
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
Taught by
Sunil Prabhakar, Debbie Perouli and Phil Sands
Tags
Related Courses
Conception et mise en œuvre d'algorithmes.École Polytechnique via Coursera Algorithmic Thinking (Part 2)
Rice University via Coursera Алгоритмы, часть I
Princeton University via Coursera Algorithms for Searching, Sorting, and Indexing
University of Colorado Boulder via Coursera Algorithms, Part I
Princeton University via Coursera