Introduction - CS206 CS206 Data Structures Fall 2009 YoonJoon Lee About About Lecture Lecturer Teaching Assistants ◦ ◦ ◦ ◦ YoonJoon Lee

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS206 CS206 Data Structures Fall, 2009 YoonJoon Lee About About Lecture Lecturer: Teaching Assistants: ◦ ◦ ◦ ◦ YoonJoon Lee, office(E3-1, Rm# 3409), email([email protected]), Phone(x3523) Location & Time: Web page: Kang, Woo Ram(867-2255, [email protected]) Choi, Hye-Bong (x5563, [email protected]) Koh, Chol-Woo, (x3563, [email protected]) Kim, Sang-Jae (x3563, [email protected]) E3-1, Rm#1101, Mon, Wed 12:30~14:45 Course Course Webpage How How to Enroll in Webpage Login with your KAIST portal account 2. Visit CS206 page 3. Put the enrollment key “CS206_2009F” 1. Course Course Overview Topics Topics Abstract data types (ADT) Linked data structures Recursion Basics of algorithm analysis Standard ADT: Lists, stacks, queues, maps Applications of stacks, queues, and maps Implementation of data structures using lists, trees and hash tables About About Improving your programming skills! Programming is fun! Can you recognize beautiful program code, and ugly one? and An elegant solution and a bungled one? Homeworks Homeworks and grading No No textbook But we have lecture notes and copies of the slides. Homework Programming projects (1 ~ 4 weeks/time), Homework (one week time) Homework requirement You must submit all programming projects, and must achieve 60% homework points. Grading Policy Homework (15%), Programming projects (15%), Midterm (30%), Final (30%), (30%) Fi Credit for participation (10%, OK with 4 absences, but deduct 2% an absence more than 4). ...
View Full Document

This note was uploaded on 04/20/2010 for the course CS CS206 taught by Professor Lee during the Fall '09 term at 카이스트, 한국과학기술원.

Ask a homework question - tutors are online