cyber security science -...

Curriculum for B.Tech Cyber Security Science, FUT Minna, Nigeria (CODeL)

Page | 1


Page | 2

FEDERAL UNIVERSITY OF TECHNOLOGY, MINNA

CENTRE FOR OPEN DISTANCE AND E-LEARNING (CODeL)

CURRICULUM FOR CYBER SECURITY SCIENCE

2011/2012 ACADEMIC SESSION


Page | 3

FEDERAL UNIVERSITY OF TECHNOLOGY, MINNA CENTRE FOR OPEN DISTANCE AND E-LEARNING (CODEL)

DEPARTMENT OF CYBER SECURITY SCIENCE B.TECH. CYBER SECURITY SCIENCE

PHILOSOPHY

The philosophy establishing universities of technology in Nigeria generally is to build national capacity to move the country from its status of a third world and developing nation to that of an advanced and developed nation, through technological advancement that drives development, and develop high level manpower that will create job and wealth.

Specifically, the Department of Cyber Security Science will build capacity and develop human capital to the highest level possible in the field of cyber security science to safeguard the information super-highway (the Internet), create job and wealth, and reduce unemployment and poverty.

VISION

The Department of Cyber Security Science is structured to be a leading academic department of excellence in the society for unequalled service delivery in Cyber Security Science.

MISSION The Department of Cyber Security Science will build capacity and develop human capital to high level through pragmatic and dynamic training, research and developmental services of high standards in the field of cyber security science that meet the demands of the society and will stand the test of time and space.

OBJECTIVES OF THE DEPARTMENT

The goal of the programmes in the department are to:

a. Provide excellent career opportunities by official a high level coverage of security principles

b. Give an understanding of the theoretical basis of security science and its importance in network administration.

c. Give a foundation in professional security standards of security analysis, design, implementation, testify and documentation is security systems.

d. Given an appreciation of the security, professional, ethical and legal obligation. e. Give an appreciation of the current state and future directions of technological

advances in security science. ADMISSION REQUIREMENTS There are two modes of admission into the First Degree Programme.

(a) THROUGH UME The requirements are 5 O’Level credits including Mathematics, Biology, Physics and/or Chemistry, English Language and a science subject, in NECO, WAEC or NABTEB.


Page | 4

(b) THROUGH DIRECT ENTRY

(i) Holders of minimum of Lower Credit Level in National Diploma Cyber Security or Computer Science may qualify for admission into 200 Level.

(ii) Holders of HSC/GCE-A’Level/IJMB with passes in Mathematics,

Physics and Chemistry qualify for admission in to 200 Level (iii) Holders of HND with at least Lower Credit in

Electrical/Electronic/Computer Engineering/ Physics electronics/computer Science may also qualify for admission into 300 Level.

NB: These direct-entry requirements are in addition to the O’Level grades stipulated in (a)

above.

REQUIREMENTS FOR GRADUATION

To be eligible for the award of B.Tech. (Information and Cyber Security), a student must have:

(a) passed all core (compulsory) courses as well as all electives prescribed for this programme;

(b) accumulated at least 200 course units and obtained a CGPA of not less than 1.00; and

(c) completed successfully all class works, industrial attachments, seminars and projects.


Page | 5

COURSE STRUCTURE

100 LEVEL (1st SEMESTER)

S/N COURSE CODE COURSE TITLE UNITS L

T

P

PRE-REQUISITE

1 MAT 111 ALGEBRA & TRIGONOMETRY 3 2 1 -

2 MAT 112 VECTOR, GEOMETRY & DYNAMICS 3 2

- -

3 STA 117 INTRODUCTION TO STATISTICS 2 2

-

-

4 CPT 111 INTRODUCTION TO COMPUTER 2 2

-

-

5 PHY 113 MECHANICS 3 2

-

-

6 GST 110 USE OF ENGLISH I &LIBRARY 3 2

1

-

7 GST 105 INTRODUCTION TO NIGERIAN LAW 2 1

1

-

8 TCD 111 TECHNICAL DRAWING 1 2

-

-

9 WKS 110 WORKSHOP PRACTICES 1 2

1

-

10 IMT 112 BASIC COMPUTER TOOLS 2 2

-

-

TOTAL 22


Page | 6

100 LEVEL (2nd SEMESTER)


T

P

PRE-REQUISITE

1 MAT 121 DIFF. & INTEGRATION CALCULUS 3 2

1 -

2 STA 127 PROBABILITY I 2 2 - -

3 GST 103 NIGERIAN PEOPLE & CULTURE 2 2

-

-

4 GST 121 USE OF ENGLISH II 2 2

-

-

5 PHY 123 PROPERTIES OF MATTER 2 2

-

-

6 PHY 126 ELECTRICITY & MAGNETISM 3 2

1

-

7 CPT 121 INTRODUCTION TO PROGRAMMING 2 1

1

-

8 GST 104 INTRODUCTION TO ECONOMICS 2 2

-

-

9 GRY 124 INTRODUCTION TO ENVIRONMENTAL SCIENCE 3 2

1

-

10 CSS 121 INTRODUCTION TO CYBERCRIME & PREVENTION 2 2

-

-

11 LIT 121 INTRODUCTION TO INFORMATION STUDIES 3 2

1

-

12 IMT 123 WEB BASE TECH. & MULTIMEDIA APPLICATION 3 2

-

1

TOTAL 23


Page | 7



T P PRE-REQUISITE

1 CPT 211 OBJECT ORIENTED PROGRAMMING I 3 2

- 1

2 CPT 213 INTRODUCTION TO CUMPUTER SYSTEM 2 2

- -

3 CPT 214 COMPUTER ARCHITECTURE 3 2 1 -

4 GST 211 LOGIC & PHILOSOPHY 2 2 - -

5 CSS216 CRYPTOGRAPHY THEORY I 3 2 1 -

6 MAT 212 LINEAR ALGEBRA I 2 2 - -

7 STA 217 PROBABILITY II 2 2 - -

TOTAL 17


Page | 8



T P PRE-REQUISITE

1 CPT 221 OBJECT ORIENTED PROGRAMMING II 2 2

- -

2 CSS 223 INTRODUCTION TO CRIMINAL JUSTICE 2 2

-

-

3 CPT 223 INTRODUCTION TO ALGORITHMS 3 2

