====== CSCI2100 Data Structures Tutorial Page ======


| ^  Tutorial I  ^  Tutorial II  ^
^ Time    |  M10, 5:30 pm - 6:15 pm  |  W8, 3:30pm - 4:15 pm  |
^ Venue    |  ERB 407  |  ERB 404  |

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


^ Week   ^    Date     ^  Topic  ^  TA  ^  Resources  ^
|  1  |  1.5 & 1.7  |  {{:teaching:csci2100:2014:tutorial1_cintro1.ppt|Introduction of C}}  |  Zhengwei Yang  |    |
|  2  |  1.12 & 1.14  |  {{:teaching:csci2100:2014:tutorial3_1.pdf|IO Issues in C}}  |  Robbie  |    |
|  3  |  1.19 & 1.21  |  {{:teaching:csci2100:2014:tutorial_vim.ppt|Introduction to VIM}}  |  Robbie  |    |
|  4  |  1.26 & 1.28  |  {{:teaching:csci2100:2014:tutorial4_lsq.ppt|Lists, Stacks and Queues }}  |  Yang Zhengwei  |    |
|  5  |  2.2 & 2.4  |  {{:teaching:csci2100:2014:tutorial5_queue_tree.ppt|Queues and Trees in C}}  |  Yang Zhengwei  |    |
|  6  |  2.9 & 2.11  |  {{:teaching:csci2100:2014:tutorial6_tree.ppt|Binary and AVL Trees in C}}  |  Robbie  |    |
|  7  |  2.16 & 2.25  |  {{:teaching:csci2100:2014:tutorial7_heap.pdf|Heaps in C}}  |  Yang Zhengwei  |    |
|  8  |  3.2 & 3.4  |  No Tutorial  |  TBD  |    |
|  9  |  3.9 & 3.11  |  {{:teaching:csci2100:2014:midterm_solution.ppt|Written Midterm}}  |  Yang Zhengwei  |    |
|  10  |  3.16 & 3.18  |  {{:teaching:csci2100:2014:tutorial_hash.ppt|Hash}}  |  Robbie  |    |
|  11  |  3.23 & 3.25  |  {{:teaching:csci2100:2014:tutorial_qsort.ppt|Quick sort and Merge sort}}  |  Robbie  |    |
|  12  |  3.30 & 4.1  |  No Tutorial   |  TBD  |    |
|  13  |  4.8 & 4.13  |  {{:teaching:csci2100:2014:graph.ppt|graph}}  |  Yang Zhengwei  |    |
|  14  |  4.20  |  {{:teaching:csci2100:2014:hw5.pptx|HW5}}  |  Yang Zhengwei  |    |

====== News ======
    - <hi yellow>**5 January 2015**</hi>.  The Tutorial Page is available now!