資料結構

112-2 開課
  • 流水號

    17545

  • 課號

    DBME2021

  • 課程識別碼

    508 22300

  • 無分班

  • 3 學分
  • 選修

    醫學工程學系

      選修
    • 醫學工程學系

  • 陳中明
  • 四 2, 3, 4
  • 請洽系所辦

  • 2 類加選

  • 修課總人數 25 人

    本校 25 人

  • 無領域專長

  • 中文授課
  • NTU COOL
  • 核心能力與課程規劃關聯圖
  • 備註
    本課程中文授課,使用英文教科書。上課地點:工綜館323電腦教室。
  • 本校選課狀況

    載入中
  • 課程概述
    「資料結構」是醫學工程資訊相關領域之基礎知識與技能。在以程式設計解決實際課題中,不僅僅需要尋求高效率的演算法以在合理的時間內完成計算,同時也需要輔以適當的資料結構以使得演算法的核心精神得以實現。本課程將以C/C++為框架,探討Array, String, Linked List, Stack, Queue, Tree, Heap, Graph, 等基礎資料結構。並佐以實際應用問題及相關之演算法,以熟稔各種資料結構的特性與使用時機。 “Data Structure” is an essential knowledge and skill for the informatics-related fields in Biomedical Engineering. When a problem is to be solved by a dedicated program, it not only requires an efficient algorithm to accomplish the computation task in a reasonable time, but also needs to be implemented with proper data structures such that the kernel concept of the underlying algorithm could be realized. Using C/C++ as the framework, this course will study such fundamental data structures as Array, String, Linked List, Stack, Queue, Tree, Heap, Graph, and so on. Moreover, to get acquainted with the property and usage of each data structure, practical applications and related algorithms will be introduced and employed as learning materials.
  • 課程目標
    本課程之主要目標在於使學生了解與熟稔基礎資料結構之基本性質與使用方式。藉由以相關演算法解決實際應用問題之學習,期能建構學生厚實之程式撰寫與演算法設計之基礎。 This course aims to familiarize students with the essential properties and usages of various fundamental data structures. By applying the related algorithms to the practical problems, it is anticipated that the students may build up a solid background for programming and algorithm design.
  • 課程要求
    C或C++
  • 預期每週課後學習時數
  • Office Hour
  • 指定閱讀
  • 參考書目
    1. Data Structure Using C++, 2nd ed., by D. S. Malik, Course Technology, Cengage Learning 2. Data Structure Using C, 2nd ed., by Reema Thareja, Oxford University Press.
  • 評量方式
    30%

    期中考 Midterm Exam

    30%

    期末考 Final Exam

    40%

    作業、小考及課堂參與 Homework, Quiz, Class Participation

  • 針對學生困難提供學生調整方式
  • 課程進度
    第 1 週Introduction、Structured Data and Pointers
    第 2 週Linked Lists
    第 3 週Standard Template Library
    第 4 週Standard Template Library
    第 5 週Linked Lists and STL
    第 6 週Stacks
    第 8 週Midterm Exam
    第 9 週Queues、Searching and Hashing Algorithms
    第 10 週Complexity Notations and Sorting Algorithms