1 -

4 CPT 222 DATA STRUCTURES 3 2 1 -

5 CSS 222

FOUNDAMENTAL OF INFORMATION

SECURITY 3 2

1

-

6 MAT 225

INTRODUCTION TO NUMERICAL

ANALYSIS 3 2

1

-

7 MAT 222 LINEAR ALGEBRA II 2 2 - -

8 CSS 224 AUTOMATA 3 2 1 -

TOTAL 18


Page | 9



T P PRE-REQUISITE

1 CSS 311 CYBER CRIME & COUNTERMEASURES 3 2

1

-

2 CSS 312 CRYPTOGRAPHY THOERY II 3 2

1

-

3 CSS 313 WIRELESS NETWORKING 3 2

1

-

4 CPT 316 SYSTEM ANALYSIS & DESIGN 3 2

1

-

5 CSS 314 ADVANCE WEB & PORTAL DESIGN 3 2

1 -

6 GST 311 ENTERPRENURESHIP STUDIES 2 2 - -

7 CPT 317

ARCHITECTURE OF DATA &

COMMUNICATION NETWORK 3 2

1

-

8 CPT 313 OPERATING SYSTEM 3 2 1 -

TOTAL 20


Page | 10



T

P

PRE-REQUISITE

1 CSS 321

INFO. SYSTEM THREATS,

ATTACKS & DEFENCES 3 2

1

-

2 CSS 322 NETWORK MANAGEMENT & SECURITY 3 2

1

-

3 CSS 323 CYBER CRIME LAW 2 2 - -

4 CSS324 OPERATING SYSTEM SECURITY 3 2

1 -

5 CSS 325 INTRODUCTION TO WEB HACKING 3 2

1

-

6 CSS 326 SOFTWARE ENGINEERING 2 2 -

7 CSS 327

DEVELOPMENT IN THE .NET

ENVIRONMENT 3 2

1

-

8 CPT 321 COMPUTER GRAPHICS 3 2 1 -

TOTAL 17


Page | 11



T P PRE-REQUISITE

1 CPT 413 SYSTEM OPERATION RESEARCH 3 2

1 -

2 CSS 411 DIGITAL FORENSIC 3 2 1 -

3 CSS 412 ETHICAL HACKING & COUNTERMEASURES 3 2

1

-

4 CSS 413

SECURITY STRATEGIES FOR WEB

APPL. & SOCIAL NETWORKS 3 2

1

-

5 CSS 414

SECURITY ANALYSIS & VULNERABILITY ASSESSMENT 3 2

1

-

6 CSS 415 DISASTER RECOVERY 3 2 1 -

7 CSS 416 CLOUD COMPUTING 3 2 1 -

8 MAT 412 DISCRETE MATHEMATICS 3 2 1 -

TOTAL 21


Page | 12


STUDENT INDUSTRIAL WORK

EXPERIENCE SCHEME (SIWES) 12


Page | 13



T P PRE-REQUISITE

1 CSS 511 ENTERPRENURESHIP II 2 2 - -

2 CSS 512

ETHICAL HACKING &

COUNTERMEASURES II 3

2

1

-

3 CPT 512 GRID COMPUTING 2 2 - -

4 CSS 513 PENETRATION TESTING I 2 2 - -

5 CSS 514 CYBER FORENSIC 3 2 - -

6 CSS 515 BIOMETRIC SECURITY TECHNOLOGY 3 2

1

-

7 CPT 515 ARTIFICIAL INTELLIGENCE 3 2 1 -

TOTAL 16


Page | 14



T P PRE-REQUISITE

1 CSS 529 PROJECT 6 - - -

2 CSS 521 e-BUSINESS SECURITY 2 2 - -

3 CSS 522 CURRENT TRENDS IN CYBER SECURITY 2 2

- -

4 CSS 523 DEVELOPMENT IN THE J2EE ENVIRONMENT 2 2

-

-

5 CSS 524 PENETRATION TESTING II 2 2 - -

6 CSS 525 INTERNET PROTOCOL VERSION 6 (IPV6) 2 2

-

-

7 CPT 522 DATA MINING 2 2 - -

TOTAL 16


Page | 15

COURSE SYNOPSES

100 LEVEL COURSES

MAT 111: ALGEBRA AND TRIGONOMETRY (3CREDITS) Elementary set theory, subsets, union, intersection, complements, Venn diagram. Number Systems, real number system, complex number system, real line, inequality, surds, indices and logarithm. Mathematical Induction, sequence and series, partial fraction. Equations, Polynomials, remainder theorem, completing the square, change of variable, reciprocal equation, method of rationalization, simultaneous equation, theory of quadratic equations, Binomial theorem, Matrices and determinants, circular measure, trigonometric functions of angles of any magnitude, addition and factor of formulae. MAT 112: VECTOR, GEOMETRY AND DYNAMICS (3 CREDITS)

Geometric representation of vector in 1-3 dimensions components direction cosines, scalars and vector with respect to a scalar variable. Coordinate geometry, distance between two points, equation of straight line, equation of a line in normal form, equation of tangent, equation of ellipse, equation of parabola, equation of hyperbola, equation of conic section, equation of a circle. Tangents, normal, kinematics of a particle. component of velocity and acceleration of a particle moving in a plane. Force, momentum, laws of motion under gravity, projectiles, resisted vertical motion, elastic string, simple pendulum impulse impact of two smooth sphere, and of a sphere on a sphere.

STA 117: INTRODUCTION TO STATISTICS (2 CREDITS) Statistical data, their sources, collection and preliminary analysis by tables and graphs, measure of location and dispersion (for grouped and ungrouped data), skewness and kurtosis, simple regression and correlation analysis, index numbers. CPT 111: INTRODUCTION TO COMPUTER (2 CREDITS) Background: History of computing, overview of programming languages and the

compilation process. Algorithms: Definition, design, and implementation;

introduction to classical algorithms (sorting, searching, and pattern matching).

Algorithmic analysis: Efficiency; asymptotic analysis; computational complexity; big-

O notation; polynomial vs. exponential growth; computability. 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; brief

introduction to a programming language that supports the object-oriented paradigm.

Hardware realizations of algorithms: Data representation; the von Neumann model


Page | 16

