Boost Your Career with Best Core Java & Data Structure Course Institute in Delhi

 
Coding Bytes is the Best Core Java & Data Structure Training, Course, Certification Institute in Delhi, Our Core Java & Data Structure Course leads the chart among the best Core Java & Data Structure Training Courses of Delhi NCR.

 

Core Java & Data Structure Course Fees: Rs. 14999/-

Core Java & Data Structure Course Duration: 4 months

➡ Weekend & Weekdays Batches Available

 

Request a Call Back !

Core Java & Data Structure

Course Highlights

  • Introduction to Java
  • Comparison with C and C++
  • The JDK Directory Structure
  • Control Flow statements
  • Packages
  • Constructors
  • Introduction to Data Structures
  • Analysis
  • Designing of the Algorithms 
  • Performance Analysis
  • Stack & Queue Implementation

Core Java & Data Structures Course Details

1) Introduction to Java

  • Introduction to Java; features of Java
  • Comparison with C and C++
  • Download and install JDK/JRE (Environment variables set up)
  • The JDK Directory Structure
  • First Java Program through command prompt
  • First Java Program through Eclipse

2) Data Types & Operators

  • Primitive Datatypes, Declarations, Ranges
  • Variable Names Conventions
  • Numeric Literals, Character Literals
  • String Literals
  • Arrays(One dimensional; two- dimensional)
  • Array of Object References
  • Accessing arrays, manipulating arrays
  • Enumerated Data Types
  • Non-Primitive Datatypes
  • Defining a class, variable and method in Java
  • Method Signature; method calls
  • Expressions in Java; introduction to various operators
  • Assignment Operator
  • Arithmetic Operators
  • Relational Operators
  • Logical Operators
  • Conditional Operators
  • Operator Precedence
  • Implicit Type Conversions
  • Upcasting and downcasting
  • Strict typing
  • Type conversion

3) Control Flow Statements

  • Statements and it’s various categories in Java
  • if, if-else, if-else-if
  • switch case
  • for statement (both flavours traditional and enhanced for)
  • while and do-while loops
  • The continue Statement; labelled continue statement
  • The break Statement; labelled break statement
  • return statement

4) OOPS and its application in Java

  • Classes and Objects
  • Defining a class;Defining instance variables and methods
  • Creating objects out of a class
  • Method calls via object references
  • Abstraction
  • Interfaces and Abstract classes
  • Abstract and non-abstract methods
  • Inheritance
  • extends and implements keywords in Java
  • Super class and Sub class
  • this keyword, super keyword in Java for inheritance
  • Concrete classes in Java
  • Polymorphism
  • Compile time polymorphism — Overloading of methods
  • Run time polymorphism — Overriding of methods
  • Method  Overriding rules and method overloading rules
  • Introduction to Object class and it’s methods
  • Encapsulation
  • Protection of data
  • Java Bean, POJO
  • Getters/Setters
  • Memory management in Java
  • Heap
  • Stack
Blank
5) Packages
  • Need for packages
  • What are packages; package declaration in Java
  • Import statement in Java
  • How do packages resolve name clashes?
6) Miscellaneous
  • Var-Args
  • Reference variables, local variables, instance variables
  • Memory allocations to variables
  • Double equals operator(==) operator for primitives and objects
  • toString() method on an object
7) Statics
  • Static variables and methods
  • Static imports
  • Static initialization blocks; instance intialization blocks
  • Static concept in inheritance
8) Constructors
  • What are Constructors?
  • Properties of Constructors
  • Default and Parameterized Constructors
  • Rules for constructor implementation
  • Constructor Chaining
  • this call; super call for constructors
  • Constructors for Enumerated Data Types
  • Constructors concept for Abstract classes and interfaces
9) Exceptions in Java
  • What are Exceptions?
  • Need for exceptions
  • How can Exceptions be coded in Java?
  • API heirarchy for Exceptions
  • Types of Exceptions
  • Keywords in Exception API: try, catch, finally, throw, throws
  • Rules for coding Exceptions
  • Declaring Exceptions
  • Defining and Throwing Exceptions
  • Errors and Runtime Exceptions
  • Custom Exception
  • Assertions
  • What are Assertions?
  • Enabling and disabling assertions in development environment
10) Strings in Java
  • What are Strings?
  • String heap memory and Constant Pool memory
  • Immutability in Strings
  • String creation on heap and constant pool
  • Method APIs on String; operations on Strings
  • Mutability of String Objects – StringBuilder and StringBuffer
  • Splitting of Strings and StringTokenizer class
11) Collection Framework in Java
  • The Collections Framework
  • The Set Interface
  • Set Implementation Classes
  • The List Interface
  • List Implementation Classes
  • The Map Interface
  • Map Implementation Classes
  • Queue Interface
  • Queue Implmentation classes
  • Utility classes
  • Sorting collections using utility methods
  • equals() and hashCode contract in Java collections
  • overriding equals and hashCode methods in Java
  • New Collections added in Java 1.6
  • Primitive wrapper classes and all its method APIs
