Buying for a Team? Gift This Course
Wishlisted Wishlist

Please confirm that you want to add Java Object-Oriented Programming: AP Computer Science B to your Wishlist.

Add to Wishlist

Java Object-Oriented Programming: AP Computer Science B

AP Computer Science, Java Programming, Object-Oriented Programming, Java GUI, OOP, Java, Algorithms, Data Structure
4.2 (27 ratings)
Instead of using a simple lifetime average, Udemy calculates a course's star rating by considering a number of different factors such as the number of ratings, the age of ratings, and the likelihood of fraudulent ratings.
1,593 students enrolled
Created by Dr. Eric Chou
Last updated 12/2016
English
$10 $40 75% off
2 days left at this price!
30-Day Money-Back Guarantee
Includes:
  • 19 hours on-demand video
  • 55 Articles
  • 386 Supplemental Resources
  • Full lifetime access
  • Access on mobile and TV
  • Certificate of Completion
Have a coupon?
What Will I Learn?
Learn object-oriented programming in Java.
Study basic algorithms and data structure using Java
Meet the course requirements for AP Computer Science B (2nd Semester)
Complete review materials for AP Computer Science Exam and College Level Java Programming Courses
View Curriculum
Requirements
  • Finish the AP Computer Science Part 1: Java Programming Essentials or equivalent course.
  • Minimum mathematical background: algebra I
Description

[This is the 2nd semester of College Level Java Course. Please make sure that you have done 1st semester College Level Java equivalent course before signing up this course.  You may signed up both at the same time but make sure you have enough capability to handle this course.]

This course covers the second semester of AP Computer Science which includes complete introduction for Java Object-Oriented programming. The course is suitable for people who are seeking for a on-line class for introduction to Java programming, who are preparing for AP Computer Science Exam in high school and who want to sharpen their knowledge in Java.

This part B course includes complete tutorials for Java Object-Oriented Programming, Program Analysis, and introduction to algorithms which included recursive programming, data structure and algorithm development. This course revolutionize the way computer science is taught. Instead of teaching textbook chapter by chapter.

This course will be focused on an example program in each lecture. Lucid big idea in computer science will be introduced by the example program. It is followed by explanation of Java syntax and other language features. Practice questions, quizzes, and programming exercises will be given thereafter to enhance the understanding of the idea and to help to improve programming efficiency and test scores.

A spiral study model is suggested for student to build up good programming habits and shorten learning cycles in programming.

I would proudly say that this is one of the best Java Programming course on-line ever.

In this course, you will get:

(1) On-line lectures (with .pdf slides)

(2) sample programs (in Java)

(3) Quiz and exams (in multiple choice format) with solution

(4) AP format exam with solution.

(5) Free-online textbook access.

(6) Free on-line related information links and book chapters.

(7) Demo programs

(8) Lab projects

(9) Chapter projects.

(10) Facebook Q&A support and Gmail responses.

Who is the target audience?
  • Working individuals who want to learn data structure and algorithms using Java
  • Students who want to take AP Computer Science Exam
  • Programmers who finished the first Java Programming course and seeking for Java Programming course at intermediate level.
Students Who Viewed This Course Also Viewed
Curriculum For This Course
Expand All 214 Lectures Collapse All 214 Lectures 19:43:13
+
Introduction
7 Lectures 36:28

Overview of AP Computer Science Course as a whole. It also includes the table of contents for part 2 and part 3. Provide readers a good big picture of what to expect in the course. The slides (.pdf file) is also made downloadable.

Preview 07:05

Overview of Part 2 (AP Computer Computer Science B) and the related issues in AP Exam.

Preview 05:02

If you have not signed up for the College Level Java 1 course: Java Programming Essentials: AP Computer Science A

Get the College Level Java 1
00:45

Think Java: Companion book for this course. 

Think Java
02:11

Show student the resources and other educational materials provided by the Lecturer.  To guide student to learn Programming step by step. 

Preview 01:11

(Additional Lecture) Installation of BlueJ from AP Computer Science Part 1: Java Programming Essentials

