https://github.com/jtlee98/2021_cse2010_12484

Course repo for Hanyang-CSE2010 (Data Structures)
https://github.com/jtlee98/2021_cse2010_12484

Last synced: over 1 year ago
JSON representation

Course repo for Hanyang-CSE2010 (Data Structures)

• Host: GitHub
• URL: https://github.com/jtlee98/2021_cse2010_12484
• Owner: JTLee98
• License: other
• Created: 2022-01-27T18:54:15.000Z (over 4 years ago)
• Default Branch: master
• Last Pushed: 2022-11-30T04:54:19.000Z (over 3 years ago)
• Last Synced: 2023-10-21T18:35:57.037Z (over 2 years ago)
• Language: C++
• Size: 503 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.md

Awesome Lists containing this project

README

          
## 2021_CSE2010_12484

Course repo for Hanyang-CSE2010 (Data Structures) \

Taken in Spring of 2021 at HYU \

Instructor: Prof. PARK, JONG-IL (https://mr.hanyang.ac.kr/ jipark@hanyang.ac.kr)

* **Course outline**

  * **Description**: 

    This course introduces various data structures, such as linked list, stack, queue, heap, binary search tree, balanced trees, and graph, which can organize data of various time and space complexity. Abstract data types will also be covered, including operations of searching, inserting, and deleting elements in each data structure. The main goal of this course is to learn how to design and select efficient data structures and operations. Students will learn how to compare data structures in terms of time and space complexity. In addition, students will have opportunities to learn how these data structures can be applied for solving computational problems. In the accompanying laboratory sessions, students will also have hands-on experience to implement data structures using the C programming language.

  * **Schedule**

    | week | topic                                          |

    | ---- | ---------------------------------------------- |

    | 1    | introduction, recursive algorithms, ADT, big-O |

    | 2    | review on C programming, Lists 1               |

    | 3    | Lists 2                                        |

    | 4    | Stack, Queues                                  |

    | 5    | Tree representations & traversals, Binary Tree |

    | 6    | BSTs                                           |

    | 7    | Heaps                                          |

    | 8    | Midterm exam                                   |

    | 9    | AVL Trees                                      |

    | 10   | B-Trees                                        |

    | 11   | Sorting Algorithms                             |

    | 12   | Hash Tables                                    |

    | 13   | Graph representations, Topological Sorting     |

    | 14   | Djikstra, Single Source Shortest Path          |

    | 15   | review                                         |

    | 16   | Final Exam                                     |