1 / 10

Course Projects

Data Structure. Course Projects. 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.

ryu
Download Presentation

Course Projects

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Data Structure Course Projects Min Chen School of Computer Science and Engineering Seoul National University

  2. Project 1: Peg Solitaries • Requirements: • Design a Peg Solitaries Game

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

  4. 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

  5. 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

  6. Project 2: Specification Entrance • Create the maze I O Line Maze Exit Block Maze

  7. Project 2: Specification • Discover the shortest path 0 1 2 3 4 5 6 7 0 X I X X X X 1 X X X 2 X X X X X X 3 X X X X X 4 X X X X X X X X 5 X X X 6 X 7 X X O X X X X A Breadth-First Approach

  8. 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

  9. 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

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

More Related