NIGERIA ARMY UNIVERSITY BIU

FACULTY OF COMPUTING

UNDERGRADUATE CURRICULUM

DEPARTMENT OF SOFTWARE ENGINEERING

1

1. Philosophy

Generally, Software Engineering is about the orderly, timely and cost effective production of quality software that is not only useful but also usable. As such software engineering not only focuses on technology but also on the non-technical issues that are faced by software Engineers during the production of software. Research in this discipline shows that most of the software projects that fail because of reasons other than technology, therefore a Software Engineering degree should address these areas so that the graduates of NAUB are able to address issues when they encounter them in their professional careers.

Software Engineers are in great demand in this economy due to the expensive nature of imported software. The cost of software will come down tremendously when that software is produced by locally trained software engineers.

The BSc. Software Engineering programme is particularly designed to produce quality and competitive graduates who are practically oriented so as to provide software solutions required in the field of Science, Engineering, Business, Healthcare, Agriculture, Entrepreneurial skills for easy integration and innovation.

The Software Engineering programme is a four(4) years course leading to the award of Bachelor of Science in Software Engineering. The four years are divided in four sessions with each session further subdivided into two semesters, and one semester of Industrial Training(IT) at second semester of the 3rd year(300 level).

2. Objectives: -

The aim of the programme is to produce graduates that are competent in the production of software and to be able to design and implement suitable software applications on a wide scale.

The specific objectives are to produce graduates that have:

i) Acquired both Theoretical and Practical skills in Software Engineering to be productive in society;ii) Acquired adequate knowledge to pursue postgraduate studies;iii) A basis for further research and solutions to Software Engineering problems that are customized for this

region.iv) To empower undergraduate students with practical knowledge of entrepreneurial related areas of

Software Engineering to make them (upon graduation) self-employed and job creators.

3. MissionThe Software Engineering Program aspires to be a leading program by excelling in education, research and community service.

 

4. VisionThe program’s mission is to produce quality software engineering graduates and innovative research through a diverse community of instructors and students.

2

5. Admission RequirementsIn addition to the requirements for admission into degree programme of Nigerian Army University Biu, Nigeria, Candidates for admission into BSc Software Engineering degree programme must also fulfill one of the following:

a) UTME: i) UTME subjects combination: Use of English, Mathematics, Physics and any one of Computer Stusies

or Data Processing or Chemistry or Biology or Agricultural Science or Economics or Geographyii) O. Level requirement: Credit Pass in at least five O-level subjects that must include English language,

Mathematics, Physics, Chemistry and any one of Computer Studies, Data Processing, Biology, Information and Communication Technology, Geography or Economics, in not more than two sittings

b) DE: Candidates for direct entry into 200 level must in addition to satisfying conditions (a ii) above, he/she must also obtain:i) A level passes of which two (2) must be Mathematics and Physics/Chemistryii) A diploma (OND) in Computer Science/Software Engineering/Information Technology/Cyber

Security and any IT related National Diploma (OND) from any recognized institution. iii) A level passes at NCE with minimum of credit in Mathematics/Physics and Computer Science

6. Duration of the CourseFour(4) years for UTME students and Three(3) years for Direct Entry students. One semester (at 300 level) in the department is spent in/outside the University for Practical training, in a well-organized establishment, as Student Industrial Work Experience (SIWES).

7. Registration ProceduresStudents shall normally complete registration of courses for the semester within the time frame of registration

set by the University after the start of the semester. A student cannot withdraw from a course, after registering for it, without permission from the Coordinator of the Programme. A student who fails to sit for the final examination for any registered course, without reasons acceptable to the School Board, shall be deemed to have failed that course.

8. Course Structure UME entry students at 100 level and DE students at 200level have common courses with students from other

programmes of the Faculty. These courses are general Science and Technology courses aim to provide good foundation in basic management, computer science and mathematics for the students. In the third year [300level], Management Information Technology students take separate courses with few common courses. At 300level, students go on compulsory 1 semester Industrial Training Programme.