https://www.udemy.com/ap-computer-science-a-java-programming-essentials

Installation of Java Software and BlueJ
06:36

Demonstrate the advantages of BlueJ as the first Integrated IDE for beginning students.

Why BlueJ?
13:37
+
Unit 3/Chapter 9: Revisit AP CSA Ch.9 - Classes and Objects
20 Lectures 01:38:29

Discuss classes and objects for data record with states and behaviors. States are properties or variables. Behaviors are methods. Any simple example of SimpleCircle class is used to show the idea of class and objects.

Preview 07:48

Exercise on different object-oriented program styles. 

Lab Project: Program Styles (Review, skip if done)
01:14

[Java Coffee Break] Showing the concept of using objects as data collection. 

A data object can with proper information hiding and encapsulation should only be accessed by getter methods and setter methods. 

[Java Coffee Break] Objects and Data Encapsulation
00:30

Discussion on the constructor methods for creating objects.

Preview 07:28

Construct a car fuel usage information class and object to exercise on basic object oriented programming skills. 

Lab Project: Fuel1 (Review, skip if done)
02:34

Talk about pointers and reference data type for Java. The main focus in this lecture is to summarize the various reference data type. For operations for reference data type, please refer to the external web link.
Reference Variables (Accessing String, Array, ArrayList, and Objects) (revisit)
07:23

Continue the Fuel Series program to add two member (instance methods) into it. 

Lab Project: Fuel2 (Review, skip if done)
01:52

Discuss the scope and lifetime of local variables, instance variables (methods), and class variables (methods).

Scope of Members (Static/Instance, Local/Global) (revisit)
12:29

Modify the Fuel2 project into Fuel3 project with multiple objects. 

Lab Project: Fuel3 (Review, skip if done)
01:41

Discuss the visibility modifiers (public, protected, default (no modifier) and private ) and where a variable, a method or object can be accessed.

Visibility Modifiers (revisit)
03:30

Modify Fuel3 project into array format. 

Lab Project: Fuel4 (Review, skip if done)
01:42

Starts Design Styles for Classes and Objects. First lecture on Static Members.

Classes and Objectes (1): Static Members (revisit)
10:25

Modify Fuel4 into arraylist format.

Lab Project: Fuel5 (Review, skip if done)
01:41

Use an example to show the idea of Data Encapsulation in Java

Classes and Objects (2) : Data Encapsulation 1 (revisit)
04:56

Discuss the ways to access objects by methods: (1) use accessor and mutator (2) passing objects as parameter for instance methods or class methods. Please also refers to the attached web-links fore more ways to pass objects to methods.
Classes and Objects (3): Data Encapsulation 2, Pass Objects to Methods (revisit)
09:02

Discuss how to design an immutable class. Three principles:

(1) All data fields must be private.

(2) No public setter methods.

(3) No accessor methods should return reference data type so that the reference data type may provide a back door (some mutator metthod) to update internal data which is supposed to be immutable.

Classes and Objects (4): Immutable Objects and Classes (revist)
03:56

Demonstrate the idea of static variables and the instance variables. 

Static versus Instance Properties
01:33

Introduce this keyword, it is a keyword to indicate the current object to distinguish the instance variable from argument, local variable and other variables of the same name. Class.variable is also presented.

this Reference (revisit)
15:51

Chapter project using AP Physics Rules for calculation of projectile. 

Chapter Project: Catapult Projectile (review, skip if done)
01:07

Show the internet resources available for eC Learning Channel by Dr. Eric Chou to support this course. 


My Udemy: https://www.udemy.com/user/eric-chou/

Youtube channel: https://www.youtube.com/channel/UCXGHpbLr9O5GydD0Ja9C7Nw

Facebook: https://www.facebook.com/profile.php?id=100007999848206

Quora: https://www.quora.com/profile/Eric-Chou-21 

Twitter: https://twitter.com/eCwarlephant

Email: echou510@gmail.com

Preview 01:45
+
Unit 4/Chapter 10: Object-Oriented Thinking (Examples of Ch. 9 Topics)
19 Lectures 02:17:12

