Data Structures and Algorithms PCCST303 KTU 2024 Scheme- Dr Binu V P

About Me


1.Basic Concepts of Data Structures Stacks and Queues

    
    Array as a Data Structure
    Polynomial Representation using arrays
    Stacks
  

Trees
    
Binary Search Tree ( BST )


4.Sorting and Searching , Hash Tables


Comments

Post a Comment

Popular posts from this blog

Performance Analysis - Time and Space Complexity

Image
  📚 Performance Analysis  Performance analysis means studying how efficient an algorithm or data structure is. Mainly, we check two things: Time Complexity — How much time (number of operations) the algorithm takes. Space Complexity — How much memory (space) the algorithm uses. ✅ Goal : To predict how the algorithm will behave as the input size grows without running the code. 📍 1. Time Complexity Measures the amount of time an algorithm takes to complete. It is expressed as a function of the input size n . We usually use Big-O notation (e.g., O(n), O(log n), O(n²)) to express it. ⏳ Why it matters? Because we want algorithms that are fast even for large inputs . Example for Time Complexity: Suppose we have a simple loop: for ( int i = 0 ; i < n; i++) { printf ( "%d " , i); } The loop runs n times . Each printf is a constant-time operation. So, Time Complexity = O(n) (linear time). Types of Common Time Complexities...
Read more

Asymptotic Analysis and Asymptotic Notations

  📚 What is Asymptotic Analysis ? Asymptotic Analysis is the process of analyzing the efficiency (especially time and space complexity ) of an algorithm as the input size (n) grows very large . It focuses on the behavior of the algorithm for large inputs . It ignores smaller constants and less significant terms. It helps to compare algorithms independently of machine speed, compiler optimizations, or programming languages. 👉 Simply: It answers "How does the running time (or space) grow as n → ∞?" 🎯 Why do we need Asymptotic Analysis? To evaluate and compare the scalability of algorithms. To predict performance when input size becomes very large . To find better algorithms for real-world, large-scale problems. 🔵 Key Focus of Asymptotic Analysis: Concentrates only on the dominant term (highest degree). Constants (like 5, 1000) are ignored. Lower-degree terms (like n, log n) are ignored if a higher degree exists. 📚 What are Asy...
Read more