dixie state college logo
dixie cit it cs vt degrees courses faculty facilities jobs submit login
dixie > cit > cs > cs3510 >



Computer and Information Technology

  Degrees
  Courses
  Faculty
  Facilities
  Contact
  Jobs
  Scholarships
  ACM Club
CS 1010 1400 1410 2005 2420 2450 2810 3310 3400 3410 3500 3510 3520 3530 3600 4300 4550 4600
Syllabus Assignments Schedule Examples Notes Grades

CS 3510 Advanced Algorithms/Data Structures
Problem Set 06

Complete the following problems from the text. Typeset your solutions.

  • 5.2 This is a mechanical problem to solidify understanding of Kruskal and Prim.
  • 5.14 This is a mechanical problem to solidify understanding of Huffman encoding.
  • 5.4 This should be a quick problem when you see the proof.
  • 5.5 Another quick problem when you see the proof or counter example.
  • 5.31 Another quick problem when you see the solution.
  • 5.28 Good experience in greedy algorithm discovery.
  • 5.32 Good experience in greedy algorithm discovery.
  • 5.25 (Do this one last.) This is a challenging problem to expand experience in amortized analysis.
  • 5.26 (Not required) If you have extra time look at this problem with a greedy solution.
Student Projects   
CIT.DIXIE.EDU