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 × Clear all filters
Showing 21–30 of 246 courses
COS 201 3 1 institution need this
Computing  ·  B.Sc. Data Science
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 201 3
Computing  ·  B.Sc. Cybersecurity
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
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 201 3
Computing  ·  B.Sc. Information Technology
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 201 3
Computing  ·  B.Sc. Information and Communication Technology
At the end of the course, students should be able to: 1. identify different programming paradigms and their approach to programming; 2. write programmes using basic data types and strings; 3. design and implement program...
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 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, and 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 201 3
Computing  ·  B.Sc. Information Systems
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 Computer Programming II (3 Units C: LH 30; PH 45) Learning Outcomes 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; 3. demonstrate the basic use of OOP concepts: classes, objects, inheritance, polymorphism, data abstraction; 4. apply the tools for developing, compiling, interpreting and debugging programmes; and 5. demonstrate the use of syntax and data objects, operators. Central flow constructs, objects and classes programming, Arrays, methods, Exceptions, Applets and the Abstract, OLE, Persistence, Window Toolkit. Course Contents 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, and 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.
COS 202 3
Computing  ·  B.Sc. Software Engineering
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 program 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 program 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.
COS 202 3
Computing  ·  B.Sc. Information Technology
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.
COS 202 3
Computing  ·  B.Sc. Information and Communication Technology
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, and 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.
COS 202 3
Computing  ·  B.Sc. Cybersecurity
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.
COS 202 3 1 institution need this
Computing  ·  B.Sc. Data Science
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.
0 Total Views

Made Possible Through

Federal Ministry of Education
TETFund