Data Structure Min Chen School of Computer Science and Engineering Seoul National University

Project 1: Peg Solitaries  Requirements: Design a Peg Solitaries Game

Project 1: Specification  GUI Either command line or graphic interface Better GUI will get incentive *** *** ******* ***O*** ******* *** *** Move (a,b) to (c,d)

Project 1: Specification  System Design Chessboard Class ○ Display the chessboard and chessman ○ Display the deletion of each move Judgment System ○ If one move is valid ○ If game ended Solution Algorithm ○ Calculate the solution for the game

Project 2: Path Discovery  Requirements: Create a random maze Discover a shortest path in a maze  GUI Either command line or graphic interface Better GUI will get incentive

Project 2: Specification  Create the maze Line MazeBlock Maze Entrance Exit I O

Project 2: Specification  Discover the shortest path I O X X XXXX X XX X XX X XX X XX X XX X XX X XX X XX XX X X X X X A Breadth-First Approach

Project 3: Compress  Requirements: Give a txt file ○ Contains 52 English letters (‘a’-’z’)&(‘A’-’Z’) ○ Contains ‘ ’(blanks), ‘,’ (commas), ‘.’(periods) ○ Contains numbers (‘0’-’9’) Compress the txt file by Huffman Codes ○ The compressed file should be smaller than original file Uncompress the file into original txt file ○ Should restore the original file

Project 3: Specification  How to calculate the Huffman Codes? ① Statistics of occurrence times of each char ② Form the Huffman Tree ③ Get the Huffman Codes from the tree

Principles  Don’t Copy Codes from Internet  Try your best for a better solution!