Scribd Logo
Importer

Bienvenue sur Scribd !

  • Introduction to Algorithms and Data Structures Course

    Transféré par

    sumit
    38 vues2 pages
    The document outlines the curriculum for a course on algorithms. It is divided into 9 sections covering different algorithm design techniques including brute force, divide and conquer, decrease and conquer, transform and conquer, dynamic programming, greedy techniques, analysis of time complexity, and number theoretic algorithms. Each section includes readings, example code in C, and a quiz. The course aims to teach classic algorithms like selection sort, merge sort, binary search, and graph algorithms as well as number theory concepts like the Euclidean algorithm and RSA encryption.

    Description originale:

    udemy c

    Titre original

    Content1 udemy

    Copyright

    © © All Rights Reserved

    Formats disponibles

    TXT, PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    The document outlines the curriculum for a course on algorithms. It is divided into 9 sections covering different algorithm design techniques including brute force, divide and conquer, decrease and conquer, transform and conquer, dynamic programming, greedy techniques, analysis of time complexity, and number theoretic algorithms. Each section includes readings, example code in C, and a quiz. The course aims to teach classic algorithms like selection sort, merge sort, binary search, and graph algorithms as well as number theory concepts like the Euclidean algorithm and RSA encryption.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme TXT, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    38 vues2 pages

    Introduction to Algorithms and Data Structures Course

    Transféré par

    sumit
    The document outlines the curriculum for a course on algorithms. It is divided into 9 sections covering different algorithm design techniques including brute force, divide and conquer, decrease and conquer, transform and conquer, dynamic programming, greedy techniques, analysis of time complexity, and number theoretic algorithms. Each section includes readings, example code in C, and a quiz. The course aims to teach classic algorithms like selection sort, merge sort, binary search, and graph algorithms as well as number theory concepts like the Euclidean algorithm and RSA encryption.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme TXT, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 2

    Section 1 - Introduction

    1. Course Introduction and Author Bio


    2. Course Curriculum & Upcoming lectures

    Section 2 - Brute Force Approach

    3. Selection Sort Algorithm


    C_Program_on_SelectionSort.pdf
    4. Bubble Sort Algorithm
    C Program On Bubble Sort
    5. Sequential Search Algorithm
    C Program Sequential Search
    6. Brute Force String Matching Algorithm
    C Program On String Matching
    BruteForceStringMatch.pdf
    quiz 1: Brute Force Quiz

    Section 3 - Divide and Conquer Approach

    7. Merge Sort Algorithm


    C Program On Merge Sort
    8. Quick Sort Algorithm
    C Program Quick Sort
    quiz 2: Divide and Conquer Quiz

    Section 4 - Decrease and Conquer Approach

    9. Binary Search Algorithm


    C Program Binary Search
    10. Insertion Sort Algorithm
    C Program On Insertion Sort
    11. Depth First Search Algorithm
    C Program On DFS
    12. Breadth First Search Algorithm
    C Program BFS
    quiz 3: Decrease and Conquer Quiz

    Section 5 - Transform and Conquer Approach

    13. Heaps
    Heaps.pdf
    14. Heap Construction [bottom-up approach]
    C_Program_HeapConstruction.pdf
    15. Heap Sort Algorithm
    C_Program_HeapSort.pdf

    Section 6 - Dynamic Programming

    16. Warshall's Algorithm


    C Program Warshall 's Algorithm
    17. Floyd's Algorithm
    C Program On Floyd 's Algorithm
    quiz 4: Dynamic Programming Quiz

    Section 7 - Greedy Technique

    18. Prim's Algorithm


    C Program On Prim 's Algorithm
    19. Kruskal's Algorithm
    C Program On Kruskal 's Algorithm
    quiz 5: Greedy Technique Quiz

    Section 8 - Bonus Section : Time Complexity

    20. Introduction to Analysis of Algorithms


    21. Asymptotic Notations
    22. Time Complexity - Selection Sort Algorithm
    23. Time Complexity - Bubble Sort Algorithm
    24. Time Complexity - Sequential Search Algorithm
    25. Time Complexity - String Matching Algorithm
    26. Time Complexity - Insertion Sort Algorithm
    27. Time Complexity - Warshall's Algorithm
    Time Complexity of Warshall's algorithm.pdf
    28. Time Complexity - Floyd's Algorithm
    Time Complexity of Floyd's algorithm.pdf
    29. Master Theorem
    quiz 6: Time Complexity Quiz

    Section 9 - Number Theoretic Algorithms

    30. Euclid's Algorithm [GCD of two numbers]


    C Program on Euclid's Algorithm.pdf
    Euclid_Algorithm.pdf
    31. C Program on Euclid's Algorithm
    32. RSA Algorithm
    CProgramOnRSA.pdf
    RSA_Algorithm.pdf
    quiz 7: Number Theory Quiz

    Vous aimerez peut-être aussi