Computer Science

The Mathematics and Statistics programmes for the meantime, serve the college’s needs in pure and applied mathematics and statistics.

The aim of establishing the department is to produce world-class graduates that would competently meet the global technological challenges. Today’s studies in sciences, technology, and humanities and the arts are interwoven with computer and ICT knowledge. That is why it becomes necessary to start this department in other to produce students that would compete at the highest level globally.

ELIGIBILITY OF ADMISSION

A prospective student in any of the programmes in the department must have completed senior secondary school with at least credit passes in English Language, Mathematics, Physics, plus two other science  subjects; must have had an acceptable score in both UTME and the Post UTME and oral interview as organized by the university. To be eligible for direct entry admission into the 200 level in the department, the candidate should possess at least an acceptable  A-level result and Ordinary Nation Diploma (OND) from recognized institutions.

OBJECTIVES:

The objectives of the programmes are:

  • To produce students with sound knowledge of the theory and practice of Computing.
  • To produce excellent trainable graduates for further academic work.
  • To produce graduates with the capacity for professional practice in Computer Sciences and Information and Communication Technology.
  • To instill in students additional transferable skills in communication, team work, self-management, and professional development to ensure ability to cope with dynamic changes in Computer Science.
  • To expose students to the state-of-art technology and industrial practice through the Students Industrial Work Experience Scheme (SIWES).
  • To produce graduates who are well-equipped to research into human problems for solution.
  • To equip students to be able to face challenges of the ever dynamic and fast growing software, hardware in entire Information Technology Industry.
  • To produce well-rounded graduates who will be academically sound, creative with good moral and God-fearing.

 ADMISSION REQUIREMENTS

The Departmental basic entry requirements shall be minimum of five (5) O’ Level credit passes including English Language, Mathematics, Physics, Chemistry and any other science subjects at SSCE/WASC/GCE or equivalent examination in at most two sittings.

Candidates who seek direct entry admission into 200 level of a degree programme must have any of the following:

  • B.Sc. degree of a recognized University in a related field
  • Three (3) A’level passes in the relevant courses acceptable to the University
  • OND (upper credit) or HND in relevant courses.

DEGREE NOMENCLATURE:

The Degrees shall be called B.Sc. (Hons) Degree in Computer Science.

 COURSE DURATION

The full-time programme leading to the award of B.Sc. (Hons) Degree in Computer Science and B.Sc. (Hons) Degree in Information Communication Technology respectively, shall last four (4) years for UME candidate’s admission and three years (3) for direct entry admission.

 REQUIREMENTS FOR THE AWARD OF DEGREE:

To be eligible for the award of B.Sc. (Hons) Degree in in Computer Science and B.Sc. (Hons) Degree in Information Communication Technology (ICT) respectively, UME student must register and pass a minimum of 153 units and maximum of 177 units

  • A total of 8 units Compulsory General Studies Courses like GST 101, PHL 101, GST 102, and PHL 102.
  • A total of 99 units  Compulsory Computer and ICT Core Courses respectively.
  • A total of 48 units in Compulsory Courses like MTH 101, MTH 123, PHY 101, BIO 101, CHM 101, CHM107, MTH 112, PHY 112, STA 122, STA 102, STA 203, , MTH 201, MTH 210, MTH 231, MTH 202, MTH 242 and MTH 301
  • 14 units of Senate approved Electives  courses like CSC 212, PHY 311, CSC 403, and CSC 407
  • A total of 8 Required Courses like GST 103, GST 104, GST 207, GST 208.

Direct Entry students must register and pass minimum of 140 units

  • A total 8 units of Compulsory General Courses like GST 101, PHL 101, GST 102, and PHL 102.
  • A total of 90 units Compulsory Computer and ICT Core Courses respectively.
  • A total of 20 units in Compulsory Courses like STA 203, MTH 201,    MTH 231, MTH 202, MTH 242 and MTH 301, PHY 202, MTH 301
  • 14 units of Senate approved Electives  courses like CSC 212, PHY 311, CSC 403, and CSC 407
  • A total of 8 Required Courses like GST 103, GST 104, GST 207, GST 208.

