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

• What are Servlets?
• What can they do? Why are they needed?
• How do Servlets look in code?
• HTTP Methods; GET, POST, PUT, DELETE, TRACE, OPTIONS
• GET/POST request; differences between the two
• Servlet Lifecycle
• Servlet Context and Servlet Config
• Forwarding and Redirection of requests

• What is a session?
• Why is it required?
• How to get a session?
• Session information passing between client and server
• Sesssion information passing mechanisms – Cookies, Rewriting
• How to destroy a session

• Introduction to JSP and need for JSPs
• Basic HTML tags
• JSP Lifecycle

• Scriptlets
• Expressions
• Declarations
• Significance of above elements and fitment into the JSP Lifecycle
• What are Directives in JSP?
• Page Directive
• Include Driective
• Taglib Directive

• JSP Standard Actions
• Expression Language
• JSTL basics and it’s usage
• Need for Custom Tag Library
• Custom Tag Library implementation

• 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

• 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
• 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