Review of classes and objects and provide overview for the Object-Oriented Programming in Unit 4 and Chapter 10.

Preview 09:09

Use Course class as an example to show how to define a class and class coherence.

Demo Program: Course Class and Coherence
07:01

Thinking in Object-Oriented Programming way. To build a complete class for BMI calculation.

Demo Program: BMI Class, Completeness and Design Conventions
08:46

Design a BMR class to experience designing a cohesive and complete class.

Lab Project: BMR class
03:54

Create two classes for the Geometric project 1. Rectangle and Triangle classes. 

Lab Project: Geometric 1
01:31

Using conversion from a structual program into the BMR class and TestBMR class as an example to demonstrate the conversion between a structural program to object-oriented program.

Demo: Conversion of Structural Program to Object-Oriented Program
11:26

To design classes, you need to explore among classes. The common relationships among classes are association, composition and inheritance.

Preview 11:24

Video clip to shop the relationship of classes including is_a and has_a relationships. 

[Java Coffee Break] Class to Class Relationship
01:39

Use the violet tool to construct class diagram with Aggregation relationship.  Build a Lego class has has_A relationship for the Lego class and Rectangle and Triangle classes. 

Lab Project: Geometric 2
01:05

Lab project on stack of integers. This is the first project in a series on user-defined data structure using object-oriented programming. These basic data structure will be very useful in AP Exam. It is also a good introduction for Unit 5 (Algorithms and Data Structure).

This lab project is also a good example for OOP design guidelines for coherence, completeness and design styles.

Lab Project: Stack Of Integers
09:45

Provide examples, demo programs, and lab project to use this.

Standard Methods for Object Class
12:33

Use of this reference for conversion of static method and constructor calls.

Use of this Reference
06:35

Use String, StringBuilder and StringBuffer classes to separate the responsibilities for operating strings. (Part 1)

String, StringBuilder, and StringBuffer I (Separation of Responsibilities)
07:25

Use String, StringBuilder and StringBuffer classes to separate the responsibilities for operating strings. (Part 2)

String, StringBuilder, and StringBuffer II (Separation of Responsibilities)
13:45

Use Palindrome check to demonstrate the advanced String processing and StringBuilder/StringBuffer Class.

Demo Program: Check Palindrome (String Processing)
09:33

Use load Class to demonstrate the class abstraction and Ecapsulation

Demo Program: Loan Class
08:05

Show the three important top level classes for Java language: Object, Number and String classes.

[Java Coffee Break] Java Top Level Classes
00:58

Add the methods inherited from the Object class into the Rectangle and Triangle Class. Also add the mutator methods into these classes. 

Lab Project: Geometric 3
01:33

Introduction of BigInteger and BigDecimal classes along with conversion of int, double, Integer, Double, String data type conversion. BigInteger and BigDecimal classes are data classes with mathematical operations.

Math Processing I: (Data/Object Type Conversion)
11:05

Chapter 10 Quiz:
20 questions
+
Unit 4/Chapter 11: Inheritance and Polymorphism
14 Lectures 01:58:04

Inheritance enables you to define a general class (i.e., a superclass) and later extend it to more specialized classes (i.e. subclass)

Preview 14:52

The keyword super refers to the superclass and can be used to invoke the super-class's methods and constructors.

super keyword
06:19

Polymorphism means that a variable of a supetype can refer to a subtype object.

Polymorphism
12:17

To override a method, the method must be defined in the subclass using the same signature and the same return type as in its superclass. Overloading means ti define multiple methods with the same name but different signatures.

Overriding and Overloading
12:15

Show the concept of Inheritance, member properties, overriding, overloading. 

[Java Coffee Break] Inheritance
01:10

Apply the Inheritance and overriding methods to Geometric project. 

Lab Project: Geometric 4
02:02

Use numbers package to demonstrate polymorphism.

Demo Program: numbers package
06:45

One object reference can be typecast into another object reference. This is called casting object. Define method return value and parameters in more general (or abstract) superclass will make it more useful.