COURSE CONTENT: 

100 Level

CSC 101 INTRODUCTION TO COMPUTER SCIENCE 3 Credits

History of computer, functional components to computer, Classifications of Computers: Size and Methods of Data processing, Characteristics of a computer, Data processing techniques, Introduction to programming languages (BASIC & FORTRAN),

CSC 110 INTRODUCTION TO PROBLEM SOLVING 3 Credits

Problem solving, flow charts, algorithm and pseudocodes.

Computer programming statements, symbolic names, arrays subscripts expressions

and control statements, Looping Statements in languages like BASIC/FORTRAN/C/PASCAL programming language.

CSC 102 INTRODUCTION TO COMPUTER APPLICATIONS 3 Credits

General introduction to the Concepts of Computer Applications Classifications of Computer Applications; Word processors, Spreadsheets Desktop Applications, and presentation software.  Internet technology.

MTH 101 ELEMENTARY MATHEMATICS II  3 CREDITS

Polynomials, the remainder and factor theorem. Polynomial Equations. Inequalities, especially linear, quadratic and cubic. Domain and zeros of rational functions. Partial fractions curves sketching of polynomial and rational functions. The principle of combinations. The Binomial Theorem for any index and applications. Sequence, Series, A.P, G.P. Limits and Sum to infinity. First and second Differences of a Sequence.  Addition, subtraction, multiplication and division of complex numbers. Fundamental theorem of Algebra (statement only). The argend diagram. De-Moivre’s Theorem. N-root of complex number. Introduction to m x n matrices where m,n < 5. Elementary properties of Determinations of most, 3X3 matrices. Transformation of plane: translation; reflection; Enlargement; Composition of transformation- invariant point and lines.

MTH 123: ELEMENTARY MATHEMATICS III 3 CREDITS

Function: Concept and notation; Polynomial and rational functions; trigonometric functions, exponential functions, logarithmic functions, functional linear equation. Idea of limits; techniques of finding limits , derivatives: definition and calculation from first principles; techniques for finding limits, derivatives of constants, powers, sums, products, quotients, composite functions; circular functions, logarithmic/ exponential functions; Higher order derivatives. Application; small increments approximations and errors, extreme integration, as the inverse of differentiation; as area, as limits of finite sums. Integration of sum/scalar multiple of functions with applications; integration of finite sums. Integration of sum/scalar multiple of functions with application to circular functions. Definite integrals; general properties of definite integral. Some application to geometry, Mechanics, Biology and Social Sciences. Derivatives of Hyperbolic functions; inverse circular functions. Method of taking successive differentiation of implicit functions and of functions like Sin(bt + c); approximations. Hard integration further techniques evaluation of (t-G) at t; integration of irrational function; integration via harder substitution; integration by parts.

STA 122: INTRODUCTION TO PROBABILITY THEORY I       3 CREDITS

Probability as a measure of uncertainty; sample points and events, combination of events. Definitions and basic properties of probability; joint and conditional probability. Combinational analysis. Random variable. Binomial, Geometric, Poison, Uniform and Normal Distributions. Expectations and moments of random variables; selected applications.

STA 102: INTRODUCTION TO STATISTICAL INFERENCE I    3 CREDITS

Statistical data: their source, collection and preliminary analysis by table, graphs and simple statistics to include measures of location dispersion, Skewness, kurtosis and correlation. Time Series, Demographics Measures and Index Numbers, inference: estimation tests of hypothesis.

200 Level

STA 203: STATISTICS FOR PHYSICAL SCIENCES AND ENGINEERING     3 CREDITS

Measure of location and dispersion in sample and grouped data experiments. Elements of probability distributions; Normal, Binomial, Poison, Geometric, Negative binomial distributions. Estimation and tests for hypotheses concerning the parameters of distributions. Regressions, correlation and analysis of variance. Contingency table. Non parametric  inference.

MAT 231: ORDINARY DIFFERENTIAL EQUATIONS 3 CREDITS

