ALGORITHMS AND PROGRAMMING
- Course
- ITEC223 - ALGORITHMS AND PROGRAMMING
- Department
- Information Technologies - English - Undergraduate
- Course Type
- Course
- Status
- Required
- Language
- English
- Credit
- 4
- ECTS
- 6
- T+P+L
- 3 + 0 + 2
- 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 Describe different types of algorithms. SOLO 3
- L01 Construct files in Python. SOLO 4
- L01 Describe different types of algorithms. SOLO 4
- L01 Describe different types of algorithms. SOLO 3
- L02 Implement sorting algorithms in Python. SOLO 4
- L02 Implement sorting algorithms in Python. SOLO 4
- L02 Implement sorting algorithms in Python. SOLO 4
- L03 Construct dictionaries in Python. SOLO 4
- L03 Construct dictionaries in Python. SOLO 4
- L03 Construct dictionaries in Python. SOLO 4
- L04 Perform string operation in Python. SOLO 4
- L04 Perform string operation in Python. SOLO 4
- L04 Perform string operation in Python. SOLO 4
- L05 Implement searching algorithms in Python. SOLO 4
- L05 Implement searching algorithms in Python. SOLO 4
- L05 Implement searching algorithms in Python. SOLO 4
- L06 Construct files in Python. SOLO 4
- L06 Construct files in Python. SOLO 4
- L07 Analyze algorithm complexity. SOLO 4
- L07 Analyze algorithm complexity. SOLO 4
- L07 Analyze algorithm complexity. SOLO 4
Program Outcomes
- P01 Apply data science principles and techniques to challenges in real life situations, and effectively communicate their solutions.
- P02 Identify and implement data analysis methodologies based on theoretical ideas, ethical code, and in-depth knowledge of the underlying data.
- P03 Analyze the guiding concepts and assessment procedures for information analysis in real-life applications.
- P04 Design and apply relevant data analysis models to find obscure solutions to business-related problems.
- P05 Utilize modern computing techniques to handle real-world problems characterized by massive amounts of data, such as parallel and distributed computing and machine learning.
- P06 Configure and administer the software tools required to efficiently produce usable information from any size of structured and unstructured datasets.
- P07 Administer or manage data science tools and techniques to organize and complete projects aimed at gaining useful insight from complex data.
- P08 Think critically and imaginatively, conceiving real-world issues from several angles, and work well in a variety of teams to solve issues cooperatively.
- P09 Be able to effectively integrate data‐based solutions into the user environment and help non-technical professionals in exploring, visualizing, and using these solutions
- P10 Understand their obligations under professional and ethical standards in relation to matters like data ownership and citation, data security and sensitivity and the privacy implications of data analysis.
Po-Lo Matrix
| LO | P01 | P02 | P03 | P04 | P05 | P06 | P07 | P08 | P09 | P10 | Average |
|---|---|---|---|---|---|---|---|---|---|---|---|
| L01 | 3 | 4 | 4 | 3 | 2 | 0 | 0 | 0 | 0 | 0 | 1.6 |
| L01 | 0 | 0 | 0 | 0 | 0 | 5 | 4 | 0 | 3 | 3 | 1.5 |
| L01 | - | - | - | - | - | - | - | - | - | - | - |
| L01 | - | - | - | - | - | - | - | - | - | - | - |
| L02 | 4 | 4 | 0 | 0 | 3 | 3 | 2 | 0 | 0 | 0 | 1.6 |
| L02 | - | - | - | - | - | - | - | - | - | - | - |
| L02 | - | - | - | - | - | - | - | - | - | - | - |
| L03 | 3 | 0 | 0 | 0 | 0 | 4 | 3 | 0 | 2 | 1 | 1.3 |
| L03 | - | - | - | - | - | - | - | - | - | - | - |
| L03 | - | - | - | - | - | - | - | - | - | - | - |
| L04 | 3 | 4 | 0 | 0 | 0 | 3 | 0 | 0 | 2 | 0 | 1.2 |
| L04 | - | - | - | - | - | - | - | - | - | - | - |
| L04 | - | - | - | - | - | - | - | - | - | - | - |
| L05 | 4 | 4 | 0 | 0 | 3 | 3 | 0 | 0 | 0 | 0 | 1.4 |
| L05 | - | - | - | - | - | - | - | - | - | - | - |
| L05 | - | - | - | - | - | - | - | - | - | - | - |
| L06 | - | - | - | - | - | - | - | - | - | - | - |
| L06 | - | - | - | - | - | - | - | - | - | - | - |
| L07 | - | - | - | - | - | - | - | - | - | - | - |
| L07 | 0 | 5 | 5 | 4 | 3 | 0 | 0 | 2 | 0 | 0 | 1.9 |
| L07 | - | - | - | - | - | - | - | - | - | - | - |