9. ExaminationsIn addition to continuous assessment, final examinations are normally given for every course at the end of each semester. The final grade should be based on the following breakdown: Final Examination:  70% Continuous assessment (Assignments, Tutorials, Group work, Tests): 30%

 Each course shall normally be completed and examined at the end of the semester in which it is offered. The minimum pass mark in any course shall be 40%. A written examination shall normally last a minimum of two hours for two units’ course and three hours for three units’ course.

10. Grading System

Grading of courses shall be done by a combination of percentage marks and letter grades, which are then translated into Grade Point (GP) as shown in table below. For the purpose of determining a student’s standing at the end of

3

every semester, the Grade Point Average (GPA) system shall be used. The GPA is computed by dividing the total semester points (SP) by the total number of semester units registered (SU) for all the courses taken in the semester. The credit point for a course is computed by multiplying the number of units for the course by the Grade Point of the marks scored in the course. Each course shall be graded out of maximum of 100 marks and assigned appropriate Grade Point as in table 1 below.

(i) Grade Point (GP):

The Grade Point derives from the actual percentage, raw score for a given course. The raw score is converted into a letter grade and a grade point.

(ii) Grade Point Average (GPA):

Performance in any semester is reported in Grade Point Average. This is the average of weighted grade points earned in the courses taken during the semester. The Grade Point Average is obtained by multiplying the Grade Point attained in each course by the number of Credit Units assigned to that course, and then summing these up and dividing by the total number of Credit Units taken for the semester.

(iii) Cumulative Grade Point Average (CGPA)

This is the up-to-date mean of the Grade Points earned by the student in a programme of study. It is an indication of the student’s overall performance at any point in the training programme. To compute the Cumulative Grade Point Average, the total of Grade Points multiplied by the respective Credit Units for all the semesters are added and then divided by the total number of Credit Units for all courses registered by the student.

4

(iv) Table 1: Grade Point Interpretation

(i)Credit Units

(ii) Percentage Scores

(iii) Letter Grades

(iv) Grade Points (GP)

(v)Grade Point Average(GPA)

(vi)Cumulative Grade Point Average (CGPA)

This varies according to contact hours assigned to each course per week per semester and according to work load carried by student

70 – 100 60 – 69 50 – 59 45 – 49 40 – 440 - 39

ABCDEF

543210

Derived by multiplying (i) and (iv) and dividing by total Credit Units

4.50 – 5.00 3.50 – 4.49 2.40 – 3.49 1.50 – 2.39 1.00  - 1.49 - < - 0.99

11. Degree Classification

This is determined by the Cumulative Grade Point Average (CGPA) earned at the end of the Programme. The Cumulative Grade Point Average is the average of all the earned GPAs. The CGPA shall be used in the determination of the class of degree.

CUMULATIVE GRADE POINT AVERAGE (CGPA) CLASS OF DEGREE4.50 – 5.00 3.50 – 4.49 2.40 – 3.49 1.50 – 2.391.00 – 1.49 - < - 0.99

First ClassSecond Class UpperSecond Class LowerThird ClassPassFail

12. Probation and Withdrawal

Guideline Cumulative Grade Point Average (CGPA) is used as a guide for assessing students for withdrawal and probation taking into account the Minimum (CGPA) of 1.00 required for graduation.

ProbationProbation is a status granted to the student whose academic performance falls below an acceptable standard. A new student, whose Cumulative Grade point Average is below 1.00 at the end of a year of study, earns a period of probation I for the academic session. Any other student whose Cumulative Grade Point Average falls below 1.00 in any semester earns also probation I. Any student on probation that fails to increase his/her CGPA above 1.00 in the succeeding semester earns probation II.

Repeating Failed Course (s).Repeating Failed Course(s); Subject to the conditions for withdrawal and probation, student may be allowed to repeat the failed course unit(s) at the next available opportunity, provided that the total number of credit units carried during that semester does not exceed the maximum units allowed, and the Grade Points earned at all attempts shall count towards the CGPA.

5

WithdrawalWithdrawal; A candidate whose Cumulative Grade Point Average is below 1.00 at the end of two probation periods shall be required to withdraw from the Programme. At any semester, a student will be required to withdraw if his/her CGPA falls below 0.25.

