Online Java Data Structures and Algorithms Training with Project
Course Content :
Duration: 40hrs
01 - How Java Works and Java Basic Concepts
Brief discussion about Abstraction , Attributes , Classes , Encapsulation , Objects ,
Operations , Inheritance , Polymorphism, Responsibilities, Methods, Visibility
02 - What is Algorithms?
Lets understand "algorithm analysis"?, Sum Problem:maximum contiguous subsequence, Big-Oh, Big-Omega, Big-Theta, Little-Oh rules, sequential search, verify algorithm analysis, big-oh analysis limitations, worst-case bound
03 - What is Data Structure? Basic Concepts in Data Structure
Java Collection API, Arrays, binary heap, binary search tree, Collection and Collections,data structure,factory method, hashCode, HashMap, HashSet, iterator,list, ListIterator, linked list, Map, operator precedence parsing, queue, priority queue, programming to an interface, SortedSet, TreeMap, TreeSet
04 - Recursion Algorithms
Activation record, alpha beta pruning(Advance minimax algorithm) backtracking An algorithm,base case, basis In a proof by induction,divide-and-conquer algorithm, driver routine, dynamic programming, encryption, Fibonacci numbers greatest common divisor (gcd) greedy algorithm induction inductive hypothesis leaf In a tree, minimax strategy, multiplicative inverse
05 - Lets understand sorting algorithms
Comparison-based sorting algorithm, diminishing gap sort (Shell sort), inversion, lower-bound proof median-of-three partitioning mergesort partition (quick sort) pivot For quick sort, quick select, quick sort,situations, selection
06 - Randomization
False positives/false negatives, Fermat s Little Theorem, full-period linear congruential generator, linear congruential generator, negative exponential distribution, Between occurrences of random events, period, permutation, Poisson distribution, Pseudorandom numbers, Random permutation, Randomized algorithm seed, Trial division, Uniform distribution, Witness to compositeness
07 - How compilers works?
Expression,infix expression, lexical analysis, operator precedence, postfix expression, postfix machine Machine, precedence, state machine, tokenization
08 - Lets understand Graph and Tree in Data structures and Algorithms Way
Activity-node graph adjacency lists, adjacency matrix, adjacent vertices, Bellman Ford algorithm, breadth-first search, critical-path analysis, cycle In a directed graph
Brief discussion about Abstraction , Attributes , Classes , Encapsulation , Objects ,
Operations , Inheritance , Polymorphism, Responsibilities, Methods, Visibility
02 - What is Algorithms?
Lets understand "algorithm analysis"?, Sum Problem:maximum contiguous subsequence, Big-Oh, Big-Omega, Big-Theta, Little-Oh rules, sequential search, verify algorithm analysis, big-oh analysis limitations, worst-case bound
03 - What is Data Structure? Basic Concepts in Data Structure
Java Collection API, Arrays, binary heap, binary search tree, Collection and Collections,data structure,factory method, hashCode, HashMap, HashSet, iterator,list, ListIterator, linked list, Map, operator precedence parsing, queue, priority queue, programming to an interface, SortedSet, TreeMap, TreeSet
04 - Recursion Algorithms
Activation record, alpha beta pruning(Advance minimax algorithm) backtracking An algorithm,base case, basis In a proof by induction,divide-and-conquer algorithm, driver routine, dynamic programming, encryption, Fibonacci numbers greatest common divisor (gcd) greedy algorithm induction inductive hypothesis leaf In a tree, minimax strategy, multiplicative inverse
05 - Lets understand sorting algorithms
Comparison-based sorting algorithm, diminishing gap sort (Shell sort), inversion, lower-bound proof median-of-three partitioning mergesort partition (quick sort) pivot For quick sort, quick select, quick sort,situations, selection
06 - Randomization
False positives/false negatives, Fermat s Little Theorem, full-period linear congruential generator, linear congruential generator, negative exponential distribution, Between occurrences of random events, period, permutation, Poisson distribution, Pseudorandom numbers, Random permutation, Randomized algorithm seed, Trial division, Uniform distribution, Witness to compositeness
07 - How compilers works?
Expression,infix expression, lexical analysis, operator precedence, postfix expression, postfix machine Machine, precedence, state machine, tokenization
08 - Lets understand Graph and Tree in Data structures and Algorithms Way
Activity-node graph adjacency lists, adjacency matrix, adjacent vertices, Bellman Ford algorithm, breadth-first search, critical-path analysis, cycle In a directed graph
