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 851–860 of 4,624 courses
ITH 407 2 Unit(s) (LH 30) 1 institution need this
Allied Health Sciences  ·  B.Sc. Information Technology and Health Informatics
At the end of this course, students should be able to: 1. explain the origins of forensic science; 2. explain the difference between scientific conclusions and legal decision-making; 3. explain the role of digital forens...
View learning outline
Computer devices, Data collection, Evidence Collection, Extraction and preservation of evidence, Data Recovery, Evidence preservation, verification & authentication, Data Discovery & Identification, Data Analysis, Computer Forensics Tools, Data Hiding Techniques, Computer forensics and mobile forensics.
CYB 305 2
Computing  ·  B.Sc. Information Systems
At the end of this course, students should be able to: 1. explain basic knowledge on digital forensic and digital evidence; 2. establish awareness of digital evidence challenges aspects of digital evidence; 3. learn the...
View learning outline
Introduction to digital forensics, digital evidence, increasing awareness of digital evidence, challenging aspects of digital evidence. best practices in securing, processing, acquiring, examining and reporting on digital evidence. cyber trail, challenging aspects of the cyber trail, brief history of computer crime and cybercrime 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. Examine techniques and tools used by computer forensics investigations such as acquisition, preservation, recovery, and analysis of evidence obtained from portable and stationary computer storage devices, personal digital assistants (PDAs), and cell phones. Students will be exposed to current technologies and methods as well as leading edge techniques with practical based projects and research opportunities. Lab work: Practical exercises on how to make use of various techniques and tools for computer forensics investigations and cyber trail during cybercrime investigations. Practice cyber auditing skills. Work on applying the best practices in securing, processing, acquiring, examining and reporting on digital evidence with current technologies and methods in forensics investigation.
CYB 305 2 1 institution need this
Computing  ·  B.Sc. Cybersecurity
At the end of this course, students should be able to: 1. develop basic knowledge on digital forensic and digital evidence; 2. establish awareness of digital evidence challenges aspects of digital evidence; 3. appraise t...
View learning outline
Introduction to digital forensics, digital evidence, and increasing awareness of digital evidence. Challenging aspects of digital evidence. Best practices in securing, processing, acquiring, examining and reporting on digital evidence. Cyber trail and challenging aspects of the cyber trail. Brief history of computer crime and cybercrime investigation. Cyber auditing. 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 and investigative reconstruction, with digital evidence. Examine techniques and tools used by computer forensics investigations such as acquisition, preservation, recovery, and analysis of evidence obtained from portable and stationary computer storage devices, personal digital assistants (PDAs), and cell phones. Current technologies and methods as well as leading edge techniques with practical based exercises/projects and research opportunities. Lab work: Practical exercises on how to make use of various techniques and tools for computer forensics investigations and cyber trail during cybercrime investigations. Practice cyber auditing skills. Work on applying the best practices in securing, processing, acquiring, examining and reporting on digital evidence with current technologies and methods in forensics investigation.
IFT 211 3
Computing  ·  B.Sc. Software Engineering
At the end of this course, student should 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.
IFT 211 2
Computing  ·  B.Sc. Information Technology
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.
IFT 211 2
Computing  ·  B.Sc. Computer Science
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.
CSC 825 3
Sciences  ·  M.Sc. Computer Science
Basic concepts of image formation and image analysis: imaging geometry; sampling; filtering; edge detection; Hough transforms; region extraction and representation; extracting and modeling three-dimensional objects.
View learning outline
Basic concepts of image formation and image analysis: imaging geometry; sampling; filtering; edge detection; Hough transforms; region extraction and representation; extracting and modeling three-dimensional objects; Students will be assigned analytical and programming assignments to explore these concepts
DNT 503 2 Unit(s) (LH 30)
Allied Health Sciences  ·  B.Sc Dental Technology
At the end of this course, students should be able to: 1. identify CAD/CAM systems and justify their use in dental technology; 2. describe the materials used in CAD/CAM; 3. identify the other supporting equipment used in...
View learning outline
Definition of terms. Types/ classification of digital prosthodontics. Materials and equipment in digital prosthodontics. Applications and indications for CAD-CAM. Prerequisites for dental CAD- CAM success. Restorative materials for dental CAD-CAM system. scanning devices. Computer- assisted designs and Computer-assisted manufacturing.
CSC 817 3
Sciences  ·  M.Sc. Computer Science
Introduction; brief review of analogue and digital signal processing systems; discrete time linear time-invariant signal processing systems; design of finite impulse response digital filters; introduction to z-transforms...
View learning outline
Introduction; brief review of analogue and digital signal processing systems; discrete time linear time-invariant signal processing systems; design of finite impulse response digital filters; introduction to z-transforms and infinite impulse response type discrete time filters; design of infinite impulse response type digital filters using analogue filter approximations; digital processing of analogue signals and other data; introduction to the discrete Fourier transform
EEE 403 2
Engineering and Technology  ·  B.Eng. Telecommunications Engineering
At the end of this course, the students should be able to: 1. explain the Fourier transform and its application in networks; 2. synthesize analogue and digital filters from network function; and 3. explain basic image pr...
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. Basic image processing concepts.
0 Total Views

Made Possible Through

Federal Ministry of Education
TETFund