13. Graduation RequirementsTo satisfy the requirements for graduation, a student must take and pass the minimum number of units specified in the Programme before he/she can qualify for the award of a degree in Information Technology. In addition to the above, the student must pass all compulsory General Studies Courses and the Industrial Training Courses and submit a graded project report based on a suitable title approved by the Programme at the end of 400 level. Candidates admitted through UME will require a minimum (including units of industrial attachment) of 175 Units for graduation. Candidates admitted through DE will require a minimum (including units of industrial attachment) of 145 Units for graduation.

12. Degree Nomenclature

B. Sc. (HONS) Software Engineering

6

BSc. Software EngineeringCOURSE CONTENT SPECIFICATIONL = Lecture, P = Practical, and T = Tutorial

100 LEVEL – FIRST SEMESTERCourse Code Status Course Title Contact Hours

Unit(s)L T P

MTH 111 C Elementary Algebra I 2 1 0 3MTH 112 C Elementary Calculus I 2 1 0 3

PHY 111 CIntroduction to Mechanics and Properties of Matter

2 1 0 3

PHY 117 C Basic Experimental Physics I 0 0 1 1CSC 111 C Introduction to Computer Science 2 0 1 3

STA 111 RIntroduction to Probability and Probability Distribution

2 0 0 2

CHM 111 R General Chemistry I 2 0 1 3CHM 113 R General Chemistry I Lab. 0 0 1 1GST 111 R Use of English I 2 0 0 2

21

100 LEVEL – SECOND SEMESTERCourse Code Status Course Title Contact Hours Unit(s)

L T PMTH 121 C Elementary Algebra II 2 1 0 3MTH 122 C Elementary Calculus II 2 1 0 3PHY 124 C Introduction to Electricity and Magnetism 2 0 1 3PHY 127 R Basic Experimental Physics II 0 0 1 1CSC 121 C Introduction to Problem Solving 2 1 0 3STA 121 R Descriptive Statistics 2 0 0 2MTH128 C Logic Set, and Algebra 2 1 0 3GST 121 R Use of English II 2 0 0 2GST 122 R Library and Information Science 2 0 0 2

21

7

200 LEVEL – FIRST SEMESTER

Course Code

Status Course Title Contact Hours Unit(s)

L T PCSC 211 C Computer Programming I 2 0 1 3CSC 212 C Web Programming 2 0 1 3CSC 213 C Operating Systems I 2 1 0 3MTH 213 C Numerical Analysis I 2 1 0 3MTH 212 R Mathematical Methods 2 1 0 3MTH 211 Linear Algebra 1 2 1 0 3SWE 212 (CSC 313)

C System Analysis and Design 2 1 0 3

GST 211 R Nigerian People and Culture 2 0 0 223

200 LEVEL – SECOND SEMESTER

Course Code

Status Course Title Contact Hours Unit(s)

L T PCSC 221 C Computer Programming II 2 0 1 3CSC 222 C Intro. to Data Communication and Network 2 0 1 3CSC 223 C Operating Systems II 2 1 0 3SWE 221 R Mobile Application Development 2 1 0 1MTH 223 R Numerical Analysis II 2 1 0 3MTH 221 R Linear Algebra II 2 1 0 3MTH 224 C Introduction to Mathematical Modeling 2 1 0 3GST 221 R Peace and Conflict Resolution Studies 2 1 0 2

21

8

300 LEVEL – FISRT SEMESTER

Course Code

Status Course Title Contact Hours Unit(s)

L T PCSC 311 C Data Structure and Algorithms 2 1 0 3SWE 311 (CSC 411)

C Software Engineering 2 1 0 3

SWE 313 C Software Design Architecture 2 1 0 3CSC 315 C Theoretical Computer Science 2 1 0 3MTH 316 R Discrete Mathematics 2 1 0 3CSC 316 C Research Methodology 2 0 0 2GNS 311 R Business Creation and Growth 2 0 0 2GNS 312 R Entrepreneurship 2 0 0 2

21

300 LEVEL – SECOND SEMESTER

IT 6 Units

Course Code

Status Course Title Contact Hours Unit(s)

L T PSWE 399 C SIWES 0 0 6 6