Casting and instanceof Operator
15:13

Example for Object class in equality package.

Demo Program: equality package
13:40

A method can be implemented in several classes along the inheritance chain. The JVM decides which method is invoked at run-time. (super.getNum(), this.getNum())

Dynamic Bining
12:41

Exercise Polymorphism on the Geometric Project.  Add three more classes, Square, Cube and Equilateral. 

Lab Project: Geometric 5
01:35

Show the nature and need for polymorphism and why it makes Java language platform-dependent with dynamic binding (linking)

Preview 01:35

Constructors for Parent class and Child class for the initialization of data fields in parent objects and children objects.

Base class Constructor (people package)
09:50

A protected member of a class can be accessed from a subclass.

The protected Data and Methods (people package: Non-AP Topic)
07:50

Quiz on Inheritance and Polymorphisn

Chapter 11 Quiz
20 questions
+
Unit 4/Chapter 12: Exception Handling and I/O (Binary I/O Optional)
17 Lectures 02:10:57

Exceptions are thrown from a method. The caller of the method can catch and handle the exception.

Preview 13:43

Exceptions are objects, and objects are defined using classes. The root class for exceptions is java.lang.Throwable.

Exception Types
08:30

A handler for an exception is found by propagating the exception backward through a chain of method calls, starting from the current method.

Exception Handling
14:50

A group of advanced topics on exception handling.

Advanced Topics (finally, Rethrowing, and Chained Exceptions)
09:53

You can define a custom exception class by extending the java.lang.Exception class. We provide an example to show how to do it.

Defining Custom Exception Classes
08:41

Discuss the keyword assert that can be used to check the program correctness. If the assertion is false, an error will be raised. This operator make initial error for program checking and testing. It is replaced by JUnit Test which is in another course that we have "Java JUnit for Unit Testing

Assertions
06:30

Objected Oriented Programming is for the following purpose: (1) Multi-threading, (2) Dynamic Binding, (3) Module Management. 

[Java Coffee Break] Object-Oriented Programming is for Module Management
02:17

Reading Geometric Object information from file. Add the Exception Handling mechanism into the program. 

Lab Project: Geometric 6
01:35

Quiz on Exception and Assertion

Chapter 12 Quiz (Exception and Assertion):
15 questions

The file class contains the methods for obtaining the properties of a file/directory and for renaming and deleting a file/directory.

File Class (Non-AP Topic)
09:47

This lecture focused on the general I/O concepts and the Stream class which is the top level class for the data stream hierarchy. 

Stream Class and Basic I/O Concepts (Non-AP Topic)
10:52

DataInputStream and DataOutputStream for the int, double, and other primitive data type and String data type I/O is presented. 

Data Stream (Non-AP Topic)
09:22

Using BufferedInputStream, BufferedOutputStream,BufferedWriter, BufferedReader to speed up the I/O for Java Programs. 

Buffered Stream (Non-AP Topic)
11:47

Write objects to files with ObjectOutputStream and read in objects from ObjectInputStream. 

Console Stream and Object Stream (Non-AP Topic)
07:58

After learning the object-oriented programming, students need to understand what is the purpose for object-oriented programming. OOP is widely used for class management and library building.  In modern terms, the packages of library code are called module, package, application programming interface (API), or even bigger, design framework. All of these are built up using object-oriented programming technology.  The Java Core classes means the classes available in Java development kit (JDK) that came with the Java compiler. 

[Java Coffee Break] Java Core Classes
00:49

Read and write objects from files or to files.  This is one of the project in the Geometric project series to work on the file operation (using Object Streams). Class used as a format of data record in this lab project. 

Lab Project: Geometric 7 (Non-AP Lab Project)
01:55

Advanced Object Stream (Non-AP Topic)
07:06

Just like you can read data from a file on your computer, you ca read data from a file on the Web.

Random Access File (Non-AP Topic)
05:22

Quiz on File Class and Input/Output Streams

