|
CS2303 Data Structures for Media
Course Duration: One Semester Precursors: Nil Equivalent Courses: Nil Exclusive Courses: Nil Course Intended Learning Outcomes (CILOs): No. CILOs Weighting (if applicable) 1. evaluate and choose the appropriate data structures to solve problems; 2. analyse and compare data structures; 3. customize and apply specific data structures for media needs. Teaching and learning Activities (TLAs): Teaching pattern: ILO No TLAs Hours/week CILO 1 Journal: As a learning and knowledge sharing tool, students are required to keep a journal to record learning progress and summarize personalized Q&A, in particular to accumulate experiences on this CILO. CILO 2 Project: Students are required to do two projects. The first one is a simple extension of the materials taught in class while the second one is either an implementation of some complicated data structures taught in class or a study on an advanced data structure not covered in class. Both projects require the students to do some analysis on data structures and also give the students an opportunity to demonstrate their abilities to apply knowledge learned to solve new problems. The project should be documented in a project report. CILO 3 Project: The second project will be focused on achieving this CILO, where students are encouraged to use the data structures they learned in class or by themselves to media needs, for example, games. Assessment Tasks/Activities: ILO No Type of assessment tasks/activities Weighting Remarks CILO 1 Coursework: The quality of the journal that students keep and their performance in the two quizzes through the semester will be used to evaluate this CILO. CILO 2 Coursework: The two projects both involve some analysis tasks for the students. The quality of the reports for the two projects will be used to evaluate this CILO. CILO 3 Coursework: The quality of the second project will be used to assess this CILO. Grading of Student Achievement: Keyword Syllabus: Complexities of programs: notation, average and worst case analysis, complexities of common programming constructs; Linked lists; Trees; Game trees; Abstract data types: stacks, queues, heaps, disjoint sets; Hash tables; Representation of vectors and bitmaps; Quadtrees and Octrees; Geometric structures. Related Links
Department of Computer Science |
||||||||||||||||||||||||||||||||||||||||||