CS 2420 Data Structures and Algorithms, Section 2, Fall 2008

• Time and place: Mon Wed Fri 12:30pm - 1:20pm, Main 301
• Course website: http://www.cs.usu.edu/~mjiang/cs2420/fall2008/
• Eagle website: http://eagle.cs.usu.edu/
• Professor: Dr. Minghui Jiang
  • Contact: mjiang at cc.usu.edu, 435-797-0347
  • Office hours: Tue Thu 12:00pm - 1:30pm, Main 402G
• Grader: p.tejada at aggiemail.usu.edu (Pedro Tejada)
• Textbook: Mark Allen Weiss. Data Structures and Algorithm Analysis in C++, Third Edition. ISBN: 0-321-44146-X.
• Course goals: The objectives of this course are to enable the students
  1. to perform asymptotic analysis for simple algorithms;
  2. to use basic data structures such as trees, hash tables, heaps, and disjoint sets, and to understand the concepts of balanced search trees, hash functions and collision resolution, priority queues, and equivalence relations.
  3. to select and use different sorting algorithms such as InsertionSort, MergeSort, and BucketSort based on their different mathematical properties, and to undertand the algorithmic design technique of divide-and-conquer.
  4. to use fundamental graph algorithms such as topological sort, shortest paths, and minimum spanning tree, to undertand the representations, traversals, and basic combinatorial properties of graphs, and to understand the algorithmic design techniques of greedy algorithms and dynamic programming.
• Prerequisite: CS 1410 or equivalent knowledge.
• Grading:
  • Homework (210 points) on eagle
    • Program
      1. (20 points, due Sep 8 Mon) p01f08.pdf prog1.txt
      2. (20 points, due Sep 17 Wed) p02f08.pdf prog2.txt avl.txt p2.cpp
      3. (20 points, due Sep 24 Wed) p03f08.pdf passwd.txt
      4. (20 points, due Oct 13 Mon) p04f08.pdf bheap.txt lheap.txt
      5. (20 points, due Oct 27 Mon) p05f08.pdf hr_time.cpp hr_time.h
      6. (20 points, due Nov 17 Mon) p06f08.pdf maze.txt maze_large.txt
      7. (20 points, due Dec 1 Mon) p07f08.pdf OList7.zip
    • Written
      1. (10 points, due Sep 10 Wed) w01f08.pdf w1.cpp
      2. (10 points, due Sep 19 Fri) w02f08.pdf splay.gif
      3. (10 points, due Sep 26 Fri) w03f08.pdf
      4. (10 points, due Oct 16 Thu) w04f08.pdf
      5. (10 points, due Oct 31 Fri) w05f08.pdf SortDetective2.exe
      6. (10 points, due Nov 21 Fri) w06f08.pdf
      7. (10 points, due Dec 5 Fri) w07f08.pdf
  • Exams (350 points) in Main 301
    1. Midterm 1 (100 points, Sep 29 Mon 12:30pm - 1:20pm):
       • Algorithm analysis, trees, and hashing.
    2. Midterm 2 (100 points, Nov 3 Mon 12:30pm - 1:20pm)
       • Priority queues and sorting.
    3. Final (150 points, Dec 8 Mon 11:30am - 1:20pm)
       • Everything, with emphasis on disjoint sets and graph algorithms.
  • Statistics

    Assignment	Points	Average	Minimum	Maximum	Standard deviation
    Program 1	20	11.38	0.00	20.00	8.51
    Written 1	10	5.90	2.00	9.00	2.12
    Program 2	20	13.43	0.00	20.00	7.71
    Written 2	10	4.23	0.00	8.00	2.46
    Program 3	20	15.15	3.00	20.00	5.38
    Written 3	10	7.05	0.00	10.00	2.79
    Midterm 1	100	49.23	7.50	85.00	21.64
    Program 4	20	14.42	0.00	20.00	8.38
    Written 4	10	7.26	0.00	9.80	3.29
    Program 5	20	14.88	0.00	20.00	6.83
    Written 5	10	4.92	0.00	7.00	2.33
    Midterm 2	100	52.25	0.00	100.00	32.55
    Program 6	20	13.42	0.00	20.00	8.07
    Total		370	213.49	12.50	348.80	112.05
    

• Lectures (schedule subject to change): holidays in [brackets]; exam dates in red; unusual dates in blue.
  • Aug 25 27 29: Review: chapters 1, 3; sections 4.1, 4.2, 4.3
  • Sep [1] 3 5: Algorithm Analysis: 2.1, 2.2, 2.3, 2.4
  • Sep 8 10 12: Trees: 4.4, 4.5
  • Sep 15 17 19: Trees: 4.6, 4.7 Hashing: 5.1, 5.2, 5.3
  • Sep 22 24 26: Hashing: 5.4, 5.5
    
  • Sep 29 Oct 1 3: Priority Queues: 6.1, 6.2, 6.3, 6.4, 6.5
  • Oct 6 8 10: Priority Queues: 6.6, 6.7, 6.8
  • Oct 13 15 16: Sorting: 7.1, 7.2, 7.3, 7.4, 7.5, 7.10
  • Oct 20 22 24: Sorting: 7.6, 7.7
  • Oct 27 29 31: Sorting: 7.8, 7.9 Disjoint Sets: 8.1, 8.2, 8.3, 8.4, 8.5, 8.6, 8.7
  • Nov 3 5 7: Graph Algorithms: 9.1, 9.2
  • Nov 10 12 14: Graph Algorithms: 9.3
  • Nov 17 19 21: Graph Algorithms: 9.4, 9.5
  • Nov 24 [26 28]: Graph Algorithms: 9.6 topological sort by depth-first search
  • Dec 1 3 5:
  • Dec 8: Final exam on Mon 11:30am - 1:20pm.
• Registration policy:
  • The last day to add this class is September 15.
  • The last day to drop this class without notation on your transcript is September 15.
  • Attending this class beyond September 15 without being officially registered will not be approved by the Dean's Office. Students must be officially registered for this course. No assignments or tests of any kind will be graded for students whose names do not appear on the class list.
• Code of conduct:
  • Every student should read and follow the department code of conduct.
  • Students are encouraged to discuss and exchange ideas on homework and projects, but each student must write up the solutions independently.
  • Students who are caught cheating immediately receive "Fail" grades (the instructor is absolutely firm on this policy; he has previously given two "Fail" grades for this reason).
• DRC statement: Students with physical, sensory, emotional or medical impairments may be eligible for reasonable accommodations in accordance with the Americans with Disabilities Act and Section 504 of the Rehabilitation Act of 1973. All accommodations are coordinated through the Disability Resource Center (DRC) in Room 101 of the University Inn, 797-2444 voice, 797-0740 TTY, or toll free at 1-800-259-2966. Please contact the DRC as early in the semester as possible. Alternate format materials (Braille, large print or digital) are available with advance notice.