Undergraduate Handbook - School of Computing and Informatics ...

Indicative Content: The object oriented paradigm; Classes and objects; Inheritance and visibility modifiers;
Interfaces and abstract classes; Graphical user interface and action handlers; Exception handling; Working with
files; Working with databases; Sessions and user management.
Reference Books:
i. M. R. Huth and M. D. Ryan, Logic in Computer Science, Modelling and Reasoning about Systems,
Cambridge University Press, 2000.
ii. SWI Prolog Home page, http://www.swi-prolog.org/
CSC 1301: Practical Skills Development (4 CU)
Course Content: The course aims at imparting practical skills in areas chosen by the faculty. The students are to be
supervised by staff with in the faculty. Areas of practical skills development include; Implementation of projects;
Network and system administration; Hardware maintenance and Computer assembly.
This can be done within the Faculty of Computing and Informatics Technology or any other unit in Makerere
University. Students will write a report at the end of the course.
CSC 1303: Cisco Certified Network Associate (Audited) (5 CU)
Course Content: In this course, students will cover the course content of the CCNA international curriculum.
CSC 2100: Data Structures and Algorithms (4 CU)
Course Description: Upon successful completion the students should be able to: Demonstrate factual knowledge
including the mathematical notation, syntax and terminology used in the course; describe the fundamental principles
including the laws and theorems arising from the concepts covered in this course; Apply course material along with
techniques and procedures covered in this course to solve practical problems; Design simple algorithms and data
structures in C and use theories and concepts covered in the course to approximate the complexities of algorithms.
Indicative Content: Methods for modularizing, documenting and constructing Programmes (abstract data types/
object orientation), and an introduction to classical data structures and algorithms with complexity analysis.
Application and implementation of strings, arrays, stacks queues, lists, trees and graphs; Abstract data types; storage
management; Sorting, searching, merging, reference and cross-referencing files; Design and analysis of algorithms,
complexity of algorithms, big-O and small-O notation. Binary trees, B-trees, B*-trees, and AVL-trees; Study of disk
and tape file organizations; Creation of sequential, direct, and indexed sequential files; Hashing techniques and
address overflows; Primary and secondary key usage, inverted and linked-list files; Semantic Nets, frames.
Reference Books:
i. A. V. Aho, J. D. Ullman, J. E. Hopcroft, Data Structures and Algorithms, Addison-Wesley, 1983.
ii. A. V. Aho, The Design and Analysis of Computer Algorithms, Addison-Wesley, Longman, 1974.
iii. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd edition,
McGraw-Hill, 2008.
BSE 2105 Formal Methods (4 CU)
Course Description: The course provides students with skills of solving generic formal problems in science. It
covers the intellectual and practical skills necessary for problem formalization.
Students will be provided with factual knowledge including the mathematical notations and terminologies used in
formalizing scientific problems; fundamental principles including the laws and theorems arising from the concepts
covered in this course; They will be able to apply course material along with techniques and procedures to solve
practical problems; The course will provide them programming skills by writing numerical Programmes like Matlab
Programmes, to solve numerical problems.
31