Data structure (CSE 221) 

2023F:  TA(Dahee Kim, Juyoung Bang, Junesoo Kang)

Quiz1, Quiz2, Quiz3

Homework manual, Homework #1, Homework #2, Homework #3

 Final (statistics)

Tentative Outline for the Course: 

• Introduction to Data Structures and Algorithms - Overview of fundamental concepts in data structures and algorithms, focusing on their importance in computer science.

  • References: 

    1. The Algorithm Design Manual - Ch 3 

    2. Algorithms - Ch 1

• Java programming and OOP - Basics of Java programming language, principles of OOP such as encapsulation, inheritance, and polymorphism.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 1 and 2 

• Fundamental Data Structures - Detailed study of various linear data structures and their implementations.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 3.  

• Algorithm Analysis - Introduction to algorithm complexity analysis, Big O notation, and essential mathematical concepts for algorithm analysis

  • Readings:

    1. Data structures & Algorithms in Java - Ch 4.  

  • References: 

    1. Algorithms by Jeff Erickson - Director's Cut Ch 9, Appendix I, Appendix II

• Recursion - Understanding recursion, recursive algorithms, and their applications.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 5.  

  • References: 

    1. Algorithms by Jeff Erickson - Ch 2

• Stacks, Queues, and Deques - Implementation and application of stacks, queues, and double-ended queues (deques).

  • Readings:

    1. Data structures & Algorithms in Java - Ch 6.  

• Generalised List - Study of generalised lists and their significance in data structures.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 7.  

• Tree structures - Overview of different tree data structures and basic algorithms. 

  • Readings:

    1. Data structures & Algorithms in Java - Ch 8.  

• Priority Queues - Understanding priority queues, their implementation, and use cases.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 9.  

  • References

• Maps, Hash Tables, and Skip Lists - Detailed study of maps, hash tables, and skip lists.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 10.  

  • References: 

    1. Introduction to Algorithms - Ch 11

• Search Trees - Advanced study of various search trees (2-4-tree, red-black tree) and their properties.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 11.  

  • References: 

    1. Algorithms - Ch 3

    2. Introduction to Algorithms - Ch 12-13

• Sorting - Examination of different sorting algorithms and their efficiencies.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 12.  

  • References: 

    1. The Algorithm Design Manual - Ch 4 

    2. Algorithms - Ch 2

    3. Introduction to Algorithms - Ch 8

• Selection - Study of algorithms used for selecting elements from a data set.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 12.  

• Greedy Algorithm - Understanding the greedy method for problem-solving.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 13.  

  • References: 

    1. Introduction to Algorithms - Ch 15

    2. Algorithms by Jeff Erickson - Ch 4

    3. Algorithm Design - Ch 4

• Dynamic Programming - Principles and applications of dynamic programming in algorithm design.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 13.  

  • References: 

    1. Introduction to Algorithms - Ch 14

    2. Algorithms by Jeff Erickson - Ch 3

    3. Algorithm Design - Ch 6

    4. The Algorithm Design Manual - Ch 10 

• Graph structure - Detailed study of graphs, their properties, and related algorithms.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 14.  

  • References: 

    1. The Algorithm Design Manual - Ch 5 and 6 

    2. Algorithms - Ch 4

• Minimum Spanning Tree - Understanding and implementation of MST algorithms.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 14.  

  • References: 

    1. Algorithms - Ch 4

    2. Introduction to Algorithms - Ch 19, Ch 21

• Shortest Paths - Study of algorithms for finding the shortest paths in graphs.

  • Readings:

    1. Data structures & Algorithms in Java - Ch 14.  

  • References: 

    1. Algorithms - Ch 4

    2. The Algorithm Design Manual - Ch 8

    3. Introduction to Algorithms - Ch 22

• Flow - Understanding flow in networks and related algorithms.

  • Readings:

    1. Algorithm Design - Ch 7

  • References: 

    1. The Algorithm Design Manual - Ch 8

    2. Introduction to Algorithms - Ch 24

    3. Algorithms by Jeff Erickson - Ch 10

Java resources

• Java tutorial offered by w3school https://www.w3schools.com/java/

• Jump to Java https://wikidocs.net/book/31

• Code academy (Java) https://www.codecademy.com/learn/learn-java

Related textbook & lecture

• Algorithms https://jeffe.cs.illinois.edu/teaching/algorithms/

• Tech Dev Guide https://techdevguide.withgoogle.com/paths/data-structures-and-algorithms/

• Data structure and algorithm analysis in Java http://people.cs.vt.edu/~shaffer/Book/

• https://yung-web.github.io/home/courses/datastructure.html

• Video: Data structure and algorithm specialization https://www.coursera.org/specializations/data-structures-algorithms

• Video: Coursera algorithm I https://www.coursera.org/learn/algorithms-part1

• Video: Coursera algorithm II https://www.coursera.org/learn/algorithms-part2

• Video: https://www.cse.cuhk.edu.hk/~taoyf/course/2100/23-spring/

• C언어로 쉽게 풀어쓴 자료구조 https://www.aladin.co.kr/shop/wproduct.aspx?ItemId=183868288

With highest honor

• 2023F: Gunyoung Kang