/data-structures-and-algorithms

Specialization Cousrse

Primary LanguageC++MIT LicenseMIT

Data Structures and Algorithms Specialization Course

Solution for the whole Specialization Course

Introduction of Computaiton

  • Week1 | Introduction
  • Week2 | History & Future of Computer Science
  • Week3 | How Computer Program Works
  • Week4 | Introduction to C Program
  • Week5 | Solving Real World Problems
  • Week6 | C Program Part 1
  • Week7 | C Program Part 2
  • Week8 | C Program Part 3
  • Week9 | C Program Part 4
  • Week10 | C Program Part 5
  • Week11 | C Program Part 6
  • Week12 | C Program Part 7

C

  • Week1 | Introduction
  • Week2 | C Function
  • Week3 | Recursion
  • Week4 | Ponters Part 1
  • Week5 | Ponters Part 2
  • Week6 | Ponters Part 3
  • Week7 | C Struct

C++

  • Week2 | From C to C++
  • Week3 | OOP
  • Week3 | Operator Overload
  • Week4 | Inheritance
  • Week5 | Polymorphism & Virutal Function
  • Week6 | File Operation & Template
  • Week7 | STL part 1
  • Week8 | STL part 2
  • Week10| C++ 11 Features part 1
  • Week11| C++ 11 Features part 2

Algorithm Foundation

  • Week1 | Introduction
  • Week2 | Enumeration
  • Week3 | Recursion
    • Implement Recursion using stack
  • Week4 | Dynamic Programming Part 1
  • Week5 | Dynamic Programming Part 2
  • Week6 | Depth First Search Part 1
    • Solving Maze
  • Week7 | Depth First Search Part 2
    • Solving Sudoku / N-Queen
  • Week8 | Bredth First Search
  • Week9 | Greedy & Binary Search

Data Structure Part 1

  • Week1 | Algorithm Analysis
    • Big (O)
  • Week2 | Linear Datastructure
    • Array
    • Linked List
  • Week3 | Stack & Queue
    • Stack
    • Queue
    • Complexity Analysis of Recursive Function Call
  • Week4 | String
    • Basic String Operation
    • KMP Algorithm
  • Week5 | Binary Tree
    • Binary Tree's Concept & Features
    • Binary Tree Traversal Techniques
      • Pre-Order Traversal
      • In Order Traversal
      • Post Order Traversal
    • Binary Tree Serialization
      • Full Binary Tree Representation
  • Week6 | Binary Search Tree
    • BST Concept & Feature
    • Heap & Priority Queue
    • Huffman Tree
  • Week7 | Tree
    • Traversal Techniques
      • BFS
      • DFS
    • Tree Serialization
  • Week8 | Graph
    • Graph's Concept & Feature
    • Traversal Techniques
      • BFS
      • DFS
    • Shortest Path
    • Minimum Spanning Tree
    • Topology Sort

Data Structure Part 2

  • Week1 | Introcution
  • Week2 | Sort Part 1
    • Insertion Sort
    • Selection Sort
    • Bubble Sort
  • Week3 | Sort Part 2
    • Merge Sort
    • Quick Sort
    • Bucket Sort
    • Radix Sort
  • Week4 | Extrernal Sort
    • Merget Sort
  • Week5 | Search
    • Linear Search
    • Hash
  • Week6 | Indexing
    • Static Indexing
    • Inverted Indexing
    • B Tree
    • B+ Tree
    • RB Tree
  • Week7 | Advanced Datastructure - 1
    • Multi-Dimensional Array
  • Week8 | Advanced Datastructure - 2
    • Trie
    • AVL Tree
    • Splay Tree

Cousera Honor Code

You need to follow Coursera’s Honor Code to uphold Coursera's standard of academic integrity:

Register for only one account. Your account is linked to your email address. If you register on our site with more than one email address, you are registering for more than one account. If you have already registered for two accounts, please contact us using the contact form at the bottom of this page.

Your answers to homework, quizzes, and exams must be your own work (except for assignments that explicitly permit collaboration).

You may not share your solutions to homework, quizzes, or exams with anyone else unless explicitly permitted by the instructor. This includes anything written by you, as well as any official solutions provided by the course staff.

You may not engage in any other activities that will dishonestly improve your results or dishonestly improve or damage the results of others.

License

Solutions licensed under MIT License