9

400 LEVEL – FISRT SEMESTER

Course Code

Status Course Title Contact Hours Unit(s)

L T PSWE 411 C Agent Oriented Software Engineering 2 1 0 3CSC 413 R Compiler Construction 2 1 0 3CSC 414 C Database Design and Management 2 0 1 3SWE 413 C Software Project Management 2 1 0 3WSE 412 C Software Quality Assurance 2 1 0 3CSC 416 C Human Computer Interaction 2 1 0 3

20

400 LEVEL – SECOND SEMESTER

Course Code

Status Course Title Contact Hours Unit(s)

L T PSWE 421 C Knowledge-based Expert System 2 1 0 3CSC 422 R Artificial Intelligence 2 1 0 3CSC 422 R Net Centric Computing 2 1 0 3SWE422 C E- Commerce 2 0 0 2CSC 425 C Modeling and Simulation 2 1 0 3CSC 499 C Project 0 0 6 6

20

10

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: Elementary 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. 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.

PHY 111: Introduction to Mechanics and Property of Matter (3 Units)Scalars and vectors: Review of vector analysis (vector addition, subtraction, cross product, dot product for both coordinate and non-coordinate vectors, direction cosines and examples). Statics: concurrent forces in equilibrium; the first condition of equilibrium. Non-concurrent forces; moment of a force, couple, resultant of concurrent forces, the second condition for equilibrium; center of gravity, stability of equilibrium. Frictional forces; static and dynamic friction, and experimental determination, friction on the incline plane, equilibrium problem involving friction. Elastic forces in static structures: Hooke’s law, spring constant, stress and strain, elastic and plastic deformations, young modulus of elasticity and its experimental determination, bulk and shear modulus, energy stored in an elastic body.Kinematics: speed, velocity and acceleration; equation of motion for bodies moving with uniform acceleration, motion with variable acceleration; displacement – time and velocity - time graphs, free fall and vertical projection, projectile motion in two dimensions and trajectory.Dynamics of Particles: forces and linear motion; equation of motion and applications, inertia, mass and momentum, weight of an object, impulse of force. Conservation of momentum,: single particle, several particles. Energy: Kinetic energy, potential energy, gravitational and elastic potential energies, conservative and dissipative forces, principles of conservation of mechanical energy, mass-energy equivalence. Elastic and inelastic collisions: perfectly elastic, completely inelastic and partially elastic collisions with simple examples from elementary particles/atomic collisions. Gravitation: Kepler’s laws, Newton’s law of gravitation, gravitational and inertial mass, masses of sun and planets, artificial satellites and parking orbits, variation of g with height, weightlessness, velocity of escape. Fluid at rest and fluid at motion: Fluid at rest, pressure in a liquid, liquid columns, Archimedes principle, atmospheric pressure and variation with height. Fluids in motion: viscosity, coefficient of viscosity and experimental determination; steady and turbulent flow. Motion in a fluid: stock’s law and terminal velocity.

11

PHY 117: Basic Experimental Physics I (3 Units)A 3 hour per week laboratory course covering basic experiments illustrative of the first semester, 100 level physics syllabus.

