{"ModuleCode":"CS2010","ModuleTitle":"Data Structures and Algorithms II","Department":"Computer Science","ModuleDescription":"This module is the third part of a three-part series on introductory programming and problem solving by computing. It continues the introduction in CS1010 and CS1020, and emphasises object-oriented programming with application to complex data structures. Topics covered include trees, binary search trees, order property, prefix/infix/postfix expressions, heaps, priority queues, graphs and their algorithmic design, recursive algorithms, problem formulation and problem solving with applications of complex data structures, data structure design principles and implementation strategies, and algorithm analysis. Advanced data structures such as B-trees and AVL trees are also covered.","ModuleCredit":"4","Workload":"2-1-1-3-3","Prerequisite":"CS1020 or CS1020E or CG1103 Data Structures and Algorithms I","Preclusion":"CG1102, CS1102, CS1102C, CS1102S, CS2020","ExamDuration":"P2H","ExamVenue":"SOC SR1","Types":["Module","UEM"],"CorsBiddingStats":[{"AcadYear":"2015/2016","Semester":"1","Round":"1A","Group":"Lecture 1","Quota":"5","Bidders":"7","LowestBid":"1","LowestSuccessfulBid":"5","HighestBid":"601","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2015/2016","Semester":"1","Round":"1A","Group":"Lecture 1","Quota":"4","Bidders":"14","LowestBid":"1","LowestSuccessfulBid":"3807","HighestBid":"5649","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2015/2016","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2015/2016","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"2","Bidders":"8","LowestBid":"1","LowestSuccessfulBid":"1341","HighestBid":"1500","Faculty":"School Of Computing","StudentAcctType":"NUS Students [G]"},{"AcadYear":"2015/2016","Semester":"1","Round":"2A","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2015/2016","Semester":"1","Round":"2B","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2015/2016","Semester":"1","Round":"3A","Group":"Lecture 1","Quota":"5","Bidders":"17","LowestBid":"1","LowestSuccessfulBid":"2873","HighestBid":"4168","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P, G]"},{"AcadYear":"2014/2015","Semester":"2","Round":"1A","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Arts & Social Sciences","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"1A","Group":"Lecture 1","Quota":"20","Bidders":"4","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"636","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"1A","Group":"Lecture 1","Quota":"15","Bidders":"11","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1000","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"1A","Group":"Lecture 1","Quota":"5","Bidders":"1","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"1B","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Arts & Social Sciences","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"1B","Group":"Lecture 1","Quota":"16","Bidders":"1","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"1B","Group":"Lecture 1","Quota":"4","Bidders":"1","LowestBid":"100","LowestSuccessfulBid":"1","HighestBid":"100","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"1B","Group":"Lecture 1","Quota":"4","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"2A","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Arts & Social Sciences","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"2A","Group":"Lecture 1","Quota":"19","Bidders":"3","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"635","Faculty":"School Of Computing","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"2A","Group":"Lecture 1","Quota":"3","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"2A","Group":"Lecture 1","Quota":"3","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Reserved for [G] in later round"},{"AcadYear":"2014/2015","Semester":"2","Round":"2B","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Arts & Social Sciences","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"2B","Group":"Lecture 1","Quota":"18","Bidders":"1","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1","Faculty":"School Of Computing","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"2B","Group":"Lecture 1","Quota":"3","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2014/2015","Semester":"2","Round":"2B","Group":"Lecture 1","Quota":"3","Bidders":"6","LowestBid":"200","LowestSuccessfulBid":"1499","HighestBid":"1823","Faculty":"School Of Computing","StudentAcctType":"NUS Students [G]"},{"AcadYear":"2014/2015","Semester":"2","Round":"3A","Group":"Lecture 1","Quota":"25","Bidders":"15","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"950","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P, G]"},{"AcadYear":"2014/2015","Semester":"2","Round":"3B","Group":"Lecture 1","Quota":"12","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P, G]"},{"AcadYear":"2014/2015","Semester":"1","Round":"1A","Group":"Lecture 1","Quota":"10","Bidders":"6","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"535","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2014/2015","Semester":"1","Round":"1A","Group":"Lecture 1","Quota":"5","Bidders":"9","LowestBid":"51","LowestSuccessfulBid":"1500","HighestBid":"3001","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2014/2015","Semester":"1","Round":"1B","Group":"Lecture 1","Quota":"4","Bidders":"1","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2014/2015","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"3","Bidders":"2","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"100","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2014/2015","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Reserved for [G] in later round"},{"AcadYear":"2014/2015","Semester":"1","Round":"2A","Group":"Lecture 1","Quota":"7","Bidders":"18","LowestBid":"200","LowestSuccessfulBid":"1750","HighestBid":"2417","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P] and NUS Students [G]"},{"AcadYear":"2013/2014","Semester":"2","Round":"1A","Group":"Lecture 1","Quota":"30","Bidders":"9","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"112","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2013/2014","Semester":"2","Round":"1A","Group":"Lecture 1","Quota":"20","Bidders":"12","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"999","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2013/2014","Semester":"2","Round":"1A","Group":"Lecture 1","Quota":"15","Bidders":"2","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2013/2014","Semester":"2","Round":"1B","Group":"Lecture 1","Quota":"21","Bidders":"3","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1000","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2013/2014","Semester":"2","Round":"1B","Group":"Lecture 1","Quota":"8","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2013/2014","Semester":"2","Round":"1B","Group":"Lecture 1","Quota":"13","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2013/2014","Semester":"2","Round":"2A","Group":"Lecture 1","Quota":"31","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2013/2014","Semester":"2","Round":"2A","Group":"Lecture 1","Quota":"8","Bidders":"1","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2013/2014","Semester":"2","Round":"2A","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Reserved for [G] in later round"},{"AcadYear":"2013/2014","Semester":"2","Round":"2B","Group":"Lecture 1","Quota":"31","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2013/2014","Semester":"2","Round":"2B","Group":"Lecture 1","Quota":"7","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2013/2014","Semester":"2","Round":"2B","Group":"Lecture 1","Quota":"5","Bidders":"11","LowestBid":"1","LowestSuccessfulBid":"604","HighestBid":"1596","Faculty":"School Of Computing","StudentAcctType":"NUS Students [G]"},{"AcadYear":"2013/2014","Semester":"2","Round":"3A","Group":"Lecture 1","Quota":"38","Bidders":"5","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"503","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P, G]"},{"AcadYear":"2013/2014","Semester":"2","Round":"3B","Group":"Lecture 1","Quota":"34","Bidders":"1","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P, G]"},{"AcadYear":"2013/2014","Semester":"1","Round":"1A","Group":"Lecture 1","Quota":"12","Bidders":"8","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"500","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2013/2014","Semester":"1","Round":"1A","Group":"Lecture 1","Quota":"20","Bidders":"21","LowestBid":"1","LowestSuccessfulBid":"20","HighestBid":"3234","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2013/2014","Semester":"1","Round":"1B","Group":"Lecture 1","Quota":"4","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2013/2014","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2013/2014","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"10","Bidders":"1","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2013/2014","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Reserved for [G] in later round"},{"AcadYear":"2013/2014","Semester":"1","Round":"2A","Group":"Lecture 1","Quota":"10","Bidders":"15","LowestBid":"1","LowestSuccessfulBid":"101","HighestBid":"773","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P] and NUS Students [G]"},{"AcadYear":"2013/2014","Semester":"1","Round":"2A","Group":"Lecture 1","Quota":"9","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2013/2014","Semester":"1","Round":"2B","Group":"Lecture 1","Quota":"10","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2013/2014","Semester":"1","Round":"3A","Group":"Lecture 1","Quota":"11","Bidders":"18","LowestBid":"2","LowestSuccessfulBid":"500","HighestBid":"1800","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P, G]"},{"AcadYear":"2013/2014","Semester":"1","Round":"3B","Group":"Lecture 1","Quota":"1","Bidders":"5","LowestBid":"77","LowestSuccessfulBid":"1201","HighestBid":"1201","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P, G]"},{"AcadYear":"2012/2013","Semester":"2","Round":"1A","Group":"Lecture 1","Quota":"18","Bidders":"3","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"10","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2012/2013","Semester":"2","Round":"1A","Group":"Lecture 1","Quota":"15","Bidders":"13","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1000","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2012/2013","Semester":"2","Round":"1A","Group":"Lecture 1","Quota":"28","Bidders":"5","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"11","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2012/2013","Semester":"2","Round":"1B","Group":"Lecture 1","Quota":"15","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2012/2013","Semester":"2","Round":"1B","Group":"Lecture 1","Quota":"2","Bidders":"2","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"309","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2012/2013","Semester":"2","Round":"1B","Group":"Lecture 1","Quota":"23","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2012/2013","Semester":"2","Round":"2A","Group":"Lecture 1","Quota":"38","Bidders":"1","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1","Faculty":"School Of Computing","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2012/2013","Semester":"2","Round":"2A","Group":"Lecture 1","Quota":"1","Bidders":"1","LowestBid":"205","LowestSuccessfulBid":"1","HighestBid":"205","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2012/2013","Semester":"2","Round":"2A","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Reserved for [G] in later round"},{"AcadYear":"2012/2013","Semester":"2","Round":"2B","Group":"Lecture 1","Quota":"37","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2012/2013","Semester":"2","Round":"2B","Group":"Lecture 1","Quota":"1","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2012/2013","Semester":"2","Round":"2B","Group":"Lecture 1","Quota":"5","Bidders":"4","LowestBid":"10","LowestSuccessfulBid":"1","HighestBid":"1111","Faculty":"School Of Computing","StudentAcctType":"NUS Students [G]"},{"AcadYear":"2012/2013","Semester":"2","Round":"3A","Group":"Lecture 1","Quota":"39","Bidders":"8","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"200","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P, G]"},{"AcadYear":"2012/2013","Semester":"2","Round":"3B","Group":"Lecture 1","Quota":"32","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P, G]"},{"AcadYear":"2012/2013","Semester":"1","Round":"1A","Group":"Lecture 1","Quota":"30","Bidders":"9","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"100","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2012/2013","Semester":"1","Round":"1A","Group":"Lecture 1","Quota":"21","Bidders":"2","LowestBid":"3","LowestSuccessfulBid":"1","HighestBid":"200","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2012/2013","Semester":"1","Round":"1B","Group":"Lecture 1","Quota":"21","Bidders":"1","LowestBid":"200","LowestSuccessfulBid":"1","HighestBid":"200","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2012/2013","Semester":"1","Round":"1B","Group":"Lecture 1","Quota":"19","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2012/2013","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"20","Bidders":"1","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2012/2013","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"19","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2012/2013","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"15","Bidders":"3","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"2","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2012/2013","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Reserved for [G] in later round"},{"AcadYear":"2012/2013","Semester":"1","Round":"2A","Group":"Lecture 1","Quota":"43","Bidders":"16","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"700","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P] and NUS Students [G]"},{"AcadYear":"2012/2013","Semester":"1","Round":"2A","Group":"Lecture 1","Quota":"12","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2012/2013","Semester":"1","Round":"2B","Group":"Lecture 1","Quota":"27","Bidders":"1","LowestBid":"32","LowestSuccessfulBid":"1","HighestBid":"32","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P] and NUS Students [G]"},{"AcadYear":"2012/2013","Semester":"1","Round":"2B","Group":"Lecture 1","Quota":"12","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2012/2013","Semester":"1","Round":"3A","Group":"Lecture 1","Quota":"38","Bidders":"7","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1256","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P, G]"},{"AcadYear":"2012/2013","Semester":"1","Round":"3B","Group":"Lecture 1","Quota":"31","Bidders":"3","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P, G]"},{"AcadYear":"2011/2012","Semester":"2","Round":"1A","Group":"Lecture 1","Quota":"20","Bidders":"3","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2011/2012","Semester":"2","Round":"1A","Group":"Lecture 1","Quota":"12","Bidders":"15","LowestBid":"10","LowestSuccessfulBid":"50","HighestBid":"652","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2011/2012","Semester":"2","Round":"1A","Group":"Lecture 1","Quota":"60","Bidders":"3","LowestBid":"5","LowestSuccessfulBid":"1","HighestBid":"7","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2011/2012","Semester":"2","Round":"1B","Group":"Lecture 1","Quota":"17","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2011/2012","Semester":"2","Round":"1B","Group":"Lecture 1","Quota":"57","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2011/2012","Semester":"2","Round":"2A","Group":"Lecture 1","Quota":"74","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2011/2012","Semester":"2","Round":"2A","Group":"Lecture 1","Quota":"2","Bidders":"3","LowestBid":"500","LowestSuccessfulBid":"750","HighestBid":"800","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2011/2012","Semester":"2","Round":"2A","Group":"Lecture 1","Quota":"8","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Reserved for [G] in later round"},{"AcadYear":"2011/2012","Semester":"2","Round":"2B","Group":"Lecture 1","Quota":"74","Bidders":"1","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1","Faculty":"School Of Computing","StudentAcctType":"Returning Students and New Students [P]"},{"AcadYear":"2011/2012","Semester":"2","Round":"2B","Group":"Lecture 1","Quota":"8","Bidders":"8","LowestBid":"2","LowestSuccessfulBid":"1","HighestBid":"1729","Faculty":"School Of Computing","StudentAcctType":"NUS Students [G]"},{"AcadYear":"2011/2012","Semester":"2","Round":"3A","Group":"Lecture 1","Quota":"73","Bidders":"6","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1000","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P, G]"},{"AcadYear":"2011/2012","Semester":"2","Round":"3B","Group":"Lecture 1","Quota":"72","Bidders":"1","LowestBid":"10","LowestSuccessfulBid":"1","HighestBid":"10","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P, G]"},{"AcadYear":"2011/2012","Semester":"1","Round":"1A","Group":"Lecture 1","Quota":"30","Bidders":"10","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1450","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2011/2012","Semester":"1","Round":"1A","Group":"Lecture 1","Quota":"3","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2011/2012","Semester":"1","Round":"1B","Group":"Lecture 1","Quota":"20","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2011/2012","Semester":"1","Round":"1B","Group":"Lecture 1","Quota":"3","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2011/2012","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"20","Bidders":"1","LowestBid":"10","LowestSuccessfulBid":"1","HighestBid":"10","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2011/2012","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"3","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"Joint Multi-Disciplinary Programmes","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2011/2012","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"5","Bidders":"2","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"62","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2011/2012","Semester":"1","Round":"1C","Group":"Lecture 1","Quota":"5","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Reserved for [G] in later round"},{"AcadYear":"2011/2012","Semester":"1","Round":"2A","Group":"Lecture 1","Quota":"27","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2011/2012","Semester":"1","Round":"2A","Group":"Lecture 1","Quota":"3","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2011/2012","Semester":"1","Round":"2B","Group":"Lecture 1","Quota":"27","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"Returning Students [P]"},{"AcadYear":"2011/2012","Semester":"1","Round":"2B","Group":"Lecture 1","Quota":"3","Bidders":"0","LowestBid":"0","LowestSuccessfulBid":"0","HighestBid":"0","Faculty":"School Of Computing","StudentAcctType":"New Students [P]"},{"AcadYear":"2011/2012","Semester":"1","Round":"3A","Group":"Lecture 1","Quota":"31","Bidders":"5","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"1640","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P]"},{"AcadYear":"2011/2012","Semester":"1","Round":"3B","Group":"Lecture 1","Quota":"26","Bidders":"6","LowestBid":"1","LowestSuccessfulBid":"1","HighestBid":"600","Faculty":"School Of Computing","StudentAcctType":"NUS Students [P]"}],"AcadYear":"2014/2015","History":[{"Semester":1,"ExamDate":"2014-11-24T17:00+0800","Timetable":[{"ClassNo":"1","LessonType":"Laboratory","WeekText":"Every Week","DayText":"Thursday","StartTime":"0900","EndTime":"1000","Venue":"COM1-B108"},{"ClassNo":"10","LessonType":"Laboratory","WeekText":"Every Week","DayText":"Thursday","StartTime":"1100","EndTime":"1200","Venue":"COM1-0113"},{"ClassNo":"11","LessonType":"Laboratory","WeekText":"Every Week","DayText":"Thursday","StartTime":"1200","EndTime":"1300","Venue":"COM1-0113"},{"ClassNo":"2","LessonType":"Laboratory","WeekText":"Every Week","DayText":"Thursday","StartTime":"1000","EndTime":"1100","Venue":"COM1-B108"},{"ClassNo":"3","LessonType":"Laboratory","WeekText":"Every Week","DayText":"Thursday","StartTime":"1100","EndTime":"1200","Venue":"COM1-B108"},{"ClassNo":"4","LessonType":"Laboratory","WeekText":"Every Week","DayText":"Thursday","StartTime":"1200","EndTime":"1300","Venue":"COM1-B111"},{"ClassNo":"5","LessonType":"Laboratory","WeekText":"Every Week","DayText":"Thursday","StartTime":"1300","EndTime":"1400","Venue":"COM1-B111"},{"ClassNo":"6","LessonType":"Laboratory","WeekText":"Every Week","DayText":"Thursday","StartTime":"1400","EndTime":"1500","Venue":"COM1-0114"},{"ClassNo":"7","LessonType":"Laboratory","WeekText":"Every Week","DayText":"Thursday","StartTime":"1500","EndTime":"1600","Venue":"COM1-0114"},{"ClassNo":"8","LessonType":"Laboratory","WeekText":"Every Week","DayText":"Thursday","StartTime":"1600","EndTime":"1700","Venue":"COM1-B111"},{"ClassNo":"9","LessonType":"Laboratory","WeekText":"Every Week","DayText":"Thursday","StartTime":"1000","EndTime":"1100","Venue":"COM1-0113"},{"ClassNo":"1","LessonType":"Lecture","WeekText":"Every Week","DayText":"Wednesday","StartTime":"1000","EndTime":"1200","Venue":"LT19"},{"ClassNo":"1","LessonType":"Tutorial","WeekText":"Every Week","DayText":"Tuesday","StartTime":"0900","EndTime":"1000","Venue":"COM1-0201"},{"ClassNo":"10","LessonType":"Tutorial","WeekText":"Every Week","DayText":"Tuesday","StartTime":"1000","EndTime":"1100","Venue":"COM1-0209"},{"ClassNo":"11","LessonType":"Tutorial","WeekText":"Every Week","DayText":"Tuesday","StartTime":"1700","EndTime":"1800","Venue":"COM1-0201"},{"ClassNo":"2","LessonType":"Tutorial","WeekText":"Every Week","DayText":"Tuesday","StartTime":"1200","EndTime":"1300","Venue":"COM1-0201"},{"ClassNo":"3","LessonType":"Tutorial","WeekText":"Every Week","DayText":"Tuesday","StartTime":"1600","EndTime":"1700","Venue":"COM1-0201"},{"ClassNo":"4","LessonType":"Tutorial","WeekText":"Every Week","DayText":"Wednesday","StartTime":"1300","EndTime":"1400","Venue":"COM1-0201"},{"ClassNo":"5","LessonType":"Tutorial","WeekText":"Every Week","DayText":"Wednesday","StartTime":"1400","EndTime":"1500","Venue":"COM1-0201"},{"ClassNo":"6","LessonType":"Tutorial","WeekText":"Every Week","DayText":"Wednesday","StartTime":"1500","EndTime":"1600","Venue":"COM1-0201"},{"ClassNo":"7","LessonType":"Tutorial","WeekText":"Every Week","DayText":"Tuesday","StartTime":"1300","EndTime":"1400","Venue":"COM1-0201"},{"ClassNo":"8","LessonType":"Tutorial","WeekText":"Every Week","DayText":"Tuesday","StartTime":"1400","EndTime":"1500","Venue":"COM1-0201"},{"ClassNo":"9","LessonType":"Tutorial","WeekText":"Every Week","DayText":"Tuesday","StartTime":"1500","EndTime":"1600","Venue":"COM1-0201"}],"IVLE":[{"Announcements":null,"Forums":[],"Workbins":[],"Webcasts":[],"Gradebooks":[],"Polls":[],"Multimedia":[],"LessonPlan":[],"ID":"1567511c-2a72-4caa-9494-32e5e4464ca5","CourseLevel":"1","CourseCode":"CS2010","CourseName":"DATA STRUCTURES AND ALGORITHMS II","CourseDepartment":"","CourseSemester":"Semester 1","CourseAcadYear":"2014/2015","CourseOpenDate":"/Date(1401638400000+0800)/","CourseOpenDate_js":"2014-06-02T00:00:00","CourseCloseDate":"/Date(1417881540000+0800)/","CourseCloseDate_js":"2014-12-06T23:59:00","CourseMC":"0","isActive":"N","Permission":"S","Creator":{"UserID":null,"Name":"Steven Halim","Email":null,"Title":null,"UserGuid":"18a81690-4c97-4248-adc4-99b5278fa616","AccountType":null},"hasGradebookItems":true,"hasTimetableItems":true,"hasGroupsItems":false,"hasClassGroupsForSignUp":false,"hasGuestRosterItems":true,"hasClassRosterItems":false,"hasWeblinkItems":true,"hasLecturerItems":true,"hasDescriptionItems":true,"hasReadingItems":true,"hasAnnouncementItems":false,"hasProjectGroupItems":false,"hasProjectGroupsForSignUp":false,"hasConsultationItems":false,"hasConsultationSlotsForSignUp":false,"hasLessonPlanItems":false,"Badge":0,"BadgeAnnouncement":0,"WebLinks":[{"ID":"42e4ff24-e5aa-499f-990d-01879c14ffd0","URL":"http://coursemology.com/courses/96","Description":"Our problem sets, PS scores (judged with other online judge system, but will be verified manually by your Lab TA), achievement scores, and leader board are posted here.","Order":1,"Rating":4,"SiteType":"Educational"},{"ID":"368b672e-73fe-4ece-8c97-00cd3d1f4de4","URL":"http://uhunt.felix-halim.net/id/32900","Description":"The best (but certainly not the easiest) way to excel in this module is to study programming problems that the lecturer (Steven) has solved in the past. The \"major problem\" is perhaps that Steven has solved more than 1868 of such problems...","Order":2,"Rating":3,"SiteType":"Reference"},{"ID":"275e4e82-73b5-43b5-be31-b537fde9ca8c","URL":"https://sites.google.com/site/stevenhalim","Description":"If you decide to buy a copy of Steven's Competitive Programming book, this is the companion website.","Order":3,"Rating":2,"SiteType":"Reference"},{"ID":"125cb886-9c58-499d-9ada-466b52460647","URL":"http://www.comp.nus.edu.sg/~stevenha/visualization","Description":"VisuAlgo: Data Structures and Algorithms visualization/animation tool that also includes the online quiz component (training + test).","Order":4,"Rating":4,"SiteType":"Educational"},{"ID":"a8ac215d-38fa-45f9-b170-a48d2945ba7b","URL":"http://ivle.nus.edu.sg/media/webcastlecture.aspx?ID=22adcec0-b0d2-4ee1-a102-9611a4d61c45","Description":"CS2010 webcasts from S1 AY2011/12 :). If you have time during week -1 & week 0, you may want to study ahead...","Order":5,"Rating":3,"SiteType":"Educational"},{"ID":"e935fb76-0942-4692-b3e1-4eb2406f7df9","URL":"https://www.facebook.com/groups/241724769269875/","Description":"Facebook group for discussing CS2010 and other relevant stuffs in informal manner (I take a risk of dropping the IVLE discussion forum starting this semester for administrative reason).","Order":6,"Rating":1,"SiteType":"Informational"},{"ID":"8ac6ec2b-3eb7-411f-8424-957e779840c4","URL":"http://algorithmics.comp.nus.edu.sg/~mooshak","Description":"We use standardized online judging system for lab grading. This system is harsh and will frustrate some students. However, Lab TAs will still look at your code after deadline to reward partial marks if your code does not pass the strict settings in this online judge.","Order":7,"Rating":4,"SiteType":""}],"Lecturers":[{"ID":"37b72cd9-ca1e-497b-a729-1feb826fec75","User":{"UserID":null,"Name":"Steven Halim","Email":null,"Title":null,"UserGuid":"18a81690-4c97-4248-adc4-99b5278fa616","AccountType":null},"Role":"Lecturer ","Order":1,"ConsultHrs":null},{"ID":"c54cdb7d-befb-4574-9a32-a99e68f14b0c","User":{"UserID":null,"Name":"Chong Ket Fah","Email":null,"Title":null,"UserGuid":"1bba4663-baa1-4811-ab3a-b1ef9ad5895e","AccountType":null},"Role":"Teaching Assistant ","Order":2,"ConsultHrs":null},{"ID":"674ca7fe-a878-4cec-b920-3c97d7869473","User":{"UserID":null,"Name":"HUANG DA","Email":null,"Title":null,"UserGuid":"780a7fa2-ebc1-40f1-b141-3e8f62d7be27","AccountType":null},"Role":"Teaching Assistant ","Order":3,"ConsultHrs":null},{"ID":"f62d0be2-a8f3-4d71-8d6c-d06d35edd73c","User":{"UserID":null,"Name":"PANG YAN HAN","Email":null,"Title":null,"UserGuid":"b8e05176-0a23-49d4-8e35-2b532f6ebcd0","AccountType":null},"Role":"Teaching Assistant ","Order":4,"ConsultHrs":null},{"ID":"2ae051c8-2bc8-418a-8d8f-826fa0ac9243","User":{"UserID":null,"Name":"ERIN TEO YI LING","Email":null,"Title":null,"UserGuid":"3855c422-a38c-4490-a39a-918c73d27e4e","AccountType":null},"Role":"Teaching Assistant ","Order":5,"ConsultHrs":null},{"ID":"e3e3ccbd-b2af-482c-a3ce-5a4a5c3d852a","User":{"UserID":null,"Name":"NATHAN AZARIA","Email":null,"Title":null,"UserGuid":"3acbdfe4-bb9d-4694-ad97-bc86957150eb","AccountType":null},"Role":"Teaching Assistant ","Order":6,"ConsultHrs":null},{"ID":"a018480e-21e7-4d02-b51e-e9831b2c0121","User":{"UserID":null,"Name":"CHIONG YAO SHENG EUGENE","Email":null,"Title":null,"UserGuid":"22b57b3b-ce31-4756-b911-97fd3d1fb86d","AccountType":null},"Role":"Teaching Assistant ","Order":7,"ConsultHrs":null},{"ID":"ced072a8-edb8-4807-acf9-9a148115219c","User":{"UserID":null,"Name":"BHARATH PARAMESWARAN","Email":null,"Title":null,"UserGuid":"9aa1736b-56c1-482a-8a47-098b1b8c6519","AccountType":null},"Role":"Teaching Assistant ","Order":8,"ConsultHrs":null},{"ID":"d0d12d45-d7a9-4b2d-8f68-7875710f37ab","User":{"UserID":null,"Name":"LE BEIER","Email":null,"Title":null,"UserGuid":"2179eff1-78df-4245-9211-984b47283ff4","AccountType":null},"Role":"Teaching Assistant ","Order":9,"ConsultHrs":null},{"ID":"0ec1bc4e-724d-4746-ae65-4458408854bf","User":{"UserID":null,"Name":"BRIAN AGUS WINATA","Email":null,"Title":null,"UserGuid":"e24885a1-dc70-4cad-b226-9b32e341b00b","AccountType":null},"Role":"Teaching Assistant ","Order":10,"ConsultHrs":null},{"ID":"654b909d-b915-45f0-bfde-f3415a4b734d","User":{"UserID":null,"Name":"STACEY GEOFFREY TAY JUN WEI","Email":null,"Title":null,"UserGuid":"7e8770ea-3d9b-43a2-93e5-c8636b4dd28c","AccountType":null},"Role":"Teaching Assistant ","Order":11,"ConsultHrs":null},{"ID":"efc5f069-1306-4207-91ec-dd79ef78608b","User":{"UserID":null,"Name":"RAMON BESPINYOWONG","Email":null,"Title":null,"UserGuid":"f4b8edf4-28c5-46a8-965b-d7d5531f2a7e","AccountType":null},"Role":"Teaching Assistant ","Order":12,"ConsultHrs":null},{"ID":"5fd03b16-fdff-49e4-8b04-91f870c72cdc","User":{"UserID":null,"Name":"IAN LEOW TZE WEI","Email":null,"Title":null,"UserGuid":"fa28cacf-1282-4bf0-9f56-7e1113dfa895","AccountType":null},"Role":"Teaching Assistant ","Order":13,"ConsultHrs":null}],"Descriptions":[{"ID":"1e5f053b-8835-4692-be49-41f07234cfff","Title":"Learning Outcomes","Description":"Overview: CS2010 is the third part of a three-part series on introductory programming and problem solving with computing (the CS1010 - CS1020 - CS2010 series).
\n
\nFocus: The module will focus on the basic data structures and algorithms that lie at the core of computer science, and how they can be used to improve performance in real-world problems. Throughout the module, we will discuss how to model problems in different ways, and how differing strategies can yield very different performance characteristics. We will both analyze algorithms to better understand their asymptotic performance, and implement them in Java to understand the issues that arise in practice. The goal of this module is both to help you learn how to how to choose and use better data structures and algorithms.","Order":1},{"ID":"6e5f053b-8835-4692-be49-41f07234cfff","Title":"Syllabus","Description":"CS2010:
\n
\n\t\t\t\tWeek | \n\t\t\t\n\t\t\t\tWed Lecture (2 hrs/wk) + Self-Study/Review (3 hrs/wk) | \n\t\t\t\n\t\t\t\tTue/Wed Tutorial (1 hr/wk) | \n\t\t\t\n\t\t\t\tThu Demo Lab (1 hr/wk) | \n\t\t\t\n\t\t\t\tProblem Set (3 hrs/wk) | \n\t\t
\n\t\t\t\t-02/-01/00 | \n\t\t\t\n\t\t\t\tFor those who want to do head start in preparing CS2010 before it actually starts: \n\t\t\t\t \n\t\t\t\t1. Revise your CS1020 & CS1231 (especially graphs, trees, proofs, see Workbin) \n\t\t\t\tIf you have not take CS1231 (which is not the compulsory pre-req of this module), \n\t\t\t\tit may be good to casually review some CS1231 material in Workbin \n\t\t\t\t \n\t\t\t\t2. Solve the following problems (CS1020 level): \n\t\t\t\ta. UVa 579 (Use this to revise your Java skill) \n\t\t\t\tb. UVa 10855 (Use this to revise your knowledge about Array) \n\t\t\t\tc. UVa 11988 (Use this to revise your knowledge about Linked List) \n\t\t\t\td. UVa 11111 (Use this to revise your knowledge about Stack) \n\t\t\t\te. UVa 10901 (Use this to revise your knowledge about Queue) \n\t\t\t\tf. UVa 10258 (Use this to revise your knowledge about Sorting) \n\t\t\t\tg. UVa 11340 (Use this to revise your knowledge about Hashing) \n\t\t\t\t | \n\t\t\t\n\t\t\t\tLegends: \n\t\t\t\t \n\t\t\t\tR-Review Questions \n\t\t\t\t(for self-check only) \n\t\t\t\t \n\t\t\t\tD-Discussion Questions \n\t\t\t\t(will be discussed \n\t\t\t\tduring tutorial sessions) \n\t\t\t\t \n\t\t\t\tA-Advanced Questions \n\t\t\t\t(will not be discussed \n\t\t\t\tduring tutorial but eager \n\t\t\t\tstudents are free to \n\t\t\t\tcross check their answers \n\t\t\t\twith TA/lecturers) | \n\t\t\t\n\t\t\t\t- | \n\t\t\t\n\t\t\t\tPS0: Testing Mooshak \n\t\t\t\tOnline Judge | \n\t\t
\n\t\t\t\t01 | \n\t\t\t\n\t\t\t\tWed, 13 Aug, L1: Introduction \n\t\t\t\ta. Quick course admins \n\t\t\t\tb. Overview of various technologies used in CS2010 class this semester \n\t\t\t\t(VisuAlgo, Training Mode, Coursemology, Mooshak) \n\t\t\t\tc. CS1020 quick review: OO, Big O notation, Linear DS, Sorting, Recursion, Hashing, etc \n\t\t\t\td. Overview of problem solving paradigms used in CS2010 | \n\t\t\t\n\t\t\t\tNot Started \n\t\t\t\tPlease bid your best tutorial group | \n\t\t\t\n\t\t\t\tNot Started \n\t\t\t\tPlease bid your best lab group | \n\t\t\t\n\t\t\t\tNot Started \n\t\t\t\tContinue trying PS0, if you want | \n\t\t
\n\t\t\t\t02 | \n\t\t\t\n\t\t\t\tWed, 20 Aug, L2: Census Problem \n\t\t\t\ta. ADT Table, comparison with CS1020 Linear DS \n\t\t\t\tb. Revisit (or introduce for some of you) CS1231 material (tree) \n\t\t\t\tc. The basic operations of Binary Search Tree (BST) - Web-based lecture! \n\t\t\t\td. Analysis of BST operations (the unbalanced version) \n\t\t\t\te. Preview of VisuAlgo Test Mode | \n\t\t\t\n\t\t\t\tNot Started \n\t\t\t\tEnsure you get a good tutorial group | \n\t\t\t\n\t\t\t\tNot Started \n\t\t\t\tEnsure you get a good lab group | \n\t\t\t\n\t\t\t\tPS1: Baby Names v4 \n\t\t\t\tReleased: Fri, 22 Aug, 8am \n\t\t\t\t(for R students to decide if \n\t\t\t\tthey can handle CS2010R) | \n\t\t
\n\t\t\t\t03 | \n\t\t\t\n\t\t\t\tWed, 27 Aug, L3: Keeping Everything in Balance \n\t\t\t\ta. Quick revision of BST concepts from Week 02 - using VisuAlgo test mode \n\t\t\t\tb. The importance of a balanced BST \n\t\t\t\tc. Introducing Adelson-Velskii Landis (AVL) Tree - PPT then Web-based demo \n\t\t\t\td. Overview implementation of AVL Tree, Java Inheritance (code NOT given due to PS1) \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tT01, Tue/Wed, 26-27 Aug \n\t\t\t\t \n\t\t\t\tD-TA Introduction \n\t\t\t\tR-Linear DS Review (Use VisuAlgo) \n\t\t\t\tR-Big O Review \n\t\t\t\tD-Discussion of various \n\t\t\t\tproblem solving techniques \n\t\t\t\tA-Expected O(n) Selection \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tL01, Thu, 28 Aug \n\t\t\t\t \n\t\t\t\tD-Lab TA Intro & Expectations \n\t\t\t\tD-Game system/Coursemology \n\t\t\t\tD-Online Judge/Mooshak \n\t\t\t\tD-VisuAlgo Training Mode \n\t\t\t\tR-PS1 overview \n\t\t\t\tR-Review of CS1020 material \n\t\t\t\tD-Discussion of one solution \n\t\t\t\tfor Week 00 UVa problems (see above) | \n\t\t\t\n\t\t\t\tNo new PS \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t | \n\t\t
\n\t\t\t\t04 | \n\t\t\t\n\t\t\t\tWed, 03 Sep, L4: Heaps of Fun \n\t\t\t\ta. Priority Queue ADT \n\t\t\t\tb. Binary Max Heap DS - another Web-based lecture! \n\t\t\t\tc. Building a Binary Max Heap from a set of numbers in O(n) \n\t\t\t\td. In-place sorting: Heapsort \n\t\t\t\t \n\t\t\t\tSat, 06 Sep, Time: 1.30-5pm, Venue: outside PL6 (during NUS ICPC NTSC1), \n\t\t\t\tif there are many people, we will use COM1-114 (Embedded Systems Teaching Lab 1) \n\t\t\t\tOptional help session to those who struggle with CS1010 and CS1020 \n\t\t\t\tWill be very boring for those who passed these two modules with ease | \n\t\t\t\n\t\t\t\tT02, Tue/Wed, 02-03 Sep \n\t\t\t\t \n\t\t\t\tR-Tree/BST DS \n\t\t\t\tR-Balanced BST \n\t\t\t\tD-bBST variants and \n\t\t\t\tapplications \n\t\t\t\tA-AVL Tree Deletion \n\t\t\t\tD-PS1 Subtask A+B \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tL02, Thu, 04 Sep \n\t\t\t\t \n\t\t\t\tD-Java TreeMap/TreeSet Demo \n\t\t\t\t(underlying DS: Balanced BST) \n\t\t\t\tD-Discuss some features and \n\t\t\t\tinteresting usage :). \n\t\t\t\te.g. Indexing city names \n\t\t\t\tD-PS1 Subtask A+B (implementation) \n\t\t\t\tR-PS2 overview \n\t\t\t\t | \n\t\t\t\n\t\t\t\tPS2: Scheduling Deliveries v4 \n\t\t\t\tReleased: Sun, 31 Aug, 8pm \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tPS1 due: Sat, 06 Sep, 8am | \n\t\t
\n\t\t\t\t05 | \n\t\t\t\n\t\t\t\tWed, 10 Sep, L5: Laying the Foundations \n\t\t\t\ta. Introduction of Union-Find Data Structure (useful for Kruskal's algorithm in Week 07) \n\t\t\t\tb. Introduction of Bitmask Data Structure (useful for TSP implementation in Week 11) \n\t\t\t\tc. Motivation for learning Graph (quick presentation) \n\t\t\t\td. Implementation of Graph DS: Adjacency Matrix and List (useful for Week 06-13) \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tSat, 13 Sep, Time: 1.30-5pm, Venue: outside PL6 (during NUS ICPC NTSC2) \n\t\t\t\tif there are many people, we will use COM1-114 (Embedded Systems Teaching Lab 1) \n\t\t\t\tOptional help session to prepare Quiz 1: Basics+BST+bBST+Heap \n\t\t\t\tAnd also to review UFDS+Bitmask+Graph DS | \n\t\t\t\n\t\t\t\tT03, Tue/Wed, 09-10 Sep \n\t\t\t\t \n\t\t\t\tR-Heap DS \n\t\t\t\tD-Applications \n\t\t\t\tD-PS2 Subtask A \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tL03, Thu, 11 Sep \n\t\t\t\t \n\t\t\t\tD-PS1 debrief \n\t\t\t\tD-Java PriorityQueue Demo \n\t\t\t\t(underlying DS: Heap) \n\t\t\t\tD-Discuss some features \n\t\t\t\tand interesting usage :) \n\t\t\t\te.g. Queueing "objects", -ve \n\t\t\t\tD-PS2 Subtask B \n\t\t\t\tR-PS3 overview \n\t\t\t\tR-VisuAlgo Mock Online Quiz | \n\t\t\t\n\t\t\t\tPS3: Hospital Tour v4 \n\t\t\t\tReleased: Sun, 07 Sep, 8pm \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tPS2 due: Sat, 13 Sep, 8am | \n\t\t
\n\t\t\t\t06 | \n\t\t\t\n\t\t\t\tWed, 17 Sep, L6: Maze Exploration \n\t\t\t\ta. Graph data structure applications: Enumerate neighbors, edge existence check \n\t\t\t\tb. Implementation of Graph Traversal algorithms - Web-based lecture: \n\t\t\t\tBreadth-First Search (BFS), Depth First Search (DFS) \n\t\t\t\tc. Graph traversal applications: \n\t\t\t\treachability test, finding connected components, topological sorting \n\t\t\t\t \n\t\t\t\tSat, 20 Sep, 10.00am-11.17am, Quiz 1-Written (10%): \n\t\t\t\tVenue: COM1-02-206 (Seminar Room 1) \n\t\t\t\tup to Heap DS (Week04), open book, all essays, you can answer in pseudo code \n\t\t\t\tMinor edit: Written Quiz 1 will include small section on UFDS and/or bitmask | \n\t\t\t\n\t\t\t\tT04, Tue/Wed, 16-17 Sep \n\t\t\t\t \n\t\t\t\tR-UFDS \n\t\t\t\tR-Bitmask \n\t\t\t\tR-Graph DS \n\t\t\t\tD-PS3 Subtask A \n\t\t\t\tD-DFS/BFS Traversal (for PS3) \n\t\t\t\tD-Bipartite Check \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tL04, Thu, 18 Sep \n\t\t\t\t \n\t\t\t\tD-PS2 quick debrief \n\t\t\t\tD-PS3 Subtask B+C \n\t\t\t\t(max 5 minutes) \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tOnline Quiz 1 (5%) \n\t\t\t\tabout 40 mins per session \n\t\t\t\tUsing VisuAlgo Test Mode | \n\t\t\t\n\t\t\t\tNo new PS before Quiz 1 \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tNo PS deadline (Quiz 1) | \n\t\t
\n\t\t\t\tRecess | \n\t\t\t\n\t\t\t\tNo Lecture \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t\t(breathing space for CS2010 students to handle midterm tests \n\t\t\t\n\t\t\t\t\tof your other modules if you choose to skip the optional PS bonus) | \n\t\t\t\n\t\t\t\tNo session | \n\t\t\t\n\t\t\t\tNo session | \n\t\t\t\n\t\t\t\tPS3 due: Mon, 22 Sep, 8am \n\t\t\t\t(extension due to Quiz 1) \n\t\t\t\t \n\t\t\t\tPS bonus: About Jane+Joshua \n\t\t\t\t(very hard, not compulsory) \n\t\t\t\tReleased: Wed, 24 Sep 00.00 \n\t\t\t\tPS bonus due: Same day, 23.59 | \n\t\t
\n\t\t\t\t07 | \n\t\t\t\n\t\t\t\tWed, 01 Oct, Mid-semester review (fifteen minutes) \n\t\t\t\tL7: Connecting People (one+ hour) \n\t\t\t\ta. Revisit CS1231 graphs (esp trees) matrial \n\t\t\t\tb. One application of MST problem \n\t\t\t\tc. Implementation of Minimum Spanning Tree (MST) algorithms - Web-based lecture \n\t\t\t\ti. Implementation of Prim's with Priority Queue/Heap DS discussed in Lecture 02-03-04 \n\t\t\t\tii. Implementation of Kruskal's with Sorting + Union-Find DS discussed in Lecture 05 \n\t\t\t\t | \n\t\t\t\n\t\t\t\tT05, Tue/Wed, 30 Sep-01 Oct \n\t\t\t\t \n\t\t\t\tR-Topological Sort with DFS \n\t\t\t\tD-PS4 Subtask A \n\t\t\t\tA-Discussion of Quiz 1 \n\t\t\t\tsolutions \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tL05, Thu, 02 Oct \n\t\t\t\t \n\t\t\t\tD-PS3 debrief \n\t\t\t\tA-PS bonus discussion \n\t\t\t\tD-Graph DS manipulation \n\t\t\t\tR-PS4 overview \n\t\t\t\tD-PS4 Subtask A+B+C \n\t\t\t\tR-Prim/Kruskal Demo+Improvement | \n\t\t\t\n\t\t\t\tPS4: Out For a Walk v4 \n\t\t\t\tReleased: Sun, 28 Sep, 8pm \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tNo PS deadline (easy week) | \n\t\t
\n\t\t\t\t08 | \n\t\t\t\n\t\t\t\tWed, 08 Oct, L8: Finding Shortest Way from Here to There 1 \n\t\t\t\ta. Single-Source Shortest Paths (SSSP) introduction \n\t\t\t\tb. BFS algorithm fails on general case of SSSP problem - Web-based lecture \n\t\t\t\tc. Bellman-Ford's algorithm - Web-based lecture + analysis \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tNote: Mon, 06 Oct, is Public Holiday (Hari Raya Haji) | \n\t\t\t\n\t\t\t\tT06, Tue/Wed, 08-09 Oct \n\t\t\t\t \n\t\t\t\tR-MST, general ideas \n\t\t\t\tD-Prim's/Kruskal's \n\t\t\t\tA-MST applications \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tL06, Thu, 09 Oct \n\t\t\t\t \n\t\t\t\tD-PS4 Subtask D (general ideas) \n\t\t\t\tA-Graph modeling exercise: \n\t\t\t\tUnlock the Lock and \n\t\t\t\tNumber Maze \n\t\t\t\t | \n\t\t\t\n\t\t\t\tNo new PS \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tPS4 due: Sat, 11 Oct, 8am | \n\t\t
\n\t\t\t\t09 | \n\t\t\t\n\t\t\t\tWed, 16 Oct, L9: Finding Shortest Way from Here to There 2 \n\t\t\t\ta. Special Case 1: SSSP on tree (quick review of DFS/BFS) \n\t\t\t\tb. Special Case 2: SSSP on unweighted graph (quick review of BFS) \n\t\t\t\tc. Special Case 3: SSSP on DAG (quick review of DFS/topological sort) \n\t\t\t\td. Special Case 4: SSSP on weighted graph without negative-weight/cycle (focus of today) \n\t\t\t\ti. Dijkstra's algorithm, two versions - Web-based lecture \n\t\t\t\tii. Implementation of both Dijkstra's algorithm variants \n\t\t\t\tiii. Analysis on the performance of both Dijkstra's algorithm variants \n\t\t\t\t \n\t\t\t\tSat, 18 Oct, 10.00am-12.00pm, Venue: Seminar Room @ LT19 \n\t\t\t\tOptional help session to prepare Quiz 2: Mostly on Week05-09 material | \n\t\t\t\n\t\t\t\tT07, Tue/Wed, 15-16 Oct \n\t\t\t\t \n\t\t\t\tR-SSSP, general ideas \n\t\t\t\tR-Bellman Ford's \n\t\t\t\tA-Graph Modeling exercises using \n\t\t\t\tCS2010 past Quiz 2 problems \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tL07, Thu, 16 Oct \n\t\t\t\t \n\t\t\t\tD-PS4 debrief \n\t\t\t\tR-PS5 overview \n\t\t\t\tR-PS5 Subtask A+B+C+D \n\t\t\t\tA-Cool things about SSSP algorithms \n\t\t\t\t(from APIO2013, TASKSAUTHOR) \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tPS5: The Onset of Labor v4 \n\t\t\t\tReleased: Sun, 12 Oct, 8pm \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tPS5 due: Sat, 18 Oct, 8am | \n\t\t
\n\t\t\t\t10 | \n\t\t\t\n\t\t\t\tWed, 22 Oct, No lecture, Public holiday (Deepavali) \n\t\t\t\t \n\t\t\t\tSat, 25 Oct, 10.00am-11.17am, Quiz 2-Written (15%): \n\t\t\t\tVenue: COM1-02-206 (Seminar Room 1) \n\t\t\t\tup to SSSP (Week09), open book, all essays, you can answer in pseudo code, \n\t\t\t\tno more "basic questions" \n\t\t\t\t \n\t\t\t\tPS: up to SSSP means it MAY cover Quiz 1 stuffs. \n\t\t\t\t \n\t\t\t\tNOTE: CG3002 students will be walking blindfolded (some project evaluation) around SR1 \n\t\t\t\tCS2010 students, please use COM1-02-SR3 for your preparation time before Written Quiz 2, \n\t\t\t\tthat is, do NOT sit around the SR1 lobby area... | \n\t\t\t\n\t\t\t\tT08, Tue, 21 Oct \n\t\t\t\tNo Wed, 22 Oct class \n\t\t\t\t \n\t\t\t\tR-Dijkstra's \n\t\t\t\tA-Graph modeling, again \n\t\t\t\t(very important skill) \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tL08, Thu, 23 Oct \n\t\t\t\t \n\t\t\t\tD-PS5 quick debrief \n\t\t\t\t(max 5 minutes) \n\t\t\t\tOnline Quiz 2 (5%) \n\t\t\t\tabout 40 mins per session \n\t\t\t\tUsing VisuAlgo Test Mode \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tNo new PS \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tNo PS deadline (Quiz 2) | \n\t\t
\n\t\t\t\t11 | \n\t\t\t\n\t\t\t\tWed, 29 Oct, L10: Algorithms on DAG \n\t\t\t\ta. SSSP on DAG revisited \n\t\t\t\tb. Longest Paths on DAG, link to Longest Increasing Subsequence (LIS) \n\t\t\t\tc. Introduction to Dynamic Programming (DP) \n\t\t\t\td. Counting Paths in DAG \n\t\t\t\t \n\t\t\t\tSteven will travel to Kuala Lumpur for ACM ICPC Regional Contest \n\t\t\t\tfrom Friday 31 Oct - Sunday 02 Nov | \n\t\t\t\n\t\t\t\tT09, Tue/Wed, 28-29 Oct \n\t\t\t\t \n\t\t\t\tR-Topological Sort of a DAG \n\t\t\t\tR-Basic DAG Properties \n\t\t\t\tD-PS6 Subtask A+B \n\t\t\t\tR-Written Quiz 2 review \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tL09, Thu, 30 Oct \n\t\t\t\t \n\t\t\t\tD-PS6 Subtask A+B+C \n\t\t\t\tA-Demo on Solving UVa 926 \n\t\t\t\t(Walking Around Wisely) \n\t\t\t\twhich can be modeled as a DAG \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tPS6: Caesarean Section v4 \n\t\t\t\tReleased: Sun, 26 Oct, 8pm \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tPS6 due: Sat, 01 Nov, 8am | \n\t\t
\n\t\t\t\t12 | \n\t\t\t\n\t\t\t\tWed, 05 Nov, L11: Traveling Salesman \n\t\t\t\ta. The Traveling Salesman Problem (TSP): 2 versions, with visualgo Web-based lecture \n\t\t\t\tb. Conversion to DAG: the backtracking routine \n\t\t\t\tc. Outline implementation using Bitmask (details in PS7) \n\t\t\t\td. Limitation of the Superpower (a bit of PS7R overview) \n\t\t\t\t | \n\t\t\t\n\t\t\t\tT10, Tue/Wed, 04-05 Nov \n\t\t\t\t \n\t\t\t\tR-DP basics (Fibonacci, CC, IS) \n\t\t\t\tD-TSP/PS7 Subtask A discussion \n\t\t\t\t \n\t\t\t\t | \n\t\t\t\n\t\t\t\tL10, Thu, 06 Nov \n\t\t\t\t \n\t\t\t\tD-PS6 debrief \n\t\t\t\tD-PS7 Subtask B implementation \n\t\t\t\tD-PS7 Subtask D ideas \n\t\t\t\t(which can solve Subtask C too) | \n\t\t\t\n\t\t\t\tPS7: A Trip to Supermarket v4 \n\t\t\t\tReleased: Sun, 02 Nov, 8pm \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tNo PS deadline | \n\t\t
\n\t\t\t\t13 | \n\t\t\t\n\t\t\t\tWed, 12 Nov, L12: Four Lines Wonder + Summary \n\t\t\t\ta. Short Motivation of the All-Pairs Shortest Paths Problem \n\t\t\t\tb. The basic of Floyd Warshall's algorithm \n\t\t\t\t(only the four lines implementation, derivation omitted and won't be asked in final exam) \n\t\t\t\tc. Cool variants of Floyd Warhsall's \n\t\t\t\td. Summary and closing any loose ends... \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tSteven will travel to Bangkok for ACM ICPC Regional Contest \n\t\t\t\tfrom Thursday 13 Nov - Sunday 16 Nov | \n\t\t\t\n\t\t\t\tT11, Tue/Wed, 11-12 Nov \n\t\t\t\t \n\t\t\t\tA-k-Reliable Shortest Path (APSP) \n\t\t\t\tD-DP vs Graph Problem? \n\t\t\t\tD-Semester Review \n\t\t\t\t(up to your Tutorial TA) \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tTake class photo! | \n\t\t\t\n\t\t\t\tL11, Thu, 13 Nov \n\t\t\t\t \n\t\t\t\tD-PS7 debrief \n\t\t\t\tA-Demo on Solving UVa 907 \n\t\t\t\t(Winterim Backpacking Trip) \n\t\t\t\tD-Semester Review \n\t\t\t\t(up to your Lab TA) \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tTake class photo! | \n\t\t\t\n\t\t\t\t \n\t\t\t\t\tPS7 due: Thu, 13 Nov, 8.59am \n\t\t\t\t\n\t\t\t\t\t(that is, just before \n\t\t\t\t\tthe first lab group of \n\t\t\t\t\tthis last week of CS2010/R) \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t | \n\t\t
\n\t\t\t\tStudy Week \n\t\t\t\tand Exam | \n\t\t\t\n\t\t\t\tWed, 19 Nov, 3.30pm-5.30pm (just before 5th STePs at 6-10pm), Venue: COM1-1-PL6 \n\t\t\t\tOptional help session to prepare Final Exam: You can ask me anything about past papers, \n\t\t\t\tCS2010 material, or about life in general... \n\t\t\t\t \n\t\t\t\tCollection of 3 last questions of past FEs have been set up at Mooshak, enjoy :) \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\t \n\t\t\t\tFinal Exam time/venue: Mon, 24 Nov, Evening, Venue: COM1-2-SR1 and SR2 \n\t\t\t\tEverything, open book, all essays, you can answer in pseudo code | \n\t\t\t\n\t\t\t\t | \n\t\t\t\n\t\t\t\t | \n\t\t\t\n\t\t\t\tOptional Problem Set \n\t\t\t\t \n\t\t\t\tA list of relevant UVa problems \n\t\t\t\tinvolving graphs that may appear \n\t\t\t\tin final exam but obviously I don't \n\t\t\t\tset any of these in this sem's \n\t\t\t\tfinal exam: UVa 11953, \n\t\t\t\tUVa 11060, UVa 11747, \n\t\t\t\tUVa 10369, UVa 314, \n\t\t\t\tUVa 11367, UVa 1056, \n\t\t\t\tUVa 11957, UVa 10913 | \n\t\t
\n\t\t\t\tTime | \n\t\t\t\n\t\t\t\tTue, TA | \n\t\t\t\n\t\t\t\tVenue | \n\t\t\t\n\t\t\t\tWed, TA | \n\t\t\t\n\t\t\t\tVenue | \n\t\t
\n\t\t\t\t09-10am | \n\t\t\t\n\t\t\t\tT1, Steven (15 students, FULL) | \n\t\t\t\n\t\t\t\tCOM1-0201 | \n\t\t\t\n\t\t\t\t- | \n\t\t\t\n\t\t\t\t- | \n\t\t
\n\t\t\t\t10-11am | \n\t\t\t\n\t\t\t\tT10, Ket Fah (15 students, FULL) | \n\t\t\t\n\t\t\t\tCOM1-0209 | \n\t\t\t\n\t\t\t\tOur lecture slot | \n\t\t\t\n\t\t\t\t- | \n\t\t
\n\t\t\t\t11am-12pm | \n\t\t\t\n\t\t\t\t- | \n\t\t\t\n\t\t\t\t- | \n\t\t\t\n\t\t\t\tOur lecture slot | \n\t\t\t\n\t\t\t\t- | \n\t\t
\n\t\t\t\t12-1pm | \n\t\t\t\n\t\t\t\tT2, Ket Fah (13 students) | \n\t\t\t\n\t\t\t\tCOM1-0201 | \n\t\t\t\n\t\t\t\t- | \n\t\t\t\n\t\t\t\t- | \n\t\t
\n\t\t\t\t1-2pm | \n\t\t\t\n\t\t\t\tT7, Ket Fah (16 students, VERY FULL) | \n\t\t\t\n\t\t\t\tCOM1-0201 | \n\t\t\t\n\t\t\t\tT4, Ket Fah (17 students, VERY FULL) | \n\t\t\t\n\t\t\t\tCOM1-0201 | \n\t\t
\n\t\t\t\t2-3pm | \n\t\t\t\n\t\t\t\tT8, Ket Fah (15 students, FULL) | \n\t\t\t\n\t\t\t\tCOM1-0201 | \n\t\t\t\n\t\t\t\tT5, Ket Fah (16 students, VERY FULL) | \n\t\t\t\n\t\t\t\tCOM1-0201 | \n\t\t
\n\t\t\t\t3-4pm | \n\t\t\t\n\t\t\t\tT9, Ket Fah (14 students) | \n\t\t\t\n\t\t\t\tCOM1-0201 | \n\t\t\t\n\t\t\t\tT6, Ket Fah (16 students, VERY FULL) | \n\t\t\t\n\t\t\t\tCOM1-0201 | \n\t\t
\n\t\t\t\t4-5pm | \n\t\t\t\n\t\t\t\tT3, Huang Da (8 students) | \n\t\t\t\n\t\t\t\tCOM1-0201 | \n\t\t\t\n\t\t\t\t- | \n\t\t\t\n\t\t\t\t- | \n\t\t
\n\t\t\t\t5-6pm | \n\t\t\t\n\t\t\t\tT11, Huang Da (9 students) | \n\t\t\t\n\t\t\t\tCOM1-0201 | \n\t\t\t\n\t\t\t\t- | \n\t\t\t\n\t\t\t\t- | \n\t\t
\n\t\t\t\tTime | \n\t\t\t\n\t\t\t\tThu, Lab TA | \n\t\t\t\n\t\t\t\tVenue | \n\t\t
\n\t\t\t\t9-10am | \n\t\t\t\n\t\t\t\tL1, Steven Halim (16 students, FULL) | \n\t\t\t\n\t\t\t\tCOM1-B108 | \n\t\t
\n\t\t\t\t10-11am | \n\t\t\t\n\t\t\t\tL2, Le Beier (14 students) | \n\t\t\t\n\t\t\t\tCOM1-B108 | \n\t\t
\n\t\t\t\t | \n\t\t\t\n\t\t\t\tL9, Ian Leow Tze Wei (15 students, FULL) | \n\t\t\t\n\t\t\t\tCOM1-0113 | \n\t\t
\n\t\t\t\t11am-12pm | \n\t\t\t\n\t\t\t\tL3, Stacey Geoffrey Tay Jun Wei (13 students) | \n\t\t\t\n\t\t\t\tCOM1-B108 | \n\t\t
\n\t\t\t\t | \n\t\t\t\n\t\t\t\tL10, Ramon Bespinyowong (14 students) | \n\t\t\t\n\t\t\t\tCOM1-0113 | \n\t\t
\n\t\t\t\t12-1pm | \n\t\t\t\n\t\t\t\tL4, Brian Agus Winata (13 students) | \n\t\t\t\n\t\t\t\tCOM1-B111 | \n\t\t
\n\t\t\t\t | \n\t\t\t\n\t\t\t\tL11, Ramon Bespinyowong (10 students) | \n\t\t\t\n\t\t\t\tCOM1-0113 | \n\t\t
\n\t\t\t\t1-2pm | \n\t\t\t\n\t\t\t\tL5, Bharath Parameswaran (14 students) | \n\t\t\t\n\t\t\t\tCOM1-B111 | \n\t\t
\n\t\t\t\t2-3pm | \n\t\t\t\n\t\t\t\tL6, Erin Teo Yi Ling (15 students, FULL) | \n\t\t\t\n\t\t\t\tCOM1-0114 | \n\t\t
\n\t\t\t\t3-4pm | \n\t\t\t\n\t\t\t\tL7, Chiong Yao Sheng Eugene (15 students, FULL) | \n\t\t\t\n\t\t\t\tCOM1-0114 | \n\t\t
\n\t\t\t\t4-5pm | \n\t\t\t\n\t\t\t\tL8, Nathan Azaria (15 students, FULL) | \n\t\t\t\n\t\t\t\tCOM1-B111 | \n\t\t