Introduction – History of JAVA, Assembler, Compiler, Linker & Loder, Execution Process.

Installation of JDK, Eclipse software and Introduction to it’s environment.

Basic requirements to write a program –  Comments, #include Statement, Printf & Scanf, Displaying Output, reading Input from terminal.

Writing first Program, Datatypes, Primitive Data types, Variables, Operators & Operands, Casting in Java, Operators, Operands and Expressions,

statements

Methods in Java –  challenges megabytes converter, barking dog, leap year, Decimal comparator, equal sum checker, method overloading,  Area Calculator

Challenges- Number Palindrome, Patterns, Matrices, Even Digit Sum, Min Max challenge

Introduction to OOPS,

Arrays,

Interfaces, Inner classes, Abstract classes with examples,

Interfaces vs Abstract Clases.

Introduction to java collections, binary search, collection list methods, maps, Immutable classes, sets & hash sets, 

Introduction to Threads,

SQL

Reading declaration, controller OS, Pass by value and refference revise, requirements to write a program, Stacks, Queues, Linked List, Trees

LIFO, FIFO, user applications, array vs stacks, push & pop, applications, reverse.

LIFO, FIFO, user aplications, array vs queus, Insert, Delete, application, reverse.

Infix, Postfix, Prefix, Local variables, psudo code, palindrome, paranthesis, conversion, search operation (null, max, min) [psudo code & c code], reverse, application.

Singly, Doubly, Circular.

array vs Linked list,

node creation, Insert front & rear, Delete

Display, pvg for Insertion, Deletion, Front and rear end.

Doubly Linked List – Insertion front & rear end, delete, display

Implementation to stack, queue

Print middle node, kth node, search multiples, max.

concatenation of linked list,

reverse linked list.

Leaf node, Root node

different trees – ordinary, binary, strictly binary, complete binary, binary search tree, building binary tree.

Tree Traversals – Pre-order, In-order, Post order.

Insert node.

Recursion, Sorting, Searching+BFS+DFS, Dynamic Programming, Hashing

• Introduction to Algorithms, Recursion Introduction,  
• Stack Overflow, 
• Anatomy Of Recursion, Exercise: Factorial,

   Fibonacci, Recursive VS Iterative, Recursive VS Iterative, When To Use Recursion, Exercise: Reverse String With Recursion.

• Sorting Introduction 
• The Issue With sort()
• Sorting Algorithms 
• Bubble Sort
• Selection Sort
• Dancing Algorithms
• Insertion Sort
• Merge Sort and O(n log n)
• Stable VS Unstable Algorithms
• Quick Sort
• Which Sort Is Best?
• Heap Sort
• Radix Sort + Counting Sort

• Searching + Traversal Introduction
• Linear Search 
• Binary Search

   

• Graph + Tree Traversals

• BFS Introduction

• DFS Introduction

• BFS vs DFS 

• Resources: BFS vs DFS

• Exercise: BFS vs DFS
• Solution: BFS vs DFS 
• breadthFirstSearch()
• breadthFirstSearchRecursive()
• PreOrder, InOrder, PostOrder
• depthFirstSearch() 
• Optional Exercise: Validate A BST
• Graph Traversals
• BFS in Graphs
• DFS in Graphs
• Dijkstra + Bellman-Ford Algorithms
• Searching + Traversal Review

Hash Tables Introduction

Hash Function, Hash Collision, Hash Tables In Different Languages