ABUBAKAR TAFAWA BALEWA UNIVERSITY, BAUCHI

DEPARTMENT OF MATHEMATICAL SCIENCES

REVISED
UNDERGRADUATE CURRICULUM
2016
 1.0. LEVEL AND SEMESTER COURSES FOR
B.TECH. COMPUTER SCIENCE

100 LEVEL COURSES

FISRT SEMESTER 100 LEVEL
FIRST SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
CHM111 General Chemistry I 2 1 0 3 -
General Chemistry I
CHM113 0 0 3 1
Lab
Introduction to
CS111 2 1 0 3 -
Computer Science I
GNS111 Use of English I 2 0 0 2 -
MTH111 Elementary Algebra I 2 1 0 3 -
MTH112 Elementary Calculus I 2 1 0 3 -
Intro. Mechanics &
PHY111 2 1 0 3 -
Properties of Matters
Basics Experimental
PHY117 Physics I 0 0 3 1 -
Introduction to Prob.
ST 111 2 0 0 2 -
& Prob. Distributions
TOTAL 21
 SECOND SEMESTER 100 LEVEL
SECOND SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
Introduction to 2 1 0 3
CS121 -
Computer Science II
GNS121 Use of English II 2 0 0 2 -
MTH121 Elementary Algebra II 3 1 0 3 -
MTH122 Elementary Calculus II 3 1 0 3 -
MTH123 Set, Logic and Algebra 2 1 0 2 -
Intro. Electricity & 2 1 0 3
PHY124 -
Magnesium
Basic Experimental 0 0 3 1
PHY127 -
Physics II
ST 121 Descriptive Statistics 2 0 0 2
TOTAL 19

200 LEVEL COURSES

FISRT SEMESTER 200 LEVEL
FIRST SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
Computer CS121
CS211 2 0 1 3
Programming I
CS212 Web Programming 2 0 1 3 CS111
GNS211 Information Science 2 0 0 2
MTH211 Linear Algebra I 2 1 0 3 MTH121
MTH212 Mathematical Method 1 1 0 2 MTH 112
Intermediate PHY111
PHY211 2 1 0 3
Mechanics
Page 3 of 68
 Discrete and ST 111
ST 211 Continuous Prob. and 3 0 0 3
Prob. Distributions
*GNS111 Use of English I 2 0 0 2 -
TOTAL 19/21
NOTES: i) * Must be taken by Direct Entry Students

SECOND SEMESTER 200 LEVEL

SECOND SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
Computer Programming
CS221 1 0 1 2 CS211
II
File Processing & Data
CS222 2 1 0 3 -
Base Mgt.
CS223 Digital Logic Design 2 0 0 3 -
CS224 Computer & Society 2 0 0 2 -
Nigerian People &
GNS221 2 0 0 2 -
Culture
Peace and Conflict
GNS222 2 0 0 2 -
Resolution Study
MTH221 Linear Algebra II 2 1 0 3 MTH211
MTH224 Introduction to 2 1 0 3 -
Mathematical Modeling
*GNS121 Use of English Lang. I 2 0 0 2
TOTAL 20-22
NOTES: (*) Must be taken by Direct Entry Students

Page 4 of 68
 300 LEVEL COURSES
FIRST SEMESTER 300 LEVEL
FIRST SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
CS311 Operating System I 2 0 1 3
Data Structures &
CS312 2 0 1 2 CS221
Algorithms
Introduction to
CS313 2 1 0 2 CS223
Computer Systems
Object Oriented
CS314 2 0 0 2 -
Programming
Computer Hardware
CS315 1 0 1 2 -
Maintenance
EE413 Digital System 2 1 0 3 -
Entrepreneurship and
GNS311 2 0 0 2
Innovation
MTH313 Numerical Analysis I 2 1 0 3
MTH314 Operation Research I 2 1 0 3
TOTAL 22

SECOND SEMESTER 300 LEVEL

SECOND SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
CS321 Operating System II 3 1 0 3 CS311
System Analysis and
CS322 3 0 0 3 CS211
Design
Human Computer
CS323 1 0 1 2 -
Interaction
Page 5 of 68
 Theoretical Computer
CS324 2 1 0 3 -
Science
Organization of
CS325 Programming 2 1 0 3 CS211
Languages
CS326 Research Methodology 2 1 0 2 -
Business Creation and
GNS321 2 0 0 2
Growth
MTH324 Discrete Mathematics 2 1 0 3 -
TOTAL 21

400 LEVEL COURSE

Credit
Code Course Title
Unit
Students Industrial Work
SIWES 8
Experience Scheme

500 LEVEL COURSES

