Computer Technologies (Evening Education) | |||||
Associate | TR-NQF-HE: Level 5 | QF-EHEA: Short Cycle | EQF-LLL: Level 5 |
Course Code: | BST101 | ||||
Course Name: | Programming Basics | ||||
Semester: | Fall | ||||
Course Credits: |
|
||||
Language of instruction: | Turkish | ||||
Course Condition: | |||||
Does the Course Require Work Experience?: | No | ||||
Type of course: | Compulsory Courses | ||||
Course Level: |
|
||||
Mode of Delivery: | |||||
Course Coordinator: | Öğr. Gör. RAHİME BÜŞRA HACIMUSTAFAOĞLU | ||||
Course Lecturer(s): | Mustafa Koçal | ||||
Course Assistants: |
Course Objectives: | This course covers computational design as well as software maintenance for students with little or no experience in computer programming, using the Python programming language. In addition to the elements of Python languages, the course will also teach sequential programming management and the basics of software development. |
Course Content: | Basic computer concepts, Programming fundamentals, Variables, Expressions, Functions, Conditional expressions, Recursion, Abundant functions, Iterations, Loops, Strings, Lists, Dictionaries, Tuples. |
The students who have succeeded in this course;
1) Learns basic computer and programming concepts. 2) Gains scientific thinking ability. 3) Learns the basics of computer programming. 4) Acquires skills to solve problems with the help of computers. |
Week | Subject | Related Preparation |
1) | Introduction of the course, meeting the instructor, basic computer concepts (Central processing unit, memory, backup, operating system, algorithm, software, programming and meeting Piazza, etc.). | Think Python, 2nd Edition, How to Think Like a Computer Scientist, Allen Downey, Green Tea Press (2015). |
2) | Fundamentals of programming, variables, expressions, idioms. | Course notes |
3) | Fundamentals of programming, variables, expressions, idioms. | Course notes |
5) | Functions | Her Yönüyle Python, 5. Baskı, Fırat Özgül, Kodlab, 2017. |
6) | Conditional expressions, recursion. | Course notes |
7) | Abundant functions | Course notes |
8) | Midterm exam | Course notes |
9) | Repetitions, loops. | - |
10) | Repetitions, loops. | - |
11) | Lists, Dictionaries, Tuples | - |
12) | Lists, Dictionaries, Tuples | - |
13) | Case study: choosing the right data structure. | - |
14) | Data structures | - |
15) | Final exam | - |
Course Notes / Textbooks: | |
References: |
Course Learning Outcomes | 1 |
2 |
3 |
4 |
---|---|---|---|---|
Program Outcomes |
No Effect | 1 Lowest | 2 Average | 3 Highest |
Program Outcomes | Level of Contribution |
Semester Requirements | Number of Activities | Level of Contribution |
Midterms | 1 | % 40 |
Final | 1 | % 60 |
total | % 100 | |
PERCENTAGE OF SEMESTER WORK | % 40 | |
PERCENTAGE OF FINAL WORK | % 60 | |
total | % 100 |
Activities | Number of Activities | Preparation for the Activity | Spent for the Activity Itself | Completing the Activity Requirements | Workload | ||
Course Hours | 4 | 15 | 60 | ||||
Midterms | 1 | 30 | 30 | ||||
Final | 1 | 35 | 35 | ||||
Total Workload | 125 |