Derivation of equations from physics geometry, etc: Techniques for solving first and second order linear and non linear equations; and solving nth order linear equations. Finite differences and equations; interpolation; error; solution of equation: Elementary numerical integration.

MTH 201: ABSTRACT AND LINEAR ALGEBRA 3 CREDITS

Set relations, equivalence relations mapping, mapping, order (partial order, well ordering) lattices (definition and example). Binary operation homomorphism of group oval, fundamental algebraic structures –semi groups monoids, groups, rings, integral domain, skew fields –definitions, examples and elementary properties. Number systems, elementary number theory, divisibility and primes. Euclid’s algorithm congruence, polynomials in single variable, factorization, partial functions.

MTH 202: REAL ANALYSIS II 3 CREDITS (For non-major):

Real and complex numbers, convergences and divergences of sequence and series of complex numbers. Function of real variable continuity and differentiability. Taylor’s theorem, extensions and applications. Riemann integration. Functions of complex variable. Bilinear transformation.

CSC  201 WEB TECHNOLOGIES AND DATA SECURITY                3 Credits

Introduction to www. HTML-document structure images, links, maps, tables, frames, forms. Introduction to PHP. Variables and constants: What is a variable? Naming Variable, PHP Variables and Value types, getting variables from Forms, Creating a calculation form, Submitting your form and getting results. PHP Operators and operations. Displaying a dynamic Content, Sending E-mail, PHP statements and functions. Using File system. Uploading Files to your Web Site. Development of an Application using PHP/MySql.

CSC 202 LOGIC DESIGNS                                      3 Credits

Symbolic logic and truth functional calculus. Boolean algebra and logic gates; switching function minimization e.g. algebraic, Karnaugh Map, Quine – Mc Cluskey etc. Combination circuit design; combination logic with MST and LST. Sequential circuits design; Bistables, SR, JK, D & T, registers, counters and the memory unit; Register Transfer logic; Sequential Machine minimization; Arithmetic Circuits; Instruction formats and sequencing error detection and Conversion. Arithmetic logic; synchronous and asynchronous control logic design; CPU logic design.

CSC 203  FILE ORGANIZATION AND PROCESSING    3 Credits

Introduction to Data management files, and job- control languages application. An overview of 1/0 ( Input/ Output ) system architecture. Logical file organizations, mapping organization onto physical storage. Back-up procedure, file recovery, higher level language, data management facilities.

CSC 204 INTRODUCTION TO COMPUTER SYSTEMS                         3 Credits

Computer circuits, diode arrays, PIAs etc, Integrated Circuits Fabrication process. Use of MSI, LSI and VLSI IC’ hardware design. Primary and Secondary memories; core memory etc. Magnetic devices; disks, tapes video disks etc peripheral devices; printers, CRT’S Keyboards, character recognition. Operational amplifiers; analog- to- digital and digital- to analog converter. Analog computer.

CSC 205 COMPUTER  PROGRAMMING I (STRUCTURED) 3 Credits

Structured programming concepts and structures and Unions. Introduction to C Programming language. Input/output statements in C programming, Variables and constants, functions definition , Recursive programming, repetition of statement, Subroutines, Recursive, constructor,  pointers and Data file.

CSC 206 OPERATING SYSTEMS I            3 Credit

History of operating systems. Concepts and structure of operating systems. Basic underlying principles of operating systems; multiprocessing, multiprogramming, multitasking,  Introduction to Computer processes; process states, concurrency, deadlock, race condition, communication and scheduling e.t.c . File management, I/O management, Device  management, Memory Management. Protection and Security in operating systems. Case Study f operating System (Unix/Windows).

CSC  208 COMPUTER PROGRAMMING II – JAVA       3 Credits

Introduction to JAVA Basic concepts in OOP; Using methods, classes and objects. Variables and Constants, operators in java .Input and Output statements, selection statements, Looping, Character, Strings and String Buffer processing. Arrays in Java. Introduction to Applets and Swings, Graphics, File input/output. Multithreading and Animation. Creating a JAVA application.

