====== CSCI2100 Data Structures Tutorial Page ======
| ^ Tutorial I ^ Tutorial II ^
^ Time | M7 2:30 pm - 3:15pm | W10 5:30 pm - 6:15 pm |
^ Venue | LSK LT3 | ERB 407 |
**See announcement at bottom of page**
^ Week ^ Date ^ Topic ^ TA ^ Resources ^
| 1 | 1.11 & 1.13 | {{:teaching:csci2100:2015:tutorial1_cintro_updated.pdf|Introduction of C}} | Hongyi Zhang | |
| 2 | 1.18 & 1.14 | {{:teaching:csci2100:2015:tutorial2_ojs.pdf|Online Judge System}} | Jiani Zhang | Instruction videos \\ [[https://youtu.be/A-cPxaKQGXQ|user preparation]] \\ [[https://youtu.be/QUgyMZbhrsU|code submission]] \\ [[https://youtu.be/ivyHXw6DF-w|user preparation]] \\ [[https://youtu.be/bgBrxkIFvuE| code submission]] |
| 3 | 1.25 & 1.27 | {{:teaching:csci2100:2015:tutorial3_ioc.pdf|I/O Issues in C}} | Jiani Zhang | |
| 4 | 2.1 & 2.3 | {{:teaching:csci2100:2015:tutorial4_lsq_1.pdf|Lists, Stacks, and Queues in C}} | Ken Chan | |
| 5 | 2.8 & 2.10 | Lunar New Year Break | | |
| 6 | 2.15 & 2.17 | {{:teaching:csci2100:2015:tutorial5_vim.pdf|Linux commands and vim}} | Ken Chan | |
| 7 | 2.22 & 2.24 | {{:teaching:csci2100:2015:tutorial6_tree.pdf|Binary and AVL Trees in C}} | Ken Chan | |
| 8 | 2.29 & 3.2 | {{:teaching:csci2100:2015:tutorial7_heaps_3.pdf|Heaps in C}} | Ken Chan | {{:teaching:csci2100:2015:tutorial7_supplementary.pdf|Proof of running time of buildHeap algorithm}} |
| 9 | 3.7 & 3.9 | {{:teaching:csci2100:2015:tutorial8_hash.pdf|hash in C}} | Jiani Zhang | |
| 10 | 3.14 & 3.16 | {{:teaching:csci2100:2015:tutorial9_pointer.pdf|Pointers in C}} | Jiani Zhang | |
| 11 | 3.21 & 3.23 | No Tutorial | | |
| 12 | 3.30 & 4.6 | {{:teaching:csci2100:2015:tutorial10_midterm.pdf|Programming Exam Preview}} | Ken Chan | |
| 13 | 4.11 & 4.13 | {{:teaching:csci2100:2015:tutorial11_qsort_msort2.pdf|QuickSort and MergeSort}} | Ken Chan | |
====== News ======
- **11 January 2015**. The Tutorial Page is available now!