Chapter 12 Quiz (File and Streams)
10 questions
+
Unit 4/Chapter 13: Abstract Classes and Interfaces
23 Lectures 01:57:11

An abstract class cannot be used to create objects. An abstract class can contain abstract methods, which are implemented in concrete subclasses.

Preview 12:27

Number is an abstract superclass for numeric wrapper classes, BigInteger, and BigDecimal.

Abstract Number Class
04:02

Use abstract class to organize classes sharing the same methods and data fields together. 

Lab Project: Geometric 8
01:47

GregorianCalendar is a concrete subclass of the abstract class Calendar.

Calendar and GregorianCalendar Class (Non-AP Topic)
05:14

Discuss the final keyword and the abstract methods.

Demo Program: absfinal package
05:07

Using an event listener for a button to explain the anonymous class. Anonymous class is very useful in GUI design.

Anonymous Class
04:52

Present the nature of Abstract Class

[Java Coffee Break] Abstract Class
01:52

Add two anonymous class (actually should be anonymous objects) into the arraylist glist. 

Lab Project Geometric 9 (Non-AP Topic)
01:15

An interface is a class-like construct that contains only constants and abstract methods.

Interfaces
08:18

The Comparable interface defines the compareTo method for comparing objects.

Comparable Interface
07:12

The Cloneable Interface specifies that an object can be cloned.

Cloneable Interface
06:01

The Iterable Interface has one method iterator(). The Iterator Class has hasNext(), next() and remove() methods.

The ListIterator Class many more methods.

These three interfaces are useful to allow the classes that implements these interfaces to have the iterator to traverse through the class with these three interfaces.

Iterable Interface (Non-AP Topic)
12:02

Show how interfaces can be used. 

[Java Coffee Break] Interface
01:26

Compare and contrast between abstract class and interface. Both of them are useful to provide a class with extra feature. Abstract class can be viewed as core data class, while interface can be viewed as a collection of unimplemented methods. An abstract class implemented an interface is a core data class with the collection of unimplemented methods.

Abstract Class verus Interfaces
07:48

Use Rational Class to demonstrate a class extend Number abstract class and implement Comparable Interface.

Demo Program: The Rational Class
04:30

Lab Project: Geometric 10
01:43

Rewrite the Geometric10 to Geometric11 using iterator interface to access the elements. 

Lab Project: Geometric 11
01:00

A class can implement multiple interfaces, but it can only extend one superclass.

Class Design Guidelines
03:38

Overview of Java Design Patterns

Java Design Patterns (Group of Classes and Interfaces) (Non-AP Topic)
05:06

Adapter class to curb the difficulty to use an abstract class or interfaces. The reason may be in-compatibility among interfaces or un-wanted methods.

Adapter Classes (Non-AP Topic)
05:27

Adapter pattern to allow an adapter to drive polymorphic methods among incompatible interfaces or abstract classes.

Adapter Pattern Demo (adapterpattern package) (Non-AP Topic)
08:48

Use the simplest Model-View-Controller (MVC) design pattern, front controller design pattern, to demonstrate idea of behavioral design pattern.

Front controller design pattern can also be named as "single dispatcher design pattern" is one of the simple but powerfule design pattern. It is a good example to understand design patterns.

Front Controller Design Pattern (frontcontroller package) (Non-AP Topic)
06:13

Use Adapter Design Pattern as an Example to show the combination of Interface, Abstract Class and Class can work together as Adapter Design Pattern 

[Java Coffee Break] Adapters
01:22

Quiz on Abstract Class, Interface, Anonymous Inner Class, Final Class, and Design Patterns

Chapter 13 Quiz
20 questions
+
Unit 4/Review 1: Review of Advanced OOP (AP: Optional)
18 Lectures 02:24:26
Java Software Installation and Swing Packages
01:09

Introduce Java GUI Programming Toolkits (AWT/Swing/SWT/Javafx) as Examples for Inheritance and Object-Oriented Programming in General

Demo Program: Swing, AWT and objectdraw packages
11:23

Introduce the user-defined GUI Application Classes in Swing and Javafx