of computation; the fetch/decode/execute cycle; basic machine organization.

Operating systems and virtual machines: Historical evolution of operating systems;

responsibilties of an operating system; basic components of an operating system.

Networking and computer graphics: Brief introduction to some of the basic

concepts in networking and computer graphics. Computing applications: Word

processing; spreadsheets; editors; files and directories.

PHY 113: MECHANICS (3 CREDITS)

Space and Time, frames of reference, Units and dimension, Kinematics; Fundamental Laws of Mechanics, static’s and dynamics; Galilean invariance; Universal gravitation; work and energy; rotational dynamics and angular momentum; Conservation laws:

GST 110: USE OF ENGLISH AND LIBRARY (3 CREDITS) General Introduction to Effective Communication and Writing English: Definition of communication, The elements and process of communication. Writing Effectively: Writing of essays, including answers to examination questions. Academic sources of information; key areas in answering examinations questions, vocabulary of questions, explanation of question terminologies, sample questions and analyses. Definition of reports/technical report: purpose of writing technical report, skills in technical report writing e.g. Exposition, Narration, Description and argumentation. Attributes of a technical report. Characteristics of Technical and non-technical reports - Formal and informal. Examples of formal Technical report. Basic/ Outline/ Structure. Research Report Writing as a variety Technical Report: Definition of Research, Objectives of writing a research Report. The Research Process. Varieties/Types of researches e.g. experimental, empirical, observation, case study, surveys. Sections of a research re[ort and their functions e.g Title, Abstract, Review of Literature etc. Data collection methods in Research Writing. PART TWO - Library Nature and concept of library; Introduction. The Library users. The five fundamental laws of librarianship. The importance of course Üse of Library/ Aims and objectives of user education. Types of Libraries. The charging system. Functions of a University Library.


Page | 17

GST 105: INTRODUCTION TO NIGERIAN LAW (2 CREDITS)

The meaning of Law. Schools of thought : naturalists school, realist school, sociological school, historical school. Legal terms and terminologies. Classification of Law. Sources of Nigerian Law: Local (Nigerian legislations; received English Law), the doctrines of equity; the statutes of general application; judicial precedence; books of authority. Nigerian Court system. Nigerian Constitutional development. The rule of Law. Separation of powers. Impeachment proceedings. The immunity clause, extents and limitations. Revenue allocation and the constitutional derivation formula. The Constitutional provision on fundermental human rights. Citizenship. TCD 111: TECHNICAL DRAWING (1 CREDIT)

Aims and objectives of Technical Drawing. Differences between technical drawing fine art and photography. Drawing equipment, drawing layout, numbering and lettering principles of construction of common figures. Construction of angles, triangles, circles, tangents, quadrilaterals and polygons using different methods of construction. Methods of dividing circle, four equal circles in a square etc.

WKS 110: WORKSHOP PRACTICES (1 CREDIT)

Use of engineering measuring instruments, e.g. clippers gauges, etc. introduction to hand tools, e.g. practice in wood planners, saws, sanders and pattern making; sampling and sizing techniques of raw materials. Sheet metal work: production of sheet metal products – layout, cutting and shaping, gas welding, soldering, brazing, fastening and assembling. Woodwork: basic woodworking principles and tools –layout methods, cutting and evaluation, finished products. IMT 112: BASIC COMPUTER TOOLS (2 CREDITS) Introduction to application software. Hands-on practical on word processing, record management, database, spreadsheet, communication, spreadsheet software, Hand-on-Internet surfing and down loading, Power point presentation, etc. CSS 121 INTRODUCTION TO CYBER CRIME AND COUNTERMEASURES (3 CREDITS)

General introduction to cyber crime, different types of cyber crime including: cyber terrorism, pornography, credit card frauds etc. and possible ways of curbing them.

MAT 121: DIFFERENTIAL AND INTEGRAL CALCULUS (3 CREDITS) Function of a real variable, graph, limits and idea of continuity. The The derivative as limit of change, techniques of differentiation. Extreme curve sketching; integration as an inverse of differentiation, method of integration, definite integrals, application to area volume.


Page | 18

STA127 PROBABILITY I (2 CREDITS)

Generation of statistical events from set theory and combinatorial methods;

elementary principle of probability: addition, multiplication and conditional

probability, Bayes’ rule, one dimensional random variables (discrete and continuous);

Types and distribution of random variables ( discrete and continuous), their

expectations and moments, Application to the Bernoulli, binomial, poison, geometric,

hypergeometric,

GST 103: NIGERIAN PEOPLES AND CULTURE (2 CREDITS) Study of Nigerian history; culture and arts in pre-colonial times; Nigeria’s perception of this world; culture and their characteristics; Evolution of Nigeris as a political unit; Indigene/settler phenomenon; Concepts of trade; Economic self-reliance; Social justice; Individual and National development; Norms and values; Negavtive attitudes and conducts (cccultism and related vices); re-orientation of moral and national values; moral obligations of citizens; Environmental problems GST 121: USE OF ENGLISH II (2 CREDITS) Reading Techniques and study skills and Reading comprehension: Definition/Concept of Reading, reading error purposes: reading strategies. Reading techniques, skimming, scanning SQ3R, main ideas in a passage and others. Summary writing, Vocabulary development-How to enrich your vocabulary, Registers/ lexis, American and British vocabulary differences. Oracy skills. CPT 121: INTRODUCTION TO PROGRAMMING (2 CREDITS)

Programming languages: History of programming languages; brief survey of

programming paradigms (procedural, object-oriented, functional). Algorithms and

problem-solving: Problem-solving strategies; the concept of an algorithm; properties

of algorithms; implementation strategies; sequential and binary search algorithms;

quadratic sorting algorithms (selection, insertion). Principles of encapsulation:

Encapsulation and information-hiding; separation of behavior and implementation.

Fundamental data structures: Primitive types; arrays; records; strings and string

processing; pointers and references; static, stack, and heap allocation; runtime storage

management. Machine level representation of data: Bits, bytes, and words; binary

representation of integers; representation of character data; representation of records

and arrays. Assembly level machine organization: Basic organization of the von

Neumann machine; instruction fetch, decode, and execution; assembly language

programming for a simulated machine. Software development methodology:


Page | 19

Fundamental design concepts and principles; structured design; testing and debugging

strategies; test-case design; programming environments; testing and debugging tools.

Introduction to language translation: Comparison of interpreters and compilers;

language translation phases (lexical analysis, parsing, code generation, optimization);

machine-dependent and machine-independent aspects of translation.

PHY 123: PROPERTIES OF MATTER (2 CREDITS)

Atomic Viewpoint, interatomic forces, melting and evaporation in molecular terms. SVP in terms of dynamic equilibrium. The Zeroth law of thermodynamics: Kinetic theory of gases, assumptions, pressure formulae, energy and temperature, Gas constant and Boltzman’s constant, various forms of gas equation.

Work done by expanding gases Cp and by Cv., Isothermal and adiabatic changes, Real gases, critical temperature, van der waal change of state, laws of thermodynamics. Elasticity, strain, stress, moduli of elasticity, Young’s sending moments, Hydrostatics, pressure, buoyancy, Archimedes’ principles, surface energy, excess pressure, formula, measurement of surface tension by various methods, coefficients, Hydrodynamics: streamlines, Bernoulli and continuity equations, turbulence, Reynolds numbers.

Viscosity: Laminar flow: Pineville’s formula, measure of coefficient of viscosity, variation with temperature.

PHY 126: ELECTRICITY AND MAGNETISM (3 CREDITS)

Electric Field and Electric Potential, Field of force, Electric Field. Electric charge, magnetic Field nuclear field, Electrostatics, Coulomb’s law, electric field, Potential energy relations, Gauss theorem, Equipotentials, capacitance, parallel plate and practical forms of capacitors, capacitors in series and parallel, energy stored, dielectrics, action of dielectric charging and discharging a capacitor.

GST 104 INTRODUCTION TO ECONOMICS (2 CREDITS)

The course introduces students to the following topics: Scope and nature of economics; the price system; theory of cost and production; the market structure; Business organizations; Money; Inflation; National income; Microeconomics and Macroeconomics.

GRY 124 INTRODUCTION TO ENVIRONMENTAL SCIENCE (3 CREDITS)

Energy systems in the atmosphere, biosphere, hydrosphere and lithosphere, current environmental problems (deforestation, pollution, desertification, soil erosion, flood and other natural disasters etc); biogeochemical cycles; ecosystems balance and its description; population explosion and issues of world food and water supply; effect of agriculture on environment; global energy problems and alternative energy sources, the problems of waste management, etc.


Page | 20

200 LEVEL COURSES

CPT 211: OBJECT-ORIENTED PROGRAMMING I (Core, 3 Units)

Prerequisite: CPT 121

Overview of programming languages and the compilation process. Introduction to object-oriented programming: Introduction to a typical object-oriented language such as Java; classes and objects; syntax of class definitions; methods, members. Simple data: variables, types, and expressions; assignment. Message passing: Simple methods; parameter passing. Sub-classing and inheritance. Control Structures: iteration, conditionals. Algorithms: problem-solving strategies; the concept of an algorithm; properties of algorithms; implementation strategies. Simple Data structure; Arrays; strings. Object Oriented Design; Fundamental design concept and principles; introduction to design patterns; object oriented analysis and design; design for reuse.

CPT 213: INTRODUCTION TO COMPUTER SYSTEM (Core, 2 Units)

Introduction: Brief history of computing; the components of computing system. Machine level representation of data: Bits, bytes, and words; numeric data representation and number bases; fixed and floating-point systems; signed and twos complement representations; fundamental operations on bits; representation of nonnumeric data ( character codes, graphical data); representation of records and arrays. Digital logic: Switching circuits; gates; memory. Assembly level machine organization: Basic organization of the von Neumann machine; control unit; instruction fetch, decode, and execution; instruction sets and types (data manipulation, control, I/O); assembly/machine language programming; instruction format, addressing modes; subroutine call and return mechanisms; I/O and Interrupt. Input and Output: simple I/O; files. Basic Computability: Finite- state machines; Turing machines; tractable and intractable problems; incomputable functions; the halting problem; implications of computability.

CPT 214: COMPUTER ARCHITECTURE ( 3 Units)

Prerequisite: CPT111

Digital logic: Fundamental building blocks (logic gates, flip-flops, counters, registers, PLA); logic expressions, minimization, sum of products forms; register transfer notation; physical considerations ( gate delays, fan-in, fan-out). Memory systems: Storage systems and their technology; coding, data compression, and data integrity; memory hierarchy; main memory organization and operations; latency, cycle time, bandwidth, and interleaving; cache memories (address mapping, block size, replacement and store policy); virtual memory (page table, TLB); fault handling and reliability. Interfacing and communication: I/O fundamentals; handshaking, buffering, programmed I/O, interrupt- driven I/O; interrupt structures; vectored and prioritized interrupt acknowledgement; external storage, physical organizations, and drives; buses: bus protocols, arbitration, direct-memory access (DMA); introduction to networks, multimedia support raid architectures. Functional organization: implementation of simple data paths; control unit: hard wired realization vs microprogrammed realization; instruction pipelining; introduction to instruction-level parallelism (ILP). Multiprocessor and alternative architectures: Introduction to SIMD, MIMD, VLIW, EPIC; systolic architecture;


Page | 21

interconnection networks; shared memory systems; cache coherence; memory models and memory consistency. Performance enhancement: RISC architecture; branch prediction; prefetching; Scalability. Contemporary architectures: Hand held devices; embedded systems; trends in processor architecture.

CSS 216: Cryptography Theory I (3 CREDITS)

Introduction to simple Cryptosystems: Shift Cipher, Substitution Cipher, Affine Cipher, Vigenere Cipher, Hill Cipher, Permutation Cipher, Streams Cipher. Cryptananlysis: Cryptananlysis of Affine, Cryptanalysis of Substitution Cipher, Cryptanalysis of Vigenere Cipher, Cryptanalysis of Hill Cipher, Cryptanalysis of substitution Cipher, Crytanalysis of streams Ciphers. Shannon’s Theory: Introduction, Elementary probability theory, Perfect Secrecy; Entropy: Huffman Encoding, Properties of Entropy, Spurious Keys and Unicity distance, product cryptography.

MAT 212: LINEAR ALGEBRA I (2 CREDITS)

Vector space over the real field, subspaces, linear independence, basis and dimension, linear transformation and their representation, matrices, range, null space rank, singular and non-singular transformation and matrices, algebra of matrices.

STA 217: PROBABILITY II (3 CREDITS)

Combinatorial analysis, probability models for the study of random phenomena infinite sample spaces, Bayes’ theorem, probability distribution of discrete and continuous random variables and their expectations, Univariate probability and moments generating functions, Chebyshev's inequality. Bivariate, marginal and conditional distributions and moments, convolution of two distributions, the central limits theorems and its uses. Baye’s theorem.

CPT 221: OBJECT-ORIENTED PROGRAMMING II (2 CREDITS)

Review of object-oriented programming: Object-oriented methodology, object-oriented design; software tools. Principles of object-oriented programming: inheritance, class hierarchies; polymorphism; abstract and interface classes; container/collection classes and iterators. Object-oriented design: concept of design patterns and the use of APIs; modeling tools such as class diagrams. CRC cards and UMI use cases. Virtual machines: the concept of a virtual machine; hierarchy of virtual machines; intermediate languages. Fundamental computing algorithms: searching, sorting, introduction to recursive algorithms. Fundamental data structures: built-in, programmer-created, and dynamic data structures. Event-driven programming: event-handling methods; event propagation; exception handling. Foundations of human-computer interaction: human-centred development and evaluation; principles of good design and good designers; engineering trade-offs; introduction to usability testing. Fundamental techniques in graphics: hierarchy of graphics software, using a graphics API; simple colour models; homogeneous coordinates; affine transformations; viewing transformation; clipping. Software engineering issues: tools; processes; requirements; design and testing; design for reuse; risks and liabilities of computer-based systems.


Page | 22

CSS 223 INTRODUCTION TO CRIMINAL JUSTICE (2 CREDITS)

History, theory, and structure of the criminal justice system emphasizing substantive and procedural criminal law; police, prosecution, defense, courts, institutional and community corrections; juvenile justice subsystem.

CPT 222: DATA STRUCTURES (Core, 3 Units)

Review of object-oriented design. Fundamental data structures: Primitive types; records; the idea of type abstraction; pointers and references; linked structures; implementation strategies for stacks, queues, and hash tables; implementation strategies for graphs and trees; strategies for choosing the right data structure. Fundamental issues in language design: general principles of language design, design goals, typing regimes, data structures models, control structure models, abstraction mechanisms.

CPT 223: INTRODUCTION TO ALGORITHMS (Core, 3 Units)

Algorithms and problem-solving: the role of algorithms in the problem-solving process; the concept and properties of algorithms; classic techniques for algorithm design and implementation and their place in an object-oriented design; application of algorithm design techniques to a medium-sized project’ with an emphasis on formal methods of testing; introduction to basic algorithmic analysis. Recursion: the concept of recursion; implementation of recursion and its relation; recursive specialization of mathematical functions (such as factorial and Fibonacci); simple recursive procedures (Towers of Hanoi, permutations, fractal patterns):; divide-and-conquer strategies; recursive backtracking; introduction to trees and graphs. Software engineering: software project management; building a medium-sized system, in teams, with algorithmic efficiency in mind.

CSS 225: FUNDAMENTALS OF INFORMATION SECURITY (3 UNITS)

History of IS security; Security attacks; Hacker methods & motivation; legal aspects of IS security; Developing an effective security policy; IT risk assessment; Firewalls; Encryption and Hashing; Intension.

MAT 222: LINEAR ALGEBRA II (Core, Units)

System of linear equations, change of basis , equivalence and similarity, Eigenvalues and Eigen vectors, minimum and characteristic polynomials of a linear transformation(matrix) Caley-Hamilton theorems, bilinear and quadratic forms, orthogonal diagonalisation, canonical forms. Pre-requisite MAT111, 112

MAT 225: INTRODUCTION TO NUMERICAL ANALYSIS (3 CREDITS)

Solution of algebraic and transcendental equations, curve fitting. Error analysis. Interpolation and approximation. Zeros or non-linear equations `in one variable’. Systems of linear equations. Numerical differentiation and integration. Initial value problems for ordinary differential equation. Pre-requisite MAT 111, 121.


Page | 23

CSS 224 AUTOMATA (3 CREDITS)

Introduction to computation theory: RE, RL, FA, DFA, NFA, etc. Context-Free Grammars and Languages: Context Free Grammars, Ambiguity in Languages and Grammars. Push-Down Automata: Definition of PushDown Automata, the Languages of a PDA, Equivalence of PDA’s and CFG’s, deterministic PushDown Automata. Properties of Context-Free Languages: Normal Forces for Context-Free Grammars, the Pumping Lemma for Context-Free Languages, Closure Properties for Context-Free Languages, Decision Properties for Context-Free Languages (CFL)

300 LEVEL COURSES

GST 311: ENTREPRENEURSHIP STUDIES (2 CREDITS)

Understanding the role of Entrepreneurship and innovation in new small ventures and existing firms. Exposure to the issues related to starting and managing new small ventures, and establishing entrepreneurial programmes in the existing firms. The economic characteristics of New Ventures; Definition of Entrepreneurship; The entrepreneurship mind; Critical success factors in New Venture failure; Common reasons for New Venture failure; New Venture evaluation processes and feasibility testing; The entrepreneurial team; Writing a Venture Summary / Venture Summary; and Social entrepreneurship

CSS 311: CYBER CRIME AND COUNTERMEASURES (3 CREDITS)

This provides detail discussion and possible solutions on various type of cyber crime such as: cyber terrorism, cyber pornography, defamation, stalking, online gambling, e-mail spoofing, electronic transaction forgery, etc

CSS 312: CRYPTOGRAPHY THEORY II (3CREDITS)

Public-key Cryptography and Discrete Algorithms: ELGamal Cryptography. Algorithms for the Discrete Logarithm Problem: Shank’s algorithm, Pollard Rho Discrete Algorithm, Pohlig-Hellman Algorithm, Index Calculus Method, Lower Bounds on Complexity of Generic, Algorithms, finite fields. Elliptic Curves: Curves over the real, Elliptic curves modulo a prime, Properties of Elliptic curves, Point compression and ECIES, Computing point multiples on Elliptic curves. Security of ELGamal: Bit Security of Discrete Logarithms, Semantic Security of ELGamal Systems, Diffie-Hallman problems

CSS 313 WIRELESS NETWORKING (3 CREDITS )

This course provides an introduction to the fundamental concepts of remote access and wireless networking. The focus is on standard and proprietary wireless solutions including: 802.11, HiPER LAN and major proprietary technologies including Medium Access Control (MAC) Layer, Frequency Hopping Spread Spectrum (FHSS) Physical Layer, Direct Sequence Spread Spectrum (DSSS) Physical Layer, and Infrared (IR) Physical.


Page | 24

CSS 314: ADVANCE WEB AND PORTAL DESIGN (3 CREDITS)

Web design essentials; PHP; Dreamweaver; JavaScript; Photoshop for web programming; other FOSS packages.

CPT 313: OPERATING SYSTEMS (Core, 3 Units)

Overview: Role and purpose of operating systems; history of operating system development; functionality of a typical operating system; design issues (efficiency, robustness, flexibility, portability, security, compatibility). Basic principles: structuring methods; abstractions, processes, and resources; design of application programming interfaces (APIs); device organisations; interrupts; user/system state transitions. Concurrency: the idea of concurrent execution; ststes and state diagrams; implementation structures (ready lists, process control blocks, etc.); dispatching and context switching; interrupt handling in a concurrent environment. Mutual exclusion: definition of the “mutual exclusion” problem; deadlock detection and prevention; solution strategies; models and mechanisms (semaphores, monitors, condition variables, rendezvous); producer-consumer problems; synchronization, multiprocessor issues. Scheduling: prememptive and non-preemptive scheduling policies; processes and threads; real-time issues. Memory management: review of physical memory and memory management hardware; overlays, swapping, and partitions; paging and segmentation; page placement and replacement policies; working sets and thrashing; caching. Device management: characteristics of serial and parallel devices; abstracting device differences; buffering strategies; direct memory access; recovery from failures. File systems: fundamental concepts (data, metadata, operations, organisation, buffering, sequential vs. nonsequential files); content and structure of directories; file system techniques (partitioning, mounting and unmounting, virtual file systems); memory-mapped files; special-purpose file systems; naming, searching and access; backup strategies. Security and protection: overview of system security; policy/mechanism separation; security methods and devices; protection; encryption; recovery management.

CPT 316: SYSTEMS ANALYSIS AND DESIGN (3 Units)

Introduction and overview. Systems development and the systems analyst. Systems developmet methodologies, models, tools and techniques. Project management and the Unifiied Process. The requirements discipline. Detailed requirements modeling. Design activities and environments. Use case realization. System access. Implementation.

CPT 317: ARCHITECTURES FOR NETWORKING & COMMUNICATION (Core, 3 Units)

Distributed Algorithms: Consensus and election; termination detection; fault tolerance; stabilization. Interfacing and communication: I/O fundamentals; interrupt structures; external storage, physical organisation, and drives; buses; introduction to networks; multimedia support; RAID architectures. Mutiprocessing and alternative structures: introduction to SIMD, MIMD, VLIW, EPIC; systolic architecture; interconnection networks; shared memory systems; cache coherence; memory models and memory consistency. Architecture for networks and distributed systems: introduction to LANs and WANs; layered protocol design, ISO/OSI, IEEE 802; impact of architectural issues on distributed algorithms; network computing; distributed multimedia. Concurrency: states and state diagrams; structures; dispatching and context switching; the role of interrupts; concurrent execution; the “mutual


Page | 25

exclusion” problem and some solutions; deadlock; models and mechanisms; producer-consumer problems and synchronization; multiprocessor issues.

CSS 321 INFORMATION SYSTEM THREATS, ATTACKS AND DEFENSES (3 CREDITS) Methods and motives of cyber-security incident perpetrators, and the countermeasures employed to organizations and agencies to prevent and detect those incidences. Ethical obligations of security professionals.

CSS 322 NETWORK MANAGEMENT AND SECURITY (3 CREDITS)

By presenting an overview of the management tools necessary to understand the LAN hardware and software for client server architecture technology, this course focuses on the installation and management of the LAN and the connectivity to other systems and networks. This course emphasizes hands-on learning including how to install, configure, and implement a network.

CSS 323 CYBER CRIME LAW (2 CREDITS) Cyber crimes, including computer crimes, Internet fraud, e-commerce, and threats to the national infrastructure. Policies, legal issues, and investigative techniques and strategies, and implications for investigation and enforcement on a global scale. Introduction to cyber law; Studies in cyber law application at the international and national levels with examples from European, North American, South American and Asian Countries; the cyber law framework in Nigeria; challenges and opportunities for enforcement in Nigeria.

CSS 324 WINDOWS/UNIX/LINUX SECURITY (3 CREDITS)

This course presents an introduction to the history and fundamentals of the Unix/Linux Operating system. Topics include the history of Linux and open source code, files and directories, shell commands; K Desktop Environment; and the GNU Network Obeject Model Environment.

CSS 325: INTRODUCTION TO WEB HACKING (3 CREDITS)

Security foundations; security principles; Ethics and legality; Internet foot printing; Scanning/Landscape discovery; Windows security overview; Attacking windows systems; securing windows systems; Unix security overview; attacking/securing UNIX systems; Web security essentials; Network security essentials; Incident response, cryptography and encryption best practice, Malware.

CSS 326: SOFTWARE ENGINEERING (2 CREDITS)

Issues in software engineering: Software lifecycle, process models. Requirements: software requirements, requirements engineering process system models. Design: design principles, architectural design, user interface design. Verification and validation, software testing , debugging.


Page | 26

CSS 327 DEVELOPMENT IN THE .NET ENVIRONMENT (3 CREDITS)

This course introduces students to various concepts in the .NET environment and programming standards within that environment. Topics may include Windows desktop application development, multi-user application development using ASP.NET, ADO.NET, XML, and Web Server.

CPT 321: COMPUTER GRAPHICS (Core, 3 Units)

Graphic systems: Raster and vector graphics systems; video display devices; physical and logical input devices; issues facing the developer of graphical systems. Fundamental techniques in graphics: hierarchy of graphics software; using a graphics API; simple colour models; homogeneous coordinates; affine transformations; viewing transformation; clipping. Graphical algorithms: line generation algorithms; structure and use of fonts; parametric polynomial curves and surfaces; polygonal representation of 3D objects; parametric polynomial curves and surfaces; introduction to ray tracing; image synthesis, sampling techniques, and anti-aliasing; image enhancement. Graphical user-interface design: choosing interaction styles and interaction techniques; HCI aspects of interface design; dynamics of colour; structuring a view for effective understanding. Graphical user-interface programming: graphical widgets; event management and user interaction; GUI builders and programming environments. Computer animation: key-frame animation, camera animation; scripting system; animation of articulated structures; motion capture; procedural animation; deformation. Multimedia techniques: sound, video, and graphics; design of multimedia systems; tools for multimedia development; virtual reality.

400 LEVEL COURSES

CPT 413: SYSTEM OPERATION RESEARCH (Core, 3 Units)

The nature of operation research; allocation problems; inventory problems; Replacement; maintenance and reliability problems. Dynamic programming; sequencing and co-ordination. MAT 412: DISCRETE MATHEMATICS (Core, 3 Units)

Groups and subgroups; group anions, permutation group, closets, Graphs; Directed and undirected graphs, sub graphs, cycles, connectivity, Application (flow chart) and state transition graphs, Lactics and Boolean Algebra, Finite fields; Mini polynomials. Irreducible polynomials, roots, Application (error correcting codes, sequences generators.

CSS 411: DIGITAL FORENSIC (3 CREDITS)

Intro. To Digital forensic, Digital evidence, Increasing awareness of Digital evidence, challenging aspects of Digital evidence, following the cyber trail, challenging aspects of the cybertrail, brief history of computer crime investigation, evolution of investigative tools, language of computer crime investigation, the role of computers in crime, technology and law: jurisdiction, pornography and obscenity, child pornography, privacy, copyrights and the “theft” of Digital intellectual property, the investigative process, investigative reconstruction, with Digital evidence.


Page | 27

CSS 412: ETHICAL HACKING AND COUNTERMEASURES (3 CREDITS)

This course focuses on how perimeter defenses work, how intruders escalate privileges and methods of security systems. Additional topics include intrusion detection, policy creation, social engineering. DoS Attacks, buffer overflows and virus creation.

CSS 413: SECURITY STRATEGIES FOR WEB APP AND SOCIAL NETWORKS (3 CREDITS)

The course will Analyze the impact of the Internet and Web applications on the business world, the evolution of social media and social networking, Compare and contrast Web-based risks, common Web site attacks, weaknesses, and security best practices, Describe the attributes and qualities of secure coding practices, the role and importance of audit and compliance to Web application security, the role and importance of quality assurance testing for Web applications, Explain the value and importance of vulnerability and security assessments for Web applications, Evaluate next-generation challenges in securing Web applications and data and Construct a comprehensive lifecycle approach to Web application security.

CSS 414: SECURITY ANALYSIS AND VULNERABILITY ASSESSMENT (3 CREDITS) This course focuses on testing methods and techniques to effective identify and mitigate risks to the security of a company’s infrastructure. Topic include penetration testing methodologies, test planning and scheduling, information gathering, password cracking penetration testing and security analysis, social engineering penetration testing and security analysis, internal and external penetration testing and security analysis, router penetration testing and security analysis and reporting and documentation.

CSS 416: CLOUD COMPUTING I (3 CREDITS)

Review for networking basics and TCP/IP. Introduction to cloud computing. Introduction to data centers: servers, data storage, networking and virtualization. Data center networking: Ethernet, network topologies, routing, addressing, transport layer protocols, etc Introduction to server virtualization software: VMware VSphere. Virtual machine management: configuration, placement and resource allocation. Power efficiency in virtual data centers. Fault tolerance in virtual data centers. Cloud Computing Architectural Framework - Cloud Benefits, Business scenarios, Cloud Computing Evolution, cloud vocabulary, Essential Characteristics of Cloud Computing, Cloud deployment models, Cloud Service Models, Multi- Tenancy, Approaches to create a barrier between the Tenants, cloud computing vendors Cloud Computing threats, Cloud Reference Model, The Cloud Cube Model and Security for Cloud Computing. How Security Gets Integrated.

CSS 415: DISASTER RECOVERY (3 CREDITS)

This course focuses on disaster recovery principles include assessment of risks to an enterprise, development of disaster recovery policies and procedures, the roles and relationships of various members of an organization, preparation of a disaster recovery plan, testing and rehearsal of the plan, implementation of the plan and recovering from a disaster. Additional emphasis is placed on identifying vulnerabilities and taking appropriate countermeasures to prevent information failure risks.


Page | 28

500 LEVEL COURSES

CSS 511: ENTERPRENUERSHIP II (3 CREDITS)

This course shall discuss in detail the benefits, pros and cons of cyber security. The job opportunities of cyber security specialist in the labor market.

CSS 512: ETHICAL HACKING AND COUNTERMEASURE II (3 CREDITS)

Introduction to Ethical Hacking, Network Infrastructure Attacks, Hacking Methodology, Developing Ethical Hacking Plans, Social Engineering, Physical Security, Password Vulnerabilities - Cracking Paswords,

CPT 512: GRID COMPUTING (3 CREDITS)

Introduction to distributed and high-performance computing. Basic terms: distributed computing, HPC, HPCC, network computing, Internet computing, cluster, grid, meta-computing, middleware, etc; milestones of the history, some representative applications

Classification: Taxonomies, MPP, SMP, CC-NUMA, cluster: dedicated high performance (HP), high availability (HA), CoPs, PoPs, CoWs; distributed, on-demand, high-throughput, collaborative, data-intensive computing.Basics of communication media and protocols: TCP/IP, Internet2, QoS, ATM, Fast Ethernet, etc. Programming models: Message passing, client-server, peer-to-peer, broker computing, code shipping, proxy computing, mobile agents. Toolkit and OO systems. Higher level communication: Light-weight communication, sockets, standard APIs, active messages. Storage and file problems: Network RAM, RAID and software RAID. Distributed File systems: NFS, AFS, OSF-DSF, RSF. Message passing standards: PVM (Parallel Virtual Machine), MPI (Message Passing Interface). Object-oriented de facto standards CORBA and DCOM

Java-based methods: JVM, RMI, Bytecode, Applet and Servlet, JavaBean and JavaSpaces, Jini. Grid toolkit approach: Globus Hourglass concept, communication, resource and process management, data access, security . Object-oriented approach: Legion Language support, component wrapping, program support, resource management. Security: Confidentiality, integrity and availability. Authentication, authori-zation, assurance, auditing, accounting. Scheduling: Algorithms, policies and techniques, high performance and high throughput schedulers, resource scheduling

Grid monitoring: Tasks, types, architecture, components. CSS 514: PENETRATION TESTING I (3 CREDITS)

Principles of penetration testing, Differences between a Hacker and a Penetration tester, Procedures followed by the professional tester, Building a testing environment, Vulnerabilities of Computer Systems, Internet Research, Network Surveying, System Services Identification, Sniffers, Social engineering, War-Dialing, Internet Penetration, Vulnerability Scanners, Password Crackers, Intrusion Detection Systems, Firewalls.


Page | 29

CSS 515: CYBER FORENSIC (3 CREDITS)

Computer basics for Digital investigators, applying forensic science to computers, forensic examination of windows systems, forensic examination of unix system, forensic examination of Macintosh system, forensic examination of handheld devices, network basic for Digital investigators, applying forensic science to networks, Digital evidence on physical and data-link layers, Digital evidence at the network and transport layers, Digital evidence on the internet.

CSS 516: BIOMETRIC SECURITY TECHNOLOGY (3 CREDITS)

Introduction to Biometric Data Analysis: Automated Biometric Identification. Hands: Fingers, Palms and hands. Heads: Face, voice and Eyes. Other Biometrics: Biometric Data: Raw data, Template data, Data Methods. Biometric Matching Basics: Biometric Authentication, enrollment, Correct User, Incorrect User, Match Threshold, Matching Performance, Setting a Threshold. Biometric Authentication 2: Matching Data, Ground Truth, Calculating errors rates and Graphs. Biometric Data: Storage of Biometric Data Elements, Transactions, Errors and quality, upgrades, Data Security and integrity. Biometric Data Examples e.g Fingersprints, Facial Image, Iris, Speech

CPT 515 ARTIFICIAL INTELLIGENT (3 CREDITS)

The evolution of computing; defining artificial intelligence, general problem solving approach in artificial intelligence, characteristics requirements for the realization of intelligent systems, programming languages for artificial intelligence and architecture for artificial intelligence machines. The psychological perspective of cognition; production systems; problem solving by intelligent search; the logic proposition and predictes; default and non-monotonic reasoning. Structural approach to knowledge representation; The nature and goals of soft-computing such as neural networks, fuzzy logic and genetic algorithms to artificial intelligence.

CSS 529: PROJECT (6 CREDITS)

Students will be required to finalize their thesis project and defend the complete report in a thesis final oral examination.

CSS 521: E-BUSSINESS SECURITY (3 CREDITS)

This course focuses on exploring security technique fundamentals involved in minimizing E-Business security risks. Topics including security web clients, security server configuration, CGI scripting active content security issues, remote authoring, firewalls, digital certificates administration and legal issues and appropriate responses when security has been breached.

CSS 522: CURRENT TRENDS IN CYBER SECURITY (3 CREDITS)

Topics in information technologies and cyber security are consistently changing. This class, which may be repeat for credit up to three times, allows students to learn about the most up to date methods in national and international information technologies cyber security science.


Page | 30

CSS 523: DEVELOPMENTS IN THE J2EE ENVINRONMENT (3 CREDITS)

Students are introduced to the Java programming language the J2SE 5.0 Java Development Kit. Topics include Java command line tools, Java language usage and syntax, object-oriented programming, threads, I/O, collections, generics JavaBeans, Swing, JDBC and network programming. Students are also exposed debugging practice and code maintenance.

CSS 524: PENETRATION TESTING II (3 CREDITS)

This course focuses on the mastery of the international standard for penetration testing. Topics include customers and legal agreements, penetration testing planning scheduling, information gathering, external and internal network penetration testing, router penetration testing, firewall penetration testing, intrusion detection system penetration testing, wireless networks penetration testing, password cracking penetration testing, social engineering penetration testing, PDA and cell penetration testing, and penetration testing report and documentation writing.

CSS 525 INTERNET PROTOCOL VERSION 6 (IPV6) (2 CREDITS)

This course provides information about:

· An introduction to the IPv6 protocol

· The benefits of the IPv6 protocol

· How the IPv6 protocol can be used across the Internet

· How to control the IPv6 protocol to limit the flow of information to and from the Internet

· How to monitor and troubleshoot the IPv6 protocol after configuration is complete


Page | 31

CPT 522 DATA MINING (2 CREDITS) Data Mining; Data Mining Functionalities; Classification of Data Mining Systems; Data

Mining Task Primitives; Integration of a Data Mining System with a Database or Data

Warehouse System; Major Issues in Data Mining; Data Preprocessing; Descriptive Data

Summarization; Data Cleaning; Data Integration and Transformation; Data Reduction; Data

Discretization and Concept Hierarchy Generation.

ASSOCIATION RULES AND CLUSTER ANALYSIS: Basic Concepts; Efficient and

Scalable Frequent Itemset Mining Methods; Mining; Various kinds of Association Rules;

Cluster Analysis; Types of Data in Cluster Analysis; A Categorization of Major Clustering

Methods; Different Clustering Methods.

CLASSIFICATION AND PREDICTION: Classification; Issues regarding Classification

and Prediction; Different Classifications; Classification by Decision Tree Induction; Bayesian

Classification; Rule Based Classification; Classification by Back propagation; Prediction;

Accuracy and Error Measures; Evaluating the Accuracy of a Classifier or Predictor-Ensemble

Methods; Model Selection.

VARIOUS MININGS: Mining Data Streams; Mining Time; Series Data; Mining Sequence

Patterns in Transactional Databases; Mining Sequence Patterns in Biological Data Graph

Mining-Social Network Analysis; Multi-Relational Data Mining.

MULTIMEDIA MINING AND APPLICATIONS: Multidimensional Analysis and

Descriptive Mining of Complex Data Objects; Spatial Data Mining; Multimedia Data Mining;

Text Mining; Mining the WWW-Applications and Trends in Data Mining.

cyber security science -...

Documents