[CSIE 1212] Data Structure and Algorithm

This is a required course for the undergraduate students in the Department of Computer Science and Information Engineering. The course will focus on the implementation and the use of data structures and how to utilize them to solve problems.

News

  • 學期成績已經公布在CEIBA系統,有問題請在7/2以前聯絡助教。
  • 所有作業、考試成績都已公布在ceiba系統。
  • 6/19期末考,地點於R103教室,時間同原上課時段。
  • 6/12因大雨停課,改為網路直播http://justin.tv/hsinmutsai,時間同原上課時段。
  • Homework 6 problem 1 sample input is uploaded. (2012/06/03)
  • Howework 6 is updated. (2012/06/03)
  • Howework 6 is announced.
  • Howework 5 Problem 1 is updated, deadline is extended to 6/7 14pm, (Problem 2 to 4 is still 5/31 14pm).
  • Howework 5 is announced.
  • Howework 4 is announced.
  • 4/17期中考,地點於R103教室,時間同原上課時段。
  • Homework 3 is updated. (2012/03/31)
  • Homework 3 problem 1 sample input is updated. (2012/03/30)
  • Howework 3 is announced.
  • Howework 2 is updated. (2012/03/21)
  • Homework 2 problem 1 sample input is uploaded. (revised: 2012/03/15)
  • Howework 2 is announced.
  • 加選授權碼已寄到學號@ntu的信箱, 若有疑問請盡快聯絡TA.
  • Howework 1 is announced.
  • Howework 0 is announced.(Last uploaded: 2012/02/22)

Course Information

The Teaching Team

Name Office hour Room
Instructor Michael Tsai (蔡欣穆) Wednesdays 9:00-10:00 R316
Teaching Assistant Hsin Miao(繆昕) Tuesdays 13:00-14:00 R508
Teaching Assistant Ming-Chang Li(李明璋) Thursdays 13:00-14:00 R508
Teaching Assistant YunJu Lee(李昀儒) Thursdays 18:30-20:00 R204
Teaching Assistant Eric Lee(李冠穎)
Teaching Assistant Harry Chen(陳彥儒) Fridays 9:10-10:00 R217
Teaching Assistant Orina Shiue(薛祐婷)

Please direct all your questions to dsa1(at)csie.ntu.edu.tw (dsa then the number 1 at csie). All e-mails sent to this address will be distributed to all members of the teaching team.

Syllabus

  • Basic concepts
  • Arrays and structures
  • Stacks and queues
  • Linked lists
  • Trees
  • Graphs
  • Sorting
  • Hashing
  • Priority queues
  • Other search structures

Class Schedule & Lecture Notes

Date Events Lecture Notes
2/21 First class, HW0 announced
2/28 No class, HW1 announced
3/6
  • Basics 2 [pptx|pdf]
  • Stacks and Queues [pptx|pdf] (Last Uploaded: 2012/03/13)
3/13 HW1 due, HW2 announced
  • Linked Lists [pptx|pdf] (Last Uploaded: 2012/03/20)
3/20
  • Tree 1 [pptx|pdf] (Last Uploaded: 2012/03/27)
3/27 HW2 due, HW3 announced
  • Tree 2 [pptx|pdf] (Last Uploaded: 2012/04/10)
4/3 No class
4/10 HW3 due
  • Tree 3 [pptx|pdf] (Last Uploaded: 2012/04/10)
  • Disjoint Sets [pptx|pdf] (Last Uploaded: 2012/04/24)
  • Version Control [pptx|pdf]
4/17 Midterm Exam
4/24
5/1 HW4 announced
  • Graph 2 [pptx|pdf] (Last Uploaded: 2012/05/08)
5/8
5/15 HW4 due, HW5 announced
  • Sorting [pptx|pdf] (Last Uploaded: 2012/05/22)
5/22
  • Sorting in Linear Time [pptx|pdf]
5/29 HW5 due, HW6 announced
  • Hashing [pptx|pdf]
  • Reference: Dynamic Hashing [pdf]
6/5
6/12 HW6 due
6/19 Final Exam

Section Textbook

”Data Sructures and Algorithms Made Easy,” Second Edition, Karumanchi

Chapter PDF File
1. Introduction
3. Linked Lists
4. Stacks
5. Queues
6. Trees

Homeworks

 
dsa_12spring.txt · Last modified: 2013/07/15 14:45 by hsinmu · [Old revisions]
Recent changes RSS feed Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki