Download presentation
Presentation is loading. Please wait.
Published byKole Berringer Modified over 10 years ago
1
Type:[ ] Filename:[ ] 計算機概論 EO107 Introduction to Computer Science 70101 & 70408 Presenter: Jonathon David White ( 白小明 ) Adviser: JDW/BXM Date: 2013-09-19 Class eo107-1
2
2 Workbook handout Cost: NT$70 TOC
3
3 Introducing… Introduction to Facilitators –Lecturer: 白小明 小明白 –Teaching Assistants: Kevin, Aray Course Introduction –Overview –Outline of Topics –Textbooks/References –Key Websites Course Delivery and Milestones Grading Respect: Classroom Rules Rules for the Computer Room Calendar Getting Started…
4
4 The Teacher ( 白小明 ) Education/Personal Experience Family 爱有力量 爱有力量 Research Timetable, Office Hours Rm70740Timetable http://www.kingcar.com.tw/Service/ProductLargeImageHandler.ashx?ID=244&Type=LargeImage
5
5 TA Introduction Kevin Aray
6
6 Respect Arrive on Time (after attendance deemed absent) Listen to Lectures Ask Questions (bonus marks) Listen to fellow students Computer Laboratory Rules –No food or drinks in classroom. –Do not leave garbage at entrance to classroom –During class: (this distracts other students) No FACEBOOK, No computer GAMES, No checking EMAIL No VIDEOS –Students disobeying rules will be asked to leave the classroom. 3X and will be asked to drop the course.
7
7 Respect: Computer Room See notes
8
8 Course Outline 1.Theory of Computing 2.Data Handling 3.Current Computers 4.Moving to the Computer (Programming)
9
9 Textbooks 1.(EO107, EO109) :Structuring Data and Building Algorithms: An ANSI-C Based Approach, Ian Chai and Jonathon White, McGraw-Hill (@ Caves, Contact: Tel : 02-23113000#212 / Fax : 02-2388- 8822 at McGraw-Hill) ISBN: 978-0071271882 (start using next class) 2. (EO107) : (2) Foundations of Computer Science, Behrouz A. Forouzan, Cengage Learning EMEA; 2 edition (December 5, 2007) ISBN 978- 1844807000 (start using class 10) 3.http://www.xiaotu.com/tea/yzu.edu.twhttp://www.xiaotu.com/tea/yzu.edu.tw 4.http://www.sdba.infohttp://www.sdba.info
10
10 Grading: Milestone Based Examples
11
11 Small Groups Up to 4 per group. Work together on tutorials One member may be called at random to represent the group. The group's mark depends on his/her performance Leader receives bonus marks if group does well.
12
12 Lets get started… Homework Reading: Chapter 11 of Ian Chai, “Structuring Data and Building Algorithms”
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.