CSC 209 FOUNDATIONS OF SEQUENTIAL PROGRAMMING          3 CREDITS

The relationship between H/L Languages and the Computer Architecture that underlies their implementation: basic machine architecture, assembles specification and translation of P/L Block  Structured Languages, parameter passing mechanisms.

ICT 212: INTRODUCTION TO COMPUTER NETWORKS  2 CREDITS

Network concepts and Protocols. Open systems interconnection (OSI) and transmission Control Protocol / Internet Protocol (TCP/IP). Network Topologies – LANs, WANs, Terminal Networks, Broadcast and Routed Transmission, LAN- Connection and transmission base media Access Protocol CSMA/CD, Token Ring, Token Bus, Slotted ring, Client / Server Models, WAN- Circuit, Message and Packet Switching, PSDN and  ISDDN, X.25. Routing Algorithms, Internetworking- Resolution of Protocol variations. Repeaters, Hubs, bridges, routers. Gateways, protocol converter of information to internet (TCP/IP). Core internet technology, internet connectivity service on the internet current trends on the internet.

CSC 214 SYSTEM ANALYSIS AND DESIGN               3 Credits

Introduction to system design, analysis tools, determining system alternatives, physical design of computer sub-systems. System analysis tools. Physical design of manual sub-system.  Software development cycle. Top -down  & Bottom –up design. Data flow diagramming .Entity -Relation modelling.

300 Level

CSC 303: COMPUTER ORGANISATION   3 CREDITS

Memory System in general: Characteristics of memory operation technology, magnetic recording, semi- conductor memory, coupled devices, magnetic bubble, memory addressing, memory hierarchy, virtual memory control systems. Hardware control, micro programmed control systems, Asynchronous control, i/c control. Introduction to the methodology of faulty tolerant computing concurrency; states & state diagrams structures. Dispatching and context switching; interrupt; concurrent execution; mutual exclusion problem and some solution. Deadlock models and mechanisms (semaphores, monitors etc) producer-consumer problems & synchronization. Multiprocessor issues. Scheduling & dispatching. Memory partitions, paging & segmentations, placement & replacement policies, working sets and trashing caching.

CSC 302 OBJECT-ORIENTED PROGRAMMING USING PHP 3 Credit

Basic OOP CONCEPTS: Classes Objects, Inheritance, Polymorphism, Data Abstraction. Tools for developing, compiling, interpreting and debugging. Java programs, java syntax and data objects, operators. Central flow constructs, objects and classes programming, Arrays, methods. Exception, Applets and the Abstract, OLE, Persistence, Window Toolkit. Laboratory Exercise in an OOP Language.

CSC 317 COMPUTER ARCHITECTURE  3 Credits

Overview of computer organization. Register transfer, Sequences, micro operation, instruction code, control units and timing, Bus, & memory organization, parallel processing, multiprocessor, thread –level parallelism, instruction format, and computer architecture of an actual simple mini –computer.

CSC  304 COMPILER CONSTRUCTION        3 Credits

Review of compilers, assemblers and interpreters, structure and function aspects of typical compiler, Syntax, semantics and pragmatics, functional relationship between lexical analysis, syntax analysis and code generation. Internal form of source programme, use of a standard compiler (i.e. C) as a working vehicle. Error detection and recovery, grammars and languages. The parsing problems. The scanner.

CSC 305 DATA STRUCTURE AND ALGORITHM         WITH C++     3 Credits

Overview of Data structures. Bits, Bytes, words, linear structures and list structures, arrays, tree structures, stacks, queue, tables, heaps, deque, and priority queues. Sets and Relations, High-level languages data types and data handling facilities.

CSC 306: GUI DESIGN AND PROGRAMMING  3 CREDITS

History of user’s interfaces and graphical users interfaces systems (GUI); human computer Interaction (HCI) principles and GUI design and evaluation; standard interaction metaphors users- control design and evaluation. Interface modeling techniques; and uses of implementation support tools.

CSC 307 DATABASE DESIGN AND MANAGEMENT  4 Credits