CSC 111: Introduction to Computer Science (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 – 5 th 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 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.

CHM 111: General Chemistry I (3 Units)Kinetic theory and the gas laws. Ideal behavior and their limitation for real gases at high and low temperatures. Maxwell – Boltzmann distribution of molecular velocities. Characteristics of liquids: Simple kinetic molecular description of melting and vaporization, vapour pressure, saturated and unsaturated vapours, surface tension and viscosity, types of solutions and their properties. Colligative properties and molecular weight determinations. Characteristics of solids: Lattice structure and x-ray diffraction, isomorphism and giant molecules such as graphite and diamond. Lattice energy, atomic, molecular and ionic lattices. Equilibria: (1) Phase equilibria : phase rule, equilibria involving one, two and three components.(2) Chemical equilibria : reversible reactions and dynamic equilibria factors affecting chemical equilibrium, Le Chatelier’s principle, equilibrium constants – definition and calculation in terms of concentration, and pressure effect of temperature on equilibrium constants.(3) Ionic equilibrium : Bronsted – Lowry theory of acid and bases, degree of dissociation, ionic product of water, solubility product, common ion effects, pH value and calculations, pH indicators and choice of indicators, strength of acids and basis, hydrolysis of salts, buffer solutions and buffer actions. Oxidation-reduction reactions and Faraday’s laws of electrolysis. Introduction to thermodynamics and thermo chemistry: Standard enthalpy changes of reaction, formation, combustions and neutralizations, free energy and entropy, first law of thermodynamics and application in thermochemistry. Hess’s law, lattice energy for single ionic crystals. Introduction to Chemical Kinetics: Simple rate equations, order of reactions, rate constant and calculations involving half-life. Effect of temperature or rate constant. Catalysis.

CHM 113: General Chemistry I Laboratory (3 Units)Introduction to Practical Chemistry. Basic experiments in Chemistry especially in the areas of Physical and Analytical Chemistry: Volumetric analysis, Gravimetric analysis, Determination of substances, filtration, fractional distillation, e.t.c.

GST 111: Use of English I (2 Units)Sentence Construction, Subject and Predicate, Introduction to Lexis, Reading and Note taking, Common Errors in English, Laboratory Report Writing, Collection and Organisation of Materials, Logical Presentation of Ideas, Punctuation.

MTH 121: Elementary Algebra II (3 Units)

12

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

MTH 122: Elementary 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, Taylor’s formula.

PHY 124: Introduction to Electricity and Magnetism (3 Units)Coulomb’s law of electrostatic: The electric field: electric field strength. Lines of force. Guass’s law. The electric potential: potential energy difference. Potential at a point in a space. The volt. Equipotential surfaces. Kinetic energy of a charged particle. The electron volt. Electric potential energy due to a charge sphere. Capacitors: capacitance for charge. Calculation of capacitance in parallel and in series. Energy required to charge a capacitor.Dielectrics: dielectric materials. Parallel plate capacitor with dielectrics.The electric circuit: electric current in a wire. Drift velocity of electrons. Electromotive force. Ohm’s law. Resistance. Resistivity, variation of resistivity with temperature, Kirchhoff’s laws. Internal resistance and its measurement. The Wheatstone bridge. Potentiometer. Combination of resistors. Chemical effects of electric current: Faraday’s laws of electrolysis. Electrochemical equivalents. The mechanism of conduction in electrolytes and ions. Determination of Avogadro’s number. Magnetic effect of current: Oesrted’s experiments. Biot and savart’s law. Magnetic field due to a long straight wirefield along the axis of a particular coil. Field due to a solenoid. Magnetic induction. Forces on a current carrying conductor in a magnetic field. Forces between two parallel conductors and definition of the Amphere. Magnetic properties of materials: magnetic flux density B, Magnetic field stenght H. Magnetic permeability. Variation of B and H hysteresisElectromagnetic Induction: induced current and induced e.m.f energy conservation: Lenz’s law, Faraday’s law of e.m.f induction. Forces on moving electrons.Alternating current and Reactive circuits: Self and mutual inductance. The induction coil. The L-R circuit, time constant. Energy associated with an inductors. The R-C circuit, growth and decay of current. The LRC circuit. Resonance tuning. Power in AC circuits. The full electromagnetic spectrum.

PHY 127: Basic Experimental Physics II (3 Units)A 3 hour per week laboratory course covering basic experiments illustrative of the second semester, 100 level physics syllabus.

CSC 121: Introduction to Problem Solving (3 Units)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). Introduction to C++ Programming Language.

STA 121: Descriptive Statistics

13

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 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.

MTH 128: Logic, Set and AlgebraBasic set operation: Union, Intersection, difference, complement, inclusion, Binary relations: fundamental theorem of equivalence relation. Functions: fundamental theorem of Arithmetic, Fermat’s theorem, Eulers existence of Fermat’s theorem. Algebraic structures, examples. Binary operations, closeness, associativity, inverse and identity, Groups rings.

