陳銘憲 老師班

本網頁僅供修習此課程同學使用 有修此課程,但未申請帳號的同學,請按下面連結申請帳號 下次登入時請您以此帳號密碼登入,謝謝~~

如有任何問題，請連絡助教

• 課程名稱:  資料結構與程式設計

• 授課教師:  陳銘憲 教授

• 上課時間地點: 星期三 第六,七,八節 (博理館114教室)

• 課程大綱:
  1. 簡介: Mathematical background, recursion, asymptotic notation, recurrence relations, performance measurement
  2. 抽象資料型態 (Abstract Data Type): stacks, queues, lists
  3. 串列 (Lists): list operations, list representations, list traversals, double linked lists
  4. 樹 (Trees): tree operations, tree representations, tree traversals, threaded trees, pointer-reversal traversal, Binary trees, Game trees, constant-space traversal
  5. 查詢結構 (Dictionaries): (optimal) binary search trees, AVL trees, 2-3 trees, B+-trees, red-black trees, splay trees
  6. 集合 (Sets): set operations, set representations, leftist trees, union-find, path compression, priority queues, heaps, binomial trees, Fibonacci heaps
  7. 湊雜 (Hashing): chaining, open addressing
  8. 記憶空間管理 (Memory management): garbage collection, buddy system
  9. 排序 (Sorting): sorting algorithms, External Sorting, Noncomputational sorting
  10. 基楚圖論 (Graphs): graph representations, graph searching, basic graph algorithms

• 教科書: Fundamentals of Data Structures in C++ / Ellis Horowitz, Sahni, Sartaj Mehta, Dinesh Mehta

• 成績評量方式:  期中考、期末考、平時作業

• 預修課程:  Introduction to C++ Programming

• 助教:  朱怡虹 (博理館603室)