Data-Structure Labs & Exercises

Data Structure Labs &ampExercises

Labs

• Lab1: Students Health System
  • inserting new student information into the student health table (describing the insertion point by position number)
  • deleting information about a specific student in the health table (by student number)
  • modifying physical information for a student (by student number)
  • sorting by student number and displaying the results
  • querying student information in the health table
  • enter all student information on the screen
  • read all student health form information from the file
  • write all student health form information to the file
• Lab2: Address List
  • search for students in the address book (by student number)
  • search for students in the address book (by name)
  • search for students in the address book (by phone number)
  • delete students in the address book (first locate the student being deleted by searching in 3-5 above)
  • output the information for the youngest student
  • output all student information on the screen (you can choose whether to iterate through it in pre-order, mid-order or post-order)
  • read the address book information from the file
  • write the student address book information to the file;
• Lab3: Decompress/Compress the text(Huffman Tree)
  • Initialization. Read in the character set size n and the n characters and n weights from the terminal, build the Huffman tree and store it in the file hfmTree.
  • Encoding. Using the constructed Huffman tree (or read from the file hfmTree if it is not in memory), encode the text in the file ToBeTran and store the result in the file CodeFile.
  • Decoding. The code in the file CodeFile is decoded using the constructed Huffman tree and the result is stored in the file TextFile.
  • Print the code file. The file CodeFile is displayed on the screen in a compact format with 50 binary codes per line. The code file in character form is also written to the file CodePrin.
  • Printing of the Huffman tree. Displays the Huffman tree already in memory in a visual format (tree or recessed) on the screen and writes the Huffman tree in character form to the TreePrin file.
  • Other auxiliary functions: The source/target file for each conversion operation is specified by the user when selecting this operation.

Environment

Qt Creator 4.14.2 based on Qt 5.15.2

MinGW 8.1.0 64bit

Suggested Arrangement

28 days per lab

Exercises

• Including 12 exercises

Environment

Visual Studio 2019 Community

Suggested Arrangement

7~14 days per exercises