FIRST SEMESTER 500 LEVEL
FIRST SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
Design and Analysis of
CS511 2 0 1 3 CS312
Algorithm
CS512 Compiler Construction 3 0 0 3 CS324
Fundamentals of
CS513 3 0 0 3 CS322
Software Engineering`
Computer Graphics and
CS514 2 1 0 2
Visualisation
Page 6 of 68
 Advanced Computer
CS515 2 1 0 3 CS314
Programming
Micro Computer &
EE502 2 1 0 3 EE413
Microprocessor System
Digital System
EE417 0 0 1 1 -
Laboratory
Micro Computer &
EE513 Microprocessor System 0 0 1 1
Lab
TOTAL 19

SECOND SEMESTER 500 LEVEL

SECOND SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
CS599 Project - - - 6 SIWES
Computer CS311
CS521 3 1 0 3
Network/Communication
Database Management CS222
CS522 2 1 0 3
Systems
Computer Architecture CS223,
CS523 2 1 0 3
313
Artificial Intelligence &
CS524 2 1 0 3 CS312
Expert System
CS526 Net Centric Computing 2 0 1 2 -
TOTAL UNITS 20

Page 7 of 68
1.2. COURSE DESCRIPTIONS

100 LEVEL COURSES

CS111 Introduction to Computer Science I (3 Units)
Historical Development of Digital Computers: The
contributions of Pascal, Leibniz, Joseph Jacquard,
Charles Babbage, Herman Hollerith etc. Progression of
computer electronics: ENIAC and EDVAC,
technological innovation during wartime. Computer
Generations: 1st – 5th generation, the major features of
each generation. Classification of computer based on
size, purpose and capability. Computer Architecture:
Von Neumann Architecture; Explanation on storage,
input and output units of computer system. Definition
and explanation on hardware component of a computer.
System software: Operating systems, Operating system
functions, Types of operating systems, Stand-alone
operating systems, Network operating systems,
embedded operating systems. Utility programs.
Language Translators; Compiler, Interpreter,
Assembler. Application software: Productivity
software, Developing a document, Graphics and
multimedia software, Software for home, personal, and
educational use, Software for communications.
Applications on the Web, Learning aids and support
tools within an application.
The Network & Internet: Meaning of internet, internet
protocols. Network Types, Network Topologies.
Communications channel, Physical transmission media,
Wireless transmission media. Communications
software, Telephone network, Network Communication
Page 8 of 68
devices (switches, routers, hub, Modem etc), Uses of
communications technologies. The Search engines.
Computer security; risks and safeguards, How viruses
work and how to prevent them, Internet and network
security, Information privacy.

CS121: Introduction to Computer Science II (3 Unit)

Overview of fundamental concept of Computer Science.
Problem solving using computer; Algorithm, Flowchart,
Pseudo code. Programming, program Control/Logic
structure, Programming paradigms (Unstructured,
structured and OO programming). Definition of the
following terms: bits, bytes, word, word length, data,
information, records, fields, files, and database.
Basic data Structure: Meaning of data structure. Brief
discussion on: Array, linked lists, stacks and queues,
tree; tree traversal, uses of binary tree). BASIC
Programming Language.

200 LEVEL COURSES

CS211 Computer Programming I (3 Unit) –
Prerequisite CS121
Number system & Data Representation: Converting
number between bases, Data Representation in binary.
Fundamental programming constructs: Syntax and
semantics of a higher-level language; variables, types,
expressions, and assignment; simple I/O; conditional
and iterative control structures; functions and parameter
passing; structured decomposition.

Page 9 of 68
Software development methodology: Fundamental
program design concepts and principles, Coding,
Testing and debugging strategies, Documenting
program using techniques of good programming style.
Introduction to Object Oriented Programming (OOP)
concepts. Python Programming Language.

CS212 Web Programming (3 Units) – Prerequisite

CS 111
Layers of the Internet. World Wide Web. Domain Name
Service. Uniform Resource Locator (URL). Overview
of Web Applications, Guide to the Server, History of
Markup Language; HTML Basics(Tags, Formatting
,Text, Creating Links, Adding Images, Lists, Tables,
Frames, Forms). Cascading Style Sheets (CSS); class,
id, positioning, linking CSS file to html page. Graphics.
JavaScript Language. Document Object Model. .
JQuery. Dynamic HTML. PHP. Generating HTML
Dynamically, Processing Forms, Maintaining State in
Web Applications, Cookies, Data Tier (Back-end
Database Support, SQL Primer, Database Interface in
PHP), Searching in Web Applications (Regular
Expressions and Matching), Multimedia and
Interactivity (Audio on the Web, Video on the Web),
AJAX, Web Security.

CS221 Computer Programming II (2 Unit) –

Prerequisite CS 211
C++ Basics; Data types, constants, variables, arithmetic
operators, expressions, statements, input and output,
pre-processor directives, structure of C program.
Page 10 of 68
Relational and logic operators, the implementation of
true/false decisions, iteration-for loop, while loop, do-
while; while use of break and continue selection- if
statement, if… else, switch, conditional operator.
Pointers and definition, use of the * and & operators;
appreciation of the need for pointers: Systems Library
functions and header files, user – defined functions
parameter passing between functions using “by value
and “by reference” methods; building user-defined
function toolboxes. Complex data types- Arrays,
Structures and Unions; Single and multi-dimensional
arrays passing between functions, arrays of characters
(strings); structures, arrays of structures passing
between functions. External file handling; Object–
Oriented Programming in C++; classes, object,
inheritances and polymorphism.

CS222 File Processing and Database Management

System (3 Unit)
File processing environment : Definitions of record, file
blocking, compaction, database sequential access;
physical characteristic of sequential media; external
sort/merge algorithms; file manipulations techniques for
updating, deleting and inserting records in sequential
files; Random access; physical characteristics of disk
and other bulk storage devices physical, representation
of data structure on storage device; inverted and indexed
sequential files, back-up, procedure, file recovery
higher level language data management facilities. Use
of Relational Database Management System such as
MySQL.
Page 11 of 68
CS223 Digital Logic Design (3 Units)
Number systems and conversion; Boolean algebra, K-
map, and Logic gates; minimization of switching
functions; combinational network design; flip-flops;
sequential network design; arithmetic networks.
Computer organization. Structure of the CPU: Registers
and Counters, the Computer Memory. Introduce
Assembly Language.

CS224 Computer and Society (2 Unit)

Computing as a profession; software engineering code
of conduct; types of organizations affected by
computers; sociological impacts of computers;
individual and computers; computers as an audit tool;
computers in banking; Computer base information
system and telecommunication; Computers in
Consultancy services; Computers in design and
construction; Computer in Education; Computers and
Electrical Engineering; Computers in Local
Government; Computers in Government; Computers in
Insurance; Computers as aids to lawyers; Computers
and the medical profession; Role of computing in Stock
broking; Computers in health; Computers in the arts and
humanities; Computer crime & Security; The privacy
and Copy right questions and other legal issues;
Computer Centre Management. Latest trend in the
Computer Industry. Exploration of the social, political,
and ethic al issues, ethical issues surrounding the
Computer Industry and evolving information society.
Term Paper on anyone of these topics must be presented
before semester examinations.
Page 12 of 68
300 LEVEL COURSES
CS311 Operating System I (3 Units)
Basic Concepts of operating system. Multiprocessing,
Multiprogramming and Time sharing Operating system,
Multitasking; Processes, Virtual Memory,; Memory
Management, Resource allocation and deadlock.

CS312 Data Structures and Algorithms (2 Units)

Review of elementary data structures and their
applications. Graphs; sub graph, minimum spanning
tree, Depth First Search, Breath First Search. Trees and
tree traversal algorithms.Binary Search Tree (BST),
AVL tree; tree balancing, B tree.Searchingand sorting
algorithms. Symbol table.Hashing.Complexity analysis.
Implementation of the algorithmsshould be using C++.

CS 313 Introduction to Computer Systems (2 Units)

– Prerequisite CS 223
Computer structure and machine language memory
control processing and I/O Units; register’s principle,
machine instruction types and their format; character
representation; programme control; pitch execute cycle
turning; I/O operations, assembly language mnemonic
operations; symbolic addresses, assembler concepts and
instruction format; data-word definition; literals,
addressing techniques; macros; file I/O; assembler
segmentation and linkage; assembler construction;
interpretative routines.

Page 13 of 68
CS314 – Object Oriented Programming (2 Units)
Basic OOP concepts.Structure ofa Java program. Data
type, variables, constants, I/O statements in Java,
Control structures, Type casting and promotion, Array,
String manipulation in Java, Java Packages. Classes,
Objects, Constructors, Fields and Methods.Inheritance,
Polymorphismin Java.Building GUI in Java: swing
library. Event Handling (mouse click, buttons etc).
Database connectivity: JDBC,Hibernate framework.

CS315 – Computer Hardware Maintenance (2 Unit)

Fundamental of digital electronics, Passive and active
maintenance, Trouble shouting techniques, Hardware
and software tools for good computer
maintenance.Coupling/Assembling of computer
systems.Installation of operation system and apps.
LABOROTARY work is required

CS321 Operating Systems II (3 Unit) – Prerequisite

CS311
Introduction to operating system using UNIX as the case
study. System calls and utilities fundamentals of
processes and inter processes communication. Free and
Open Source software concepts; Principles of Computer
Operating Systems concurrent processes, memory
management, job scheduling, multiprocessing file
systems performance evaluation, network.

Page 14 of 68
CS 322 System Analysis and Design (3 Units) –
Prerequisite CS 211
System Concept; System Development Life Cycle
Analysis: Fact gathering Techniques, data flow
diagrams, Process description data modeling. System
Design: Logical design leading to functional
specifications; rapid prototyping, Physical design
leading to detailed specifications, Structure Charts, form
designs, automated Tools for design. Database selection
and integration issues. Software testing and software
quality assurance, system security. System performance
evaluation; end user training; system delivery; Post
implementation review; maintenance and re-
engineering. There should be a course project.

CS323 Human Computer Interaction (2 Units)

Introduction to the basic principles of user interface
design and evaluation. Include the use of interactive
devices, layout, symbolism, colour and other interface
characteristics, tools and methods for evaluating
interfaces, and related topics from human factors and
usability engineering.

CS324 Theoretical Computer Science (3 Units)

Logic set Theory, Functions and relations, induction,
Boolean functions, switching functions, recurrence
relations, recursive algorithms. Proof of Program
correctness, models of computation, including turning
machines, the halting problem, the Post correspondence
problem, Church’s thesis recursively enumerable sets.

Page 15 of 68
Finite state machines and finite automata. Introduction
to formal and recognition by machine

CS325 Organization of Programming Languages (3

Units) – Prerequisite CS 211
Language definition structure; data type and structures;
review of basic data type; including list and trees;
control structures and data flows; run- time
consideration; interpretation languages; Lexical
analysis and parsing. C programming Language.

CS326: Research Methodology (2 Units)

Team Management, Project Scheduling, Software
meansurement and estimation techniques, Risk analysis,
Software quality assurance, Software Configuration
Management, Project Management tools.

400L COURSE
SIWES – Students Industrial Work Experience
Scheme
It is a one year practical training course to be undertaken
by each student in an industry. The scheme is called
Students Industrial Work Experience Scheme (SIWES).
At the end of the training the students are required to
submit a report about what he/she has learnt during this
practical industrial training

Page 16 of 68
500 LEVEL COURSES
CS511 Design & Analysis of Algorithms (3 Units) –
Perquisite CS 312
Principles of good programming styles, expression and
documentation, structured programming concept,
debugging, testing, verifying; Code inspection,
semantic analysis, string procession, data structures;
Recursions; efficiency of algorithms. Design
techniques including Greedy, backtracking, dynamic
programming, divide and conquer, fast Fourier
transform, NP Complete Problems, Hard Problems.
Basic algorithmic analysis: Asymptotic analysis of
Upper and average complexity bounds; standard
Complexity Classes Time and space tradeoffs in
algorithms analysis recursive algorithms.

CS512 Compiler Construction (3 Unit) – Perquisite

CS 324
Concept of Assemblers, Compilers, interpreters and
their design and construction; Polish notation and
translation techniques; Operator precedence parsing and
code generation. Programming Language to be used:
Java

CS513 Fundamentals of Software Engineering (3

Units) – Perquisite CS322
Software crisis. Goals, Scope and principles of Software
Engineering; Software Process, Software process
models: Water fall model, V-model, Prototyping,
Incremental model, Spiral model. Agile Software
Page 17 of 68
Development methodology: Extreme Programming
(XP). Software Design: Architectural design,
Component design, Design patterns, Object Oriented
analysis and design. UML Notations: use case, sequence
diagram, and class diagrams, CRC. Software
Reliability; Verification and Validation, Software
testing; Black box testing, White box testing. Software
Maintenance, Software project management.

CSC 514: Computer Graphics And Visualization (2

Units)
Hardware aspect, plotters microfilm, plotters display,
graphic tablets, light pens, other graphical input aids
Facsimile and its problems Refresh display refresh
huggers, changing images, light pen interaction. Two
and three dimensional transformation, perspective
Clipping algorithms. Hidden line removal bolded
surface removal. Warmock’s method, shading, data
reduction for graphical input. Introduction to hand
writing and character recognition. Curve synthesis and
fitting. Contouring. Ring structures versus doubly
linked lists. Elerarchical structures. Data structure:
Organization for intersotive graphics.

CS515 – Advanced Programming (3 Units) –

Prerequisite CS 314
Advance topics in OOP like Abstract classes, Interface,
Exception handling, Thread, Socket programming, etc
should be covered using either JAVA or VB.net or C#
language

Page 18 of 68
CS521 Computer Networks/Communication (3
Units) – Prerequisites CS311.
Introduction. Types of networks, peer-to-peer and client
server networks, Network topologies, Fourier analysis,
measure of communication, channel characteristics,
transmission media, noise and distortion, modulation
and demodulation, multiplexing, TDM FDM and FCM
Parallel and serial transmission (synchronous Vs
asynchronous). Bus structures and loop systems,
computer network Examples and design consideration,
data switching principles broadcast techniques, network
structure for packet switching, protocols, description of
network e.g. ARPANET, etc. Advanced issues such as
Gigabit networks; ATM networks; and real-time
Communications.

CS522 Database Management Systems (3 Units) –

Prerequisite CS222.
Database Management Systems; review of basic
concepts; data representation; entity-relation model;
design of database systems; relational, hierarchical, and
network approaches. Security and integrity of
databases. Database programming languages.
Programming Languages to be used Visual Basic,
MYSQL.

CS523 Computer Architecture (3Units) –Prerequisite

CS 313.
Basic logic design, data representation; instruction
formats; introduction to design for the synthesis of
digital computers; principles of computer structure and
Page 19 of 68
design as applied to major computer functions. Memory
system; general characteristics of memory operations;
memory addressing, memory hierarchy, virtual memory
control systems. Hardware control, micro programmed
control. Synchronous control, I/O control. Introduction
to the methodology of fault-tolerant computing. Study
the architecture of an actual simple mini/micro-
computer.

CS524 Artificial Intelligence & Expert Systems

(3 Unit) – Prerequisite CS 312
Understanding natural languages, knowledge
representation, search strategies, symbolic logic expert
systems and applications; programs which play games,
prove theorems, handle language recognize patterns,
and learn; Expert System and Applications; Robotic;
Emphasis upon the mathematical techniques and
programming methods used, representation and
problem solving in LISP/CLIPS.

CS525: Net Centric Computing (2 Units)

Distributed Computing. Wireless and Mobile Network.
Network security. Web application/Mobile Application
Development.

CS599 Project (6 Units)

MTH212: Mathematical Method – Pre-requisite

MTH 112 (3 Units)
Real-valued functions of a real variable. Review of
differentiation and integration and their applications.
Page 20 of 68
Mean value theorem. Taylor series. Real-valued
functions of two or three variables. Partial derivatives
chain rule, extrema, languages multipliers. Increments,
differentials and linear approximations. Evaluation of
line, integrals. Multiple integrals.

Page 21 of 68
 2.0. LEVEL AND SEMESTER COURSES FOR
B.TECH. MATHEMATICS
100 LEVEL COURSES
FIRST SEMESTER 100 LEVEL
FIRST SEMESTER
Course Pre-
Course Title L T P CU
Code Requesite
MTH111 Elementary Algebra I 2 1 0 3 -
MTH112 Calculus I 2 1 0 3 -
MTH113 Geometry 2 1 0 3 -
MTH114 Discrete Mathematics I 1 1 0 2 -
Intr. Mechanics &
PHY111 2 1 0 3 -
Properties of Matter
PHY117 Basic Exp. Physics I 0 0 3 1 -
GNS111 Use of English I 2 0 0 2
CHM111 General Chemistry I 2 1 0 3
General Chemistry I
CHM113 0 0 3 1
Lab
Introduction to Prob. &
ST111 2 0 0 2 -
Prob. Distributions
TOTAL UNITS 23

SECOND SEMESTER 100 LEVEL

SECOND SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
MTH121 Elementary Algebra II 2 1 0 3 -
MTH 122 Calculus II 2 1 0 3 -
MTH 123 Set Logic and Algebra 1 1 0 2 -
Page 22 of 68
MTH124 Vectors and Dynamics 1 1 0 2 -
ST 121 Descriptive Statistics 2 0 0 2
Intro. Optics & Modern
PHY 122 2 1 0 3 -
Physics
Basic Experimental
PHY 127 0 0 1 1 -
physics II
GNS 121 Use of English II 2 0 0 2 -
Intro to Computer
CS 121 2 1 3 -
Science II
TOTAL UNITS 21

200 LEVEL COURSES

FIRST SEMESTER 200 LEVEL
FIRST SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
MTH211 Linear Algebra I 2 1 0 3 MTH121
MTH213 Analysis I 2 1 0 3 -
MTH214 Elementary Differential
1 1 0 2 MTH112
Equations
PHY211 Intermediate Mechanics 2 1 0 3 PHY111
Discrete and Continuous
ST211 Prob. and Probability 3 0 0 3 ST111
Distributions
GNS211 Information Science 2 0 0 2 -
CS211 Computer Programming I 1 1 0 3 CS121
*GNS111 Use of English I 2 0 0 2
TOTAL UNITS 19/21
* To be registered by DE students

Page 23 of 68
 SECOND SEMESTER 200 LEVEL
SECOND SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
MTH221 Linear Algebra II 2 1 0 3 MTH211
MTH223 Analysis II 2 1 0 3 MTH213
Intro to Math
MTH224 2 1 0 3 -
Modeling
Introduction to
MTH225 2 1 0 3 -
numerical Analysis
ST 221 Statistical Method I 3 0 0 3 ST 122
Nigerian people and
GNS221 2 0 0 2 -
culture
Peace & conflict
GNS222 1 1 0 2 -
resolution studies
Computer
CS 221 1 0 1 2 CS211
Programming II
*GNS121 Use of English II 2 0 0 2 -
TOTAL UNITS 21/23
* To be registered by DE students

300 LEVEL COURSES

FIRST SEMESTER 300 LEVEL
FIRST SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
MTH311 Abstract Algebra I 2 1 0 3 MTH123
MTH312 Analysis III 2 1 0 3 MTH223
MTH313 Numerical Analysis I 2 1 0 3 MTH225
MTH314 Operation research 3 1 0 3 -
Page 24 of 68
MTH315 Differential Equations I 2 1 0 3 MTH214
ST314 Probability Theory I 3 0 0 3 ST211
GNS311 Entrepreneurship and
2 0 0 2
Innovation
TOTAL UNITS 20

SECOND SEMESTER 300 LEVEL

SECOND SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
MTH321 Abstract Algebra II 2 1 0 3 MTH311
MTH322 Topology I 2 1 0 3 MTH123
MTH323 Complex Analysis I 1 1 0 3 -
MTH324 Discrete mathematics II 2 1 0 3 MTH114
MTH326 Numerical Analysis II 1 1 0 3 MTH313
MTH327 Mathematical method 2 1 0 3 MTH214
ST325 Time Series Analysis 3 0 0 3 ST122
Business Creation &
GNS321 2 0 0 2
Growth
TOTAL UNITS 23

400 LEVEL COURSE

Code Course Title Credit Unit
Students Industrial Work
SIWES 8
Experience Scheme

Page 25 of 68
 500 LEVEL COURSE
FIRST SEMESTER 500 LEVEL
FIRST SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
MTH511 Topology II 2 1 0 3 MTH322
Ordinary Differential
MTH512 2 1 0 3 MTH327
Equation
Measure and
MTH513 2 1 0 3
Integration
MTH514 Fourier Analysis 2 1 0 3 MTH312
Electives 6
TOTAL UNITS 18
Electives Courses
A minimum of six (6) credit units, to be chosen from
the following.
Pre-
FIRST SEMESTER
Requisite
MTH515 Complex Analysis II 3 MTH323
MTH516 Differential Geometry 3 MTH222
MTH517 Algebraic Geometry 3 MTH321
MTH518 Representation of Finite Groups 3 MTH311
MTH519 Algebraic Topology 3 MTH321
MTH530 Quantum Mechanics 3 MTH327
MTH531 Elasticity 3 MTH327
Note: The electives to be mounted shall be decided by the
department.

Page 26 of 68
 SECOND SEMESTER 500 LEVEL
SECOND SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
MTH521 Number Theory 2 1 0 3 MTH321
Partial Differential MTH512
MTH522 2 1 0 3
Equations
MTH523 Functional Analysis 2 1 0 3 MTH511
MTH 599 Project 0 0 0 6 SIWES
Electives 6
Total Units 21

Electives Courses
A minimum of six (6) credit units to be chosen from
the following
Pre-
SECOND SEMESTER
Requisite
MTH524 Abstract Algebra III. 3 MTH321
MTH525 Field Extension & Galois Theory 3 MTH321
MTH526 Theory of Categories 3 MTH321
MTH527 Non-associative Algebraic Systems 3 MTH311
MTH528 Topological Groups I 3 MTH311
MTH529 Theory of Finite groups 3 MTH311
MTH540 Biomathematics 3 MTH327
MTH541 Wave Theory 3 MTH327
MTH542 Fluid Mechanics 3 MTH512
Note: The electives to be mounted shall be decided by the
department.

Page 27 of 68
2.1. COURSE DESCRIPTIONS
100 LEVEL COURSES
MTH 111: Elementary Algebra I (3 Units)
Trigonometric functions: Radian measure. Laws of sine
and cosine. Sum, difference and product formulae.
Trigonometric identities. Inverse trigonometric
functions. Solution of trigonometric equations.
Exponential and logarithmic functions: Indices and
Logarithms, Definitions of 𝑒 𝑎𝑥 , for any positive number
a and any real number x, Definition of log x, Laws of
exponents and of logarithms. The natural exponential
and natural logarithmic functions.
Algebraic functions: Solution of polynomials functions,
Division algorithm, synthetic division, factor theorem,
remainder theorem, partial functions decomposition.
Roots of rational functions: finding the domain.
Complex numbers: Representative in the plane. Sum,
product, quotient. Modules, argument. Complex
conjugate and its properties, polar representation, unit
circle, nth roots. De moivre’s theorem. Zeroes of
polynomials, quadratic formula.

MTH 112: Calculus I (3 Units)

Real numbers: The number line, intervals, properties of
absolute value, Solving inequalities, sign chart.
Function from R to R; Domain, range, graph,
Monotonically increasing and decreasing functions,
inverse functions, Composition of functions, Even and
odd functions, periodic functions, Limits; Continuity.

Page 28 of 68
Differentiation: Differentiability at a point and on an
interval, Sum, product and quotient rule. Chain rule for
inverse functions. Implicit differentiation.
Integration: Fundamental theorem of Calculus.
Integration by parts, change of variable, integration of
rational functions, trigonometric substitutions,
trigonometric integrals, Trapezium rule, Simpson’s rule.

MTH 113: Geometry (2 Units)

Introduction to vectors: Three-dimensional vectors,
Addition and scalar multiplication, Dot product and
cross product, Norm of a vector, Translations, rotations,
reflections and projections, lines and planes: Equations
and parametric representations, Angle between line and
plane, between planes, perpendicularity.
Figures in space: Poly-hadrons, prisms, cylinder,
pyramids, cones. Area and volume, quadric surfaces.
Polar, cylindrical and spherical coordinates.

MTH 114: Discrete Mathematics I (2 Units)

Graphs and digraphs: Elementary concepts. Multi-
graphs. Loops. Planar graphs, complete graphs and
digraphs. Incidence and adjacency matrix. Walks,
trails, paths. Cycles. Vertex coloring. Mathematical
induction. Binomial theorem. Summation notation.
Sequence. Recursive definition. Series: Partial sums,
convergence criteria.

MTH 121: Elementary Algebra II (3 Units)

Plane analytic geometry: Rectangular coordinates,
plane coordinates of two-dimensional vectors, Addition
Page 29 of 68
and scalar multiplication. Curves: Locus of an
equation, Polar and parametric equations, Lines and
conic sections, Distance formulae, Tangents and
normals, Transformations of the plane. polar
coordinates of 2-dimensional vectors: Matrices:
Addition and multiplication, associative and distributive
laws, identity and squares matrices, Adjugate matrix.
Determinants, nonlinear equations in n unknowns,
Gaussian elimination. Gauss-Jordan method for the
inverse Crammar’s rule. .

MTH 122: Calculus II (3 Units)

Application of differentiation: Extreme of a function (on
restricted domain), concavity, points of inflection,
tangents to a curve. Mean value theorem, Taylor’s
formula. L’ Hospital’s rule. Application of integration:
Area under the graph of a function, area of a sector
(polar coordinates) and arc length. Functions of several
variables: Limits, continuity, Partial differentiation:
Total derivation. Chain rule. Tangent line to a space
curve. Tangent plane to a surface. Maxima and minima.

MTH 123: Set, Logic and Algebra (2 Units)

Basic set operation: Union, Intersection, difference,
complement, inclusion, Binary relations: fundamental
theorem of equivalence relation. Functions:
Fundamental theorem of Arithmetic, Fermat’s theorem,
Euler’s existence of Fermat’s theorem. Algebraic
structures, examples. Binary operations, closeness,
associativity, inverse and identity, Groups, Rings.

Page 30 of 68
MTH 124: Vectors and Dynamics (2 Units)
Geometric representation of vectors in 1-3 dimensions,
components, direction cosines. Addition and Scalar
multiplication of vectors, linear dependence and
independence of vectors. Dot products. Differentiation
and integration of vectors. Dynamics: kinematics of
particles, velocity and acceleration, force, momentum,
laws of motion, gravity, projectiles, elasticity, simple
pendulum and impulse, impact of two smooth spheres.

200 LEVEL COURSES

MTH 211: Linear Algebra I (3 Units) – Pre-requisite
MTH 121
Vector spaces, subspaces, linear combinations,
generators, linear independence, basis, dimension,
column space, row space and null space of a matrix.
Rank of a matrix. Simultaneous linear equations.
Echelon form of a matrix. Homogeneous and
inhomogeneous systems, particular solution and general
solution. Linear mapping. Matrix of a linear mapping,
kernel and image of a linear mapping. Composition and
inverse. The effect of a base change on the matrix of a
linear map. Determinants. Formulae for the
determinant expansion according to row or column.
Properties of determinants. Sub-determinants. Adjugate
matrix. Crammar’s rule, volume of a parallelepiped.

Page 31 of 68
MTH 213: Analysis I (3 Units)
Essential notions of mathematical analysis:
Mathematical problems arising from the description of
motion; instantaneous velocity and mathematical notion
related with it; mathematical problem of the calculus of
path. Essential theorems of continuous and
differentiable functions. Lagrange’s formula.
Application of Maclaurin’s formula for asymptotic
estimate of elementary functions, and computation of
limits. Differentials; The invariant property of the first-
order differentials of functions of one or several
variables; differentials of higher orders, Euler’s
theorem, elementary differential geometry.

MTH 214: Elementary Differential Equation I – Pre-

requisite MTH 112 (3 Units)
Derivation of differential equation by eliminating
arbitrary constants of functions, order and degree of
differential equation, First order ordinary differential
equations: Exact differential equations. Separation of
variables, Homogeneous differential equation. Linear
differential equations, Bernoulli’s equation, second
order differential equations, reduction of order, Methods
of undetermined coefficients, Method of variation of
parameters. Series solution of second order equations.
The general theory of nth order linear equations.
Application of ODE to physical, life and social sciences

Page 32 of 68
MTH 221: Linear Algebra II (3 Units) – Pre-
requisite MTH 211
Bilinear forms, Hermiltian forms, Quadratic forms,
symmetric, Hermitian, Unitary operators scalar
products and orthogonality. Positive definite matrices.
Gram-Schmidt orthogonialization. Orthogonality of
null-space and rowspace of a matrix. Eigenvalues and
eigenvectors. Characteristic polynomial, triangulation.
Theorem of Hamilton-Cayley. Diagonalization of
unitary matrices. Special theorem. Decomposition of a
vector space. Schur’s Lemma, Jordan normal form.

MTH 223: Analysis II (3 Units) – Pre-requisite

MTH213
Infinite series: Definition, theorem, series, series of
positive terms, alternating series; absolute and
conditional convergence. Series of functions:
Definition, dominated series, properties of functional
series, power series, radius of convergence. Taylor and
Maclaurin series, standard expansions. Integral:
Properties of definite Riemann’s integral, evaluation of
definite integrals, improper integrals, infinite range,
integral infinite in range, differentiations, and
integration of definite integral.

MTH 224: Introduction to Mathematical Modeling

(3 Units)
Notion of modeling: Methodology of model building,
identification, formulation and solution of problems,
cause-effect diagrams, equation types, Algebraic,
ordinary differential, partial differential, difference,
Page 33 of 68
integral and function equations. Application of
mathematical models to physical, biological, social and
behavioural sciences.

MTH 225: Introduction to Numerical Analysis (3

Units)
Solution of algebraic and transcendental equations,
error analysis, interpolation approximation, curve
fittings, zeros of non-linear equations of single variable,
systems of linear equations, numerical differentiation
and integration, Initial Value Problems for ordinary
differential equations.

MTH 311: Abstract Algebra I (3 Units) - Pre-

requisite MTH 123
Binary operations, group and subgroups. Group actions,
cosets, Lagrange’s theorem, class equation. Permutation
groups, alternating groups, generators, free groups.
Elementary definitions of rings, integral domain, ideals,
field.

300 LEVEL COURSES

MTH 312: Analysis III (3 Units) – Pre-requisite
MTH 223
Theory of field: Scalar and vector field, divergence
gradient and curl; general equation of a conic section;
Laplace’s and Poisson’s equation Integrals:
Independence of the line integral from the path: integral
with respect to parameter; Green’s formula, Gauss-
Ostrogradsky theorem. Harmonical analysis: Fourier
Page 34 of 68
series: Dirichlet’s sum, test for convergence of four
series; expansion of a periodic function. Fourier series
for even and odd functions; Fourier intergral, its
convergence; Dirichlet’s intergral. Introduction to
partial differential equation.

MTH 313: Numerical Analysis I (3 Units)Pre-

requisite MTH 221 & MTH 212
Solution of single algebraic equations: Newton’s
method, Bairstow’s method. Interpolation solution of
systems of equations: Matrix algebra, Gaussian
method, LU decomposition, iterative methods, matrix
inversion, interpolating polynomials. Numerical
differentiation and integration. Numerical solution of
ordinary differential equations. Initial and boundary
value problems. Euler’s method, Taylor series method,
Runge-Kutta, predictor-corrector methods, multi-step
methods. Systems of equations and higher order
equations. Finite difference calculus: Difference
equations.

MTH 314: Operations Research I (3 Units)

Linear programming: Simplex method. Dual simplex
method. Postoptimality sensitivity analysis.
Parametric linear programming. Transportation of
problem. Non-linear programming: Classical
optimization theory, unconstrained and constrained
problems. Non-linear programming algorithms,
integer programming: Integer linear programming,
integer non-linear programming.

Page 35 of 68
MTH 315 Differential Equations I (3 Units)
Linear second order differential equations with constant
coefficient: The solution of homogeneous equations
using Differential operator method, finding particular
integral for non-homogeneous linear differential
equations, Laplace transform: properties of Laplace
transform, transform of derivatives, transform of
integrals, solution of differential equation using Laplace
transform and applications of Laplace transform to
physical sciences.

MTH 321: Abstract Algebra II (3 Units)- Pre-

requisite MTH 311
Normal subgroups, conjugate subgroups, centre of a
group, normalizer, quotient group, cyclic group,
homomorphism and isomorphism. Fundamental
theorem of homomorphism. Direct product, Sylow’s
theorems, quotient rings. Field of fraction of an integral
domain, characteristics of a ring, ring of polynomials,
factorization of polynomials, zeros of polynomials, field
extension.

MTH 322: Topology I (3 Units) – Pre-requisite MTH

123
Metric space: Open and closed sets, equivalent metrics,
continuity, convergence, completeness. Topological
spaces; boundary, interior, closure. Bases and sub-
bases, continuity, convergence. Compactness,
connectedness, separation. Product spaces.

Page 36 of 68
MTH 323: Complex Analysis I (3 Units)
Function of a complex variable. Limit and continuity of
a complex valued function of a complex variable,
Differentiation of complex functions, Cauchy-Riemann
equations. Complex integration, Cauchy’s integral
formula, Morera’s theorem, Cauchy’s inequality,
Liouvilles’ theorem, Singularities, Taylor’s and
Laurent’s theorems, calculus of residues and its
application to evaluation of integrals and summation of
series, Maximum modulus principle, Argument
principle, Principle of analytic continuation, Conformal
mappings, Schwarz-Christoffel transformation.

MTH 324: Discrete Mathematics II (3 Units)

Graph theory. Definition of graph and digraph.
Complete graphs Bipartite graphs, planner graphs.
Subgraphs. Walks, path, cycles, connectedness.
Applications. Shortest path problem. Trees, spanning
trees the connector problem. Eulerian and Hamiltonian
graphs. Coloring reachability in a digraph. Network
flows. Generating functions, recurrence relations.

MTH 325: Operations Research II (3 Units) – Pre-

requisite MTH 314
Project scheduling by PERM-COM. Network
representations Stochastic programming: Stochastic
linear programming. Stochastic non-linear
programming. Stochastic dynamic programming.
Dynamic Programming: Decision theory and Games:
Decisions under risk. Decisions under uncertainty.

Page 37 of 68
Game theory. Inventory models: Deterministic and
probabilistic models.

MTH 326: Numerical Analysis II (3 Units) – Pre-

requisite MTH 313
Analysis of errors. Finite difference formulation of
parabolic, elliptic and hyperbolic differential equations.
Implicit and explicit problems. Discrete variable
methods for solution of IVPs, Discrete and continuous
Tan method for solving IVPs, Galerkin method.
Introduction to finite element method. Stability and
error analysis.

MTH 327: Mathematical Methods (3 Units) - Pre-

requisite MTH 214
Calculus of variations. Functional, conditions for an
extremum, Hamilton’s principle, Lagrange’s equation
(2 dimensional). The vibrating string, Isoperimetric
problems, constrained extremum, Lagrange’s
multipliers. Introduction to tensors. Elementary partial
differential equations and initial boundary value
problems.

400 LEVEL COURSE

SIWES – Students Industrial Work Experience
Scheme
It is a one year practical training course to be undertaken
by each student in an industry. The scheme is called
Students Industrial Work Experience Scheme (SIWES).
At the end of the training the students are required to

Page 38 of 68
submit a report about what he/she has learnt during this
practical industrial training

500 LEVEL COURSES

MTH 511: Topology II (3 Units) - Pre-requisite MTH
322
Topological spaces. Definitions, open and close sets,
limit points, coarser and finer topologies. Bases and
subspaces of topological space, quotient topology. First
and second countable spaces. Separable spaces,
separation axioms. Topology of matrix spaces,
convergence of sequence in topological spaces,
pointwise and uniform convergence. Limit of functions
of Hausdorff spaces. Continuous mappings, open and
close mapping. Connectedness, connected set as
intervals. Image of connected set under continuous
mapping. Introduction to homotopy and paths.
Fundamental groups.

MTH 512: Ordinary Differential Equation (3 Units)

– Pre-requisite MTH 327
Solution methods and basic theory of linear and non-
linear system: Stability and asymptotic behaviour of
linear (non-linear) systems. Existence theorem (Peano)
for systems of differential equations continuation of
solutions. Fixed point and substitution methods.
Properties of homogeneous and inhomogeneous
equations. Boundedness of solution, oscillatory
equations. Stability by Liapunor’s method.
Autonomous, non-autonomous systems perturbation
Page 39 of 68
and converse theorems. Existence of periodic solutions,
fundamental theorem, Green’s functions, Schroedinger
equations, Lioluvlle theory. Two-dimensional system
of differential equations. Some topics in integral
equations.

MTH 513: Measure and Integration (3 Units)

Algebra, Borel’s sets, Lebesgue measure, Lebesgue
integral. Measure spaces, measureable functions,
integrations singed measures, the Radom-Nikodym
theorem. The P-spaces. The Lebesgue-stilthes integral.

MTH 514: Fourier Analysis (3 Units) – Pre-requisite

MTH312
Fourier analysis: periodic functions. Orthogonal
functions. Even and odd functions Fourier series.
Dirichiet’s conditions. Half – range series complex form
of Fourier series paraservals theorem. Evaluation of
Fourier coefficient. Fourier integrals. Fourier integrals
formula Weleterass M. test sectional continuity function
of exponential order. Reimann lebesgue theorem
Fourier integrals theorem. Different forms of Fourier
integrals formula. Diridilets’s integral fejer’s integrals.
Application of Fourier integral formula

MTH 515: Complex Analysis II (3 Units) – Pre-

requisite MTH 323
Cauchy’s theorem for triangular contours. Cauchy’s
theorem for starlike domains. Applications. Global
analysis. Taylor expansions. Properties of series. Entire
functions. Mesomorphic functions. Weierstrass
Page 40 of 68
expansion. Topological index. Mitfag-Leffler’s
expansion. The open mapping theorem. The maximum
modules principle. Conformal mapping. Discussion of
the Riemann mapping theorem. The automorphisms of
a domain. Mapping of the boundary. Some illustrative
mapping. Analytical continuation. Direct analytical
continuations. General analytical functions. Complex
analytic manifolds. The Gamma and Zeta functions.

MTH 516: Differential Geometry (3 Units) – Pre-

requisite MTH 322
Curves in Euclidean space, Frennet-Serret formulae,
tensor algebra on manifold, tensors of second rank,
elements of Riemann geometry, vector and tensor
calculus in Riemann spaces. Hypersurfaces in Euclidean
space. Fundamental forms, principal curvatures,
geodesics.

MTH 517: Algebraic Geometry (3 Units) – Pre-

requisite MTH 321
Affine varieties. Protective varieties. Local rings.
Structure sheaf, Tangent space. Divisors. Linear
systems of divisors.

MTH 518: Representation of finite Groups (3 units)

– Pre-requisite MTH 311
Representations, reducibility. Induced representations.
Characters, Schur’s Lemma. Orthogonally of
characters. Representations of symmetric groups,
symmetric groups. Representation of p-groups.

Page 41 of 68
MTH 519: Algebraic topology (3 Units) – Pre-
requisite MTH 321
Simplical complexes, simplical homology. Homotopy.
Triangulations. Computation of homology of n-
dimensional sphere. The Mayo- Vietoris exact
sequence.

MTH 521: Number Theory (3 Units) – Pre-requisite

MTH 321
Congruences. Chinese remainder theorem. Linear
Diophantine equations. Quadratic residues. Law of
quadratic reciprocity. Continued fractions. Quadratic
irrationality. Bell’s equations. Sums of two and four
squares. Arithmetic functions and the greases integer
function. The Mobius function. Algebraic numbers and
algebraic integers. Integers in quadratic fields.
Fermat’s last theorem.

MTH 522: Partial Differential Equation (3 Units) –

MTH512
Classification of partial differential equations of second
order. Dirichlet problems for elliptic equations.
Maximum principle. Neumann problems for elliptic
equations. Maximum principle. Green’s formula.
Critical boundary value problems for hyperbolic
equations, Fouriers’ method, and initial boundary value
problems for hyperbolic equations.

Page 42 of 68
MTH 523: Functional Analysis (3 Units) – Pre-
requisite MTH 511
Metric spaces: Contraction mapping theorem. Arzela-
Ascoti theorem. Topological vector spaces: Normed
spaces; spaces of measurable functional other normed
spaces of functions, Banach spaces, dual spaces, the
Hahn theorem. Hilbert spaces: Linear operators and
functionals, Hilbert spaces. Orthogonal complements.
Orthonormal sets. Selfadjoint, unitary and normal
operators.

MTH 524: Abstract Algebra III (3 Units) – Pre-

requisite MTH 321
Theory of ideals in commutative rings. Noetherian
rings. Principal ideal domains, Euclidean rings. Product
and quotients of ideas. Prime ideals. Factorization of
ideas. Theory of polynomial ideas. Algebra manifolds,
zeros of a prime ideal dimension. Modules over a
commutative unitary ring. Submodules, factor modules,
homomorphism, kernel of homomorphism.
Factorization of homomorphism. Jordan-Holder
theorem, length of a module exact sequences.
Generators, free modules. Protective and injective
modules, Tensor products, flat modules.

MTH 525 Field Extension and Galois Theory (3

Units) – Pre-requisite MTH 321
Extension of fields, Finite extensions, Algebraic
extensions, Minimal polynomial of an element, Multiple
roots of a polynimial, Splitting field of a polynomial
over a field, Existence and uniqueness of splitting field,
Page 43 of 68
Normal extensions, Automorphisms of a field, F-
automorphisms of the extension field K of F, Galois
group of a polynomial, Fundamental theorem of Galois
Theory, Construction with straight edge and compass.

MTH 526: Theory of Categories (4 Units) – Pre-

requisite MTH 321
Categories, diagrams and factors, complete categories,
group valued factors, adjoint functions, applications of
adjoint functions, extensions, satellites, global
dimension. Sheaves.

MTH 527: Non-Associative Algebra Systems (3

Units) – Pre-requisite MTH 311
Quasi-groups, loops, normal sub-loops.
Homomorphism, isomorphism and isotropy, Mounfang
loops and Bo loops. Arbitrary non-associative algebra.
Malcev algebra.

MTH 528: Topological Groups I (3 Units) – Pre-

requisite MTH 311
Topological groups and their basic properties,
subgroups. Normal subgroups, factor groups,
isomorphism, homomorphism. The direct product of
topological groups. Connected and totally disconnected
groups, linear representations of compact topological
groups.

Page 44 of 68
MTH 529: Theory of Finite groups (3 units) – Pre-
requisite MTH 311
Definition and example of p-group. Sylow’s p-group.
Determination of all groups of low order (upto order
15). Groups of automorphisms. Burnside lemma.
Normal structures of groups, composition series,
derived series. Jordan-Holder’s theorem, soluble and
nilpotent groups. Group Algorithms and Programming
(Gap)

MTH 530: Quantum Mechanics (3 Units) – Pre-

requisite MTH 327
Review of classical mechanics: Lagrange’s and
Hamilton’s equations; equations of motion in poisson
bracket notations; Hamilton-jacobi equation. The old
quantum theory: Failure of classical mechanics; origin
and failure of the old quantum theory; Bohr-
Sommerfield quantumization rules. The new quantum
mechanics. The Schrodinger’s equation and application
to simple systems, energy levels. Operator methods,
observations values and constants of motion. Wave
packets Heisenberg and Schrodinger representations.
Approximate methods in quantum mechanics including
the variation method, stationary and the dependent
perturbation theories.

MTH 531: Elasticity (3 Units) – Pre-requisite

MTH327
Stress-Stain Analysis. Field equations and boundary
value problems. Variational methods of the theory of
elasticity. Benidning, bucklind and torsion. Complex
Page 45 of 68
variable methods. Tree dimensional problems. Elastic
waves. Vibrators. Introduction to plasticity. Stress
spaces, loading path yield surfaces. Various
deformation and incremental theories. Boundary value
problem of plasticity.

MTH 540: Biomathematics (3 Units) – Pre-requisite

MTH 327
Mathematical Genetics: Genetics metrics, Hardy-
Weinberg Law Naye’s theorem and its applications in
genetics. Mathematical theory of epidemics: some
epidemic models, deterministic model (i) with removal
(ii) with no removal and migration.

MTH541: Wave Theory (3 Units) – Pre-requisite

MTH327
The general wave equation and its solution: Wave on
stringer: Waves in membranes, normal co-ordinates;
longitudinal waves in bars and springs; waves in liquids,
surface waves, sound waves, boundary conditions,
electric waves, Maxwell’s equations, shook waves.

Page 46 of 68
 3.0. LEVEL AND SEMESTER COURSES FOR
B.TECH. STATISTICS

100 LEVEL COURSES

FIRST SEMESTER 100 LEVEL
FIRST SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
MTH111 Elementary Algebra I 2 1 0 3 -
MTH112 Calculus I 2 1 0 3 -
Introduction to Prob. &
ST111 2 0 0 2 -
Prob.Distributions
Basic Concept of
ST112 2 0 0 2 -
Sample Survey
Intro. Mechanics &
PHY111 2 1 0 3 -
Properties of Matter
PHY117 Basic Exp. Physics I 0 0 3 1 -
GNS111 Use of English I 2 0 0 2 -
Introduction to
CS111 3 0 0 3
Computer Science I
CHM111 General Chemistry I 3 0 0 3
General Chemistry I
CHM113 0 0 3 1
Lab
TOTAL UNITS 23

Page 47 of 68
 SECOND SEMESTER 100 LEVEL
SECOND SEMESTER
Course Pre -
Course Title L T P CU
Code Requisite
MTH 121 Elementary Algebra II 2 1 0 3 -
MTH 122 Calculus II 2 1 0 3 -
MTH 123 Set Logic and Algebra 1 1 0 2 -
Introduction to -
CS 121 3 0 0 3
Computer Science II
Intro. Optics & Modern -
PHY 122 2 1 0 3
Physics
Basic Experimental 1 -
PHY 127 0 0 3
Physics II
GNS121 Use of English II 2 0 0 2 -
ST 121 Descriptive Statistics 2 0 0 2
Introduction to
ST 122 2 0 0 2
Statistical Inference
TOTAL UNITS 21

200 LEVEL COURSES

FIRST SEMESTER 200 LEVEL
FIRST SEMESTER
Course Pre -
Course Title L T P CU
Code Requisite
MTH211 Linear Algebra I 2 1 0 3 MTH121
MTH213 Analysis I 2 1 0 3 -
Elementary
MTH214 1 1 0 2 MTH112
Differential Equations
Discrete and Cont. Prob.
ST211 3 0 0 3 ST111
and Prob. Distributions
Page 48 of 68
 ST121 or
ST212 Analysis of variance I 3 0 0 3
122
Computer
CS211 3 0 0 3 CS 121
Programming I
GNS211 Information Science 2 0 0 2 -
*GNS111 Use of English II 2 0 0 2 -
TOTAL UNITS 19/21
Note: * is to be registered by DE students
Service courses:
Course Course Title Pre-
L P TU
Code Requisite
Intro. Statistics &
ST213 3 0 0 3
Elementary Prob. Theory

SECOND SEMESTER 200 LEVEL

SECOND SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
MTH221 Linear Algebra II 2 1 0 3 MTH211
MTH223 Analysis II 2 1 0 3 MTH213
Intro to Mathematical
MTH224 2 1 0 3 -
Modeling
ST221 Statistical Method I 3 0 0 3 ST 122
Sampling Distributn &
ST222 3 0 0 3 ST 111
Distributn. Techniques
Nigerian People and
GNS221 2 0 0 2 -
Culture
Peace & conflict
GNS222 2 0 0 2 -
resolution studies

Page 49 of 68
 Computer
CS221 1 0 1 2 CS211
Programming II
*GNS121 Use of English II 2 0 0 2 -
TOTAL UNITS 21/23
Note: * is to be registered by DE students
Service courses:
Course Course Title Pre-
L P T U
Code Requisite
Statistics for Physical
ST224 2 - - 2 -
Science (Service course)
ST223 Basic Elementary Statistics 3 - - 3 -

300 LEVEL COURSES

FIRST SEMESTER 300 LEVEL
FIRST SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
ST311 Statistical Methods II 3 0 0 3 ST 221
ST221 or
ST312 Statistical Inference 3 0 0 3
122
Design and Analysis of
ST313 3 0 0 3 ST 212
Experiments I
ST314 Probability Theory I 3 0 0 3 ST 211
ST111 or
ST315 Industrial Statistics I 3 0 0 3
121
ST316 Sampling Techniques I 3 0 0 3 ST 112
Entrepreneurship and
GNS311 2 0 0 2 -
Innovation
MTH314 Operational Research I 3 0 0 3 -
TOTAL UNITS 23
Page 50 of 68
 SECOND SEMESTER 300 LEVEL
REVISED CURRICULUM
Course Pre -
Course title L T P CU
Code Requisite
ST 211 or
ST321 Decision Theory 3 0 0 3
222
ST322 Survey Methodology 3 0 0 3 ST 112
ST323 Biometry 3 0 0 3 -
ST324 Educational Statistics 3 0 0 3 ST 121
ST325 Time Series Analysis 3 0 0 3 ST122
MTH325 Operation Research II 2 1 0 3 -
Business Creation &
GNS321 2 0 0 2 -
Growth
TOTAL UNITS 20

400 LEVEL COURSE

Code Course Title Credit
Unit
Students Industrial Work
SIWES 8
Experience Scheme

Page 51 of 68
 500 LEVEL COURSES
FIRST SEMESTER 500 LEVEL
FIRST SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
ST512 Regression Analysis 3 0 0 3 ST221
ST513 Stochastic Processes 3 0 0 3 ST 314
ST514 Analysis of Variance II 3 0 0 3 ST 212
ST515 Demography 3 0 0 3 -
Computer Aided Statistical
ST516 3 0 0 3 ST 121
Data Processing & Analysi
Elective 3
TOTAL UNITS 18

Elective Courses
A minimum of 3 credit units to be chosen from the
following
Course L P T U Pre-
Course Title
Code Requisite
ST511 Probability Theory II 3 0 0 3 ST 314
ST517 Psychometrics 3 0 0 3 ST311 or 322
ST518 Econometrics 3 0 0 3 ST 221
Note: The electives to be mounted shall be decided by the
department.

Page 52 of 68
 SECOND SEMESTER 500 LEVEL
SECOND SEMESTER
Course Pre-
Course Title L T P CU
Code Requisite
ST599 Project 0 0 0 6 SIWES
ST221 or
ST521 Multivariate Analysis 3 0 0 3
311
Non Parametric
ST522 3 0 0 3 ST 311
Statistical Methods
Design & Analysis of
ST524 3 0 0 3 ST 313
Experiments II
Elective 3
Total Units 18

Elective Courses
A minimum of 3 credit units to be chosen from the
following
Course L P T U Pre-
Course Title
Code Requisite
ST 523 Sampling Techniques II 3 0 0 3 ST 316
ST 525 Industrial Statistics II 3 0 0 3 ST 315
ST 526 Bayesian Inference 3 0 0 3 ST 312
Simulation and Monte-
ST527 2 0 0 2
Carlo Method
Note : The electives to be mounted shall be decided by the
department.

Page 53 of 68
3.1. COURSE DESCRIPTIONS

100 LEVEL COURSES

ST 111 - Introductions to Probability and
Probability Distributions (2 Units)
Concept of permutation and combination, Random
experiment, Sample space, event space, definitions of
probability, conditional probability, addition and
multiplication theorems, definition of random variable
(discrete and continuous), mathematical expectations of
a random variable, addition and multiplication theorems
of expectation, Some basic theoretical distribution:
Bernoulli; Binomial; Poisson; Hyper-geometric;
Uniform; and Normal distributions.

ST 112 - Basic Concept of Sample Survey (2 Units)

Population census and sample survey, comparison of
sample and census, sampling and non-sampling errors.
Definition of concepts in sampling, concept of sampling
with and without replacement, various sampling
techniques, the use of Random numbers and estimations
based on simple random sampling.

ST 121 – Descriptive Statistics (2 Units)

Nature of Statistics, its definition, importance and
limitations, types of statistical data: the primary and
secondary data, methods of collecting primary data,
graphical and diagrammatic representations of data, the
frequency distribution, nature of frequency curves,
characteristics of a frequency distribution, Measures of
Page 54 of 68
central tendency, location and dispersion, moments
(about the origin and about the mean), skewness and
kurtosis along with their measures, essential requisites
of an ideal measure.

ST 122 - Introduction to Statistical Inference (2

Units)
Elementary Regression and correlation analysis; Time
series analysis; and index numbers; Inference estimation
and test of hypothesis; fitting of binomial, Poisson and
Normal distributions to data; and Theory of attribute.
Use of calculator

200 LEVEL COURSES

ST 211 – Discrete and Continuous Probability and
Probability Distributions (3 Units) - Prerequisite
ST111
Various definitions of probability, Baye’s theorem,
concepts of probability function, probability density
function, cumulative probability density function,
concept of Bi-variate probability distribution, joint,
marginal and conditional probability distribution, mean,
variance and higher moments (to include the conditional
expectations and variances). Probability distributions
(both discrete and continuous types), various properties
of these distributions, their mean and variance as well as
applications

Page 55 of 68
ST 212 – Analysis of Variance I (3 Units) –
Prerequisite ST 121 or ST 122
Concept of Analysis of variance: Assumption underline
ANOVA; the fixed, random and mixed effect model.
Analysis of simple, double and multiple classifications
of balance data in crossed and nested arrangement.
Analysis of variance involving unbalanced data:
incomplete tables and missing value (only one
observation) .Concept of degree of freedom associated
with sum of squares. Multiple comparisons of
component or variance estimates and tests;

ST 213 – Introduction to Statistics & Elementary

Prob. (3 Units)
Measures of central tendency and dispersion, (grouped
and ungrouped): Mean-arithmetic, geometric,
Harmonic; median; mode; quartiles, deciles mode.
Relative and absolute dispersion. Sample space and
events as sets. Finite probability space. Properties of
probability. Statistical independence and conditional
probability. Tree diagram. Bayes theorem. Discrete
and continuous random variables. Expectation.
Independent Bernoulli trials. Binomial Poisson and
Normal variances and expectations. Normal
approximation to binomial and Poisson, distributions.
Hyper geometric.

ST 221 - Statistical Method I (3 Units) -

Prerequisite ST122
Analysis of Simple and multiple linear regression and
correlation (from one to three cases), elementary
Page 56 of 68
polynomial regression curve (using Matrix approach
where necessary); Test concerning correlation and
regression coefficients (T-test and Anova test); Fitting
of straight line and polynomial regression curve to data,
use of Calculator

ST 222 – Sampling Distribution and Distribution

Techniques (3 Units) - Prerequisite – ST 111
Concept of sampling distribution and standard error of
Statistics, Review of some important distributions
(discrete and continuous), distribution of functions of
random variables using the techniques such as factorial
generating function technique, moment generating
function technique, cumulative distribution function
technique and transformation techniques, The chi-
square, t and F distributions, properties of these
distributions and inter-relationship between them.

ST 223 – Basic Elementary Statistics (3 Units)

Descriptive Statistics: Source of data and collection
problems. Processing analysis and interpretations.
Statistical tables and charts. Vital statistics and
demography. Frequency distributions. Moments, skew
ness and Kurtosis. Regression, correlation, curve fitting
and method of least squares. Sample and population.
Types of sample design (simple random, stratified, etc.).

ST 224 – Statistics for Physical Science (2 Units)

Scope for statistical methods in physical science.
Measures of location, partition and dispersion. Elements
of probability, probability distribution: Binomial,
Page 57 of 68
Poisson, Geometric, Hypergeometric, Negative-
binomial and Normal. Estimation (Point and Interval)
and test of hypotheses concerning population means,
proportions and variances. Regression and correlation.
Non-parametric tests: contingency table analysis.
Introduction to Design of experiments and Analysis of
variance.

300 LEVEL COURSES

ST 311 – Statistical Method II (3 Credit Units) -
Prerequisite – ST 221
Concept of statistical hypothesis, null hypothesis,
alternative hypothesis (one sided and two sided), level
of significance and critical region. Basic steps of testing
hypothesis, simple and composite hypothesis, type I and
type II errors, power of a test, Neyman-Pearson
fundamental lemma, Large sample tests such as normal
test for testing of proportions and means, applications of
chi-square, t and F distributions in testing of hypothesis.

ST 312 –Statistical Inference (3 Units) -

Prerequisite – ST 122 or ST221
Theory of point estimation, methods of estimation such
as method of moments, method of maximum likelihood
and method of least squares, properties of point
estimators: unbiasedness, consistency, efficiency,
Cramer - Rao inequality and its extension, sufficiency,
Fisher – Neyman criterion and factorization theorem,
concept of completeness, Rao - Blackwell theorem,
Interval estimation.
Page 58 of 68
ST 313 –Design and Analysis of Experiments (3
Units) - Prerequisite – ST 212
Basic concepts such as experiment, treatment,
experimental unit, experimental error, basic principles:
randomization, replication and local control, the
completely randomized design (CRD), randomized
block design (RBD) and latin square design (LSD),
layout and analysis, missing plot technique in RBD and
LSD, Orthogonal Latin square design, Balance
incomplete block, split plot, and 22 Factorial design.
Analysis of efficiencies of the above designs

ST 314 – Probability Theory I (3 Units) -

Prerequisite – ST 211
The axiomatic approach to the theory of probability as
developed by Kolmogorov, probability inequalities such
as Markov’s inequality. Chebychev’s inequality,
Jensen’s inequality and Cauchy-Schwartz inequality,
generating functions such as probability generating
function, characteristic function and their properties,
inversion theorem, convergence concepts and weak and
strong law of large numbers, various forms of central
limit theorem.

ST 315 – Industrial Statistics - I (3 Units) -

Prerequisite – ST 111 or ST121
Process Control : Concept of statistical quality control,
types of quality measures, control charts for variables
and attributes ( x , R) and ( x , σ) charts, control charts for
standard deviation, range, fraction defectives, number
Page 59 of 68
of defectives and number of defects per unit (under
standard given and not given for all charts).
Product control : Acceptance sampling, basic concepts,
producers’ risk and consumers’ risk, acceptable quality
level (AQL), rejectable quality level (RQL), average
outgoing quality (AOQ), average outgoing quality limit
(AOQL), O.C. function, A.S.N. functions LTPD and
ATI, single and double sampling inspection plans.

ST 316 – Sampling Techniques I (3 Units) -

Prerequisite – ST 112 or ST 222
Basic concepts: Sampling designs and sampling
strategy. Sampling and non-sampling errors. Types of
sampling: probabilistic and non-probabilistic sampling
and mixed sampling. Standard sampling procedures:
Simple random sampling (with and without
replacement) determination of sample size, stratified
sampling, systematic sampling and cluster sampling
with equal cluster size. Ratio and Regression methods
of estimation in SRSWOR

ST321 - Decision Theory (3 Units) – Prerequisite -

ST211
Basic Concepts related to a decision problem, states of
nature, parametric space, decision space, action space,
randomized and non-randomized decisions, pay offs,
optimal decision such as maximin, minimax and Bayes
decision rules, decision tree analysis, introduction to the
theory of games, saddle point, two-person zero sum
game.

Page 60 of 68
ST 322 – Survey Methodology (3 Units) -
Prerequisite – ST 112
Organization of sample survey: Planning, execution and
analysis of large-scale surveys with special emphasis on
Nigeria. Various problems arising in sample survey.
Use of sample survey over complete enumeration

ST 323 – Biometry (3 Units)

Purpose, history and structure of biological assays.
International standards. Statistical science and
biological assays. Types of biological assays. Nature of
direct assays. The dose-response curves, parallel line
assays, potency ratio and calibration curves.

ST 324 – Educational Statistics (3 Unit) -

Prerequisite – ST 121
Scope, nature and use of educational data resources and
methods of collection of data related to education,
educational indicators designed for educational
information systems, education flow models and
performance evaluation, multivariate methods in
educational data analysis, the role of operations research
in educational management.

ST 325 – Time Series Analysis (3 Units) -

Prerequisite – ST 122
Review of components of time series such as secular
trend, seasonal, cyclic and random components.
Estimation and isolation of these components, Non-
stationary and stationary processes: theoretical
moments, auto-correlations and partial autocorrelations;
Page 61 of 68
sample moments, auto-correlations and partial
autocorrelations. Unvariate time series model:
identification and estimation – Auto-regressive (AR),
Moving average (MA) and Auto-regressive moving
average (ARMA) model. Diagnostic checking of
models, linear prediction and forecasting. Introduction
to Spectral analysis

400 LEVEL COURSE

SIWES– Students Industrial Work Experience
Scheme
It is a one year practical training course to be undertaken
by each student in an industry. The scheme is called
Students Industrial Work Experience Scheme (SIWES).
At the end of the training the students are required to
submit a report about what he/she has learnt during this
practical industrial training

500 LEVEL COURSES

ST 511 – Probability Theory II (3 Units) -
Prerequisite – ST 314
Basic theory of sets and set functions, construction and
properties of measures, extension theorem, Lebesgue
measures, complete measures, Lebesgue Stieltjes
measures, definition and properties of the integral,
simple function, measurable functions, Lebesgue
integral, Lebesgue-Stieltjes integral, condition for
integrability, Probability as measure, probability space,
theorems related to probability space, random variables
as measurable function, distribution of random
Page 62 of 68
variables, convergence of random variables, week
convergence, convergence almost everywhere,
convergence in data mean.

ST 512 – Regression Analysis (3 Units) -

Prerequisite – ST 221
Multiple linear regression models, polynomial models
of various orders, Model selection techniques, models
involving transformation, non – linear models that are
intrinsically linear, use of dummy variables in multiple
regression, introduction to non - linear estimation,
partial and conditional regression models and
correlation, canonical correlation, test of independence
of regression coefficients, Multicollinearity and other
problems associated with best Regression models.

ST 513 – Stochastic Processes (3 Units) -

Prerequisite – ST 314
Introduction, definition, basic concepts, Markov chain,
transition and absolute probabilities, classification of
states, classification of Markov chain, random walk,
random walks in presence of absorbing and reflecting
barriers, definition of Markov process, classification,
special Markov process such as birth - death process,
birth process and Poisson process, queueing process, its
classification, the simplest queueing process (M/M/1)
and waiting time distribution along with simple
application.

Page 63 of 68
ST 514 – Analysis of Variance II (3 Units) -
Prerequisite – ST 212
Analysis of variance involving unbalanced data such as
with more than one missing observations. Multivariate
analysis of variance (MANOVA); Analysis of multi-
factors and multi-response data; Treatment of non-
normality and heterogeneity of variances in data

ST 515 – Demography (3 Units)

The scope and importance of demographic studies, vital
events and vital statistics, collection of vital statistics,
Mortality and its measures, the crude death rate and its
limitations, age specific death rates, infant mortality
rate, standardized death rates, fertility and its measures,
the crude birth rate, general fertility rate, age specific
fertility rates, total fertility rate, standardized birth rates,
gross and net reproduction rates, elements of life table.

ST 516 – Computer Aided Statistical Data

Processing and Analysis (3 Units) - Prerequisite –
ST 121
Types of Statistical data, concept of processing of
Statistical data, coding of data, preparation of transfer
sheet, classification and tabulation of statistical data
using statistical software, construction of frequency
distributions, graphs and diagrams, fitting of curves,
computations of correlations, regression curves and
tests of significance based on normal chi-square, t & F
distributions to the given set of data using statistical
packages. Case study of different statistical packages
(Excel, SPSS, SAS, S-Plus etc)
Page 64 of 68
 ST 517 – Psychometrics (3 Units) Prerequisite –
ST311 or ST 322
The foundations of mental measurement theory
Measurement in psychology and education. The
construction of true and error scores, the classical test
theory model - fixed length, variable length, some
estimates of parameters of the classical model, other
weak true-score models; parallel measurements, types
of reliability co-efficient and their estimation, some test
theory for equivalent measurements, item, sampling in
test theory and in research design.

ST 518 – Econometrics (3 Units) - Prerequisite–

ST221
The nature of Econometrics, relationship between
economic variables, roles of econometrics, two variable
linear model, least squares estimators, analysis of
variance in regression, two – variable non – linear
relationships, relation between three variables, fitting of
regression plane, partial and multiple correlations, intra
– class correlation, general linear model,
multicollinearity, generalized least squares,
autocorrelation, conventional tests for autocorrelation,
The BLUE procedure, lagged variables, simultaneous
equation methods, identification problem.

ST 521 – Multivariate Analysis (3 Units) -

Prerequisite – ST 221 or ST 311
Multivariate data structure, the multiple and partial
regression and correlation, multivariate normal
distribution, the marginal and conditional distribution,
Page 65 of 68
Hotellings T2 and Mahalanobis D2 distribution, the
Wishart distribution, concept of canonical correlation,
discriminant function. Principal components and cluster
analysis.

ST 522 – Non-Parametric Statistical Methods (3

Units) - Prerequisite – ST 311
Definition, concepts of non-parametric estimation and
testing of hypothesis, non parametric tests such as: sign
test, run test, median test, Mann-Whitney - Wilcoxon
test. Wilcoxan signed rank test, Kolmogorov – Smirnov
test, Wald - Wolfowitz test, Cochran O test, the
Friedman test, Kruskal - Wallis test.

ST 523 – Sampling Techniques II (3 Units) -

Prerequisite – ST 316
Sampling with varying probabilities (with and without
replacement), procedure of selecting a sample with
varying probabilities, estimation of population mean
and variance and their sampling variances. The two-
stage and multistage sampling schemes with equal first
and second stage units, multivariate ratio estimation,
double sampling.

ST 524 – Design and Analysis Of Experiment II (3

Units) - Prerequisite – ST 313
Layout and analysis of 2n factorial experiments carried
out in RBD, confounding, concept of pn factorial
experiments, strip plot designs, simple notion of
balanced incomplete block design (BIBD),. The
partially balanced incomplete block design (PBIBD),
Page 66 of 68
the cross over design, lattice design, weighing designs,
notion of response surface designs. Analysis of
covariance

ST 525 – Industrial Statistics II (3 Units) -

Prerequisite – ST 315
Special process control procedures, concept of reject –
limits, modified control limits relationship between
control chart limits and specification limits, charts for
subgroup totals and individual measurements, control
charts for medians, specification and tolerances aspects.
Acceptance sampling: the multiple and sequential
sampling, Dodge Ramig system for lot by lot inspection,
acceptance sampling by attributes, some basic aspects
of life testing and reliability.

ST 526 – Bayesian Inference (3 Units) - Prerequisite

– ST 312
Bayesian estimation technique, prior and posterior
distribution, posterior Bayes estimator, loss – function
approach, Bayes risk, Bayes estimator – Bayesian
interval estimates, Bayesian tests, prediction problem.

ST 527 – Simulation and Monte-Carlo Method (3

Units)
Random numbers, pseudo-random numbers. Simulation
of random variable – discrete and continuous.
Simulation of stochastic process, simulation of
inventory model, simulation of birth and death
processes and queuing systems. Regenerative

Page 67 of 68
simulation. Monte-carlo methods. Simulation computer
languages.
ST 599 – Statistical Project (6 Units)
Individual work on a selected topic illustrating
applications of some of the theories and techniques
covered in the course.

Page 68 of 68