Faculty of Education · Secondary School Mathematics Education · Undergraduate
Course Objective
To be able to comprehend the principles and phases for solving a problem, To be able to make algorithms and flow charts for solving a problem., To be able to write algorithms for algorithms and flow charts. Being able to understand and use concepts such as variables, control statements, loops, strings, subprograms.
Course Content
Algorithm design; development of algorithms for flow diagrams, input-output concepts, loops, decision structures, decision-making, and cyclic problems; applications of algorithms and flowcharts using visualization (scratch, code.org); the creation of appropriate resolution algorithms using the function; develop appropriate solution algorithms using single and double dimensional arrays; coding and applications of generated algorithms in Computer Algebra Systems.
Course Learning Outcomes
- To be able to comprehend basic data types and expressions on computer
- To be able to analyze problems by listing inputs and outputs
- Ability to design different and effective algorithms to solve problems
- To be able to express algorithms with a notation
- To be able to design modular programs with subprograms
Core Area Distribution
Teaching Methods
Assessment & Evaluation
ECTS / Workload
| Activity | Quantity | Duration (h) | Total Workload |
|---|---|---|---|
| Course Duration (Including Exam Week) | 15 | 2 | 30 |
| Out of Class Study Period | 5 | 2 | 10 |
| Midterm | 1 | 5 | 5 |
| Quiz | 0 | 0 | 0 |
| Assignment | 0 | 0 | 0 |
| Practice | 0 | 0 | 0 |
| Final | 1 | 5 | 5 |
Course Schedule
| Week | Subject | Preparation |
|---|---|---|
| 1 | General programming knowledge, programming, algorithm, flowchart, programming language | Resource Book |
| 2 | Writing the program, compiling, linking, running, testing | Resources Book |
| 3 | Algorithms, algorithm design, input-output concepts, loops | Resources Book 2 |
| 4 | Arithmetic and logical expressions; arithmetic operator, arithmetic operand, transferring value, comparison operator, logical operator | Resources Book |
| 5 | Variable and array definition; constant, integer constants, fractional constants, string constants | Resource Book 1 |
| 6 | Running algorithms, number systems, data processing | Resource Book 2 |
| 7 | Development of algorithms suitable for decision structures, decision making and circular problems | Resource Book 2 |
| 8 | Midterm | Midterm |
| 9 | Loops | One of the Resource Books |
| 10 | Applications of programs in which algorithms and flowcharts are visualized (such as scratch, code.org) | Related programs |
| 11 | Creation of suitable solution algorithms using functions | Related pocket programs |
| 12 | Development of suitable solution algorithms using one- and two-dimensional arrays | Resource Books 1-2 |
| 13 | Coding the generated algorithms in Computer Algebra Systems | Related Programs |
| 14 | Applications of created algorithms in Computer Algebra Systems | Related Programs |
| 15 | Applications of created algorithms in Computer Algebra Systems | Mapple |
| 16 | Final | Final |