COSC-320 Data Structures & Algorithm Analysis
Lab General Information
Each lab is worth 10 points. (Some labs may have extra bonus points)
You must finish pre-lab reading and writing assignments (if any) PRIOR to the lab meeting time. You are encouraged to read the related chapter contents before you do your lab.
Read and follow the instruction. You are recommended to open the instruction page on your desktop or print that page and have it with your hand when you are doing your lab.
Type your answers for lab questions.
Put your name and your section number on the top of your pages. Staple your pages and have them in order. Put your pre-lab assignment at the top of other assignments. (The sample answer sheet for your lab.)
Labs including pre-lab assignments are due at the completion of the lab period unless specifically stated differently by the instructor. You can do part of your lab in advance if you think you can not finish the whole lab during regular lab time. The total lab time is one hour forty minutes. Make sure you can finish your lab in one hour 30 minutes and leave ten minutes for wrapping up lab reports, print out the answer sheets, and submit the softcopy of your answers though MyClasses@SU (if required) and the hardcopy to the instructor.
Lab Report: state clearly if you have finished all required tasks for the lab. If you don't finish lab or some part of that doesn't work, you must state clearly what the problem is. You need to state if your lab is completed by yourself independently. If you get any help from tutors, your classmates, or other resources (eg. Internet), you need to state each of them clearly. You can NOT copy others’ labs. These are individual lab assignments!
Week |
Lab No | Topic | |
1 | Jan 27 | 0 |
Get an account in Lab HS 143 (if you don't have) Test your account that can login you into the machines in HS 143. (If you don't have an account, ask instructor for more information.)
Note: If you are not familiar with or forget Linux system, please review COSC220 lab 1 |
2 | Feb 3 | 1 |
|
3 | Feb 10 | 2 | Searching |
4 | Feb 17 | 3 | Binary Tree |
5 | Feb 24 | 4 | Tree Traversal |
6 | Mar 2 | 5 | Binary Search Tree |
7 | Mar 9 | 6 | Set & Map |
Mar 16 | Spring break | ||
8 | Mar 23 | 7 | Hash Table |
9 | Mar 30 | Work on your project proposal | |
10 | Apr 6 | 8 | Priority Queue |
11 | Apr 13 | 9 | Graph |
12 | Apr 20 | 10 | Graph traversal |
13 | Apr 27 | 11 | Graph minimizations |
14 | May 4 | Prepare your final |