Certification Course in Java

Overview

Python is a valuable learning tool for high school students, honing problem-solving and
logical thinking skills while providing a versatile programming foundation applicable
across STEM and creative domains.
Meanwhile, Java training delves into architecture, code development, data handling,
and functions, offering a certification path towards roles such as Java developer, web
designer, or database administrator.
The course covers Java fundamentals, statements, exception handling, object-oriented
programming, and packages. This comprehensive Java certification equips individuals
for diverse roles, from programming hobbyist to web developer, fostering a broad skill
set for those pursuing a career in technology.

Why Choose this Program?

1. Java is globally ubiquitous, fostering collaboration and providing extensive resources, making it a practical choice for developers.
2. Learning Java serves as a gateway to mastering diverse programming
   languages, broadening one’s skill repertoire effectively.
3. Java’s balance of simplicity and robust features makes it accessible for beginners
   while ensuring scalability and reliability in advanced applications.
4. With a rich set of pre-built libraries, Java’s API empowers developers,
   streamlining application development and enhancing overall efficiency.

Salient Features of This Program

• Designed for High School Students ( 8-12th Preferred)
• Project based learning
• Dedicated Program Support

You Get A Completion Certificate

Upon accomplishing the Java Certification Course, students attain an esteemed
certificate, validating their expertise in Java programming. This credential enhances
career prospects, unlocking diverse opportunities in the field.

Course Curriculum

MODULE 1: 

Basic Java

• Flowcharts

• Concepts in Java
  • Java Platform Independence
  • Installation of Java
  • Hello World and Variables
  • Taking Input
  • Storing Data
  • Explicit Typecasting
  • Operators
• Loops and Conditionals
  • Conditionals
  • While Loop
  • For Loop
  • Break and Continue
  • Patterns
    • Square Pattern
    • Triangular and Character Patterns
    • Reverse Number Patterns
    • Mirror Number Patterns
    • Star Patterns
    • Diamond Star Pattern
  • Scope of Variables
• Operators
  • Bitwise Operators
  • Power set using Bitwise
  • Post and Pre Increment Operator
  • Post and Pre Decrement Operator
• Mathematics
  • Factorial of Number
  • Trailing zeros in Factorial
  • GCD or HFC, LCM of two numbers
  • Prime Factors
  • All Divisors of a Number
  • Iterative Power
  • Computing Power
• Functions
  • What are Functions?
  • How Function Calling Works?
  • Pass By Value

MODULE 2:

oops

• Intro to OOPS
• Constructors and Modifiers
• Components of OOPS
• Inheritance
• Private Members
• Protected and Super Keywords
• Inheritance and Constructors
• Polymorphism
• Exception Handling
• Final Keyword
• Method Overriding

MODULE 3:

Arrays

• Intro to Arrays
• How Arrays are Stored?
• Operations on Arrays
• Passing Arrays to Function

MODULE 4:

Searching, Sorting and Multidimensional Arrays

• Intro to Binary Search
• Selection Sort
• Bubble Sort
• Insertion Sort
• Quick Sort
• Merging Sorted Arrays
• Strings and how to store them
• 2D Arrays and it’s Sorting
• Passing 2D as Arguments
• Jagged Arrays

MODULE 5:

Everything about Time And Space Complexity

• Asymptotic Notation
• Omega Notation
• Theta Notation
• Analysis of Common loops
• Linear Search Time Complexity
• Insertion Sort Complexity
• Merge Sort Complexity
• Selection Time Complexity
• Fibonacci Space Complexity

MODULE 6:

Recursion

• Method Overloading
• Variable Arguments
• What is Recursion?
• Application of Recursion
• Analysis of Recursion Time Complexity
• Recursion and PMI Method
• Recursion and Arrays
• Helper Functions
• Practice Questions

MODULE 7:

OOPS 2.O

• Dynamic Method Dispatch
• Abstract Function and Classes
• Interfaces
• Generics
• About Generics
  • Generic Methods
  • Bound Generic Types

MODULE 8:

Linked List

• Array List
• Intro to Linked List
• Print Linked list
• Taking linked list input
• Inserting node in Linked list
• Deleting Node in Linked list
• Midpoint of Linked List
• Merge Sort
• Merging two sorted LL
• Reverse LL
• Reverse Recursively Double Node
• Reverse Iterative
• Insert Recursively
• Delete Recursively
• Variations of LL
• Circular doubly LL
• Traversal in LL
• Linked List in Collections

MODULE 9:

Stacks

• Intro to Stacks 
• Stacks Using Array
• Stack double capacity
• Stack using LL
• Stack in Collections
• Balanced Parenthesis
• Intro to Queue
• Queue using Array
• Dynamic Queue
• Queue using LL
• Queue in Collections
• Dequeue
• Array Implementation of Dequeue
• Array Dequeue

MODULE 10:

Trees

• Tree Data Structure
• Applications of Tree
• Tree node class
• Finding number of nodes
• Node with largest data
• Height of Tree
• Depth of node
• Maximum in Binary Tree
• Tree Traversals
• Binary Tree

MODULE 11:

Hashing

• Intro to Hashing
• Hashing Application
• Direct Address table
• Chaining VS Open Addressing
• Inbuilt Hashmap
• Bucket Array and Hash Function
• Collision handling
• Time Complexity and Load Factor
• Rehashing
• Practise Questions

MODULE 12:

Binary Tree

• What is a Binary Tree?
• Count nodes in Binary Tree
• Take Tree input and print recursively
• Find Node
• Height of Tree
• Diameter Binary Tree
• Preorder and Postorder Traversal
• Maximum in Binary Tree
• LCA of Binary Tree
• Serialise and Deserialize a Binary Tree
• Iterative Inorder Traversal of Binary tree

MODULE 13:

Priority Queues

• What is the Priority Queue?
• Ways to implement Priority Queues
• Heaps Introduction
• CBT Height and its implementation
• Insert and Delete in Heaps
• Implementation – Insert
• Remove Min Solution and Complexity Analysis
• Inplace Heap Sort
• Inplace Heap Sort – Solution
• Inbuilt Priority Queue and K sorted array
• K largest elements
• Inbuilt Max Priority Queue

MODULE 14:

Tries and Huffman Coding

• Intro to Tries
• Tries Implementation – Insert a Word
• Tries Implementation – Searching and Deleting a Word
• HashMap vs Tries
• Types of Tries
• Huffman Coding

MODULE 15:

Dynamic Programming

• Minimum coins to make a value
• Minimum Cost path- Recursive, Memoization, DP
• LCS – Memoization, DP
• Optimal Strategy for a Game
• Maximum sum with no consecutive
• Matrix Chain multiplication
• Allocate minimum pages
• Edit Distance-Recursive, Memoization, DP
• Knapack

MODULE 16:

Graph

• Graph Introduction
• Graph Representation
• Adjacency List Implementation
• Adjacency Matrix
• BFS Traversal
• Applications of BFS
• DFS Traversal
• Applications of DFS
• Topological Sorting (DFS Based Algorithm)
• Implementation of Dijkstra_s Algorithm
• Kosaraju’s Algorithm
• Bellman Ford Shortest Path Algorithm
• Articulation Point
• Kruskal’s Algorithm

MODULE 17:

Greedy

• Selection Activity Problem
• Fractional Knapsack
• Job Sequencing Problem

MODULE 18:

Backtracking

• Rat in Maze
• Sudoku Problem