LADOKE AKINTOLA UNIVERSITY OF TECHNOLOGY, OGBOMOSO

FACULTY OF ENGINEERING AND TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

CURRICULUM

FOR

POSTGRADUATE DIPLOMA PROGRAMMES

(Computer Science)
 PGD (COMPUTER SCIENCE) CURRICULUM

Introduction

The PGD (Computer Science) Programme is designed to meet the

requirements for the training and development of the people that are coming

from Science, Engineering and Social Sciences related background into

Computer Science. It serves as a bridge programme to accommodate further

learning and training in Computer Science and Engineering.

Philosophy/ Objectives

This programme is based on the philosophy that the rate of technological

development of a nation depends to a great extent on the size, quality,

motivation and orientation of its science and engineering workforce. It is

clear that the computer is going to play a major role in technological

advancement of any nation in the next millennium and will depend largely

on the quality and quantity of computer professionals in this information

age.

The objectives of the Postgraduate diploma in the department are:

1. To provide students with bachelor’s degree and holder of HND in

relevant fields with deeper and specialized knowledge in Computer

Science.
2. Those who wish to make up for their deficiencies in their mother

background in order to satisfy the requirements for the pratice of

Computer Science and Information Technology such as HND courses to

become more theoretical, research oriented studies in the University.

3. Those who wish to convert from Engineering, Science, and Social

Science related fields to Computer Science field.

Admission Requirements

1. A candidate with minimum qualification of Third Class Degree in

Science, Social Science, Engineering and other fields.

2. HND holders of the same field or equivalent professional certificate of

equivalent qualification.

3. Also, candidates who have acquired the status of Full Membership of

Computer Professional Registration Council of Nigeria (MCPN).

 PGD COURSES

SEMESTER COURSE COURSE DESCRIPTION UNITS

CODE

First Semester CSE 601 Computer Programming I 3

CSE 603 Digital Computer Logic I 3

CSE 605 Database Design and Management 3

CSE 607 Fundamentals of Software Engineering 3

CSE 609 Principles of Compiler Construction 3

CSE 611 Computer Architecture 3

CSE 602 Computer Programming II 3

CSE 604 Digital Computer Logic II 3

CSE 606 Data Structure and Algorithms 3

CSE 608 Operating Systems 3

CSE 610 Numerical Computation 3

CSE 612 Project 3

TOTAL 39
 DESCRIPTION OF COURSES

CSE 601: Computer Programming I ( 3 Units) 2-0-3

Structured programming principles, keywords, and standard identifiers,

structure of a programming language. No statements. Control structures,

sub-programming, records files, sets, enumerated and sub-range data. Pascal

programming language is employed at this stage.

CSE 602: Computer Programming II (3 Units) 2 -0-3

The structure of C++ should be taught and illustrated

CSE 603: Digital Computer Logic I (3 Units)

Introduction to logic circuits. Elements of Logic circuit e.g. AND, OR, NOT

and NAND grates. Logic functions and truth table. Application of Boolean

algebra to logic circuits. Simplification using Boolean algebra theorems.

Simplification using Karnaugh’s maps. Electronics realization of logic

values and gates. Practical design and implementation of combinational

circuits using selection standard integrated circuits. Logic families; open

collector and tri-state gates and their applications. Semi-custom logic and

programmable Devices. Elements of sequential circuit e.g. R-S, J-K, and T

flip fops and their electronic realization.

CSE 604: Digital Computer Logic II (3 Units) 2-1-0

 Analysis and design of sequential circuits, input triggered, clock triggered

circuits; races, hazards, consideration of consideration of common logic

circuits such as adders, comparators, decoders, counters, parallel and shift

registers etc. Design and implementation of simple sequential circuits,

selected standard integrated circuits. Interfacing; digital and analog devices.

Memory interfaces. Buses and device controllers. But standards. Serial and

parallel interfaces. A/D and D/A Conversion.

CSE 605: Data Design & Management ( 3 Units) 3-0-3

Data analysis and modeling. Data models: relational, hierarchical and

network models. Database management system; specific examples. Query

Language. Data integrity and data security. File organizations: sequential,

random, indexed sequential, hierarchical, heap, hash-addressed, inverted.

Database administration. Distributed database systems. Future directors in

DBMS.

CSE 606: Data Structures and Algorithms (3 Units) 3 -0-0

Data structures: Application and implementation of the following data

structures: strings, arrays, stacks, queues, lists, trees and graphs, including

different phases of graphs, and reachability matrix. Algorithms: Internal

Sorting. External sorting. Searching. Merging. Analysis of algorithms:

Complexity measurement/metrics.
CSE 607: Fundamentals of Software Engineering (3 Units) 3-0-0

Introduction to Software Engineering life-cycle. Software specification and

conformity with specification, requirements analysis, real-world modeling.

Formal specification design techniques. Implementation. Quantity

assurance; reviews, inspection, formal verification and validation testing

strategies. Software reliability. Software project management; configuration

management, planning. Team-management; documentation and standards.

Software support environment.

CSE 608: Operating Systems (3 Units) 3-0-0

Function and objectives of an operating system. The process concept an

introduction to concurrency. Competing and co-operating processes. Mutual

exclusion, critical regions semaphores, monitors, rendezvous’, deadlock.

Job and process management. Memory management. Device management.

Information Management protection issues. Performance. Case Studies.

CSE 609: Principles of Compiler Constructions (3 Units) 2-1-0

Compilers and interpreters/ main phases of compilation: Lexical analysis,

syntax analysis, semantic analysis, code generation, issues in Compiler

 design; symbol tables, two-pass storage Allocation. Object code for

subscripted variable. A simple complete complier. Organization, subroutine

and function compilation. Bootstrapping techniques. Multi-pass compilation.

Optimization techniques; local expression, loops and global optimization.

CSE 610 Numerical Computation

(a) Computation-Representation of number errors Computation of

function.

(b) Solution of Non-Equations.

(c) Newton-Raphson-Method, iterative methods. Bairston’s method.

Aitken’s techniques.

(d) System of Linear Equations-Gaussian elimination,

triangularization method.

(e) Algebraic Eigen value problems.

The characteristic polynomial, the power method, Gwen and Householder

methods.

CSE11 Computer Architecture 3Units 2-1-0

Hardware features of modern Computer System: structural and functional

characteristics of computer systems components. Organization and design of

 digital computing system; description of current typical computing

structures. CUP configuration and possible architectures software/hardware

trade-offs.

CES 612 Individual Project (3 Unit) 0-0-3

Every individual student is expected to undertake a personal project in

specialized areas and domain in the field of Computer Science, Computer

Engineering and other its related fields.