JAVA COURSE. Curriculum >>>

Transcription

1 JAVA COURSE Curriculum >>> CSS TEC W E C H A N G E L I V E S

2 Introductory Java Language Features Packages and Classes Types and Identifiers Identifiers Built-in Types Storage of Numbers Hexadecimal Numbers Final Variables Operators Arithmetic Operators Relational Operators Logical Operators Assignment Operators Increment and Decrement Operators Operator Precedence Input/Output Input Output Escape Sequences Control Structures Decision-Making Control Structures Iteration Errors and Exceptions Multiple-Choice Questions on Introductory Java Language Concepts Classes and Objects Objects Classes Public, Private, and Static Headers Types of Method Overloading Scope The this Keyword References Reference vs. Primitive Data Types The Null Reference Method Parameters Multiple-Choice Questions on Classes and Objects

3 Inheritance and Polymorphism Inheritance Super class and Subclass Inheritance Hierarchy Implementing Subclasses Declaring Subclass Objects Polymorphism Dynamic Binding (Late Binding) Type Compatibility Down casting The Class Cast Exception Abstract Classes Abstract Class The abstract Keyword Interfaces Interface Defining an Interface The implements Keyword The Comparable Interface Multiple-Choice Questions on Inheritance and Polymorphism Some Standard Classes The Object Class The Universal Super class in Object The String Class String Objects Constructing String Objects The Concatenation Operator Comparison of String Objects Other String Wrapper Classes The Integer Class The Double Class The Kath Class Random Numbers Multiple-Choice Questions on Standard Classes

4 Program Design and Analysis The Software Development Life Cycle The Waterfall Model Program Specification Program Design Program Implementation Testing and Debugging Program Maintenance Object-Oriented Program Design Identifying Classes Identifying Behaviour Encapsulation Determining Relationships Between Classes UML Diagrams Implementing Classes Implementing Vocabulary Summary Program Analysis Program Correctness Assertions Efficiency Big-0 Notation Multiple-Choice Questions on Program Design and Analysis Arrays and Array Lists One-Dimensional Arrays Initialization Length of Array Traversing an Array Arrays as Parameters Array Variables in a Class Array of Class Objects Analysing Array Algorithms Array Lists The Array List Class Generics The of Array List Auto-Boxing and Unboxing Using Array List Two-Dimensional Arrays Declarations Processing a Two- Dimensional Array Two-Dimensional Array as Parameter Multiple-Choice Questions on Arrays and Array Lists

5 Recursion Recursive General Form of Simple Recursive Writing Recursive Analysis of Recursive Sorting Algorithms That Use Recursion Recursive Helper Recursion in Two- Dimensional Grids Multiple-Choice Questions on Recursion Linked Lists Linked List Linear Linked Lists Features of a Linked List The List Node Class A Linear Linked List Class Circular Linked Lists Implementing a Circular Linked List Doubly Linked Lists Why Doubly Linked Lists? Header and Trailer Nodes Implementing Doubly Linked Lists Run Time of Linked List vs. Array Algorithms Multiple-Choice Questions on Linked Lists

6 Stacks and Queues Stacks What Is a Stack? The Stack<E> Class When to Use a Stack Queues What Is a Queue? The Queue<E> Interface Queue Implementation When to Use a Queue Priority Queues What Is a Priority Queue? The Priority Queue<E> Class Implementation of a Priority Queue When to Use a Priority Queue Run Time of Stack, Queue, and Priority Queue Operations Multiple-Choice Questions on Stacks and Queues Trees Binary Trees Definitions Implementation of Binary Trees The Tree Node Class A Binary Tree Class Binary Search Trees. A Binary Search Tree Class Inserting an Element into a Binary Search Tree Finding a Target Element in a Binary Search Tree Creating a Binary Search Tree Tree Traversal Three of Traversal Implementing the Traversal Algorithms Recursive Tree Algorithms Recursion That Alters the Tree Structure Binary Expression Trees Infix, Postfix, and Prefix Expressions Binary Expression Tree Evaluating a Binary Expression Tree A Binary Expression Tree Program Run Time of Binary Search Tree (BST) Algorithms Multiple-Choice Questions on Stacks and Queues

7 Collections Collections in Java What Is a Collection? The Collections API The Collections Hierarchy Collections and Generics Collections and Iterators Definition of an lterator The lterable<e> Interface The Iterator<E> Interface Using a Generic lterator The Listlterator<E> Interface Using the Listlterator<E> Interface The Listd> Interface The oflist<e> The ArrayList<E> Class Using ArrayList<E> The LinkedList<E> Class Using LinkedList<E> Writing General Code ArrayList vs. LinkedList The Set <E> Interface The of Set<E> The HashSet<E> Class The TreeSet<E> Class Examples with HashSet<E> and TreeSet<E> The llap4, V> Interface The of Kap<K, V> The HashMap<K, V> Class The TreeMap<K, V> Class Iterating over Maps Examples with HashMap<K, V> and TreeMap<K, V> Run Time of Set and Map Operations Multiple-Choice Questions on Stacks and Queues

8 Sorting and Searching O(n2) Sorts: Selection and Insertion Sorts Selection Sort Insertion Sort Recursive Sorts: Merge sort and Quicksort Merge sort Quicksort A Binary Tree Sort: Heap sort Sorting Algorithms in Java Sequential Search Binary Search Hash Coding Resolving Collisions Note About Collections Run Time of Sorting Algorithms Run Time of Searching Algorithms Multiple-Choice Questions on Sorting and Searching

9 The GridWorld Case Study Overview The Classes The Actors The Location Class The Actor Class The Rock and Flower Classes The Rock Class The Flower Class The Bug Class The Box Bug Class The Critter Class The Chameleon Critter Class The Grid<!> Interface The AbstractGrid<E> Class The BoundedGrid<E> and UnboundedGrid<E> Classes Run-Time Analysis of Grid Bounded Grid Unbounded Grid Big-0 Summary of Grid Multiple-Choice Questions on Case Study