Course Detail
Course Detail
Course Description
| Course | Code | Semester | T+P (Hour) | Credit | ECTS |
|---|---|---|---|---|---|
| FUNDAMENTALS of PROGRAMMING (PYTHON) | - | Fall Semester | 2+2 | 3 | 5 |
| Course Program | Salı 10:00-10:45 Salı 11:00-11:45 Salı 12:00-12:45 Salı 12:45-13:30 |
| Prerequisites Courses | |
| Recommended Elective Courses |
| Language of Course | English |
| Course Level | Short Cycle (Associate's Degree) |
| Course Type | Required |
| Course Coordinator | Assist.Prof. Ali DEMİR |
| Name of Lecturer(s) | Lect. Halise TÜRKMEN |
| Assistant(s) | |
| Aim | The course aims to build a solid foundation in Python programming by teaching core concepts like data types, operators, and functions. It focuses on developing logical problem-solving through control flow structures (if/else, loops) and the manipulation of complex data sequences like strings, lists, and dictionaries. Ultimately, students learn to design efficient algorithms for searching, counting, and data processing. |
| Course Content | This course contains; Course Orientation ,Introduction, Compilers vs. Interpreters, and Debugging ,Values, Types, Variables, and Operators ,Functions, Parameters, and Type Conversions ,Booleans, Relational/Logical Operators, and Iteration ,Conditionals (if/else/elif) and Keyboard Input ,Break/Continue, Modulus, and Fruitful Functions (Return) ,Midterm Exam ,String Fundamentals and Traversal ,String Patterns and Methods, Membership Operator ,Lists (Mutable Sequences, Methods, and Aliasing) ,Dictionaries (Keys, Values, and Mappings) ,Tuples (Immutable Sequences, Methods, and Aliasing) and Global Variables ,Introduction to Object-Oriented Programming ,Final Exam . |
| Course Learning Outcomes | Teaching Methods | Assessment Methods |
| Can use fundamental data types: int, float, str, and bool. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Analyzes problems and develop algorithmic solutions. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| identifies and fixes syntax, runtime, and semantic errors. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Applies arithmetic, relational, and logical operators correctly. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Implements conditional logic with if/elif/else statements. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Creates iterative solutions using for and while loops. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Designs modular programs using functions with parameters and return values. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Understands variable scope and manages local/global variables. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Manipulates strings using slicing, traversal, and built-in methods. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Is comfortable with mutable lists and their methods (append, extend, sort). | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Uses dictionaries for key-value mappings and counting patterns. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Applies tuples for immutable sequences and tuple unpacking. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Is able to convert between data structures (strings, lists, dictionaries, tuples). | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Handles user input with appropriate type conversion. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Traces program execution flow and debugs code effectively. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Teaching Methods: | 1: Mastery Learning, 10: Discussion Method, 12: Problem Solving Method, 13: Case Study Method, 14: Self Study Method, 16: Question - Answer Technique, 17: Experimental Technique, 19: Brainstorming Technique, 3: Problem Baded Learning Model, 37: Computer-Internet Supported Instruction, 9: Lecture Method |
| Assessment Methods: | A: Traditional Written Exam, B: Short Answer Exam, C: Multiple-Choice Exam, G: Quiz, H: Performance Task |
Course Outline
| Order | Subjects | Preliminary Work |
|---|---|---|
| 1 | Course Orientation | |
| 2 | Introduction, Compilers vs. Interpreters, and Debugging | |
| 3 | Values, Types, Variables, and Operators | |
| 4 | Functions, Parameters, and Type Conversions | |
| 5 | Booleans, Relational/Logical Operators, and Iteration | |
| 6 | Conditionals (if/else/elif) and Keyboard Input | |
| 7 | Break/Continue, Modulus, and Fruitful Functions (Return) | |
| 8 | Midterm Exam | |
| 9 | String Fundamentals and Traversal | |
| 10 | String Patterns and Methods, Membership Operator | |
| 11 | Lists (Mutable Sequences, Methods, and Aliasing) | |
| 12 | Dictionaries (Keys, Values, and Mappings) | |
| 13 | Tuples (Immutable Sequences, Methods, and Aliasing) and Global Variables | |
| 14 | Introduction to Object-Oriented Programming | |
| 15 | Final Exam |
| Resources |
Course Contribution to Program Qualifications
| Course Contribution to Program Qualifications | |||||||
| No | Program Qualification | Contribution Level | |||||
| 1 | 2 | 3 | 4 | 5 | |||
Assessment Methods
| Contribution Level | Absolute Evaluation | |
| Rate of Midterm Exam to Success | 40 | |
| Rate of Final Exam to Success | 60 | |
| Total | 100 | |
| ECTS / Workload Table | ||||||
| Activities | Number of | Duration(Hour) | Total Workload(Hour) | |||
| Course Hours | 14 | 3 | 42 | |||
| Guided Problem Solving | 14 | 2 | 28 | |||
| Resolution of Homework Problems and Submission as a Report | 5 | 5 | 25 | |||
| Term Project | 14 | 1 | 14 | |||
| Presentation of Project / Seminar | 0 | 0 | 0 | |||
| Quiz | 5 | 1 | 5 | |||
| Midterm Exam | 1 | 10 | 10 | |||
| General Exam | 1 | 20 | 20 | |||
| Performance Task, Maintenance Plan | 0 | 0 | 0 | |||
| Total Workload(Hour) | 144 | |||||
| Dersin AKTS Kredisi = Toplam İş Yükü (Saat)/30*=(144/30) | 5 | |||||
| ECTS of the course: 30 hours of work is counted as 1 ECTS credit. | ||||||
Detail Informations of the Course
Course Description
| Course | Code | Semester | T+P (Hour) | Credit | ECTS |
|---|---|---|---|---|---|
| FUNDAMENTALS of PROGRAMMING (PYTHON) | - | Fall Semester | 2+2 | 3 | 5 |
| Course Program | Salı 10:00-10:45 Salı 11:00-11:45 Salı 12:00-12:45 Salı 12:45-13:30 |
| Prerequisites Courses | |
| Recommended Elective Courses |
| Language of Course | English |
| Course Level | Short Cycle (Associate's Degree) |
| Course Type | Required |
| Course Coordinator | Assist.Prof. Ali DEMİR |
| Name of Lecturer(s) | Lect. Halise TÜRKMEN |
| Assistant(s) | |
| Aim | The course aims to build a solid foundation in Python programming by teaching core concepts like data types, operators, and functions. It focuses on developing logical problem-solving through control flow structures (if/else, loops) and the manipulation of complex data sequences like strings, lists, and dictionaries. Ultimately, students learn to design efficient algorithms for searching, counting, and data processing. |
| Course Content | This course contains; Course Orientation ,Introduction, Compilers vs. Interpreters, and Debugging ,Values, Types, Variables, and Operators ,Functions, Parameters, and Type Conversions ,Booleans, Relational/Logical Operators, and Iteration ,Conditionals (if/else/elif) and Keyboard Input ,Break/Continue, Modulus, and Fruitful Functions (Return) ,Midterm Exam ,String Fundamentals and Traversal ,String Patterns and Methods, Membership Operator ,Lists (Mutable Sequences, Methods, and Aliasing) ,Dictionaries (Keys, Values, and Mappings) ,Tuples (Immutable Sequences, Methods, and Aliasing) and Global Variables ,Introduction to Object-Oriented Programming ,Final Exam . |
| Course Learning Outcomes | Teaching Methods | Assessment Methods |
| Can use fundamental data types: int, float, str, and bool. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Analyzes problems and develop algorithmic solutions. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| identifies and fixes syntax, runtime, and semantic errors. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Applies arithmetic, relational, and logical operators correctly. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Implements conditional logic with if/elif/else statements. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Creates iterative solutions using for and while loops. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Designs modular programs using functions with parameters and return values. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Understands variable scope and manages local/global variables. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Manipulates strings using slicing, traversal, and built-in methods. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Is comfortable with mutable lists and their methods (append, extend, sort). | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Uses dictionaries for key-value mappings and counting patterns. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Applies tuples for immutable sequences and tuple unpacking. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Is able to convert between data structures (strings, lists, dictionaries, tuples). | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Handles user input with appropriate type conversion. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Traces program execution flow and debugs code effectively. | 1, 10, 12, 13, 14, 16, 17, 19, 3, 37, 9 | A, B, C, G, H |
| Teaching Methods: | 1: Mastery Learning, 10: Discussion Method, 12: Problem Solving Method, 13: Case Study Method, 14: Self Study Method, 16: Question - Answer Technique, 17: Experimental Technique, 19: Brainstorming Technique, 3: Problem Baded Learning Model, 37: Computer-Internet Supported Instruction, 9: Lecture Method |
| Assessment Methods: | A: Traditional Written Exam, B: Short Answer Exam, C: Multiple-Choice Exam, G: Quiz, H: Performance Task |
Course Outline
| Order | Subjects | Preliminary Work |
|---|---|---|
| 1 | Course Orientation | |
| 2 | Introduction, Compilers vs. Interpreters, and Debugging | |
| 3 | Values, Types, Variables, and Operators | |
| 4 | Functions, Parameters, and Type Conversions | |
| 5 | Booleans, Relational/Logical Operators, and Iteration | |
| 6 | Conditionals (if/else/elif) and Keyboard Input | |
| 7 | Break/Continue, Modulus, and Fruitful Functions (Return) | |
| 8 | Midterm Exam | |
| 9 | String Fundamentals and Traversal | |
| 10 | String Patterns and Methods, Membership Operator | |
| 11 | Lists (Mutable Sequences, Methods, and Aliasing) | |
| 12 | Dictionaries (Keys, Values, and Mappings) | |
| 13 | Tuples (Immutable Sequences, Methods, and Aliasing) and Global Variables | |
| 14 | Introduction to Object-Oriented Programming | |
| 15 | Final Exam |
| Resources |
Course Contribution to Program Qualifications
| Course Contribution to Program Qualifications | |||||||
| No | Program Qualification | Contribution Level | |||||
| 1 | 2 | 3 | 4 | 5 | |||
Assessment Methods
| Contribution Level | Absolute Evaluation | |
| Rate of Midterm Exam to Success | 40 | |
| Rate of Final Exam to Success | 60 | |
| Total | 100 | |
