Scribd
Upload
8 views1 page

DAA Final Outline

The document outlines the design and analysis of algorithms, covering key concepts such as algorithm performance, time and space complexity, and the importance of algorithms in computational science. It details various algorithm paradigms, problem-solving processes, and includes specific algorithms like linear search, binary search, and sorting techniques. Additionally, it discusses data structures like linked lists and binary trees, along with their representations and traversal methods.

Uploaded by

syedtanveer7475
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views1 page

DAA Final Outline

The document outlines the design and analysis of algorithms, covering key concepts such as algorithm performance, time and space complexity, and the importance of algorithms in computational science. It details various algorithm paradigms, problem-solving processes, and includes specific algorithms like linear search, binary search, and sorting techniques. Additionally, it discusses data structures like linked lists and binary trees, along with their representations and traversal methods.

Uploaded by

syedtanveer7475
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Outline: Design and Analysis of Algorithm

1. What is Analysis of Algorithm?


• Algorithm Performance
• Methods of Analysis
2. Time and Space Complexity Measurement
• Best Case
• Average Case
• Worst Case
3. Importance of Algorithm in Daily Life and Computational Science.
4. Properties of Algorithm
5. Characteristics of Algorithm
6. Components of Algorithms
7. Difference Between Algorithm and Procedure
8. Difference between Algorithm, Pseudo code and Program
9. Algorithm Notations
10. Asymptotic Notation (Discussion, Graph and Mathematical representation)
• Big O Notation
• Big Omega Notation
• Theta Notation
11. General Problem Solving Process
12. Algorithm Problem Solving Process
13. Algorithm Paradigms and Associated Techniques
• Brute force Paradigms
• Greedy Algorithms Paradigm
• Divide and Conquer Paradigm
• Backtracking Paradigm
• Dynamic Programming Paradigm
14. Maxima Point Finding through Car Selection Problem
• 2D Graph
• Pseudo Code
• Running Time Analysis
15. Linear Search Manual Process, Algorithm and Complexity Calculation
16. Binary Search Manual Process, Algorithm and Complexity Calculation
17. Bubble Sort Manual Process, Algorithm and Complexity Calculation
18. Insertion Sort Manual Process, Algorithm and Complexity Calculation
19. Quick Sort Manual Process, Algorithm and Complexity Calculation
20. Selection Sort Manual Process, Algorithm and Complexity Calculation
21. What is Linked List in Data Structure?
• Representation of Binary Tree through Memory Addresses
• Traversing Algorithm
• Counting Number of Nodes by traversing technique
• Searching Algorithms
22. What is Binary Tree in Data Structure and Binary Tree
• Binary Tree Terminologies
• Creating Binary Tree from algebraic equations
• Creating Binary Tree from Numbers
• Binary Traversing Techniques
▪ Preorder
▪ Inorder
▪ Postorder

You might also like