GST 121: Use of English IIResearch Paper Writing, Precis Writing, Report Writing, Functional Writing: Description, Definition, etc. Logical Presentation of papers (speech writing

GNS 122: Library and Information ScienceBrief history of Libraries, Library and education, Libraries, Information and the Society, University Libraries and other types of Libraries , Study skills (reference services), Types of Library materials, using Library resources including e-learning, e-materials, etc, Understanding Library catalogues (card, OPAC, etc) and classification, copyright and its implications, Database resources, Bibliographic citations and referencing collection, Development, Preservation of Library materials- handling of Books.

CSC 211: Computer Programming INumber 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.

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.

CSC 212: Web ProgrammingLayers 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.

CSC 213: Operating Systems IBasic Concepts of operating system. Multiprocessing, Multiprogramming and Time sharing Operating system, Multitasking; Processes, Virtual Memory,; Memory Management, Resource allocation and deadlock.

MTH 213: Numerical Analysis ISolution 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

14

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 differe4nce calculus: Difference equations.

MTH 212: Mathematical MethodsDerivation 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 n th order linear equations. Application of ODE to physical, life and social sciences

MTH 211: Linear Algebra IVector spaces, subspaces, linear combinations, generators, linear dependence 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. Determination. Permutations. Formulas for the determinant expansion according to tow or column. Properties of determinants. Sub-determinants. Adjugate matrix. Grammar’s rule, volume of a parallelepiped.

SWE 212/ CS 313: System Analysis and Design

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.

GNS 211: Nigerian People and CultureStudy of Nigerian history, culture and arts in pre-colonial times, Nigerian’s perception of this world, Culture areas of Nigeria and their characteristics, Evolution of Nigeria as a political unit, Indigene/settler phenomenon, Concepts of trade, Economic self-reliance, Social justice, Individual and national development, Norms and values, Negative attitudes and conducts (cultism and related vices), Re-orientation of moral and national values, Moral obligations of citizens, Environmental problems, Nigeria under democratic rule (1999- to date)

CSC 221: Computer Programming IIC++ Basics; Data types, constants, variables, arithmetic operators, expressions, statements, input and output, pre-processor directives, structure of C program. 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.

15

CSC 222: Introduction to Data Communication and NetworkBasic concepts of networking. Network topologies. The concept of layered architecture modelling including OSI and the TCP/IP protocol suite. Client-server communications. Physical layer functionalities including signalling, modulation, multiplexing, line coding and synchronisation. Transmission media. Network performance measures. Data vs. signalling rates, channel bandwidth and capacity. Link layer functionalities including frame synchronization. Circuit, packet and virtual circuit switching technologies, Local area network technologies including ETHERNET, Token Rings. Multiple-access schemes such as CSMA/CD, CSMA/CA and Token-passing. MAC addressing. Switched vs. shared ETHERNETs. Performance evaluation, including throughputs and delays, Internetworking devices including repeaters, bridges, switches, routers and gateways. Network layer protocols, including IP, ARP and ICMP. IP addressing schemes. Subnetting, Internet routing including protocols used in the Internet such as RIP, OSPF and BGP. Transport layer protocols including UDP and TCP. Ports and sockets. TCP connection establishment. Error, flow and congestion control in TCP. Applications layer protocols such as HTTP, FTP, DNS, SMTP, TELNET.

CSC 223: Operating System IIIntroduction 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.

SWE 221: Mobile Application Development

Develop high-level plans for script solutions for mobile and evaluate the post-production outcome; design scripts to meet given interface and media control requirements; use variables, properties and other code elements appropriately to implement the code design; devise, carry out and evaluate functional test strategies of mobile design; implement and evaluate techniques for the installation of mobile applications and delivery via various channels; explain the principles of technologies which support media production and delivery on a variety of platforms.

MTH 223: Numerical Analysis IIAnalysis 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 224: Introduction to Mathematical ModelingNotion of modeling: Methodology of model building, identification, formulation and solution of problems, cause-effect diagrams, equation types, Algebraic, ordinary differential, partial differential, difference, integral and function equations. Application of mathematical models to pluprical, biological, social and behavioural sciences.

MTH 221: Linear Algebra IIBilinear 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.

16

GST 221: Peace and Conflict Resolution StudiesBasic concepts in peace studies and conflict resolution, Peace as vehicle of unity and development, Conflict issues, Types of conflicts e.g. Ethnic/Religious/Political/Economic Conflicts, Root causes of conflicts and violence in Africa, Indigene/settler phenomenon, Peace building, Management of conflict and security, Elements of peace studies and conflict resolution, Developing a culture of peace, Peace mediation and peace keeping, Alternative Dispute Resolution (ADR), Dialogue/Arbitration in conflict resolution, Role of international organizations in conflict resolution e.g. ECOWAS, African Union and United Nations.

CSC 311: Data Structure and AlgorithmReview 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. Searching and sorting algorithms. Symbol table. Hashing. Complexity analysis. Implementation of the algorithms should be using C++.

SWE 311/ CSC 411: Software Engineering 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 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.

SWE 312: Software Design ArchitectureThis course covers the concepts, principles, and state-of- the-art methods in software architectures, including domain-specific software architectures (DSSA), architectural styles, architecture description languages (ADL), software connectors, deployment and mobility, and dynamism in architecture. In the process of understanding these concepts, it also focuses on relationship to other areas of software engineering, specifically the requirements, design and implementation.

CSC 315: Theoretical Computer ScienceLogic 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. Finite state machines and finite automata. Introduction to formal and recognition by machine.

CSC 316: Research Methodology Introduction to Research Methods; criteria for good scientific practice, Literature review, critical use of existing knowledge, generalize and define limits of new findings, scientific publishing, creating document in Latex format, classification of conferences and journals, judging what material is publishable, publishing, referencing process. Theory of science: theory of science and computational science, viz. innovation, systemizing and classifying, hypothesis development and testing, establishing laws and models, criticizing own and others works. Ethics: computer ethics in research. Ethical and plagiarism, development of research plan.

MTH 316: Discrete MathematicsGraph theory. Definition of graph and digraph. Complete graphs, Bipartite graps, planner graphs. Subgraphs. Walks, path, cycles, connectedness. Applications. Shortest path problem. Trees, spanning trees the connector

17

problem. Eueran and Hamiltonian graphs. Coloring reachability in a digraph. Network flows. Generating functions, recurrence relations.

GNS 311: Business Creation and GrowthConcept of Business and New value Creation: Business planning process, Start up decision-what motivates people to begin new businesses, Opportunity search and identification, Legal issues at start up, Feasibility analysis of new ventures and new venture financing; Theories of Growth - An Overview: Concepts and reasons of growth, Challenges of growth, Strategies for growth external growth strategies, Franchising, Buy-in and Buy-out), Mergers and Acquisition;Sources of Funds: Internal sources and external sources, Formal and informal sources, Efficiency in the use of resources; Marketing: Concept of marketing: Small and big business marketing, Marketing mix, Modern marketing tools; Ethics and Social Responsibility: The importance of ethics in business, Ethical behavior and practices in Nigeria, Community Development projects/welfare; New Opportunities for Expansion: E-commerce, E-business, E-trade; Managing Transition - From start up to growth: Content Personal disciplines, Learning, Decision making, Control. GNS 312: Entrepreneurship and InnovationDevelopment Entrepreneurship: The concept Organizations and Theories of Entrepreneurship, The Entrepreneurship Culture, Biographical Studies of Entrepreneurs, Barriers to Entrepreneurial practice; The Nigerian Entrepreneurial Environment: The Business External Environment (political, legal, socio-cultural, economic, natural, technological etc.); Identifying Business Opportunities and Threats, Strategies for exploiting opportunities in the environment,Approaches to addressing environmental barriers; Creativity and Intellectual Rights: Intellectual Property and its Dimensions, Copyright Laws in Nigeria, Strategies for Protection of Intellectual Property (original ideas, concepts, products etc.); Technological Entrepreneurship: The Interface between Technology Development and Entrepreneurship, Technological Development and Entrepreneurial, Technological Environment and Business, New Technology and Entrepreneurship Opportunities; Management of Innovation: The concept, nature and types of Innovation, Theories of Innovation, Financial Innovation and New Ventures, Change Management, Technical Change and management of Innovation; Family Business and Succession Planning: The Concept of Family Business, The Cultural Contexts of Family Business, Roles and Relationship in Family Business, Ownership Transfer and Succession in Family Business; Women Entrepreneurship: The Concept of Women Entrepreneurship, Role Orientation and Women Entrepreneurial Aspirations, Contributions of Women to National Socio-economic and Human Development, Barriers to Women Entrepreneurial Practice; Social Entrepreneurship: The concept of Social Entrepreneurship, Social Entrepreneurship and Value Creation, The Roles of Non-governmental organizations in Social Entrepreneurship, Social Entrepreneurship Enhancement Factors; Business Opportunity Evaluation: Sources of Business Opportunities in Nigeria, The difference between Ideas and Opportunities, Scanning Business Opportunities in Nigeria, Environment and New Venture Idea generation.

