Course syllabus

Syllabus

Problem Sets

Problem Set 1  (Due 07-03-2007)

Problem Set 2  (Due 21-03-2007)

Problem Set 3  (Due 28-03-2007)

Problem Set 4  (Due 11-04-2007)

Exercise given in class  (Due 16-04-2007)

Term Paper     (Due 25-05-2007)

Problem Set 6  (Due 23-04-2007)

Problem Set 7  (Due 16-05-2007)  emails.txt

Problem Set 8  (Due 23-05-2007)

Codes

1. (22-02-2007) Insertion sort code: ins_sort.c
   

2. (26-02-2007) C implementation of pseudocode on page 17: ins_sort2.c
   

3. (01-03-2007) Analysis of insertion sort: ins_sort2_analyze.c
   

4. (01-03-2007) Bubble sort: bubble_sort.c
   

5. (05-03-1007) Factorial with recurrences: factorial.c
   

6. (05-03-2007) Divide and conquer - skeleton code: divide_and_conquer_skeleton.c
   

7. (07-03-2007) Divide and conquer - problem session: divide_and_conquer.c
   

8. (12-03-2007) Sorting a record: sort_record.c
   

9. (14-03-2007) Linear sort: linear_search.c
   

10. (28-03-2007) Stack: stack.c
    

11. (28-03-2007) Stack using “C struct”: stack_struct.c
    

12. (04-04-2007) Linked list example: link_list.c
    

13. (11-04-2007) Linked list using pointer links (skeleton): real_link_list.c
    

14. (16-04-2007) Linked list using pointer links (completed): real_link_list.c
    

15. (11-05-2007) Hashing: hashing.c, emails.txt
    

16. (16-05-2007) Binary search tree: binary_search_tree.c
    

Announcements

1. First lecture will be held on Feb 19th, 2007.
   

2. Problem Set 3 was postponed to Monday. Its weight is going to be 150. (50% increase)