AI generated all content on this course page.

Data Structures

Course Information

• Instructor: Minseok Jeon (전민석)
  • Office: E7-211, DGIST
  • Email: minseok_jeon@dgist.ac.kr

Course Materials

• AI-Generated Data-Structure Lecture Notes
• Self-contained lecture notes are provided

Course Overview

This course provides a comprehensive introduction to fundamental data structures and their applications. Students will learn to analyze, design, and implement various data structures, understanding their trade-offs in terms of time and space complexity.

Course Objectives

By the end of this course, students will be able to:

• Understand and analyze the time and space complexity of algorithms
• Implement fundamental data structures from scratch
• Choose appropriate data structures for specific problems
• Apply data structures to solve real-world computational problems
• Prepare for technical interviews and competitive programming

Slides

• (Part 1) Foundations & Introduction
  • Foundations
  • Introduction to Data Structures
• (Part 2) Linear Data Structures
  • Linear Data Structures
    • Arrays
    • Linked Lists
    • Stacks
    • Queues
• (Part 3) Non-Linear Data Structures
  • Non-Linear Data Structures
    • Trees
    • Graphs
• (Part 4) Advanced Data Structures
  • Advanced Data Structures
    • Hash Tables
    • Tries
    • Union-Find
    • Segment Trees
    • Fenwick Trees
    • B-Trees and B+ Trees
• (Part 5) Algorithms with Data Structures
  • Algorithms with Data Structures
    • Sorting Algorithms
    • Searching Algorithms
    • Graph Algorithms
    • Dynamic Programming
• (Part 6) Practical Applications
  • Practical Applications and Projects
  • Interview Preparation
  • Next Step

Assignments

• Assignment1 (Stack)
• Assignment2 (Queue)
• Assignment3 (Linked List)
• Assignment4 (Tree)
• Assignment5 (Trie)
• Assignment6 (Graph)