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

• Need for packages
• What are packages; package declaration in Java
• Import statement in Java
• How do packages resolve name clashes?

• 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

• Static variables and methods
• Static imports
• Static initialization blocks; instance intialization blocks
• Static concept in inheritance

• 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

• 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

• 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

• 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

• Generics for Collections
• Generics for class
• Generics for methods

• 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

• 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

• 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

• What are access modifiers?
• Default
• Protected
• Private
• Public

• Time complexity
• Space complexity

• Big O
• Omega
• Theta notations

• Malloc()
• calloc()
• realloc()
• free()

• 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

• 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

• Operations on Queue – enqueue(), dequeue()
• Queue implementation using static arrays
• Applications
• Queues Implementations using pointer (dynamic)

• Introduction
• Construction
• Length
• Insertion
• Deletion
• Sort
• Reverse list
• Swap node data
• Swap nodes
• Applications

• 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

• 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

• 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

• 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