DESIGN AND ANALYSIS OF ALGORITHMS (S.E. 2023-24)

TABLE OF CONTENTS


1. Expressing Algorithm and Flowcharts


2. Recursion


3. Algorithm Design Techniques


4. Understanding Different Types of Algorithm Analysis for Data Algorithms


5. Defination and Properties of Algorithm


6. Master Theorem  By : Aachal Khodape


7. Comparison Between Binary Search, Merge Sort, Quick Sort


8. Master Theorem  By : Nikeetaa Garrade


9. Substitution Method Explanation

10. Order of Growth

11. Asymptotic Notations

12. Changing Variable Method

13. Recurrence Relation

14. Need and Use of Algorithm

15. Job Sequencing Problem

16. Activity Selection Problem

17. Solving Recurrence Relation Using Iterative Method

18. Concept Of Backtracking

19. Optical Merge Pattern

20. Four Queen Problem

21. Travelling Salesman Problem with Greedy Approach


















Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

No comments:

Post a Comment

Home
Subscribe to: Comments (Atom)

Featured post

  Optimal merge pattern   Optimal merge pattern is a pattern that relates to the merging of two or more sorted files in a single sorted ...

Search This Blog

About Me

My photo
DESIGN AND ANALYSIS OF ALGORITHMS (S.E. 2023-24)
Welcome to DAA, where (S.E. AI 2023-24) students share cool stuff about Design and Analysis of Algorithms (DAA). We'll break down the basics, explore smart ways to create algorithms, and see how they work. Dive into fun discussions and real-world examples as we learn about algorithms together from the perspectives of students like you!
View my complete profile

Pages

MENU

  • Home (INDEX)
  • About
  • Contact Us

Blog Archive

  • July 2024 (9)
  • April 2024 (2)
  • February 2024 (6)

Social Media Icons

  • instagram
  • linkedin

Most Popular

Contact Form

Name

Email *

Message *

Theme images by ULTRA_GENERIC. Powered by Blogger.