GUI Simple Application Classes (Swing/Javafx)
13:57

Go over the topics in GUI Programming (Containers, Components, Listeners, Interface, Data Model) and finish with one Sparring Score example before going into serious GUI topics.

Overview of GUI Programming with Sparring Score Example (Non-AP Topic)
14:59

Overview of the AWT/Swing package class hierarchy. 

Class Hierarchy of AWT/Swing Package for Java GUI Basics
06:30

Discuss the basic GUI program structure with the brief explanation on Frame, JFrame, Applet, JApplet and their Anatomy. 

Frame (Top Level Container) (Non-AP Topic)
10:49

One simple example for 2nd Level containers (also component) JPanel. 

Sub-Containers (Panel) (Non-AP Topic)
04:21

Basic Helper class that represents many objects in the GUI environment including Color, Font, FontMetrics, Graphics, and Dimension

Helper Classes (Color, Font, FontMetrics, Graphics, and Dimension) (Non-AP)
11:46

Discuss the general issues about graphics design in AWT/Swing

Graphics Class as Canvas in Swing Graphics Design (An Overview) (Non-AP Topic)
07:06

Use awt.Applet and Rectangle3 class to as a basic Java graphic development platform. 

Lab Project: Geometric 12 (GUI 1 - awt.Applet)
02:12

Discussion of drawing basic geometric objects. 

Drawing Geometric Objects (Non-AP Topic)
11:19

Use awt.Applet and Rectangle3 class to as a basic Java graphic development platform. 

Lab Project: Geometric 12 (GUI 2 - JFrame)
00:54

Use javax.swing.JApplet (BlueJ default style) and Rectangle3 class to as a basic Java graphic development platform. 

Lab Project: Geometric 13 (GUI 3 - JApplet - BlueJ default style)
00:53

Use javax.swing.JApplet in a JFrame and Rectangle3 class to as a basic Java graphic development platform. 

Lab Project: Geometric 14 (GUI 4 - JApplet in JFrame)
00:57

Introduce the event-driven programming environment in java.awt API. 

Event-Driven Programming using AWT Event package (Non-AP Topic)
08:24

Event source, event object, event listener, event handler and event target. 

Event Objects (Non-AP Topic)
12:19

Event Listener, event handler method and anonymous inner class for simplification of event listener and handler design. 

Event Listener and Anonymous Inner Class (Non-AP Topic)
17:11

Design Flow of GUI Projects

Development of GUI Projects
08:15
+
Unit 5/Chapter 14: Recursion
14 Lectures 01:01:33

Introducing the recursion pattern in real-life and computer arts.  Using a recursive rectangle drawing program to show how to create visual recursion. 

Preview 07:22

Further discuss the fractals using the Sierpinski Triangle as an example. 

Fractals
05:19

Using factorial algorithm to explain tail recursion with helper method and compare it to the non-tail recursion method. 

Computing Factorials and Tail Recursion
06:34

Explain 2nd order linear recursion using the example of Fibonacci sequence. 

Fibonacci Numbers
03:41

Write an advanced Fibonacci number generator which can handle int data type and long data type.

Lab Project: Fibonacci Numebrs
00:50

Introduction of using recursion to solve problems.  One example of recursive palindrome check is used. 

Problem Solving using Recursion
06:11

Show the simple steps to write a recursive method. 

[Java Coffee Break] Recursive Patterns
00:57

Recursive Information Processing I on Simple Statistics. 

Recursive Processing I (Traverse, Sum/Avg/Max/Min, Reverse)
04:05

Recursive Processing on Text Processing. 

Recursive Processing II (Text Processing)
05:10

Recursive Processing III on recursive algorithms. 

Recursive Processing III (Selection Sort, Binary Search) (Non-AP Topic)
10:42

Comparison and conversion between iterative algorithm and recursive algorithm. 

[Java Coffee Break] Iterative VS Recursive
01:04

Writing the Palindrome Check for String (a chance to rewrite the program that is shown in the lecture). Please try to write in a different way. 

Lab Project: Palindrome
00:51

