477-201 Computer programming (1/59)

คำอธิบายชั้นเรียน

477-201 Computer programming (1/59)

https://www.classstart.org/classes/21168

  • ดร.จันทวรรณ ปิยะวัฒน์ ([email protected]) และ ดร.ธวัชชัย ปิยะวัฒน์
  • Concept of programming; algorithm to solve the problem; flowchart, expression and instruction; high-level language syntax, modern programming, testing, debugging, installation and software documentation
  • เพื่อให้นักศึกษามีความรู้พื้นฐานทางด้านการเขียนโปรแกรม และสามารถพัฒนาโปรแกรมด้วยภาษา Python ได้
  • A required book: http://greenteapress.com/thinkpython2/html/index.h...
  • Youtube channel: https://www.youtube.com/user/tpiyawat/videos
  • Tue & Thur 9.00-10.20 ห้อง FMS3503(COM)

วิธีการประเมิน
Evaluation Methods

สัปดาห์ที่ประเมิน
Week

สัดส่วนของการประเมิน
Percentage of Evaluation

Quizzes

01-06, 08-14

20

Exercises

01-06, 08-04

20

Midterm exam

07

25

Final exam

15

25

Reflection

01-06, 08-14

10

การตัดเกรดอิงเกณฑ์

A (ดีเยี่ยม)

80 - 100

B+ (ดีมาก)

75 - 79

B (ดี)

70 - 74

C+ (พอใช้)

65 - 69

C (ค่อนข้างดี)

60 - 64

D+ (อ่อน)

55 - 59

D (อ่อนมาก)

50 - 54

E (ตก)

0 - 49

Class schedule

Week Topic Youtube Step 1 Quizzes 20% Step 2 Exercises 20% Step 3 Reflection 10%
1 Setup and Running Python and IDE 00 Q1 1.4 สะท้อน
1 Code Units 01 2.1
1 Operators 2.2
1 Values and Types 2.3
1 Variables 2.4
1 Expressions
1 Statements
1 Comments
2 Conditionals 02 Q2 5.14.1 สะท้อน
2 Boolean expressions 5.14.2
2 Logical operators 5.14.3
2 Conditional execution 5.14.4
2 Alternative execution
2 Chained conditionals
2 Nested conditionals
3 Functions 03 Q3 6.1 สะท้อน
3 Function calls 6.2
3 Composition 6.3
3 Definitions and usages 6.5
3 Flow of execution 6.7
3 Parameters and arguments 6.8
3 Local and global variables
3 Void functions
3 Functions that return values
3 Functional programming
4 Iteration and Recursion 04 Q4 7.1 สะท้อน
4 The for statement 7.2
4 The while statement 7.3
4 Break 7.4
4 Recursion 7.5
5 Strings 05 8.1 สะท้อน
5 A string is a sequence 8.11
5 Len 8.12
5 Loop traversal 8.2
5 String slices 8.3
5 Immutable 8.4
5 Searching 8.6
5 Looping and counting 8.8
5 String methods 8.9
5 The in operator
5 String comparison
6 Lists (Array) 06 10 all สะท้อน
6 A list is a sequence
6 Mutable
6 Traversal
6 List operations
6 List slices
6 List methods
6 Map, filter, and reduce
6 Deleting elements
6 Lists and strings
6 Objects and values
6 Aliasing
6 List arguments
7 ทบทวนและบูรณาการเนื้อหาสัปดาห์ 1-6 สะท้อน
8 Dictionaries 07 11 all สะท้อน
8 A dictionary is a mapping
8 Looping
8 Lookup
8 Dictionaries and listso
9 Tuples 08 12 all สะท้อน
9 A tuple is immutable
9 Tuple assignment
9 Tuple as return values
9 Variable-length argument tuples
9 Lists and tuples
9 Dictionaries and tuples
9 Sequences of sequences
10 Files 09 14 all สะท้อน
10 Persistence
10 Reading and writing
10 Format operator
10 Filenames and paths
10 Catching exceptions
10 Databases
10 Picking
10 Pipes
11 Procedural Programming สะท้อน
11 Data
11 Functions
11 Modules
11 PIP
12 Object-Oriented Programming 16-18 สะท้อน
12 Key Concepts
12 Encapsulation
12 Inheritance
12 Polymorphism
12 Classes
12 Members
12 Methods
13 Python syntactic tools 19 สะท้อน
13 Conditional expressions
13 List comprehensions
13 Generator expressions
13 any and all
13 Sets
13 Counters
13 defaultdict
13 Named tuples
13 Gathering keyword args
14 Introduction to GUI Programming with wxPython
15 ทบทวนและบูรณาการเนื้อหาสัปดาห์ 7-14 สะท้อน


Course Policies:

Missed Classes: The student is responsible for obtaining material distributed on class days when he/she was absent. This can be done through contacting a classmate who was present or by contacting the instructor during his office hours or other times. Missed or late quizzes can not be made up under any circumstances but with good cause and adequate notice, an early quiz may be given.

Assignments: All assignments are due at the end of class on the date due. No exceptions are made.

Academic Dishonesty: Plagiarism and cheating are serious offenses and may be punished by failure on exam, paper or project; failure in course; and or expulsion from the University. For more information refer to the "Academic Dishonesty" policy in the University Undergraduate Catalog. For this class, it is permissible to assist classmates in general discussions of computing techniques. General advice and interaction are encouraged. Each person, however, must develop his or her own solutions to the assigned projects, assignments, and tasks. In other words, students may not "work together" on graded assignments.

Need for Assistance: If you have any condition, such as a physical or learning disability, which will make it difficult for you to carry out the work as I have outlined it, or which will require academic accommodations, please notify me as soon as possible.

Incomplete Policy: Students will not be given an incomplete grade in the course without sound reason and documented evidence as described in the Student Handbook. In any case, for a student to receive an incomplete, he or she must be passing and must have completed a significant portion of the course.

eLearning: It will be used for class content (e.g., class slides and assignment descriptions) and the recording of grades. Slides will be posted before class. Class announcements (e.g., change in assignment dates) will also be posted. It is the students’ responsibility to keep up with the changes that are posted on eLearning.

Make­up Exams: No make­up tests will be offered except on medical or educational grounds. You will be required to provide necessary documentations.

Attendance Policy: Attendance is extremely important. Students are expected to attend all classes in order to achieve maximum success.