History of Database, Database Models, Review of basic concepts, File systems, Database Design concepts, Database implementation, E-R Modeling, Normalization of database table. Normal forms: 1st NF, 2nd N and 3rd NF. DataBase Management systems,  function and components of DBMS. File design and access path future directions in DBMS. SQL, PL/SQL. Introduction to transaction management. Concurrency control. Distributed database systems. Database privacy, security, failure and recovery.

CSC  308 OPERATING SYSTEMS II                     3 Credits

Issues in analyzing and designing operating systems, memory management, File management, Device management, I/O management. Resource allocation. Concurrent processing,  synchronization and communication, memory management including partitioning; base and limit registers, paging and segmentation. Network structure & Security in operating system. Case study of Unix operating system.

CSC 309 AUTOMATA THEORY, COMPUTABILITY AND FORMAL LANGUAGES 2 Credits

Formal grammars and automata, regular languages. Context-free languages. Deterministic parsing of context-free languages, recursive languages. Push down Automata, Ambiguity, Useless production, pumping Lemma.

CSC  311  DISCRETE MATHEMATICS 2 Credits

Basic concepts of logic, sets, partial order and other relations and functions. Fundamental principles of counting. Basic algebraic structures; modulo arithmetic group, running and field structures. Boolean algebra. Introduction to graph theory, trees, depth, firs search, matching, maxflow, mincut,, and other optimization algorithms.

CSC 313 OPERATIONS RESEARCH                    2 Credits

The nature of operations research, simplex, linear, and integer programming, allocation problems, inventory problems, replacement, maintenance and reliability problems, dynamic programming, Ill-sequencing and co-ordination. Project management.

CSC 399 INDUSTRIAL TRAINING                       6 Credits

6 months of Students Industrial Training experience will be documented, presented and graded (through log book, student report, and presentation).

400 Level

CSC 401 ORGANIZATION OF PROGRAMMING LANGUAGES            3 Credits

Language definition structure, data types and structures. Review of basic data types, including lists and trees, control structures and data flow, run-time consideration/interpretative languages, lexical analysis and parsing.

CSC 402: DATA MINING AND WAREHOUSING 3 CREDITS

Data Mining and Warehousing Concepts: Introduction and Definitions of Data Mining. Anatomy of Data Mining. Data Mining Tools and Applications. Data Mining Techniques: Classification, Neural Networks, Decision Trees.Genetic Algorithm. Clustering, Online Analytic Processing (OLAP), Association Rules. Architecture of Data Mining. Evaluation of Data Mining. Emerging Trends in Data Mining. Data Mining Research Projects,

Data Warehousing and Characteristics. Data Warehouse Architecture. Data Warehouse Evaluation: Calculating Memory Capacity, Data, Information and Knowledge, Fundamentals of Database, OLAP and OLAP Server, Data Warehouse, OLTP, OLAP and Data Mining,

Data Warehouse Design: Introduction, The Central Data Warehouse, Data Warehousing Objects, Goals of Data Warehouse Architecture, Data Warehouse Users, Designing the Relational Database and OLAP Cubes, Data Warehousing Schemas.

Learning, Types of Knowledge, and Knowledge Discovery Process  in Data Mining: Definition of learning?, Different Types of Knowledge, Stages of the Data Mining Process and Data Mining Operations in knowledge discovery.

Real Time Applications, Future Scope of Data Mining and Data Mining Products,

CSC 403 MODELING AND SIMULATION          3 Credits

Concepts and techniques used in modeling and simulation methodology and a suitable simulation language. Modeling; generation of random variables, transforming of random numbers, parameters estimation, design optimization.

CSC 416 ANALYSIS OF ALGORITHMS AND COMPLEXITY 3 CREDITS

Design and analysis techniques; divide and conquer principle, fixed point algorithm, graph problems, matrix multiplication, fast transforms, integer and polynomial arithmetic, lower bounds , Algorithm design and Recursion, efficiency of algorithms. NP-complete problems, reducibility. Approximations algorithm amortized analysis.

CSC 405  INTRODUCTION TO SOFTWARE ENGINEERING             3 CREDITS

