Skip to content
BRIDGE BRIDGE Diaspora BRIDGE

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
Showing 861–870 of 4,624 courses
ICE 513 2
Engineering and Technology  ·  B.Eng. Information and Communication Engineering
At the end of this course, the students should be able to: 1. illustrate the basic concepts of DSP theory such as sampling theory and discrete frequency; 2. differentiate DTFT, DFT, and FFT; 3. define the concept of filt...
View learning outline
Digital Fourier transform; Fast Fourier transform; approximation problem in network theory; synthesis of low-pass filter; special transforms and their application in synthesis of high-pass and band-pass filters; digital filtering transfer function analysis; one-dimensional recursive and non-recursive filters; computer techniques in filter analysis; realization of filters in hardware and software; basic image processing concepts. ICE 515 : Satellite Communications (2 Units C: LH 30) Learning Outcomes At the end of this course, the students should be able to: 1. determine the location of a satellite in space; 2. explain Kepler’s laws vis-à-vis their application to the location of satellite in orbit; 3. differentiate between Earth segment and Space segment of a satellite communication system; 4. design a satellite uplink and downlink; and 5. identify the different techniques and trade-offs employed in communicating signals through a satellite. Course Contents Orbital equations for satellites in space. Kepler’s laws of planetary motion. Space segment- based satellite subsystems including: Attitude and Orbit Control System (AOCS), Telemetry, Tracking, and Command (TTC) system, Power Subsystem, Communication Subsystem, Antenna Subsystem. System noise temperature, G/T ratio, Downlink design, Uplink design, Design for specified C/N. Design examples. Analogue and Digital modulation techniques employed in satellite communications including: FM transmission by satellite, SCPC FM links, Digital transmission, Digital Modulation/Demodulation, Digital transmission of analogue signals. Various multiple access schemes relevant to satellite communications: Frequency Division MA, Time Division MA, Code Division MA, Spread Spectrum Transmission and Reception. Very Small Aperture Terminal (VSAT) systems. Their network architectures, Access control protocols, Basic techniques, and VSAT Earth Station engineering.
ELE 507 3
Engineering and Technology  ·  B.Eng. Electronic Engineering
On the successful completion of this course, the student should be able to: 1. specify the sampling, quantization, and signal conditioning requirements for a given DSP application; 2. identify components of a DSP hardwar...
View learning outline
Review of discrete-time signals and systems with emphasis on sampling and quantization. Introduction to DSP hardware architecture, including fixed-point vs. floating-point processors and the multiply-accumulate unit. Convolution and spectral analysis using the discrete-time Fourier transform. The discrete Fourier transform, the fast Fourier transform (FFT), and use of the FFT for convolution and spectral analysis. Z- transforms, pole-zero analysis of discrete-time systems, and pole-zero-based digital filter design. Analysis of FIR and IIR discrete-time systems with emphasis on phase response. Design and implementation of FIR digital filters. Design and implementation of IIR digital filters. Introduction to multi-rate signal processing and filter banks.
CPE 502 3
Engineering and Technology  ·  B.Eng. Computer Engineering
At the end of this course, the students will be able to: 1. understand analytical tools such as fourier transforms, discrete fourier transforms, fast Fourier transforms and Z-transforms required for digital signal proces...
View learning outline
Discrete signals and Z-transform, digital fourier transform, fast fourier transform; the approximation problem in network theory; synthesis of low-pass filters; spectral transforms and their application in synthesis of high-pass and band-pass filters; digital filtering, digital transfer function aliasing, one-dimensional recursive and non-recursive filters; computer techniques in filter synthesis, realisation of filters in hardware and software; and basic image processing concepts.
TEE 401 3
Engineering and Technology  ·  B.Eng. Telecommunications Engineering
At the end of this course, the students should be able to: 1. describe finite state machine and its applications in designing digital circuits; 2. build advanced digital logic circuits by applying various reduction techn...
View learning outline
Finite state machine: definition, Mealy and Moore models, state diagram, state table, transition table. Sequential circuits design using flip-flops; asynchronous, and synchronous circuit design. Algorithm State Machine. Design examples and exercises. Structured design: design constructs, design levels, geometry-based interchange formats, computer aided electronic system design tools, Sshematic circuit capture, hardware description languages, design process (simulation, synthesis), structural design decomposition. Introduction to VHDL: VHDL language abstractions, design hierarchies, VHDL component, lexical description, VHDL source file, data types, data objects, language statements, concurrent VHDL, sequential VHDL, advanced features of VHDL (library, package and subprograms). Structural level modelling, register-transfer level modelling, FSM with data path level modelling, algorithmic level modelling. Introduction of ASIC, types of ASIC, ASIC design process, standard cell ASIC synthesis, FPGA design paradigm, FPGA synthesis, FPGA/CPLD architectures. VHDL design: top-down design flow, verification, simulation alternatives, simulation speed, formal verification, recommendations for verification, writing RTL VHDL code for synthesis, top-down design with FPGA. VHDL synthesis, optimization and mapping, constraints, technology library, delay calculation, synthesis tool, synthesis directives. Computer-aided design of logic circuits.
CPE 505 2
Engineering and Technology  ·  B.Eng. Computer Engineering
On completion of this course, the students will be able to: 1. explain VHDL as a programming language; 2. design the combinational and sequential logic circuits using VHDL; 3. design programmable logic devices (PLDs) and...
View learning outline
Finite state machine: definition, mealy and Moore models, state diagram, state table, transition table; sequential circuits design using flip-flops, asynchronous and synchronous circuit design; algorithm state machine; design examples and exercises; structured design: design constructs, design levels, geometry-based interchange formats, computer-aided electronic system design tools, schematic circuit capture, hardware description languages, design process (simulation, synthesis), structural design decomposition; introduction to VHDL: VHDL language abstractions, design hierarchies, VHDL component, lexical description, VHDL source file, data types, data objects, language statements, concurrent VHDL, sequential VHDL, advanced features of VHDL (library, package and sub- programmes); structural level modelling, register-transfer level modelling, FSM with data path level modelling, algorithmic level modelling; introduction of ASIC, types of ASIC, ASIC design process, standard cell ASIC synthesis, FPGA design paradigm, FPGA synthesis, FPGA/CPLD architectures; VHDL Design: top-down design flow, verification, simulation alternatives, simulation speed, formal verification, recommendations for verification, writing RTL VHDL code for synthesis, top-down design with FPGA; VHDL synthesis, optimisation and mapping, constraints, technology library, delay calculation, synthesis tool, synthesis directives; and computer-aided design of logic circuits.
PST 624 1 Unit(s) (LH 30)
Allied Health Sciences  ·  DPT. Physiotherapy
At the end of the posting, students should be able to: 1. describe issues pertaining to people with long-term disabilities and their families within the social and cultural context; 2. describe inter-relationships among...
View learning outline
Definitions and descriptions of disease, deformity, disability, habilitation and rehabilitation. Common causes of long term disabilities – autism, poliomyelitis, cerebral palsy, spinal cord and head injuries, mental retardation and many others. Differences and relationships between the concepts of community rehabilitation and community-based rehabilitation for people with long term disability. Community reintegration post disability. Psychosocial issues – discrimination, deprivation, isolation, mental health, family finance. Care setting. Participation in the society – schooling, access to private and public facilities, transportation, occupation, participation in sports and recreational activities. Policies, advocacies related to disability. Comparison of disability issues such as legislation, enforcement and implementation of relevant promulgations and conventions in Nigeria and other parts of the world.
CSC 203 3
Computing  ·  B.Sc. Software Engineering
At the end of this course, students should be able to: 1. convert logical statements from informal language to propositional and predicate logic expressions; 2. describe the strengths and limitations of propositional and...
View learning outline
Propositional Logic, Predicate Logic, Sets, Functions, Sequences and Summation, Proof Techniques, Mathematical induction, Inclusion-exclusion and Pigeonhole principles, Permutations and Combinations (with and without repetitions), The Binomial Theorem, Discrete Probability, Recurrence Relations.
CSC 203 3
Computing  ·  B.Sc. Information and Communication Technology
At the end of the course, students should be able to: 1. convert logical statements from informal language to propositional and predicate logic expressions; 2. describe the strengths and limitations of propositional and...
View learning outline
Propositional Logic. Predicate Logic. Sets. Functions. Sequences and Summation. Proof Techniques. Mathematical induction. Inclusion-exclusion and Pigeonhole principles. Permutations and Combinations (with and without repetitions). The Binomial Theorem. Discrete Probability. Recurrence Relations. INS 202 Human-Computer Interface (HCI) (2 Units C: LH 15; PH 45) Learning Outcomes At the end of this course, students should be able to: 1. discuss the foundations and concept of the human-computer interface; 2. explain Understanding of principles of human-computer interface; 3. explain the design and development of the human-computer interface; and 4. explain the importance of user feedback. Course Contents Foundations of HCI. The concept underlying the design of HCI. Principles of GUI. GUI toolkits. System design methods. User conceptual models and interface metaphors. Human cognitive and physical ergonomics. Human-centred software evaluation and development. GUI design and programming. Lab Work: Illustration of the principles of HCI design. Practice on GUI design and programming. Demonstration of some GUI toolkits. Practical evaluation of GUIs
CSC 203 2
Computing  ·  B.Sc. Computer Science
At the end of this course, the students will be able to: 1. convert logical statements from informal language to propositional and predicate logic expressions; 2. describe the strengths and limitations of propositional a...
View learning outline
Propositional Logic. Predicate Logic. Sets. Functions. Sequences and Summation. Proof Techniques. Mathematical induction. Inclusion-exclusion and Pigeonhole principles. Permutations and Combinations (with and without repetitions). The Binomial Theorem. Discrete Probability. Recurrence Relations.
CSC 203 3
Computing  ·  B.Sc. Data Science
At the end of this course, students should be able to: 1. convert logical statements from informal language to propositional and predicate logic expressions; 2. describe the strengths and limitations of propositional and...
View learning outline
Propositional Logic, Predicate Logic, Sets, Functions, Sequences and Summation, Proof Techniques, Mathematical induction, Inclusion-exclusion and Pigeonhole principles, Permutations and Combinations (with and without repetitions), The Binomial Theorem, Discrete Probability, Recurrence Relations. 300 Level
0 Total Views

Made Possible Through

Federal Ministry of Education
TETFund