Course Goal: An introductory course for the (new) undergraduates in the computer science department. We will cover basic knowledge about computer, data manipulation & abstraction, computer architecture, organization, software, operating system, database, network, multimedia, machine learning, etc. We will introduce common tools for CS programming such as python, GitHub, etc.

Lecturer: Winston Hsu (office: R512, CSIE Building)

TAs:

  • 吳權祐 <r13922a23@ntu.edu.tw>, R506; office hour: 3-4pm, Friday
  • 陳致翰 <r14944006@ntu.edu.tw>, R506; office hour: 2-3pm, Thursday

Time: 9:10am ~ 12:00pm, Monday

Location: RM 101, CSIE Building

Info: 課號CSIE1000; 課程識別碼: 902 10720

Assessment (tentative):

  • Assignments : 30-35%
  • Midterm Exam.: 30-35%
  • Final Exam.: 30-35%
  • Class Participation: 5-10%

Requirements: 限學號單號且限本系所學生(含輔系、雙修生) (總人數上限:85人)

Textbook (digital copy available):

Reference:

  • Computer Science: An Overview, 12th Edition, by J. Glenn Brookshear
    • Used for the major topics for computer science in the latter half lectures (need not buy)

Resources:

  • The lecture slides, homework descriptions, and datasets will be posted in NTU COOL. Only the students registered for the lecture can access them.
  • We will also host the discussions (questions) in NTU COOL as well.
  • The icon indicates that the related resources are ready for download.

[Course Outline]

  • [09/01] Lecture 01 – Introduction for the topic and course planing
  • [09/08] Lecture 02 – Data and Number System
    • Coverage: (1) Harris: Chap. 1.1-1.5, (2) Brookshear: Chap. 1.1, 1.2, 1.4-1.7, (3) Nisan: Chap. 2.1
    • HW #2, Due at 23:59, September 22, 2025 (Monday); 
  • [09/15] Lecture 03 – Boolean Logic (I)
    • HW #3, Due at 23:59, September 29, 2025 (Monday)
  • [09/22] Lecture 04 – Boolean Logic (II)
  • [09/29] Lecture 05 – Holiday (no lecture)
  • [10/06] Lecture 06 – Holiday (no lecture)
  • [10/13] Lecture 07 – Sequential Logic (I)
    • Coverage: chapter 3 (partial) from [Harris] (except Sec. 3.2.7., Sec. 3.5)
    • HW #4, Due at 23:59, October 27, 2025 (Monday)
  • [10/20] Lecture 08 – Sequential Logic (II)
  • [10/27] Lecture 09 – Midterm
    • Conducting the exam in R101 (or R103)
    • Scopes: till Lecture 08 – Sequential Logic (II)
  • [11/03] Lecture 10 – Arithmetic Logic Unit (ALU)
    • Coverage: Section 5.1 –5.3 in [Harris] except prefix adder, 5.2.7
    • HW #5, Due at 23:59, November 17, 2025 (Monday); online submission  
  • [11/10] Lecture 11 – Python programming and Git
    • HW #6, Due at 23:59, December 1, 2025 (Monday)  
  • [11/17] Lecture 12 – Computer Architecture + Machine Language
    • Coverage:  Section 5.1 – 5.4 in [Nisan and Schocken]
    • HW #7, Due at 23:59, December 8, 2025 (Monday) 
  • [11/24] Lecture 13 – Operation System + Network and Internet
    • Mainly covered by the lecture slides; requiring no textbook
    • Suggested reading: Operating System Tutorial from TutorialsPoint
  • [12/01] Lecture 14 – Database (I)
    • HW #8 Due at 23:59, December 15, 2025
  • [12/08] Lecture 15 – Database (II)
  • [12/15] Lecture 16 – Final Exam
    • Conducting the exam in R101 (or R103)
    • Scopes: TBA