Programming II | DIT YR2 SEM 1

TEAM UNIVERSITY
FACULTY OF APPLIED SCIENCES
DEPARTMENT OF INFORMATION TECHNOLOGY

TEACHING PORTFOLIO
Lecturer: Muwanguzi Benard
Contact: +256708646603
Email: info@ictconnect.org    Email 2: muwanguzibenard2017@gmail.com

Course Title: DIT5223 – PROGRAMMING 2

Course Description
This course builds upon the foundations of Programming 1. It introduces students to structured programming techniques, data structures, modular programming, file handling, and debugging. The emphasis is on problem-solving using programming logic and applying practical coding skills to real-world problems.

Course Objectives
This course aims to:
a) Strengthen students’ programming and problem-solving skills.
b) Introduce structured and modular programming concepts.
c) Enable students to design, implement, and test programs that solve real-life problems.
d) Develop understanding of arrays, pointers, functions, and file handling.
e) Encourage teamwork, creativity, and independent programming practice.

Learning Outcomes
By the end of the course, students should be able to:
a) Explain and apply structured programming techniques.
b) Use arrays and pointers to manage data in programs.
c) Write and apply user-defined functions and procedures.
d) Apply modular programming to design large programs.
e) Demonstrate basic file handling techniques in programs.
f) Debug and test programs effectively.

Detailed Course Description

• Unit 1: Introduction to Structured Programming – concepts, importance, examples (3 Hrs)
• Unit 2: Arrays and Strings – definition, operations, applications (8 Hrs)
• Unit 3: Pointers – concept, uses in memory management (6 Hrs)
• Unit 4: Functions and Procedures – built-in vs user-defined, modularization (8 Hrs)
• Unit 5: Modular Programming – principles, modular design with examples (6 Hrs)
• Unit 6: File Handling – opening, reading, writing, closing files (8 Hrs)
• Unit 7: Debugging and Testing – types of errors, debugging tools, techniques (6 Hrs)
  Total Contact Hours: 45 Hrs

Mode of Delivery

• Lectures
• Practical lab sessions
• Demonstrations
• Group projects and discussions

Mode of Assessment

• Continuous Assessment (30%) → Assignments, Tests, Group Work
• Final Examination (70%)
• Total: 100%

References

1. Deitel, H. M., & Deitel, P. J. (2012). C: How to Program. Pearson.
2. Kernighan, B. W., & Ritchie, D. M. (1988). The C Programming Language. Prentice Hall.
3. Malik, D. S. (2010). C++ Programming: Program Design Including Data Structures. Cengage Learning.
4. Wirth, N. (2017). Algorithms and Data Structures. Springer.

Grade Scale
80–100: A
75–79: B+
70–74: B-
65–69: C+
60–64: C-
55–59: D+
50–54: D-
0–49: F