12) Generics
  • Generics for Collections
  • Generics for class
  • Generics for methods
13) Input-Output in Java
  • What is a stream?
  • Overview of Streams
  • Bytes vs. Characters
  • Overview of the entire Java IO API
  • Reading a file; writing to a file usinf various APIs
  • Reading User input from console
  • PrintWriter Class
14) Threads in Java
  • Non-Threaded Applications
  • Threaded Applications
  • Process based multitasking Vs Thread based multitasking
  • Thread API in Java
  • Creating Threads
  • States of a Thread
  • Sychronization for threads; static and non-static synchronized methods; blocks; concept of object and class locks
  • Coordination between threads – wait, notify and notifyAll methods for inter-thread communication
15) Applets in Java
  • What are applets?
  • Need for Applets
  • Different ways of running an applet program
  • Applet API heirarchy
  • Life Cycle of an applet
  • Even Handlers for applets, mouse events, click events
16) Access Modifiers in Java
  • What are access modifiers?
  • Default
  • Protected
  • Private
  • Public
17) Introduction to Data Structure
18) Algorithms
19) Performance Analysis
  • Time complexity
  • Space complexity
20) Asymptotic Notations
  • Big O
  • Omega
  • Theta notations
21) Arrays
22) Structures
23) Pointers
24) Dynamic Memory Allocation
  • Malloc()
  • calloc()
  • realloc()
  • free()
25) Stacks
  • Stack Operations
  • push()
  • pop()
  • peex()
  • distzay()
  • isEmpty()
  • isFull()\
  • Stack implementation using arrays Applications
  • Decimal to Binary
  • String reverse
  • Number reverse
  • Recursion – Towers of Hanoi
  • Balanced Parentheses
  • Expressions
26) Expression
  • Introduction to Notations
  • Importance of Notations in expression evaluation
  • Conversion Algorithms
  • Infix to prefix
  • Infix to postfix
  • Prefix to infix
  • Prefix to postfix
  • Postfix to infix
  • Postfix to prefix
  • Implementation of all the conversions
27) Queues
  • Operations on Queue – enqueue(), dequeue()
  • Queue implementation using static arrays
  • Applications
  • Queues Implementations using pointer (dynamic)
28) Single linked list
  • Introduction
  • Construction
  • Length
  • Insertion
  • Deletion
  • Sort
  • Reverse list
  • Swap node data
  • Swap nodes
  • Applications
29) Stack & Queue implementation using linked list
30) Binary & Binary Search Tree
  • Terminology
  • Differences between Tree and Binary Tree
  • Binary Tree Representations
  • Expression Trees
  • Traversals
  • In-order
  • pre-order
  • post-order
  • Introduction to BST
  • Insertion
  • Deletion
  • Search
  • Implementation
31) Graph, Searching & Sorting algorithms
  • Introduction & Terminology
  • Graph Representations
  • Traversal
  • BFS (Breadth First Search)
  • DFS (Depth First Search)
  • Linear search
  • Binary search
  • Bubble sort
  • Selection sort
  • Insertion sort
  • Heap sort
  • Merge sort
  • Quick sort
32) AVL, Red Black , B Tree, Hashing
  • Introduction
  • BST v/s AVL
  • Rotations
  • L-L-Rotation
  • R-R-Rotation
  • L-R-Rotation
  • R-L-Rotation
  • Insertion
  • Deletion
  • Traversal

Red Black Trees

  • Introduction
  • BST v/s AVL v/s RBT
  • Rotations
  • L-L-Rotation
  • R-R-Rotation
  • L-R-Rotation
  • R-L-Rotation
  • Insertion
  • Deletion

B trees

  • M-way Search Tree
  • Search
  • Insertion
  • Deletion

Hashing

  • Hash Table representation
  • Hash function-Division Method
  • Collision
  • Collision Resolution Techniques
  • Separate Chaining
  • open addressing
  • linear probing
  • quadratic probing
  • double hashing
  • Rehashing
33) Priority Queue-Definition,Heap,Pattern matching algorithms,Tries
  • Operations-Insertion, Deletion,

Heap

  • Definition
  • Max Heap
  • Min Heap
  • Insertion and deletion

Pattern matching algorithms

  • Brute force
  • Boyer –Moore algorithm
  • Knuth-Morris-Pratt algorithm

Tries

  • Standard Tries
  • Compressed Tries
  • Suffix tries
34) Dynamic Programming ,Greedy Method, Divide & conquer method

Small Batches

Mentoring By Experts

Flexible Schedule

i

Learn By Doing

Goal Oriented