JAVA FOUNDATION WITH
DS + ALGO
What you’ll learn ?
This course is designed to take you from zero to hero, For absolute beginner in programming. This certified training is designed by Industry experts to make students Internship and Job ready.
*Since this program is for absolute beginner hence no pre-requisite of programming is required.
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,
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,
Inheritance- complete introduction to Inheritance with Examples.
References Types vs Value Types, Minimum Element Challenge, Reverse Array Challenge,
List and ArrayList with examples, Bug Fix for ArrayList Challenge.
Interfaces, Inner classes, Abstract classes with examples,
Interfaces vs Abstract Clases.
Introduction to java generics, naming conventions & packages, static & final keywords, scpe, access modifiers, static statement, final statement.
Introduction to java collections, binary search, collection list methods, maps, Immutable classes, sets & hash sets,
Introduction to Threads,
Friend Function and Classes,
Static Member Examples,
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.
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
BFS vs DFS
Resources: BFS vs DFS
- Exercise: BFS vs DFS
- Solution: BFS vs DFS
- PreOrder, InOrder, PostOrder
- 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
C E T I F I C A T E S
With what you have gained including experience, get the shot in the arm for your career prospects and interviews with skills and certificates to back your talk and stand tall among others in the crowd.
Our courses are offered at the best rates in the industry that fit perfectly in your budget and offer you the best services.
Pre-enrolment price ₹1000
Pre-enrolment price ₹1000
Pre-enrolment price ₹1000
Frequently Asked Question
JAVA is the Top one and most used coding language in the Industry. One who wants to have an massive kick start there career in IT field for sure should know this coding language and also JAVA provides more flexibility in career options compared to other languages.
One should know Datastructures and Algorithms to get Internship/Job in any IT company, It is the primary expectation from any company from a Student/Fresher.
The answer is yes, for any student/fresher who wants to start there career in IT industry persuing this begginer program is more than enough to get it into an IT company.
For this program the total fees is Rs.5000 but students know need to pay entire fee at once so, they can book there slot by paying Pre-enrolment amount Rs.1000 to book there slot which included in the main fees, Prior to the commencement of the program our executive will contact you to pay remaing amount Rs.4000 at that time you need to pay the remaining amount.
Pre-recorded: The pre-recorded sessions are hosted on different platforms you will get access to it once the program commence.
Live Sessions: The live sessions are hosted via one of the video conferencing platforms such as ZOOM.US or Webex or Google Meet.