Introduction to Software Engineering.  Organization of software projects, Software Process, Process models. Software project life cycle. Software Requirements, Critical System, Critical System specification, Formal specification, Software development, verification, software testing, validation and implementation, software cost estimation and project control management, software reuse, system documentation. Configuration management, service-oriented software engineering, software maintenance.

CSC 406 QUEUING SYSTEMS      2 CREDITS

Introduction to queuing systems, birth-death queuing systems, marckovian queues, the queue M/GL, bounds, inequalities and approximations.

CSC  407 COMPUTER GRAPHICS AND VISUALISATION     2 CREDITS

Hardware aspect, plotters microfilms, plotter displays, graphic-tablets, light pens, other graphical input a facsimile and its problem-refresh display, refresh huggers, changing images, light pen interaction. Two and three dimensional transformations perspective. Clipping algorithms, hidden live removal, Bolden surface removal, Warnock’s method, shading, data reduction for graphical input. Introduction to hard writing and character recognition, cursive and fitting contouring. Ring structures versus doubly linked list. Hierarchical structure, organization for interactive graphics.

CSC 408 SEMINAR                                           1 Credit

Students are expected to present a seminar paper on contemporary topics in Computer Science.

CSC 409  ARTIFICIAL INTELLIGENCE (AI) 3 Credits

Introduction to Artificial Intelligence. Underlying concepts of Artificial Intelligence. Knowledge modeling, knowledge representation, Expert Systems, knowledge-Based Expert Systems. Introduction to Natural language processing. Introduction to pattern recognition. Introduction to LISP and PROLOG.

CSC 410 DATA COMMUNICATION AND NETWORK 3 Credits

Introduction to Data Communication. Principles of Data Communication, Mode of Data Transmission. Data Communication Topology, Data Communication Protocols and Algorithm. Reference model. Network Designs, Local Area Network, Widely Distributed systems. Routing protocols and algorithm. Design and installation of Network..

CSC  411: NET- CENTRIC COMPUTATING 3 CREDITS

Distributed computing: mobile & wireless computing. Network security. Client / server computing (using the web). Building web applications

CSC  412 COMPUTER INSTALLATION AND MANAGEMENT 2 Credits

Meaning of computer installation, organization of computer installation, personnel in a computer installation. Safety in a computer installation. Hardware & Software Safety. Safety precaution in a computer installation. Establishment and management in a computer installation. General operating procedures in a computer installation. Data preparation. Job processing. Professional issues and Ethics.

CSC 413: EMERGING TECHNOLOGIES 3 CREDITS

E- Commerce. Data mining and data warehousing. Bioinformatics. Robotics Survey. E- Learning

CSC 414: COMPUTATIONAL SCIENCE AND NUMERICAL METHODS (ANALYSIS) 3 CREDITS

The nature of numerical analysis Practical areas of application of numerical analysis. Solution of algebraic and transcendental equations. Curve fitting. Error analysis. Interpolation and approximation. Zeros of non-linear equations to one variable. Systems of linear equations. Numerical differential and integral equations. Initial value problems for ordinary differential equation. Numerical computation. Graphical computation. Modeling and simulation. High performance computation. Computer application software for solving numerical problems eg MATLAB, Spreadsheet, Python, Mathematica. Floating point, arithmetic, use of mathematical subroutine packages, error analysis and norms, alternative methods, computing of eigenvalues and eigen-vectors, related topics, numerical solution of boundary value problems for ordinary differential equations, solution of non-linear systems of algebraic equations, least-square solution of over determined systems.

CSC 499 PROJECT                                                   6 Credits

An independent or group investigation of an appropriate Software, hardware, Communication & Network or Information Technology related problems in Computer Science carried out under the supervision of a lecturer.

Note: Each of the Courses listed above shall be examined as follows;

30% for Continuous Assessment

70% for Final Examinations

Total = 100%

An independent or group investigation of an appropriate Software, hardware, Communication & Network or Information Technology related problems in Computer Science carried out under the supervision of a lecturer.