ALGORITHMS AND PROGRAMMING
- Course
- MISY223 - ALGORITHMS AND PROGRAMMING
- Department
- Management Information Systems - 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
- L02 Implement sorting algorithms in Python. SOLO 4
- L03 Construct dictionaries in Python. SOLO 4
- L04 Perform string operation in Python. SOLO 4
- L05 Implement searching algorithms in Python. SOLO 4
- L06 Construct files in Python. SOLO 4
- L07 Analyze algorithm complexity. SOLO 4
Program Outcomes
- P01 Demonstrate comprehensive knowledge of key concepts across the breadth of effective application and use of MIS and innovative information technologies in organizations.
- P02 Demonstrate autonomy and responsibility in managing MIS projects and improving organizational processes
- P03 Demonstrate comprehensive understanding of appropriate enterprise frameworks, theories from the MIS to research and assess contemporary issues in the field and related allied fields and disciplines
- P04 Apply MIS knowledge to facilitate the acquisition, development, deployment, and management of information systems
- P05 Apply MIS knowledge to the exploitation of opportunities created by information technology innovations ensuring the alignment between MIS strategy and organizational strategy
- P06 Demonstrate ethical reasoning in relation to crucial MIS issues such as privacy, information security, and ethical use of information
- P07 Apply appropriate technologies and techniques to the collection and analysis of organizational and environmental data to facilitate evidence-based decision-making
- P08 Analyse organizational data to accurately identify organizational problems and propose solutions using MIS
- P09 Apply effective communication skills consistent with the professional environment
- P10 Apply effective collaboration skills consistent with the professional environment
Po-Lo Matrix
| LO | P01 | P02 | P03 | P04 | P05 | P06 | P07 | P08 | P09 | P10 | Average |
|---|---|---|---|---|---|---|---|---|---|---|---|
| L01 | 5 | 0 | 3 | 4 | 4 | 0 | 3 | 3 | 0 | 0 | 2.2 |
| L02 | 5 | 0 | 0 | 5 | 4 | 0 | 4 | 4 | 0 | 0 | 2.2 |
| L03 | 4 | 0 | 0 | 5 | 4 | 0 | 4 | 4 | 0 | 0 | 2.1 |
| L04 | 3 | 0 | 0 | 4 | 4 | 0 | 3 | 3 | 0 | 0 | 1.7 |
| L05 | 4 | 0 | 0 | 5 | 4 | 0 | 4 | 4 | 0 | 0 | 2.1 |
| L06 | 4 | 0 | 0 | 5 | 4 | 0 | 4 | 4 | 0 | 0 | 2.1 |
| L07 | 5 | 0 | 3 | 5 | 5 | 0 | 4 | 5 | 0 | 0 | 2.7 |