DSA With Java

Data Structures and Algorithms in Java Programming entail utilising Java to create and put into use effective Data Structures and Algorithms for handling and manipulating huge data sets while maximising programme performance.

Content:

• Introduction
• Analysis of Algorithm
• Background analysis through a Program and its functions.
• Order of Growth
• A mathematical explanation of the growth analysis through limits and functions.
• A direct way of calculating the order of growth
• Asymptotic Notations
• Best, Average and Worst case explanation through a program.
• Big O Notation
• Graphical and mathematical explanation.
• Calculation
• Applications at Linear Search
• Omega Notation
• Graphical and mathematical explanation.
• Calculation.
• Theta Notation
• Graphical and mathematical explanation.
• Calculation.
• Analysis of common loops
• Single, multiple and nested loops
• Analysis of Recursion
• Various calculations through Recursion Tree method
• Space Complexity
• Basic Programs
• Auxiliary Space
• Space Analysis of Recursion
• Space Analysis of Fibonacci number
• Practice Problems
• This section contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.
• Mathematics
• Mathematics
• Count Digits
• Palindrome Numbers
• Factorial of Numbers
• GCD of Two Numbers
• LCM of Two Numbers
• Check for Prime
• Prime Factors
• Sieve of Eratosthenes
• Computing Power
• Practice Problems
• This section contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.
• Bit Magic
• Bitwise Operators in C++
• Operation of AND, OR, XOR operators
• Operation of Left Shift, Right Shift and Bitwise Not
• Bitwise Operators in Java
• Operation of AND, OR
• Operation of Bitwise Not, Left Shift
• Operation of Right Shift and unsigned Right Shift
• Problem(With text Solutions): Check Kth bit is set or not
• Method 1: Using the left Shift.
• Method 2: Using the right shift
• Problem(With text Solutions): Count Set Bits
• Method 1: Simple method
• Method 2: Brian and Kerningham Algorithm
• Method 3: Using Lookup Table
• Problems(With text Solutions):
• To check whether a number is a power of 2 or not
• Odd occurrences in an array.
• Two numbers having odd occurrences in an array.
• Generate power set using bitwise operators.
• Practice Problems
• This section contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.
• Recursion
• Introduction to Recursion
• Applications of Recursion
• Writing base cases in Recursion
• Factorial
• N-th Fibonacci number
• Various problems on Recursion(With text Solutions)
• Print n to 1
• Print 1 to n
• Tail Recursion
• Checking Palindrome
• Sum of digits
• Rod cutting
• Subsets of a set
• Tower of Hanoi Problem
• Josephus Problem
• Practice Problems
• This section contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.
• Arrays
• Introduction and Advantages
• Types of Arrays
• Fixed-sized array
• Dynamic-sized array
• Operations on Arrays
• Searching
• Insertions
• Deletion
• Arrays vs other DS
• Reversing – Explanation with complexity
• Problems(With text Solutions)
• Left Rotation of the array by 1
• Check if Sorted
• Left Rotation of the array by D places
• Leaders in an Array
• Maximum Difference Problem
• Frequencies in Sorted Array
• Stock Buy and Sell Problem
• Trapping Rainwater Problem
• Maximum Consecutive 1s
• Maximum Subarray Sum
• Longest Even-Odd Subarray
• Maximum Circular sum subarray.
• Majority Element
• Minimum Consecutive Flips
• Sliding Window Technique
• Prefix Sum Technique
• Practice Problems
• This section contains many practice problems for the users which are considered important and must-do as far as Data Structure and Algorithm is concerned.
• and more