====== CSCI2100B Data Structures Tutorial Page ======


|  ^  Lecture I  ^  Tutorial I  ^  Tutorial II  ^  Tutorial III  ^  Lab session  ^
^ Time    |  T2-4, 9:30 am - 12:15 pm  |  W6, 1:30 pm - 2:15 pm  |  W7, 2:30pm - 3:15 pm  |  H6, 1:30pm - 2:15 pm  |  Mon to Thu, 5:30 pm - 7:30 pm  |
^ Venue    |  LSB LT1  |  BMS LT  |  BMS LT  |  LSB C1  |  SHB924  |

 
 <hi #ff0000>**See announcement at bottom of page**</hi> 


^ Week   ^    Date     ^  Notes  ^  TA  ^  Resources  ^
|  1  | 9.4 & 9.5 |  No Tutorials  |  NA  |  NA  |
|  2  | 9.11 & 9.12 |  {{:teaching:csci2100b:2013:tutorial1_cintro.ppt|Introduction on C}}  |  Yuanming Yu  |  TBD  |
|  3  | 9.18 & 9.19 |  {{:teaching:csci2100b:2013:tutorial2_ojs.ppt|Online Judge System}}  |  Hongyi Zhang  |  {{:teaching:csci2100b:2013:noncse-ssh_login.doc|Non-CSE SSH}}  |
|  4  | 9.25 & 9.26 |  {{:teaching:csci2100b:2013:tutorial3_ioc.ppt|I/O Issues in C}}  |  Yuanming Yu  |  TBD  |
|  5  | 10.2 & 10.3 |  {{:teaching:csci2100b:2013:tutorial4_lsq_updated.ppt|Lists, Stacks, and Queues in C}}  |  Hongyi Zhang  |  TBD  |
|  6  | 10.9 & 10.10 |  {{:teaching:csci2100b:2013:tutorial5_tree.ppt|Binary and AVL Tree in C}}  |  Yuanming Yu  |  TBD  |
|  7  | 10.16 & 10.17 |  {{:teaching:csci2100b:2013:tutorial6_hash_update.ppt|Hash in C}}  |  Hongyi Zhang  |  TBD  |
|  8  | 10.23 & 10.24 |  {{:teaching:csci2100b:2013:tutorial7_heaps.ppt|Heaps in C}}  |  Hongyi Zhang |  TBD  |
|  9  | 10.30 & 10.31 |  {{:teaching:csci2100b:2013:homework_2_tips.pptx|Homework #2 Tips}}  |  Fei Chen  |  TBD  |
|  10  | 11.6 & 11.7 |  {{:teaching:csci2100b:2013:tutorial9_midterm.ppt|PC^2 Tutorial and Midterm Tips}}  |  Yuanming Yu  |  TBD  |
|  11  | 11.13 & 11.14 |  {{:teaching:csci2100b:2013:written_midterm_tips.pptx|Written Midterm Tips}}  |  Fei Chen  |  TBD  |
|  12  | 11.20 & 11.21 |  {{:teaching:csci2100b:2013:tutorial10_qsort_msort.pptx|Mergesort and Quicksort in C}}  |  Fei Chen  |  TBD  |
|  13  | 11.27 & 11.28 |  {{:teaching:csci2100b:2013:tutorial11_graph.ppt|Graph Revisited}}  |  Fei Chen  |  TBD  |

**Lab Session**
^ Week   ^    Date     ^  Notes    ^  Code  ^
|  2  |  9.9 - 9.12   |  {{:teaching:csci2100b:2013:t1.pdf|Tutorial 1: Hello World}}  |  {{:teaching:csci2100b:2013:ass1.doc|ass1}}  |
|  3  |  9.16 - 9.19  |  {{:teaching:csci2100b:2013:lec02a-datatypes.pdf|Tutorial 2: Data Types}}  |  {{:teaching:csci2100b:2013:converter.docx|ass2}}  |
|  4  |  9.23 - 9.26  | {{:teaching:csci2100b:2013:l3_pointers_3_.pdf|Tutorial 3: Pointers }}|  {{:teaching:csci2100b:2013:l3.zip|}}  |
|  5  |  9.30 - 10.3  |  {{:teaching:csci2100b:2013:iab4.zip|Tutorial 4: Structure}} | {{:teaching:csci2100b:2013:lab4.zip|}}   |
|  6  |  10.7 - 10.10  |  {{:teaching:csci2100b:2013:lab5-stringspointerstools.ppt|Tutorial 5: Strings}}    |  {{:teaching:csci2100b:2013:lab5.zip|}}  |
|  7  |  10.14 - 10.17  |  {{:teaching:csci2100b:2013:slides_for_lab6.zip|Tutorial 6: File}}   |   |

====== News ======
    - <hi yellow>**20 November 2013**</hi>.  There will be no tutorial on Nov 21 (Thu) because of congregation. 
    - <hi yellow>**30 September 2013**</hi>.  Oct. 1st(Tuesday) is holiday. There will be no lab session. 
    - <hi yellow>**26 September 2013**</hi>.  The lab notes of week 3 updated:(1) modify a small mistake in practice 2; (2） add slides to show the procedure of call-by-value function and call-by-address function; (3) add one slide to explain the difference between char *s = "abc" and char s[] = "abc".
     - <hi yellow>**16 September 2013**</hi>. For Non-CSE students, after you get your CSE UNIX account, please look at the resource file "Non-CSE SSH" besides week 2's tutorial ppt and follow the instructions to submit your programming assignments. We also prepare a link including some basic commands in UNIX operation system below.