教學大綱表 (112學年度 第2學期)
請遵守智慧財產權，勿使用非法影印教科書，避免觸法。
課程名稱
Course Title		 (中文) 程式設計(二)
(英文) Computer Programming 		開課單位
Departments		 資訊工程學系
課程代碼
Course No.		 I1252A
授課教師
Instructor		 卓世明
學分數
Credit		 3.0 必/選修
core required/optional		 必修 開課年級
Level		 大一
先修科目或先備能力(Course Pre-requisites)：程式設計(一)
課程概述與目標(Course Overview and Goals)：(1) 接續程式設計(一)之C語言課程，講授重點在於pointer, string, structure, file等.
(2) 設計配套之實驗題，讓學生在程式實驗(二)之實驗課程中得到充分的練習.
教科書(Textbook) 小黑碼C/C++程式學習日記
普林斯頓
參考教材(Reference) https://www.homeyes.com.tw/課程規定與小黑碼場使用方法.pdf
https://www.codingpass.com/
課程大綱 Syllabus 學生學習目標
Learning Objectives		 單元學習活動
Learning Activities		 學習成效評量
Evaluation		 備註
Notes
序
No.		 單元主題
Unit topic		 內容綱要
Content summary
1 String 1. string representation in C
2. string conversion functions in stdlib.h
3. ...printf and ...scanf fuctions in stdio.h 		1. String processing in C
2. Understanding the string functions provided in C library		  
2 String 1. string parsing functions in string.h
2. memory functions in string.h 		1. Introducing string processing in C
2. Understanding the string functions provided in C library		  
3 String --- Parsing 1. strspn, strcspn
2. strbrk, strtok
3. finite state machine concept 		1. Understand some important string paring function in string.h
2. Finite state machine concept		  
4 C Structures, Unions, Bit Manipulations and Enumerations 1. structure definitions (struct)
2. structure data initialization
3. accessing members of structures
4. using structure with functions 		1. Define structured data
2. Bit operation
3. Enumeration data type		  
5 C Structures, Unions, Bit Manipulations and Enumerations 1. typedef
2. unions
3. bit operators
4. bit fields
5. enumeration constants 		1. Define structured data
2. Bit operation
3. Enumeration data type		  
6 Files 1. data hierarchy
2. Files and Streams
3. file modes in C ---- text mode and binary mode
4. creating and accessing sequential-access files 		1. Creating and accessing files by C
2. Database concept		  
7 Files 1. creating and accessing random-access files
2. moving file pointer (fseek)
3. database concept 		1. Creating and accessing files by C
2. Database concept		  
8 Midterm Review 1. sorting with structure
2. write structure to files
3. editing a binary file
4. string repalcement 		1. Review the topics learnt
2. More difficult labs		  
9 Midterm none none  
10 C Data Structures 1. Self-Referential Structures
2. Dynamic Memory Allocation 		1. Establish the basic concept of data structure
2. memory allocation/deallocation in C		  
11 C Data Structures 1. Linked list
2. Linked list applications 		1. Node maintenance
2. List maintenance operations
3. Create sorted list		  
12 C Data Structures 1. Stacks
2. Stack implementation by array
3. Stack implementation by linked list
4. Stack applications 		1. Understand the operations of a stack
2. Reverse Polish Calculator		  
13 C Data Structures 1. Queue
2. Queue implementation by array
3. Queue implementation by linked list
4. Queue applications 		1. Understand the operations of a queue
2. cash line simulation		  
14 C Data Structures 1. Binary tree
2. Binary search tree
3. Tree traversal 		1. Understand the structure of trees
2. Understand several tree-traversal methods		  
15 Supplementary Materials 1. Variable argument list
2. exit() & atexit()
3. Define Macros 		1. Introduce some special topics of C language  
16 Supplementary Materials 1. Variable argument list
2. exit() & atexit()
3. Define Macros 		1. Introduce some special topics of C language  
17 Discussion 1. UVa Problem Solving
2. Debugging 		1. Using right method in programming
2. Programming as an art		  
18 Final Examination none none  


教學要點概述：
1.自編教材 Handout by Instructor：
□ 1-1.簡報 Slides
□ 1-2.影音教材 Videos
□ 1-3.教具 Teaching Aids
□ 1-4.教科書 Textbook
□ 1-5.其他 Other
□ 2.自編評量工具/量表 Educational Assessment
□ 3.教科書作者提供 Textbook

成績考核 Performance Evaluation：

教學資源(Teaching Resources)：
□ 教材電子檔(Soft Copy of the Handout or the Textbook)
□ 課程網站(Website)
課程網站(Website)：http://elearn.ttu.edu.tw/learn/index.php
扣考規定：https://curri.ttu.edu.tw/p/412-1033-1254.php