CIT 399: SIWESIt is a six months 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.

SWE 411: Agent Oriented Software Engineering This course covers the theoretical, analytical and technical understanding of the concepts behind the technologies to produce a highly enviable skills graduate. It focuses on analysis, design, implementation and deployment of web-

18

based systems. The course involves practical work that deal with web programming for client and server development, and development of database application. It also provides issues related to the awareness of quality of service for web-based application, the importance of web security and good web management.

SWE 412: Software Quality AssuranceHow to critically evaluate alternative standards, models and techniques aimed at achieving quality assurance in a variety of software development environments; propose and defend innovative solutions to software quality assurance and measurement problems in the context of various software development environments; critically evaluate leading edge approaches in software development and attendant quality assurance methodologies, presenting the research using Harvard referencing

CSC 413: Compiler ConstructionConcept 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.

CSC 414: Database Design and ManagementDatabase 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.

SWE 413: Software Project Management Product, Process and project, Product life Cycle, Project Life Cycle Models, Process Models, Software Configuration Management, Software Quality Assurance, Risk Management.Project initiation, Project Planning and Tracking, Project Closure, Software requirement Gathering, Estimation, Design and Development Phases, Project Management in Testing & Maintenance Phase.Globalization Issues in Project management, Impact of the internet on Project Management: Project management activities, People Focused Process Models.

