Mathematics and Computer Science Lectures
 /  Mathematics and Computer Science Lectures
  1. COMPUTER ARCHITECTURE AND ORGANISATION

    Ogeh, Clement O.

    Introduction Computer organization refers to the components from which computers are built. It is the operational units and other interconnections that brings about the architecture. In other words, they are the units that are transparent to the machine language programmer.

    Staff Profile Download
    Details
  2. Computer Memory

    Ogeh, Clement O.

    Introduction Data are represented in the computer memory in bits. That is 0s and 1s. 8bits make up a byte. Data entered into the computer have to be converted into the machine readable form.

    Staff Profile Download
    Details
  3. COMPUTER NETWORKS

    Ogeh, Clement O.

    Introduction Communication is the act of conveying a massage from a sender to a receiver through some form of medium. Communication is not complete if the receiver does not understands the massage.

    Staff Profile Download
    Details
  4. Computer Storage

    Ogeh, Clement O.

    Introduction Computer Storage are Secondary Memory that are external memory of the computer. It is also known as Auxiliary memory and permanent memory. It is used to store the different programs and the information permanently. They are non volatile.

    Staff Profile Download
    Details
  5. CSC102 – INTRODUCTION TO PROBLEM SOLVING

    Ogeh, Clement O.

    SOFTWARE Software are programs or collection of instructions that enable users to interact with the computer. They are the variable part of the computer (while the hardware of the computer are the invariable part of the computer).

    Staff Profile Download
    Details
  6. CSC204 – COMPUTER HARDWARE – LECTURE 1

    Ogeh, Clement O.

    Introduction An integrated circuit (IC), sometimes called a chip or microchip, is a semiconductor wafer on which thousands or millions of tiny resistors, capacitors, and transistors are fabricated. Integrated circuits are the building blocks of most electronic devices and equipment.

    Staff Profile Download
    Details
  7. CSC204 – COMPUTER HARDWARE – LECTURE 2

    Ogeh, Clement O.

    Introduction The Secondary memory is also known as Auxiliary Memory, Permanent Memory or external memory. It is non-volatile memory because it retains stored programs and information permanently even when power is switched off. Programs and information can also be deleted at any time. It is called auxiliary memory because it serves as a backup memory to the primary memory. They are also used for off-line storage and achieving.

    Staff Profile Download
    Details
  8. CSC204 – COMPUTER HARDWARE – LECTURE 3

    Ogeh, Clement O.

    Introduction The primary memory also called main memory or temporary memory is the internal memory of the computer. It is called the primary memory because it is the memory that the processor accesses first. It holds the data and instructions on which the processor is currently working on.

    Staff Profile Download
    Details
  9. CSC204 – COMPUTER HARDWARE – LECTURE 4

    Ogeh, clement O.

    Diode A diode is an electronic component that conducts current in one direction and blocks current from flowing in the other direction.

    Staff Profile Download
    Details
  10. CSC205 – Discrete Structure – Lecture 1

    Anoemuah Rosemary

    Lesson objectives:

    By the end of this lesson, students should be able to: describe discrete structure; define set; identify set notations; describe set theory; describe set operations.

    Staff Profile Download
    Details
  11. CSC205 – Discrete Structure – Lecture 10

    Anoemuah Rosemary

    Basic Graph Theorems In this topic we review certain basic concepts of linear algebra in graph theory. We consider matrices. You are assumed to be familiar with the basic operations on matrices.

    Staff Profile Download
    Details
  12. CSC205 – Discrete Structure – Lecture 2

    Anoemuah Rosemary

    Lesson objectives:By the end of this lesson, students should be able to: Define and describe relations; Identify and describe the different kinds of relations.

    Staff Profile Download
    Details
  13. CSC205 – Discrete Structure – Lecture 3

    Anoemuah Rosemary

    Lesson objectives:By the end of this lesson, students should be able to: Define functions; Identify and describe the different types of functions.

    Staff Profile Download
    Details
  14. CSC205 – Discrete Structure – Lecture 4

    Anoemuah Rosemary

    Lesson Objectives:By the end of this lesson, students should be able to: describe and identify antisymmetric relations; describe and identify partial order sets(POSETs); describe Lattices; identify different types of Lattices; describe Boolean algebra; identify different types of Boolean algebra.

    Staff Profile Download
    Details
  15. CSC205 – Discrete Structure – Lecture 5

    Anoemuah Rosemary

    Partially and totally ordered setsA partially ordered set or poset P is a pair (X,P) where P is an reflexive, anti symmetric and transitive binary relation on X. The set X is called the groundset and members of X are called elements or points. The binary relation P is called a partial order on X.

    Staff Profile Download
    Details
  16. CSC205 – Discrete Structure – Lecture 6

    Anoemuah Rosemary

    Lattices Partial order and lattice theory play an important role in many disciplines of computer science and engineering. For example, they have applications in distributed computing (vectorclocks, global predicate detection), concurrency theory(pomsets, occurrence nets),programming language semantics(fixed-point semantics), and data mining(concept analysis). They are also useful in other disciplines of mathematics such as combinatorics, number theory and group theory.

    Staff Profile Download
    Details
  17. CSC205 – Discrete Structure – Lecture 8

    Anoemuah Rosemary

    Boolean Algebra & Calculus, Basic GatesA Boolean algebra is a system consisting of a set of elements, B, two binary operators (+ and .), parentheses to indicate the nested order of evaluation and an = operator to perform assignment of an expression. The algebra must further obey sixfundamental postulates, or axioms:

    Staff Profile Download
    Details
  18. CSC205 – Discrete Structure – Lecture 9

    Anoemuah Rosemary

    Graph Theory: Graph theory is a branch of discrete mathematics.In mathematics and computer science, graph theory is the study of graphs which are mathematical structures used to model pairwise relations between objects.

    Staff Profile Download
    Details
  19. CSC206 – Foundations of Sequential Program – Lecture 1

    Anoemuah Rosemary

    Memory Memory refers to the computer hardware integrated circuits that store information for immediate use in a computer; it is synonymous with the term "primary storage". Computer memory operates at a high speed, for example random-access memory (RAM), as a distinction from storage that provides slow-to-access information but offers higher capacities. If needed, contents of the computer memory can be transferred to secondary storage, through a memory management technique called "virtual memory".

    Staff Profile Download
    Details
  20. CSC206 – Foundations of Sequential Program – Lecture 2

    Anoemuah Rosemary

    COMPUTER / PROGRAMMING LANGUAGES Computer or Programming Languages are sets of words, symbols and codes used to write programs. Different programming languages are available for writing different types of programs. Some languages are specially used for writing business programming, others are used for writing scientific program etc.

    Staff Profile Download
    Details
  21. CSC206 – Foundations of Sequential Program – Lecture 3

    Anoemuah Rosemary

    Memory Your programs /software has two main kinds of memory to work with, which are: Stack memory, Heap memory

    Staff Profile Download
    Details
  22. CSC206 – Foundations of Sequential Program – Lecture 4

    Anoemuah Rosemary

    What is memory management? Memory management is the process of controlling and coordinating computer memory, assigning portions called blocks to various running programs to optimize overall system performance.

    Staff Profile Download
    Details
  23. CSC206 – Foundations of Sequential Program – Lecture 5

    Anoemuah Rosemary

    Control Structure Control Structures.In a program,a control structure determines the order in which statements are executed. It can also be defined as any mechanism that departs from the default of straight-line execution.

    Staff Profile Download
    Details
  24. CSC206 – Foundations of Sequential Program – Lecture 6

    Anoemuah Rosemary

    Describing Procedures In computer programming, a procedure is a set of coded instructions that tell a computer how to run a program or calculation. Many different types of programming languages can be used to build a procedure. Depending on the programming language, a procedure may also be called a subroutine, sub program or function.

    Staff Profile Download
    Details
  25. CSC209 – Applications of Computer to Science – Lecture 1

    Anoemuah Rosemary

    History of Computers: Before the 1500s, in Europe, calculations were made with an abacus Invented around 500BC, available in many cultures (China, Mesopotamia, Japan, Greece, Rome, etc.)

    Staff Profile Download
    Details
  26. CSC209 – Applications of Computer to Science – Lecture 2

    Anoemuah Rosemary

    IMPORTANCE OF COMPUTERS: A computer is an electronic device that executes certain actions through user-based commands. It is made up of two parts- hardware and software. The computer processes input through input devices like the mouse and keyboard. It displays output through output devices like a monitor and printer.

    Staff Profile Download
    Details
  27. CSC209 – Applications of Computer to Science – Lecture 3

    Anoemuah Rosemary

    Components of Computer: Computer system consists of: System Unit-The system unit is the main container for system devices. It protects the delicate electronic and mechanical devices from damage; Storage devices; primary storage; secondary storage; input devices; output devices; Communications devices; Buses-a path through which data can be sent to the different parts of the computer system; Ports.

    Staff Profile Download
    Details
  28. CSC209 – Applications of Computer to Science – Lecture 4

    Anoemuah Rosemary

    Computer Software: Computer Instructions or data, anything that can be stored electronically is Software. Software consists of programs and enables a computer to perform specific tasks, as opposed to its physical components(hardware) which can only do the tasks they are mechanically designed for.

    Staff Profile Download
    Details
  29. CSC209 – Applications of Computer to Science – Lecture 6

    Anoemuah Rosemary

    System Software: System software is the software that controls everything that happens in a computer. System Software includes the Operating System and all the utilities that enable the computer to function. System software is a term referring to any computer software which manages and controls the hardware so that application software can perform a task.

    Staff Profile Download
    Details
  30. CSC209 – Applications of Computer to Science – Lecture 7

    Anoemuah Rosemary

    Software Programming and Development: Program is a set of instructions, written with computer programming languages by programmers, to solve a particular task or problem. Therefore, programming is the act of writing computer programs. Programming Languages are the languages used in developing computer programs.

    Staff Profile Download
    Details
  31. CSC302 – COMPILER CONSTRUCTION 1 – LECTURE 1 Details
  32. CSC302 – COMPILER CONSTRUCTION 1 – LECTURE 2 Details
  33. CSC302 – COMPILER CONSTRUCTION 1 – LECTURE 3 Details
  34. CSC302 – COMPILER CONSTRUCTION 1 – LECTURE 4 Details
  35. CSC302 – COMPILER CONSTRUCTION 1 – LECTURE 5 Details
  36. CSC302 – COMPILER CONSTRUCTION 1 – LECTURE 6 Details
  37. CSC303 – Object Oriented Programming – Lecture 1

    Anoemuah Rosemary

    What is Object Oriented Programming? OOP, is a programming paradigm using “objects”, which are data structures consisting of data fields and methods together with their interactions, to design applications and computer programs. It is an approach that provides a way of modularizing programs by creating partitioned memory area for both data and functions that can be used as templates for creating copies of such modules on demand.”

    Staff Profile Download
    Details
  38. CSC303 – Object Oriented Programming – Lecture 10

    Anoemuah Rosemary

    Methods The concept of modularity in Java, i.e, how java handles subprograms or program modules, is usually achieved by the use of methods; which is also referred to as functions and procedures in some other languages.

    Staff Profile Download
    Details
  39. CSC303 – Object Oriented Programming – Lecture 11

    Anoemuah Rosemary

    Principles of OOP in Java An object oriented program will usually contain different types of objects, each type corresponding to a particular kind of complex data to be managed or perhaps to a real life object or concept such as a bank account, a hockey player, or a bull dozer. An OOP may thus be viewed as a collection of interacting objects, as opposed to the conventional model in which a program is seen as a list of tasks or subroutines to perform.

    Staff Profile Download
    Details
  40. CSC303 – Object Oriented Programming – Lecture 12

    Anoemuah Rosemary

    Applications of Object Oriented Programming Concepts in Java Inheritance can be defined as the process where one object acquires the properties of another. With the use of inheritance the information is made manageable in a hierarchical order. When we talk about inheritance, the most commonly used keyword would be extends and implements.These words would determine whether one object is a type of another.

    Staff Profile Download
    Details
  41. CSC303 – Object Oriented Programming – Lecture 13

    Anoemuah Rosemary

    Java Applets Built using one of general definitions of applets; Appletclass, JAappletclass. Java applets are usually graphical; Draw graphics in a defined screen area; Enable user interaction with GUI elements

    Staff Profile Download
    Details
  42. CSC303 – Object Oriented Programming – Lecture 14

    Anoemuah Rosemary

    File Handling with Java All along,we have been using keyboard and monitor to input our programs and output the results of computations respectively from our programs, we now turn our attention to the use of files. A file stores data permanently unlike variables and arrays, which loose data as soon as the programs that use them terminates.

    Staff Profile Download
    Details
  43. CSC303 – Object Oriented Programming – Lecture 15

    Anoemuah Rosemary

    Database Handling with Java JDBC stands for Java Database Connectivity. JDBC API is a collection of classes and interfaces, which help a Java application to connect to SQL based relational databases by abstracting vendor specific details of the database. JDBC enables Java developers to connect to any SQL compliant database, send SQL statements, and process return messages and data.

    Staff Profile Download
    Details
  44. CSC303 – Object Oriented Programming – Lecture 16

    Anoemuah Rosemary

    OLE Microsoft’s Technology for components; The full meaning is “Object Linking and embedding”; Based on “COM” = “Component Object Model”

    Staff Profile Download
    Details
  45. CSC303 – Object Oriented Programming – Lecture 17

    Anoemuah Rosemary

    Java Persistence Mapping Java objects to database tables and vice versa is called Object-relational mapping (ORM). The Java Persistence API (JPA) is one possible approach to ORM. Via JPA the developer can map, store, update and retrieve data from relational databases to Java objects and vice versa. JPA can be used in Java-EE and Java-SE applications.

    Staff Profile Download
    Details
  46. CSC303 – Object Oriented Programming – Lecture 2

    Anoemuah Rosemary

    Introduction: Java is an OOP language with a relatively simple grammar. Java omits the poorly understood, confusing features of C++ such as header files, pointer arithmetic, structures, unions, operator overloading and templates. Java added new features like automatic garbage collection. All methods, fields and constructors are local to classes, that is, there is no global data. Java supports static methods and fields, exception handling, inheritance, and control structures such as while loops, for loops, and if/else statements.

    Staff Profile Download
    Details
  47. CSC303 – Object Oriented Programming – Lecture 3

    Anoemuah Rosemary

    TOOLS FOR DEVELOPING, COMPILING, INTERPRETING AND DEBUGGING JAVA PROGRAMS Comments are very good in programs. They make the codes to be more readable and understandable. Note that adding comments to your code is called documenting your code and comments are normally ignored during program compilation. Therefore, comments promote readability, understandability and maintainability of programs. Java embraces both c and C++ styles of comments. The C comment style is a multi line style. It is used when we have several lines of comments to be inserted into our program.

    Staff Profile Download
    Details
  48. CSC303 – Object Oriented Programming – Lecture 4

    Anoemuah Rosemary

    Java programs1. the scanner has to be imported into your program, similar to #include in C or C++ language. This is done in line 2. 2. In line 5, an object of the Scanner class(input) is created. The variable/object input is user-defined. You can give any other meaningful identifier name for this object. This will serve as the anchor for receiving data from the keyboard buffer as you are entering data via the keyboard.

    Staff Profile Download
    Details
  49. CSC303 – Object Oriented Programming – Lecture 5

    Anoemuah Rosemary

    Java variables and objects: A variable has a type and hold a single value. It hold data in Java just as any other programming languages. While an object is an instance of a class and may contain many variables. An object is created by using the “new”  operator to invoke a “constructor” and it dies when it has when it has no references.

    Staff Profile Download
    Details
  50. CSC303 – Object Oriented Programming – Lecture 6

    Anoemuah Rosemary

    Lesson Objectives: By the end of this lesson, students should be able to: describe the structure of a Java program; describe java access specifiers and modifiers.

    Staff Profile Download
    Details
  51. CSC303 – Object Oriented Programming – Lecture 7

    Anoemuah Rosemary

    Operator definition: An operator is a character that represents an action, for example + is an arithmetic operator that represents addition.

    Staff Profile Download
    Details
  52. CSC303 – Object Oriented Programming – Lecture 8

    Anoemuah Rosemary

    By the end of this lesson, students should be able to: distinguish between instance and local variables;describe how to initialize instance variables; identify and correct a Possible reference before assignment compiler error; recognize, describe, and use Java software operators; distinguish between legal and illegal assignments of primitive types

    Staff Profile Download
    Details
  53. CSC303 – Object Oriented Programming – Lecture 9

    Anoemuah Rosemary

    What is an Array? With the basic built-in Java data types that you’ve seen in the previous chapters, each identifier corresponds to a single variable. But when you want to handle sets of values of the same type— the first 1,000 primes, for example—you really don’t want to have to name them individually. What you need is an array.

    Staff Profile Download
    Details
  54. CSC308 – Algorithms and Complexity Analysis – Lecture 1

    Anoemuah Rosemary

    Introduction This course applies design and analysis techniques to numeric and non numeric algorithms which act on data structures. Design is emphasized so that the student will be able to develop new algorithms. Analysis of algorithms is concerned with the resources an algorithm must use to reach a solution. Only theoretical techniques of analysis are covered.

    Staff Profile Download
    Details
  55. CSC308 – ALGORITHMS AND COMPLEXITY ANALYSIS – LECTURE 1

    Anoemuah Rosemary

    Overview: This course applies design and analysis techniques to numeric and non numeric algorithms which act on data structures. Design is emphasized so that the student will be able to develop new algorithms. Analysis of algorithms is concerned with the resources an algorithm must use to reach a solution. Only theoretical techniques of analysis are covered. Topics include introduction to algorithm, Basic algorithmic analysis: Asymptotic analysis of Upper and average complexity bounds(Asymptotic complexity, sorting and searching); standard Complexity Classes Time and space trade offs in algorithms analysis recursive algorithms. Algorithmic Strategies: Fundamental computing algorithms:

    Staff Profile Download
    Details
  56. CSC308 – ALGORITHMS AND COMPLEXITY ANALYSIS – LECTURE 2

    Anoemuah Rosemary

    Algorithm classification: Algorithms that use a similar problem-solving approach can be grouped together; We’ll talk about a classification scheme for algorithms; This classification scheme is neither exhaustive nor disjoint; The purpose is not to be able to classify an algorithm as one type or another, but to highlight the various ways in which a problem can be attacked

    Staff Profile Download
    Details
  57. CSC308 – ALGORITHMS AND COMPLEXITY ANALYSIS – LECTURE 3

    Anoemuah Rosemary

    Analysis of Algorithms: What is the goal? Analyze time requirements -predict how running time increases as the size of the problem increases: Why is it useful? To compare different algorithms.

    Staff Profile Download
    Details
  58. CSC310 – SYSTEM ANALYSIS AND DESIGN – LECTURE 1

    Ejodamen Pius Uagbae

    INTRODUCTION Systems analysis and design refers to the process of examining a business situation with the intent of improving it through better procedures and methods. Systems development can generally be thought of as having two major components: Systems Analysts and Systems Design. Systems design is the process of planning a new system or replace or complement an existing system. But before this planning can be done, we must thoroughly understand the existing system and determine how computers can best be used to make its operation more effective.

    Staff Profile Download
    Details
  59. CSC310 – SYSTEM ANALYSIS AND DESIGN – LECTURE 2

    Ejodamen Pius Uagbae

    SYSTEM DEVELOPMENT LIFE CYCLE (SDLC) System development, a process consisting of the two major steps of systems analysis and design, starts when management or sometimes system development personnel feel that a new system or an improvement in the existing system is required. The systems development life cycle is classically thought of as the set of activities that analysts, designers and users carry out to develop and implement an information system.

    Staff Profile Download
    Details
  60. CSC310 – SYSTEM ANALYSIS AND DESIGN – LECTURE 3

    Ejodamen Pius Uagbae

    FEASIBILITY STUDY Once a preliminary area of application has been identified, it may then be subjected to a more rigorous examination in a feasibility study. We previously discussed the steps that make up the initial investigation. By the initial investigation, a user has recognized the need, user requirements are determined and the problem has been defined. Apart from this, an initial investigation is launched to study the present system and verify the problem in a systematic way. The next step is to determine exactly what the proposed system is to do by defining its expected performance. This kind of work will be carried out in the feasibility study.

    Staff Profile Download
    Details
  61. CSC310 – SYSTEM ANALYSIS AND DESIGN – LECTURE 4

    Ejodamen Pius Uagbae

    Data Flow Diagrams (DFD) Graphical description of a system’s data and how the processes transform the data is known as Data flow Diagram (or DFD). Unlike detail flowcharts, DFDs do not supply detailed descriptions of modules but graphically describe a system’s data and how the data interact with the system.

    Staff Profile Download
    Details
  62. CSC311 – Survey of Programming Languages – Lecture 1

    Anoemuah Rosemary

    What is Programming? A program is a set of instructions use in performing specific task. Therefore, Programming is an act of writing programs.

    Staff Profile Download
    Details
  63. CSC311 – Survey of Programming Languages – Lecture 10

    Anoemuah Rosemary

    Abstraction Principle In software engineering and programming language theory, the abstraction principle (or the principle of abstraction) is a basic dictum that aims to reduce duplication of information in a program (usually with emphasis on code duplication) whenever practical by making use of abstractions provided by the programming language or software libraries.

    Staff Profile Download
    Details
  64. CSC311 – Survey of Programming Languages – Lecture 11

    Anoemuah Rosemary

    Activation records and storage management It is useful to understand how storage is managed in different programming languages and for different kinds of data. Three important cases are: static storage allocation, stack-based storage allocation, heap-based storage allocation

    Staff Profile Download
    Details
  65. CSC311 – Survey of Programming Languages – Lecture 12

    Anoemuah Rosemary

    Modular programming Modular programming is a software design technique that emphasizes separating the functionality of a program into independent, interchangeable modules, such that each contains everything necessary to execute only one aspect of the desired functionality.

    Staff Profile Download
    Details
  66. CSC311 – Survey of Programming Languages – Lecture 13

    Anoemuah Rosemary

    Type Parameter A parameter represents a value that the procedure expects you to pass when you call it. The procedure's declaration defines its parameters. When you define a Function or Sub procedure, you specify a parameter list in parentheses immediately following the procedure name. For each parameter, you specify a name, a data type, and a passing mechanism (ByVal or ByRef).

    Staff Profile Download
    Details
  67. CSC311 – Survey of Programming Languages – Lecture 14

    Anoemuah Rosemary

    Overview of the main programming paradigms A programming paradigm is a style, or “way,” of programming. Some Common Paradigms are: Imperative - Programming with an explicit sequence of commands that update state; Declarative - Programming by specifying the result you want, not how to get it; Structured - Programming with clean, goto-free, nested control structures; Procedural - Imperative programming with procedure calls; Functional (Applicative) - Programming with function calls that avoid any global state; Function-Level (Combinator): Programming with no variables at all.

    Staff Profile Download
    Details
  68. CSC311 – Survey of Programming Languages – Lecture 2

    Anoemuah Rosemary

    Introduction Early (~1950-1957) computers were set-up/programmed using binary assembly codes for that exact computer. Multiplication, or even adding numbers that took more than one word, was done in several steps. Registers had different abilities (r1 can have r2-4 added to it, r3-6 can do bit-shifting, ... ) which you needed to know. It was obvious that the set-up for one computer wouldn't work for another.

    Staff Profile Download
    Details
  69. CSC311 – Survey of Programming Languages – Lecture 3

    Anoemuah Rosemary

    PARADIGM? We use the word Paradigm to mean “any example or model”. This usage of the word was popularized by the science historian Thomas Kuhn. He used the term to describe a set of theories, standards and methods that together represent a way of organizing knowledge- a way of viewing the world.

    Staff Profile Download
    Details
  70. CSC311 – Survey of Programming Languages – Lecture 4

    Anoemuah Rosemary

    Syntax Tree It is a Syntax tree because we are representing the Syntax of a language. The syntax of something is the structure of its statements. To have valid syntax means that you have written something that makes sense based on the rules of grammar.

    Staff Profile Download
    Details
  71. CSC311 – Survey of Programming Languages – Lecture 5

    Anoemuah Rosemary

    Lesson objectives: By the end of this lesson, students should be able to: Describe Grammar; Describe Ambiguous Grammar; Parse an expression on syntax tree; Transverse preorder, inorder and postorder.

    Staff Profile Download
    Details
  72. CSC311 – Survey of Programming Languages – Lecture 6

    Anoemuah Rosemary

    Introduction
    • Semantics: the meaning of the expressions, statements, and program units, that is, the study of meaning of languages.

    Staff Profile Download
    Details
  73. CSC311 – Survey of Programming Languages – Lecture 7

    Anoemuah Rosemary

    Students should be able to: Identify and describe Axiomatic semantics; Identify and describe Operational semantics; Identify and describe Denotation semantics.

    Staff Profile Download
    Details
  74. CSC311 – Survey of Programming Languages – Lecture 8

    Anoemuah Rosemary

    Declaration vs.definition A basic dichotomy is whether a declaration contains a definition or not: for example, whether a declaration of a constant or variable specifies the value of the constant(respectively,initial value of a variable), or only its type; and similarly whether a declaration of a function specifies the body(implementation) of the function, or only its type.

    Staff Profile Download
    Details
  75. CSC311 – Survey of Programming Languages – Lecture 9

    Anoemuah Rosemary

    GARBAGE COLLECTION When you are programming, no matter the task on hand, you are manipulating some data.These are stored in basic types and objects and they live inside computer memory. Eventually,the memory fills up and you need to make more room for new data and discard the old one.

    Staff Profile Download
    Details
  76. CSC312 – Formal Methods and Software Development – Lecture 1

    Anoemuah Rosemary

    Introduction Our society is still increasingly dependent on computer systems. As a result, mistakes in these computer systems can have serious consequences: large monetary damage can occur, or human lives can be endangered. In these cases, the traditional error prevention methods are often insufficient. However, employing formal methods can help to achieve the desired safety level.

    Staff Profile Download
    Details
  77. CSC312 – Formal Methods and Software Development – Lecture 2

    Anoemuah Rosemary

    Formal methods mathematical tools and models Every software development methodology is based on a recommended development process proceeding through several phases: Requirements identification, Specification, Design, Coding, Unit Testing, Integration and System Testing, Maintenance, Formal methods can; Be a foundation for designing safety critical systems, Be a foundation for describing complex systems, Provide support for program development

    Staff Profile Download
    Details
  78. CSC312 – Formal Methods and Software Development – Lecture 3

    Anoemuah Rosemary

    Formal Specification The approach is especially important in high-integrity systems, for example where safety or security is important, to help ensure that errors are not introduced into the development process.

    Staff Profile Download
    Details
  79. CSC312 – Formal Methods and Software Development – Lecture 4

    Anoemuah Rosemary

    What is Imperative Programming? Imperative Programming(IP) is one of the popular Programming Paradigms which executes a sequence of steps/instructions/statements in some order.

    Staff Profile Download
    Details
  80. DATA MANAGEMENT 1

    Ogeh, Clement O.

    Introduction Data management refers to all areas of planning, handling, analysis, documentation and storages. It includes the following activities of a study. The main elements of data management are database files. Database files contain text, numerical, images and other data in machine readable form. The files are viewed as part of a database management system which has a large range of functions that includes data entry, checking updating, documentation and analysis.

    Staff Profile Download
    Details
  81. Database management systems

    Ogeh, Clement O.

    Introduction Data are raw, unorganized facts that need to be processed. Data can be something simple and seemingly random and useless until it is organized. For example, student's test score is one piece of data.

    Staff Profile Download
    Details
  82. GENERATIONS OF COMPUTERS

    Ogeh, Clement O.

    Introduction The First Generation (1946 - 1958); Main component - vacuum tube, Generated a lot of heat, which was often the cause of malfunctions. Relied on machine language to perform operations.

    Staff Profile Download
    Details
  83. HISTORY OF COMPUTERS

    Ogeh, Clement O.

    Introduction The architecture of the first man made computers Earliest Computer; Originally calculations were computed by humans, whose job title was computers. These human computers were typically engaged in the calculation of a mathematical expression. The calculations of this period were specialized and expensive, requiring years of training in mathematics.

    Staff Profile Download
    Details
  84. Internet and the world wide web (www)

    Ogeh, Clement O.

    Introduction The first prototype of the Internet came in the late 1960s with the creation of ARPANET, or the Advanced Research Projects Agency Network. Originally funded by the U.S. Department of Defense, the 1970s after scientists Robert Kahn and Vinton Cerf developed Transmission Control Protocol and Internet Protocol, or TCP/IP, a communications model that set standards for how data could be transmitted between multiple networks.

    Staff Profile Download
    Details
  85. MTH101 – Elementary Mathematics – Lecture 1

    Dr. Mrs. C. E. Oladayo

    THE REAL NUMBERS SYSTEM Integers are whole numbers both positive and negative. They are whole numbers and opposite of whole numbers. Rational numbers are number that can be written as function (or ratio) of two integers. Irrational numbers are number that cannot be written as a function of two integers and are on the number line. The numbers defined above are different in their definitions but are similar in the sense that they are all components in the real number system.

    Staff Profile Download
    Details
  86. MTH101 – Elementary Mathematics – Lecture 2

    Dr. Mrs. C. E. Oladayo

    MATHEMATICAL INDUCTION A sequence of numbers can be defined as a set of numbers which are arranged in a set of order with constant different ratio and common difference. Each sequence of a term is separated from a term by commas. Sequence can be divided into 2, namely: Arithmetic Progression and Geometric Progression.

    Staff Profile Download
    Details
  87. MTH101 – Elementary Mathematics – Lecture 3

    Dr. Mrs. C. E. Oladayo

    AP- PRACTICE AND GEOMETRIC PREGRESSION In an A.P, the difference between the 8th and 4th term is 20 and the 8th term is one and half of the 4th term. What is: (a.) The common difference. (b.) The first term of the sequence?

    Staff Profile Download
    Details
  88. PHY252 – Modern Physics

    Prof. Ibiyinka Fuwape

    What are atoms? Fundamental particles of nature. Are they the smallest particles? No. Democritus in the Fifth century B.C. hypothesized that all matter (plus space and time) is composed of tiny indestructible units, called atoms.

    Staff Profile Download
    Details
  89. THE CALCULATOR AND THE JOHN VON NEUMANN’S ACHITECTURE OF THE COMPUTER

    Ogeh, Clement O.

    Introduction The calculator is an example non programmable finite state machine. Early digital systems were made of random logics including memory which are hardwired together. They are non-programmable Finite State Machine hence they perform their functions in a predefined way determined by the logic inputs and the memory. They are very fast but not flexible. They can only perform one function since they are non-programmable.

    Staff Profile Download
    Details

MICHAEL AND CECILIA IBRU UNIVERSITY

Ibru Village
Agbarha – Otor
Ughelli North
Delta State
Nigeria

Admissions

CONNECT WITH US

Registry