ALGORITHMS AND PROGRAMMING
- Course
- VCP271 - ALGORITHMS AND PROGRAMMING
- Department
- Computer Technologies and Programming - English - Associate
- Course Type
- Course
- Status
- Required
- Language
- English
- Credit
- 3
- ECTS
- 0
- T+P+L
- 3 + 0 + 0
- Course Coordinator(s)
- -
- Prerequisite
- -
Course Description
The course mainly focuses on software implementations in C Programming Language. Firstly, basic concepts of algorithms are discussed and then structures of programming are studied. Then, arrays and searching and sorting algorithms on arrays are studied. Fundamentals of basic data structures, which are arrays, structures and unions are discussed together with bitwise operations and enumerations in C. Pointers, functions and file processing are studied in the second part of the course, after midterm examination. Case studies related to searching and sorting algorithms are also studied. Functions, characters and strings are studied as last topics of algorithm developments and course is finalized with complexity analysis of algorithms.
ALGORITHMS AND PROGRAMMING
Evaluation Tools (Active Term)
| Item | Type | Weight (%) |
|---|---|---|
| Final Exam | Final | 40 |
| Midterm Exam | Midterm | 30 |
| Quiz | Quiz | 10 |
| Homework | Assignment | 10 |
| Lab | Assignment | 10 |
| Total | 100 | |
Course outcomes
- 01 Learn and enhance basics of algorithms - pseudocodes and flowcharts.
- 02 Improve computer programming abilities with arrays, structures, pointers, strings.
- 03 Implement popular searching and sorting algorithms.
- 04 Learn how to program using structured data.
- 05 Develop computer programs including file processing.
- 06 Analyse the complexity of an algorithm and software implementation.
Course Syllabus
| Week | Topic |
|---|---|
| Week 1 | Introduction to Algorithms |
| Week 2 | Pseudocodes and Flowcharts |
| Week 3 | Structured Program Development and Program Control |
| Week 4 | Arrays, Sorting Algorithms on Arrays |
| Week 5 | Searching Algorithms on Arrays |
| Week 6 | Structures, Unions, Bit Manipulations and Enumerations |
| Week 7 | Midterm Examination |
| Week 8 | Midterm Examination |
| Week 9 | File Processing |
| Week 10 | Case Studies - Basic searching and sorting algorithms |
| Week 11 | Dictionaries |
| Week 12 | Characters and Strings |
| Week 13 | Complexity Analysis of Algorithms |
| Week 14 | Complexity Analysis of Algorithms |
| Week 15 | Final Exam |
Reference Books & Course Materials
- 01 John V. Guttag, Introduction to Computation and Programming Using Python, Third Edition, The MIT Press, 2021.
- 02 Thomas H. Cormen, Algorithms Unlocked, First Edition, The MIT Press, 2013.
Learning Outcomes
- L01 Learn and enhance basics of algorithms - pseudocodes and flowcharts.
- L02 Improve computer programming abilities with arrays, structures, pointers, strings.
- L03 Implement popular searching and sorting algorithms.
- L04 Learn how to program using structured data.
- L05 Develop computer programs including file processing.
- L06 Analyse the complexity of an algorithm and software implementation.
Program Outcomes
- P01 Be able to apply knowledge of programming
- P02 Be able to design software systems of varying complexity
- P03 Be able to identify, categorize, and develop solutions for computer orientated challenges.
- P04 Be able to demonstrate autonomy and responsibility in managing computer programming projects
- P05 Be able to follow the state of the arts concepts in computer technology
- P06 Be able to design, implement, and evaluate a computational system to meet desired needs within realistic constraints.
- P07 Be able to use appropriate techniques, skills, and tools necessary for computing practice.
- P08 Be able to apply appropriate technologies and techniques for the collection and analysis of organizational and environmental data to facilitate evidence-based decision making
- P09 Be able to apply effective communication skills consistent with the professional environment -
- P10 Be able to apply effective collaboration skills in teamwork consistent with the professional environment -
Po-Lo Matrix
| LO | P01 | P02 | P03 | P04 | P05 | P06 | P07 | P08 | P09 | P10 | Average |
|---|---|---|---|---|---|---|---|---|---|---|---|
| L01 | - | - | - | - | - | - | - | - | - | - | - |
| L02 | - | - | - | - | - | - | - | - | - | - | - |
| L03 | - | - | - | - | - | - | - | - | - | - | - |
| L04 | - | - | - | - | - | - | - | - | - | - | - |
| L05 | - | - | - | - | - | - | - | - | - | - | - |
| L06 | - | - | - | - | - | - | - | - | - | - | - |