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
Faculty: Computing × Programme: B.Sc. Computer Science × Clear all filters
Showing 11–20 of 35 courses
STA 111 3
Computing  ·  B.Sc. Computer Science
At the end of the course, students should be able to: 1. explain the differences between permutation and combination; 2. explain the concept of random variables and relate it to probability and distribution functions; 3....
View learning outline
Permutation and combination. Concepts and principles of probability. Random variables. Probability and distribution functions. Basic distributions: Binomial, geometric, Poisson, normal and sampling distributions; exploratory data analysis.
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 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.
MTH 202 2
Computing  ·  B.Sc. Computer Science
At the end of the course, students should be able to: 1. define the following: order and degree of a differential equation; 2. describe some techniques for solving first and second order linear and non-linear equations;...
View learning outline
Derivation of differential equations from primitive, geometry, physics, etc. order and degree of differential equation. Techniques for solving first and second order linear and non-linear equations. Solutions of systems of first order linear equations. Finite linear difference equations. Application to geometry and physics.
MTH 101 2
Computing  ·  B.Sc. Computer Science
At the end of the course, students should be able to: 1. explain 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, union, intersection, complements, 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
Computing  ·  B.Sc. Computer Science
At the end of the course, students should be able to: 1. distinguish types of rules in Differentiation and Integration; 2. describe the meaning of Function of a real variable, graphs, limits and continuity; and 3. solve...
View learning outline
Function of a real variable, graphs, limits and idea of continuity. The derivative, as limit of 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
Computing  ·  B.Sc. Computer Science
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, Intrapreneurship/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.
CSC 402 2
Computing  ·  B.Sc. Computer Science
At the end of the course, students should be able to: 1. state laws and regulations related to ethics; 2. identify and explain relevant codes of ethics for computing practice; 3. identify social and ethical issues in dif...
View learning outline
Addresses social, ethical, legal and managerial issues in the application of Computer Science to the information technology industry. Through seminars and case studies, human issues confronting Computer Science graduates will be addressed. Topics include managerial and personal ethics, computer security, privacy, software reliability, personal responsibility for the quality of work, intellectual property, environment and health concerns, and fairness in the workplace.
CSC 497 3
Computing  ·  B.Sc. Computer Science
At the end of this course, students should be able to: 1. identify a researchable project topic in Computer Science; 2. search and review literature pertinent to identified problem statement; 3. acknowledge and reference...
View learning outline
An independent or group investigation of appropriate software, hardware, communication and networks or IT related problems in Computer Science carried out under the supervision of a lecturer. Before registering, the student must submit a written proposal to the supervisor to review. The proposal should give a brief outline of the project, estimated schedule of completion, and computer resources needed. A formal written report is essential and an oral presentation may also be required.
CSC 498 3
Computing  ·  B.Sc. Computer Science
At the end of the course, students should be able to: 1. demonstrate technical skills in Computer Science; 2. demonstrate generic transferable skills such as communication and team work; 3. produce a technical report in...
View learning outline
This is a continuation of CSC 497. This contains the implementation and the evaluation of the project. A formal written report, chapters 4-5 have to be approved by the supervisor. A final report comprising chapters 1 - 5 will be submitted to the department for final grading. An oral presentation is required. INS 401 Project Management (2 Units C: LH 30) Learning Outcomes At the end of this course, students should be able to: 1. describe project management planning; 2. describe project scheduling; 3. explain management of project resources; 4. discuss project procurement, monitoring and execution; and 5. explain project communication and time management. Course Contents Introduction to Project Management. The Project Management Lifecycle: Project management and systems development or acquisition. The project management context. Technology and techniques to support the project management lifecycle, and Project management processes. Managing Project Teams: Project team planning, motivating team members, Leadership, power and conflict in project teams, and managing global project teams. Managing project communication and enhancing team communication. Project Initiation and Planning. Managing Project Scope: Project initiation, how organisations choose projects, Activities, and Developing the project charter. Managing Project Scheduling: Common problems in project scheduling, and Techniques for project scheduling. Managing Project Resources: Types of resources (human, capital, time), and Techniques for managing resources. Project quality and tools to manage project quality. Managing project risk and tools for managing project risk. Managing Project Procurement: Alternatives to systems development, External acquisition, Outsourcing-domestic and offshore. Steps in the procurement process, and managing the procurement process. Project Execution, Control and Closure: Managing project execution, monitoring progress and managing change. Documentation and communication, and Common problems in project execution. Managing Project Control and Closure: Obtaining information, Cost control, Change control, administrative closure, Personnel closure, Contractual closure and Project auditing.
0 Total Views

Made Possible Through

Federal Ministry of Education
TETFund