CSC 416: Human Computer InteractionIntroduction 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.

SWE 421: Knowledge Based Expert Systems The Human Expert and an Artificial Expert, Knowledge Base and Inference Engine, Knowledge Acquisition and Knowledge Representation, Problem Solving Process. Rule Based Systems, Heuristic Classifications, Constructive Problem Solving, Tools for Building Expert Systems.Case Based Reasoning, Semantic of Expert Systems, Modeling of Uncertain Reasoning, Applications of Semiotic Theory. Expert System Architectures, High Level Programming Languages, Logic Programming for Expert Systems. Machine Learning, Rule generation and refinement, Learning Evaluation, Testing and tuning.

CSC 423: Artificial IntelligenceUnderstanding 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.

19

CSC 422: Net Centric Computing Distributed Computing. Wireless and Mobile Network. Network security. Web application/Mobile Application Development.

SWE 422: E-Commerce Introduction to E- Commerce, Generic Framework of E- Commerce, Business Models , Network Infrastructure , E- Commerce and World Wide Web. Consumer Oriented E- Commerce Applications, Mercantile Process Models, Electronic Payment Systems, Digital Token Based Electronic Payment Systems, Smart Cards, Credit Cards, Risks, Designing Electronic Payment Systems. Electronic Data Interchange, EDI Applications in Business, EDI and E-Commerce, EDI standardization and Implementation, Internet based EDI. Security Issues, Security Services, Cryptology, Encryption Techniques, Security Protocols for Web Commerce, E-Payment Systems. Agents in E-Commerce, Advertising and Marketing on the Internet, Overview of Mobile Commerce and its Applications, E-Commerce Strategy in Business Models and Internet Start-ups: A Business Case Study.

CSC 425: Modeling and SimulationThe concept and techniques used in modeling and simulation methodology and a suitable simulation languages, modeling, generation of random variables, transformation of random numbers, parameter estimation design experiment, factorial optimization.

CSC 499: Project

20