Skip to main content

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

AP Computer Science A from Purdue University
AP Computer Science A: Java Programming Polymorphism and Advanced Data Structures
6 weeks
5–10 hours per week
Instructor-paced
Instructor-led on a course schedule
This course is archived

About this course

Skip About this course

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!

At a glance

  • Language: English
  • Video Transcript: English
  • Associated skills:Computer Programming, Java (Programming Language), Sorting, Polymorphism, Computer Science, Data Structures, Object-Oriented Programming (OOP)

What you'll learn

Skip 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

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

Interested in this course for your business or team?

Train your employees in the most in-demand topics, with edX For Business.