Courses with Gaps
BRIDGE's partner institutions have flagged these courses as needing diaspora expertise. Browse the list below and express interest in teaching a course to start the conversation with the institution.
197
Courses with Gaps
10
Faculties
168
Programmes
Faculty: Computing ×
Clear all filters
Showing 1–10
of 21 courses
CSC 309
2
5 institutions need this
At the end of this course, students should be able to: 1. explain Artificial Intelligence(AI) fundamentals, concepts, goals, types, techniques, branches, applications, AI technology and tools; 2. discuss intelligent agen...
View learning outline
Overview of Artificial Intelligence. History of AI. Goals of AI. AI Technique. Types of AI.
Branches and applications of AI. Advantages and Disadvantages. Introduction to Intelligent
Agents. Agent Performance, Examples of Agents, Agent Faculties, Rationality, Agent
Environment. Agent Architectures. Search. General Classes of AI Search Algorithm Problems.
Problem Solving by Search. Types of AI Search Techniques and Strategies. Introduction to the
types of problems and techniques in AI. Problem-Solving methods. Major structures used in
AI programmes. Knowledge Representation. KR and Reasoning Challenges. KR Languages.
Knowledge representation techniques such as predicate logic, non-monotonic logic, and
probabilistic reasoning. Semantic Network - types of relationships, semantic network
inheritance, types and components. Introduction to Frames. Natural Language Processing
(NLP). Introduction to natural language understanding and various syntactic and semantic
structures. Introduction to Expert Systems - characteristics, components, types, requirements,
technology, development. Programming Languages for AI. Introduction to computer image
recognition.
Lab work: Group practical in (i) Turing test practical - Students can act out their own version
of the Turing test (iii) Facial recognition practical to aid in teaching students how machine
learning works with students simulating a facial recognition algorithm. Practical applications
of NLP in groups – (i) Question Answering focuses on building systems that automatically
answer the questions asked by humans in a natural language (ii) Spam detection application
for detecting unwanted e-mails getting to a user's inbox (iii) Sentiment analysis/opinion mining
should be used on the web to analyse the attitude, behaviour, and emotional state of the
sender, implemented through a combination of NLP and statistics (iv) Practical exercise of
machine translation used to translate text or speech from one natural language to another
natural language such as the Google Translator (v) Developing a model to provide word
processor software for the spelling correction (vi) Developing a model for speech recognition
for converting spoken words into text (vii) Implementing a Chatbot to provide the
staff/student's chat services. OR
Group Practical exercise on agents and its environment using simulation of a colony of ants
foraging for food; model simulating a message between agents; model simulating the flocking
behaviour of birds; model to apply standard search algorithm to the classic search problem of
missionaries and cannibals, and how to use communicating agents for searching networks.
Some computer AI animation exercises for any branch of AI. Practical exercise on simple
robots coupling and programming. Group project of building a lawn robot for trimming
grasses, or any simple design and implementation of robotics.
400 Level
CSC 309
2
5 institutions need this
At the end of this course, students should be able to: 1. explain AI fundamentals, concepts, goals, types, techniques, branches, applications, AI technology and tools; 2. discuss intelligent agents, their performance, ex...
View learning outline
Overview of Artificial Intelligence. History of AI. Goals of AI. AI Technique. Types of AI.
Branches and applications of AI. Advantages and Disadvantages. Introduction to Intelligent
Agents. Agent Performance, Examples of Agents, Agent Faculties, Rationality, Agent
Environment. Agent Architectures. Search. General Classes of AI Search Algorithm Problems.
Problem Solving by Search. Types of AI Search Techniques and Strategies. Introduction to the
types of problems and techniques in AI. Problem-Solving methods. Major structures used in
AI programmes. Knowledge Representation. KR and Reasoning Challenges. KR Languages.
Knowledge representation techniques such as predicate logic, non-monotonic logic, and
probabilistic reasoning. Semantic Network - types of relationships, semantic network
inheritance, types and components. Introduction to Frames. Natural Language Processing
(NLP). Introduction to natural language understanding and various syntactic and semantic
structures. Introduction to Expert Systems - characteristics, components, types, requirements,
technology, development. Programming Languages for AI. Introduction to computer image
recognition.
Lab work: Group practical in (i) Turing test practical - Students can act out their own version
of the Turing test (ii) Facial recognition practical to aid in teaching students how machine
learning works with students simulating a facial recognition algorithm. Practical applications
of NLP in groups – (i) Question Answering focuses on building systems that automatically
answer the questions asked by humans in a natural language (ii) Spam detection application
for detecting unwanted e-mails getting to a user's inbox (iii) Sentiment analysis/opinion mining
should be used on the web to analyse the attitude, behaviour, and emotional state of the
sender, implemented through a combination of NLP and statistics (iv) Practical exercise of
machine translation used to translate text or speech from one natural language to another
natural language such as the Google Translator (v) Developing a model to provide word
processor software for the spelling correction (vi) Developing a model for speech recognition
for converting spoken words into text (vii) Implementing a Chatbot to provide the
staff/student's chat services. OR
Group Practical exercise on agents and its environment using simulation of a colony of ants
foraging for food; model simulating a message between agents; model simulating the flocking
behaviour of birds; model to apply standard search algorithm to the classic search problem of
missionaries and cannibals, and how to use communicating agents for searching networks.
Some computer AI animation exercises for any branch of AI. Practical exercise on simple
robots coupling and programming. Group project of building a lawn robot for trimming
grasses, or any simple design and implementation of robotics.
CYB 302
2
2 institutions need this
At the end of this course, students should be able to: 1. discuss biometric algorithms and data analysis along with digital image/signal processing; 2. apply automated biometric identification: hands-fingers, palms and h...
View learning outline
Introduction to biometrics and digital image processing. Matlab in biometric image/signal
processing. Biometric algorithms and systems with emphasis on face, fingerprint, eyes (iris),
speech (voice). Automated biometric identification multimodal biometrics. Biometric data: raw
data, template data, and data methods. Biometric matching basics: biometric authentication,
enrolment, correct user, and incorrect user. Match threshold and matching performance.
Setting a threshold. Biometric authentication: 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. Privacy issues and other aspects of biometrics.
Applications of biometrics and future trends. Challenging issues: security strength and
recognition rates. Alternatives of passwords and smart cards.
Lab work: Practical exercise on biometric capture, image processing, matching threshold and
performance. Learn the practical aspect of automated biometric identification of multimodal,
authentication and calculation of error rates. Work on biometric algorithms, privacy and
security of stored biometric data.
CSC 401
2
1 institution need this
At the end of the course, students should be able to: 1. explain the use of big-O, omega, and theta notation to describe the amount of work done by an algorithm, 2. use big-O, omega, and theta notation to give asymptotic...
View learning outline
Basic algorithmic analysis. Asymptotic analysis of Upper and average complexity bounds.
Standard Complexity Classes. Time and space trade-offs in analysis recursive algorithms.
Algorithmic Strategies. Fundamental computing algorithms. Numerical algorithms. Sequential
and Binary search algorithms. Sorting algorithms, Binary Search trees. Hash tables. Graphs
and their representation.
DTS 302
2
1 institution need this
At the end of the course the students should be able to: 1. identify Big Data; 2. identify some of the foundational tools, systems, and platforms that feature in working with Big Data across several domains; 3. install B...
View learning outline
Installation: Cloudera VM, Jupyter server. Big data retrieval and relational querying: Postgres
databases, NoSQL data, MongoDB, Aerospike, and Pandas for data aggregation and working
with data frames. Big Data Integration: Splunk and Datameer. Big Data Processing: Apache
Spark, Hadoop, Spark Core (Spark MLlib and GraphX). Big Data Applications (Graph
Processing). Big Data Streaming Platforms for Fast Data.
Lab Work: Analysing Twitter Data using Spark and MongoDB. Learn Big Data analytics skills.
Practical procedure for the crafting of an enterprise-scale cost-efficient Big Data and machine
learning solution to uncover insights and value from data. Use the practical exercises to bridge
the gap between the theoretical world of technology with the practical ground reality of
building corporate Big Data and data science platforms. Hands-on exposure to Hadoop and
Spark (or any of the BD tools), build machine learning dashboards using R and R Shiny, create
web-based apps using NoSQL databases. Practical assignment of BD security.
CYB 404
2
1 institution need this
At the end of this course, students should be able to: 1. review the concept of cloud, cloud computing, and benefits of the cloud and knowledge of cloud-enabling technologies, virtualisation and multi-tenanting; 2. descr...
View learning outline
Introduction to cloud computing, cloud computing vendors, cloud computing threats, cloud
reference model. Cloud-enabling technologies. Services, Service-Oriented Architectures. Cloud
service models. Cloud deployment models. Introduction to data centres: servers, data storage,
networking and virtualisation. Data centre networking. Introduction to server virtualisation
software: VMware VSphere. Virtual machine management: configuration, placement and
resource allocation. Power efficiency in virtual data centres. Fault tolerance in virtual data
centres. The cloud cube model and security for cloud computing. Security in the cloud. Cloud
threats, threat mitigation and security risks. Real world issues with cloud computing. Cloud
security alliance. National Institute of Standards and Technology, Information Assurance
Framework. Cloud audit. Cloud management audit/assurance programme, Cloud business
continuity planning. Building a cloud. Architectural best practices: Designing for the cloud.
Economics of the cloud. Cloud strategy. Cloud standards and the future. Security of the cloud.
GST 111
2
1 institution need this
At the end of this course, students should be able to: 1. identify possible sound patterns in English Language; 2. list notable language skills; 3. classify word-formation processes; 4. construct simple and fairly comple...
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). 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.
COS 201
3
1 institution need this
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 lang...
View learning outline
Introduction to computer programming. Functional programming; Declarative programming;
Logic programming; Scripting languages. Introduction to object-orientation as a technique for
modelling computation. structured, and even some level of functional programming principles;
Introduction of a typical object-oriented language, such as Java; 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
1 institution need this
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.
CYB 301
2
1 institution need this
At the end of this course, students should be able to: 1. define cryptography means, simple cryptosystems, symmetric and asymmetric cryptography, symmetric cryptosystems and asymmetric cryptosystems; 2. differentiate key...
View learning outline
Introduction to cryptography, symmetric and asymmetric cryptography, key management,
and encryption algorithms. Introduction to simple cryptosystems. Cryptanalysis. Stream
ciphers, Block ciphers and Feistel ciphers. Multiple encryption. Hash functions. Data integrity,
authentication, and perfect secrecy. Public-key cryptography and discrete algorithms-ELGamal
cryptography. Algorithms for the discrete logarithm problem. Algorithmic number theory.
Probabilistic primality testing. Security of ELGamal and RSA Encryption, and RSA Key
Generation. Discrete logarithm cryptographic schemes. Conventional and public-key
cryptography. Selected cryptosystems, including Data Encryption Standard (DES) and Rivest-
Shamir-Adleman (RSA) algorithm. AES encryption algorithm, a symmetric 128-bit block data
encryption technique. PKI, SSL, and VPN. Digital signatures, pseudo-random number
generation, cryptographic protocols and cryptanalytic techniques. Use of protocols, hashing
and certificates and certificate authorities. Policies, procedures, and methods for the proper
use of cryptography in secure systems. Applications of cryptography to signal.
Lab work: Practical exercise on writing cryptography algorithms. Work on cryptographic
techniques. Practice cryptanalysis of cipher and how to use protocols. Understand hash
functions and learn how to hash, produce secured digital signatures and certificates. Learn
the procedures and methods for the proper use of cryptography in secure systems. Practice
primality testing. Practical assignments on ELGamal, DES and RSA encryption security,
generation of RSA key and discrete logarithm cryptographic schemes.
400 Level