• Home
  • About
  • Mobile
  • Open Content
  • Search

Module Overview


  • Description
  • Facilitators
  • Weblinks
  • Timetable
CS1102S 

DATA STRUCTURES AND ALGORITHMS
   2007/2008, Semester 2
   School of Computing (Computer Science)
Modular Credits: --
  Tags: --

Learning Outcomes

TopThis module is the second part of a two-part series on introductory programming from a functional paradigm. It emphasizes on algorithms, data structures, and software engineering. It also demonstrates programming language as an abstraction of computation by gradually revealing 'the details of computation': from a purely functional language transiting to an object-oriented paradigm of programming. Topics covered include: software engineering concepts, classic data structures (lists, stacks, queues, and their algorithmic designs), various forms of sorting methods, trees, BST, AVL tree, order property, hash tables, heap and priority queues, graphs representation and various graph-search algorithms, basic algorithmic analysis, register-machine interpreter, object-oriented language.

Prerequisites

TopPrerequisites: CS1101S  Preclusions: CS1102, CS1102C

Teaching Modes

TopLectures

Wed 1000-1200 COM1/206, first lecture: 16/1/2008
Fri 1100-1200 COM1/206

Tutorials

Each student will attend one 1-hour tutorial session per week. Details to be announced.

Labs

Each student will attend one 2-hour lab session per week. Details to be announced.

Assessment

Top

Continuous assessment: 50%
Final exam: 50%

Details see Materials Website

Consultations

TopMonday 10-12, COM1, #03-28.

Contact

  • IVLE Webmaster

Social Media

Latest Alerts

  • IVLE scheduled maintenance every Tuesday 0300 hrs - 0700 hrs

Centre for Instructional Technology

Legal  |  Acceptable Use Policy

Copyright © 2015, National University of Singapore. All rights reserved.