CCMAS Course Search
Browse BRIDGE's courses under the National Universities Commission's Core Curriculum Minimum Academic Standards (CCMAS) — Nigeria's unified benchmark curriculum for every accredited program. Search by course title, code, faculty or programme to see full descriptions, learning outlines and credit-hour loads.
4,624
Courses
10
Faculties
168
Programmes
Programme: B.Sc. Information Technology ×
Clear all filters
Showing 1–10
of 34 courses
GST 111
2
At the end of this course, students should be able to: 1. identify possible sound patterns in the English language; 2. list notable language skills; 3. classify word-formation processes; 4. construct simple and fairly co...
View learning outline
Sound patterns in English language (vowels and consonants, phonetics, and phonology).
English word classes (lexical and grammatical words, definitions, forms, functions, usages,
collocations). A sentence in English (types: structural and functional, simple and complex).
Grammar and Usage (tense, mood, modality and concord, aspects of language use in everyday
life). Logical and Critical Thinking and Reasoning Methods (Logic and Syllogism, Inductive and
Deductive Argument and Reasoning Methods, Analogy, Generalisation, and Explanations).
Ethical considerations, Copyright Rules, and Infringements. Writing Activities: (Pre-writing,
Writing, Post Writing, Editing, and Proofreading; Brainstorming, outlining, Paragraphing,
Types of writing, Summary, Essays, Letter, Curriculum Vitae, Report writing, Note making,
etc. Mechanics of writing). Comprehension Strategies: (Reading and types of Reading,
Comprehension Skills, 3RsQ). Information and Communication Technology in modern
Language Learning. Language skills for effective communication. Major word-formation
processes. Writing and reading comprehension strategies. Logical and critical reasoning for
meaningful presentations. Art of public speaking and listening. Report writing.
IFT 212
2
At the end of this course, students will be able to: 1. explain the organisation of the classical von Neumann machine and its major functional units; 2. construct simple assembly language programme segments; 3. describe...
View learning outline
Principles of computer hardware and instruction set architecture. Internal CPU organisation
and implementation. Instruction format and types, memory, and I/O instructions. Dataflow,
arithmetic, and flow control instructions, addressing modes, stack operations, and interrupts.
Data path and control unit design. RTL, microprogramming and hardwired control. The
practice of assembly language programming. Memory hierarchy. Cache memory, Virtual
memory. Cache performance. Compiler support for cache performance. I/O organisations.
Lab work: Practical demonstration of the architecture of a typical computer. Illustration of
different types of instructions and how they are executed. Simple Assembly Language
programming. Demonstration of interrupts. Programming assignments to practice MS-DOS
batch programming, Assembly Process, Debugging, Procedures, Keyboard input, Video
Output, File and Disk I/O, and Data Structure. Demonstration of Reduced Instruction Set
Computers. Illustration of parallel architectures and interconnection networks.
COS 201
3
At the end of this course, students should be able to: 1. explain the principles of good programming and structured programming concepts; 2. explain the programming constructs, syntax, and semantics of a higher-level lan...
View learning outline
Essentials of computer programming. Types of programming: Functional programming;
Declarative programming; Logic programming, object-oriented programming. Scripting
languages, structured programming principles. Basic data types, variables, expressions,
assignment statements, and operators. Basic object-oriented concepts: abstraction; objects;
classes; methods; parameter passing; encapsulation. Class hierarchies and programme
organisation using packages/namespaces. Use of API – use of iterators/enumerators, List,
Stack, Queue from API. Searching; sorting; Recursive algorithms. Event-driven programming:
event-handling methods; event propagation; exception handling. Introduction to Strings and
string processing. Simple I/O; control structures; Arrays. Simple recursive algorithms;
inheritance; polymorphism.
Lab work: Programming assignments, design and implementation of simple algorithms, e.g.,
average, standard deviation, searching and sorting. Developing and tracing simple recursive
algorithms. Inheritance and polymorphism.
COS 202
3
At the end of this course, students should be able to: 1. demonstrate the principles of good programming and structured programming concepts; 2. demonstrate string processing, internal searching, sorting, and recursion;...
View learning outline
Review and coverage of advanced object-oriented programming - polymorphism, abstract
classes, and interfaces. Class hierarchies and programme organisation using
packages/namespaces. Use of API – use of iterators/enumerators, List, Stack, Queue from
API. Searching, sorting. Recursive algorithms. Event-driven programming: event-handling
methods, event propagation, exception handling. Applications in Graphical User Interface
(GUI) programming.
Lab work: Programming assignments leading to extensive practice in problem-solving and
programme development with emphasis on object orientation. Solving basic problems using
static and dynamic data structures. Solving various searching and sorting algorithms using
iterative and recursive approaches. GUI programming.
ICT 305
3
At the end of the course, the students should be able to: 1. identify various network services, characteristics, elements, standards, and technologies; 2. describe the layered architecture of computer networks and the op...
View learning outline
Types and sources of data, simple communications network, transmission definitions, one-
way transmission, half-duplex transmission, transmission codes, transmission modes, parallel
transmission, serial transmission, bit synchronisation, character synchronisation, synchronous
transmission, asynchronous transmission, the efficiency of transmission, error detection
methods and data compression. Protocols: Introduction to the network protocol. Seven Layer
ISO-OSI standard protocols and network architecture. Transport protocols, session services
protocols, and other protocols. Institute of Electrical and Electronics Engineering 802
standards. Error control and Data Compression: Forward Error Control; error detection
methods; parity checking; linear block codes, cyclic redundancy checking; feedback error
control, data compression, Huffman coding, and dynamic Huffman coding. Local Area
Networks: medium access control techniques – Ethernet, token bus and token ring; LAN
standards; fibre-distributed data interface, metropolitan area network. Peer-to-peer, Client-
Server. Client-Server Requirements: GUI design standards, interface independence, platform
independence, transaction processing, and connectivity, reliability, backup, and recovery
mechanisms. Information Network Software; Features and benefits of major recovery
mechanisms. Information Network Software: features and benefits of major Network
Operating Systems. Network OS: (e.g., Novell NetWare, UNIX/LINUX, and OS/2 & Windows
NT). TCP/IP and Network OS. INTERNET: Definition, architecture, services, internet
addressing. Internet protocol, IPv4, IPv6. Internet programming, Intranet. System
administration, and security issues.
Lab Work: Demonstration of simple communications networks. Illustration of applications at
the various levels of the OSI model. Demonstration of different types of Local Area Networks
(LANs). Illustration of Metropolitan Area Networks. Illustration of Error Detection and Error
Correction techniques. Demonstration of Network Operating Systems.
400 Level
STA 111
3
At the end of the course, students should be able to: 1. explain the basic concepts of descriptive statistics. 2. present data in graphs and charts. 3. differentiate between measures of location, dispersion and partition...
View learning outline
Statistical data. Types, sources and methods of collection. Presentation of data. Tables chart
and graph. Errors and approximations. Frequency and cumulative distributions. Measures of
location, partition, dispersion, skewness and Kurtosis. Rates, ratios and index numbers.
IFT 211
2
At the end of this course, students will be able to: 1. explain why everything is data, including instructions, in computers; 2. describe how negative integers, fixed-length numbers, and non-numeric data are represented;...
View learning outline
Introduction to information representation and number systems. Boolean algebra and
switching theory. Manipulation and minimisation of completely and incompletely specified
Boolean functions. Physical properties of gates: fan-in, fan-out, propagation delay, timing
diagrams and tri-state drivers. Combinational circuits design using multiplexers, decoders,
comparators and adders. Sequential circuit analysis and design, basic flip-flops, clocking and
timing diagrams. Registers, counters, RAMs, ROMs, PLAs, PLDs, and FPGAs.
Lab Work: Simple combinational gates (AND, OR, NOT, NAND, NOR); Combinational circuits
design using multiplexers, decoders, comparators and adders. Sequential circuit analysis and
design using basic flip-flops (S-R, J-K, D, T flip-flops); Demonstration of registers, counters,
RAMs, ROMs, PLAs, PLDs, and FPGAs.
MTH 101
2
At the end of the course students should be able to: 1. tell the basic definition of Set, Subset, Union, Intersection, Complements, and use of Venn diagrams; 2. solve quadratic equations; 3. solve trigonometric functions...
View learning outline
Elementary set theory, subsets, and union, intersection, complements, and Venn diagrams.
Real numbers, integers, rational and irrational numbers, mathematical induction, real
sequences and series, theory of quadratic equations, binomial theorem. Complex numbers;
algebra of complex numbers, the Argand diagram. De-Moivre’s theorem, nth roots of unity.
Circular measure, trigonometric functions of angles of any magnitude, addition, and factor
formulae.
MTH 102
2
At the end of the course students should be able to: 1. explain the fundamental concept of Differentiation and Integration; 2. evaluate the Function of a real variable, graphs, limits, and continuity; and 3. solve some a...
View learning outline
The function of a real variable, graphs, limits, and the idea of continuity. The derivative, as
the limit of the rate of change. Techniques of differentiation. Extreme curve sketching;
Integration as an inverse of differentiation. Methods of integration, Definite integrals.
Application to areas, volumes.
ENT 211
2
At the end of this course, students should be able to: 1. explain the concepts and theories of entrepreneurship, intrapreneurship, opportunity seeking, new value creation, and risk-taking; 2. state the characteristics of...
View learning outline
Concept of Entrepreneurship (Entrepreneurship, Corporate Entrepreneurship). Theories,
Rationale, and relevance of Entrepreneurship (Schumpeterian and other perspectives. Risk-
Taking, necessity, and opportunity-based entrepreneurship and creative destruction).
Characteristics of Entrepreneurs (Opportunity seeker, Risk-taker, Natural and Nurtured,
Problem solver and change agent, innovator and creative thinker). Entrepreneurial thinking
(Critical thinking, Reflective Thinking, and Creative thinking). Innovation (Concept of
innovation, Dimensions of innovation, Change and innovation, Knowledge and innovation).
Enterprise formation, partnership, and networking (Basics of Business Plan, Forms of business
ownership, business registration, and forming alliances and joint ventures). Contemporary
Entrepreneurship Issues (Knowledge, Skills and Technology, Intellectual property, Virtual
office, Networking). Entrepreneurship in Nigeria (Biography of inspirational entrepreneurs,
youth and women entrepreneurship, Entrepreneurship support institutions, Youth enterprise
networks, and Environmental and cultural barriers to entrepreneurship). Basic principles of e-
commerce.