Using mathematical definition of Fibonacci sequence to compare the efficiency of iterative algorithm and recursive algorithm. 

Recursion vs. Iteration
04:20

Tower of Hanoi algorithm. 

Tower of Hanoi (Non-AP Topic)
04:27

Chapter 14 Quiz:
15 questions
+
Unit 5/Chapter 15: Searching, Sorting and Program Efficiency Analysis
25 Lectures 01:57:48

Overview of Algorithms and Algorithm study.  Introduce these important concepts and their study domain.

Preview 04:46

Discuss the Time complexity T(n) function and its asymptotic behavior for O(n) growth rate (for Big O notation)

Analysis of Algorithms: Big-O Notation
06:31

Resume the Geometric Project Series with comparable interface (implements compareTo() method). 

Lab Project: Geometric 15 (Comparable Interface)
01:33

Discuss how to formulate the time complexity function T(n) and the growth function O(n) which is the big-O notation. 

Time Complexity
06:49

collection of algorithms for FRQ exams.  We provide programs to show the basic algorithms.  By studying these algorithms, you may use them with some modification in the free response section in the real exams. 

Standard Algorithms
02:59

Use Euclid's algorithm to show that good algorithms do not come from hard-working people but from smart-working people.  A person cannot invent good algorithm by only studying other people's algorithm.  Instead, he must know about the nature of problem pretty well to invent a good algorithm. 

Euclidean Algorithm (Non-AP Topic)
06:35

Use 4 different algorithm to demonstrate the Prime Number checking algorithm (isPrime) of different efficiency.  Because of this reason, finding a good algorithm is very important. 

Finding Prime Numbers (Non-AP Topic)
06:18

Discuss simple linear search algorithm which is very useful in many applications. This lecture is followed by two exemplary demo program for letter occurrence count and word occurrence count in a text string.

Linear Search (Enhanced with Implementation from Chapter 7)
04:28

Highlight the issues in the study of algoriithms. 

[Java Coffee Break] Algorithms
01:32

Add the equals2D() method to the Geo2D interface, Rectangle3, Triangle3 classes. 

Add the equals3D() method to the Geo3D interface, Box3, Prism3 classes. 

Use these two methods to perform linear search on 2D and 3D Geometric objects. 

Lab Project: Geometric 16 (Linear Search)
02:39

Introduce a Binary Search version which will return the index of the matched element or a return code which indicate the hole where the key element can be inserted.

Binary Search (Enhanced with Implementation from Chapter 7)
10:46

Insertion Sort is based on finding the minimum and Insert by circular shifting. Example program is provided.

Sorting I: Insertion Sort
10:18

Showing the steps of a Insertion Sort case. 

[Java Coffee Break] Insertion Sort
02:24

Exercise on Insertion sort for array and use the same program to work on the arraylist with proper type conversion. 


Lab Project: Geometric 17 (Insertion Sort)
01:48

Selection Sort is based on the idea of finding minimum and swap. This lecture discussed selection sort from idea to solution. And an example is given.

Sorting II: Selection Sort
07:13

Showing the steps of a particular selection sort case. 

[Java Coffee Break] Selection Sort
03:06

Exercise on Insertion sort for array and use the same program to work on the arraylist with proper type conversion. 

Lab Project: Geometric 18 (Selection Sort)
01:52

Demo the use of selection sort and the binary search for arraylist and array. The array and arraylist are of interface reference type.  Interfaces are used as a combination of heterogeneous data object types. 

Lab Project: Geometric 19 (Binary Search)
02:20

Bubble Sort is another linear array sort. It is O(n^2) algorithm. The core for this algorithm is successive compare and swap.

Sorting III: Bubble Sort
08:52

Showing the steps of a particular Bubble Sort case. 

[Java Coffee Break] Bubble Sort
00:58

Bubble Sort is based on the idea of finding minimum and swap. This lecture discussed bubble sort from idea to solution. And an example is given.

Lab Project: Geometric 20 (Bubble Sort)
01:50

Introduce the merge sort and its performance analysis

