ALGORITHMS AND PROGRAMMING
- Course
- CMPE124 - ALGORITHMS AND PROGRAMMING
- Department
- Computer Engineering - English - Master
- Course Type
- Scientific Preparation
- Status
- Required
- Language
- English
- Credit
- 0
- ECTS
- 0
- T+P+L
- 0 + 0 + 0
- Course Coordinator(s)
- Dr. Inst. Basmah ANBER
- Prerequisite
- -
- Keywords
Course Description
---
ALGORITHMS AND PROGRAMMING
Evaluation Tools (Active Term)
No evaluation items have been defined.
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 | Review Arrays (1 Dimension & 2 Dimensions) |
| Week 2 | C-Strings (Character Arrays); Pointers |
| Week 3 | Functions (Value returning & Void ); Recursion |
| Week 4 | Arrays as Parameters to Functions (1 Dimension & 2 Dimensions) |
| Week 5 | APPLICATIONS OF ARRAYS (SEARCHING AND SORTING): Sequential Search, Binary Search |
| Week 6 | APPLICATIONS OF ARRAYS (SEARCHING AND SORTING): Bubble Sort, Selection Sort |
| Week 7 | Review |
| Week 8 | Midterm Examination |
| Week 9 | APPLICATIONS OF ARRAYS (SEARCHING AND SORTING): Divide and Conquer approach, Quick Sort, Merge Sort |
| Week 10 | Structure, Union, Bit, Manipulations and Enumerations |
| Week 11 | File Input/Output; Complexity Analysis of Algorithms |
| Week 12 | Complexity Analysis of Algorithms |
| Week 13 | Complexity Analysis of Algorithms |
| Week 14 | Complexity Analysis of Algorithms |
| Week 15 | Final Exam |
Reference Books & Course Materials
- 01 C++ PROGRAMMING: FROM PROBLEM ANALYSIS TO PROGRAM DESIGN, DS Malik
- 02 C How to Program, Fifth Edition, Deitel & Deitel, Prentice Hall, 2005.
- 03 1. J. Glenn Brookshear, Computer Science, Eighth edition, Addison Wesley, 2004.
- 04 A Book on C, Fourth Edition, Al Kelley and Ira Pohl, Addison Wesley, 1999.
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
No program outcomes have been defined.
Po-Lo Matrix
The PO-LO matrix has not been populated yet.