Search courses 👉
Professional Training

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

edX, Online
Length
6 weeks
Next course start
Start anytime See details
Course delivery
Self-Paced Online
Length
6 weeks
Next course start
Start anytime See details
Course delivery
Self-Paced Online
Visit this course's homepage on the provider's site to learn more or book!

Course description

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

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!

Upcoming start dates

1 start date available

Start anytime

  • Self-Paced Online
  • Online
  • English

Suitability - Who should attend?

Prerequisites:

Some basic algebra skills needed. Students should have taken:

  • Computer Science A: Java Programming
  • Computer Science A: Java Programming Data Structures and Loops
  • Computer Science A: Java Programming Classes and Objects

Outcome / Qualification etc.

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

Training Course Content

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

Course delivery details

This course is offered through Purdue University, a partner institute of EdX.

5-10 hours per week

Expenses

  • Verified Track -$49.95
  • Audit Track - Free
Ads