Sorting IV: Merge Sort
07:56

Merge Sort is based on the idea of finding minimum and swap. This lecture discussed merge sort from idea to solution. And an example is given.

Lab Project: Geometric 21 (Merge Sort)
01:49

Introduce quick sort algorithm with small pivot version and general discussion for quick sort performance. Extra links for the middle pivot and large pivot version are also provided.

Sorting V: Quick Sort (Non-AP Topic)
10:30

Quick Sort is based on the idea of finding minimum and swap. This lecture discussed quick sort from idea to solution. And an example is given.

Lab Project: Geometric 22 (Quick Sort)
01:54

Chapter 15 Quiz:
10 questions
+
Unit 5/Chapter 16: Lists, Stacks, Queues, Sets, Maps, and HashMap (Optional)
17 Lectures 01:48:09

Collections Framework in Java API. 

Preview 11:44

Revisit for ArrayList by comparing ArrayList to LinkedList. 

ArrayList
04:48

Discuss the LinkedList Concrete Class

LinkedList
06:07

Word Ordering by Frequency using Linked List

Lab Project: Moon Landing (Analyzing word occurrence count for JFK speech)
03:32

Introduce Vector Class which is a synchronized version of ArrayList.  All of the methods for List can also be used for Vector.  But Vector has its own legacy methods. 

Vector Class (Non-AP Topic)
05:48

enum is a special numerical data type (It is defined like a class, while it behaves like a list). 


enum Type (Non-AP Topic) [revisit]
01:28

Summarize the Java Collection-List API and start the custom-designed MyArrayList Class. 

List Interface (Linear Data Structure)
10:10

Un-guided Lab: Use only the methods from the Collections, List, ArrayList, and Arrays classes or interfaces to convert an array to its own reverse. 


Lab Project: Reverse of an array
00:42

Introduce a simple example for custom designed pointer for linked list. 

Custom Data Structure by Pointers-Reference Data Type (Non-AP Topic)
05:14

Talk about the implementation of LinkedList class (named MyLInkedList). 

Custom-Designed Linked List
09:28

Quiz: Lists
12 questions

Discuss the data structure of Stack and Queue and provide a pair of examples for implementation of Stack and Queue using ArrayList and LinkedList, respectively. 

Stacks Class and Queue (Non-AP Topic)
06:48

Discuss PriorityQueue Class in Java API and a custom design PriorityQueue Class

Priority Queue (Non-AP Topic)
05:41

Discuss the Stack Class and Queue Interface in the collections framework. 

Stack Class and Queue Interface (Collections Framework)
07:33

Quiz: Stacks and Queues (Non-AP Topic)
10 questions

Discussion of Map Interface, HashMap, LinkedHashMap, TreeMap Classes and SortedMap, NavigableMap Interfaces

Maps (Non-Linear) (Non-AP Topic)
11:46

Application of Map data structure by an example of counting the word occurrence.  Please compare to AP Computer Science A chapter 7 Bible Word Count. 

Map Application (Word Occurrence) (Non-AP Topic)
04:01

Introduction to Set Interface, HashSet, and LinkedHashSet Classes. 

Sets (HashSet and LinkedHashSet) (Non-AP Topic)
06:34

Ordered TreeSet

Set (TreeSet) (Non-AP Topic)
06:44

Quiz: Sets and Maps (Non-AP Topic)
15 questions
8 More Sections
About the Instructor
4.0 Average rating
99 Reviews
3,259 Students
3 Courses
IEEE Senior Member, an engineer and an inventor

I love computational research and its application to real world. i have involved in many large-scale computer/communication product research development in many world-leading company such as HP, Micrel, and many startups. I also involved in founding a startup company. I also enjoy sharing my ideas through teaching. I hold many US and international patents in technical fields such as software development, mobile computing, IC design and communication receiver design. I am also a certified coach in Taekwondo in both UAST and AAU. 

I also serve as an adjunct faculty for on-line M.S. program in Computer Science/Data Science at Lewis University, IL, USA. 

Report Abuse