11.1.5.
COMPUTATIONAL MATHEMATICS (130 HOURS)
11.1.5.01: INTRODUCTION
This module unit is intended to equip the trainee with the knowledge, skills and
attitudes to be used in the Information Communication Technology.
11.1.5.02: GENERAL OBJECTIVES
63 By the end of this module unit, the trainee should be able to:
a) understand mathematical techniques relevant to Information Communication
Technology
b) use mathematical techniques to solve Information communication
Technology problems
c) apply mathematical principles in decision making
d) appreciate the role of computational mathematics in Information
Communication Technology
11.1.5.03: COURSE SUMMARY AND TIME ALLOCATION
CODE TOPIC SUB-TOPIC HOURS
11.1.5.1 INTRODUCTION TO COMPU- • algebra 14
TATIONAL MATHEMATICS - quadratic equations
- simultaneous equations
- linear equation with
three or more un-
knowns
- definition of matrices
- matrix operation
- application to matrices
11.1.5.2 NUMBER SYSTEMS AND • number systems 6
BINARY ARITHMETIC - decimal
- binary
- octal
- hexadecimal
• binary arithmetic
11.1.5.3 BINARY CODES • BCD 4
• GRAY
• alphanumeric code
50
CODE TOPIC SUB-TOPIC HOURS
11.1.5.4 LOGIC GATES AND • AND 7
BOOLEAN ALGEBRA • OR
• inverter
• Boolean Algebra
• NAND
• NOR
• implementation
• exclusive OR
• exclusive NOR
11.1.5.5 DISCRETE COUNTING • fundamental principles 14
• permutations and combi-
nations
• binomial expansion
11.1.5.6 GRAPHS AND FUNCTIONS • continuous functions 11
• (interpolations and
extrapolations)
• graphs of functions
• areas under a curve
• errors in graphs
• in-equalities
11.1.5.7 NUMERICAL ANALYSIS • iterative method 16
• approximation
• errors
• linear interpolation and
extrapolation
• finite differences
11.1.5.8 DATA COLLECTION REPRE- • basic for data collection 5
SENTATION • data classification
• data tabulation
• data presentation
11.1.5.9 MEASURES OF CENTRAL • definition of measures 5
TENDENCY • properties
• calculation and
• calculations
• interpretation
11.1.5.10 MEASURES OF DISPERSION • characteristics 5
• relative and absolute
• measures
• measures calculation
• and interpretation
51
CODE TOPIC SUB-TOPIC HOURS
11.1.5.11 ELEMENTS OF PROBABIL- • modeling 12
ITY • scale
• space
• multiple probabilities
• conditional
• probabilities
• probability trees
11.1.5.12 INTRODUCTION TO MOD- • symbolic models 11
ELING • laws of modeling
• generalizing models
• spartial models
• logical models
• statistical models
11.1.5.1T INTRODUCTION TO MODELLING
THEORY
11.1.5.1.T0 Specific Objectives
64 By the end of this topic, the trainee should be able to:
a) apply the laws of modeling
b) construct generalized and logical models
c) describe statistical models
d) model pseudocode
CONTENT
11.1.5.1.T1 Outline the laws of modeling
11.1.5.1.T2 Construct generalized models
11.1.5.1.T3 Explain logical models
Boolean Algebra
11.1.5.1.T4 Explain statistical models
Histograms
Frequency polygons
11.1.5.1.T5 Model pseudocode
11.1.5.2T NUMERICAL ANALYSIS
THEORY
11.1.5.2.T0 Specific Objectives
65 By the end of this topic, the trainee should be able to:
52
a) define the term interaction
b) derive an iterative formula for solving a given equation
c) round off or truncate a given number to required degree of accuracy
d) define types of errors
e) calculate errors
f) use partial derivatives to calculate errors
g) define linear interpolation and linear extrapolation
h) state the assumptions made in interpolation and extrapolation
i) calculated the value of function within and outside a given interval
j) define finite different table for given function
k) construct different table for given function
l) use the differences table to interpolate and extrapolate values of a given
function
CONTENT
11.1.5.2.T1 Definition of an interaction
11.1.5.2.T2 Derivation of an interactive formula for solving functions such as: F (x) = 0
Algebraic formula
Newton Raphson formula
11.1.5.2.T3 Rounding off or truncating a given number to required degree of accuracy
11.1.5.2.T4 Meaning of error types
Relative error
Absolute error
% error
11.1.5.2.T5 Using partial derivation to calculate error
11.1.5.2.T6 Definition of linear interpolation and linear extrapolation
linear interpolation
11.1.5.2.T7 Statement of assumption
11.1.5.2.T8 Calculation of values of functions
11.1.5.2.T9 Definition of finite difference table
11.1.5.2.T10 Construction of
forward difference table
central difference table
backward difference table
11.1.5.2.T11 Using finite differences table to interpolate and extrapolate values of function
linear interpolation table
53
quadratic interpolation table
Newton forward differences interpolation
Newton-Gregory interpolation
11.1.5.3T NUMBER SYSTEMS AND BINARY ARITHMETIC
THEORY
11.1.5.3.T0 Specific Objectives
66 By the end of this topic, the trainee should be able to:
a) represent decimal number in other number system
b) convert binary numbers into other numbers systems and vice versa
c) represent numbers in octal and vice versa
d) represent number in hexadecimal and vice versa
e) perform binary arithmetic
CONTENT
11.1.5.3.T1 Representation of decimal number system
digits used in decimal system (0-9)
representation of decimal number to binary, octal and hexadecimal
representation of fractions
11.1.5.3.T2 Conversion of binary numbers
binary digits (0, 1)
representation of binary number to octal decimal and hexadecimal
representation of multi-digit binary number
applications
bit
- byte
- word
- kilobyte
- megabyte
- gigabyte
11.1.5.3.T3 Representation of octal numbers
- octal digits (0, 7)
- representation of octal numbers in binary, decimal and hexadecimal
- representation of multi-digit octal numbers
- application
11.1.5.3.T4 Representation of hexadecimal numbers
- hexadecimal (0-F)
- representation of binary, octal and decimal
- representation of multi-digit hexadecimal numbers
- application of hexadecimal number in microcomputers
54
11.1.5.3.T5 Performance of binary arithmetic
perform binary addition using
- straight binary
- sign magnitude
- perform binary subtraction using
- straight binary
- sign and magnitude
- one’s compliment
- two’s compliment
compare the use of binary subtraction methods in a digit system
perform binary multiplication
perform binary division
perform binary arithmetic using
- fixed point
- floating point arithmetic
compare and contrast the use of fixed points and floating points
arithmetic in digital machines
11.1.5.3.T6 Octal number systems
state symbols of octal number systems as (0-7)
form octal numbers greater than 7
11.1.5.3.T7 Conversion of octal numbers to other number systems
convert from octal to decimal and vice versa
convert from octal to binary and vice versa
convert from octal to hexadecimal and vice versa
11.1.5.3.T8 Hexadecimal numbers
state symbols of hexadecimal as 0 through F
form hexadecimal numbers greater than F
11.1.5.3.T9 Conversion of hexadecimal numbers to other number systems
convert from hexadecimal to binary and vice versa
convert from hexadecimal to octal and vice versa
convert from hexadecimal to decimal and vice versa
demonstrate the use of hexadecimal numbers in microcomputer assembly
language
55
10.1.6. BINARY CODES
THEORY
11.1.6.3.T0 Specific Objectives
67 By the end of this topic, the trainee should be able to:
a) explain the need of various binary coes
b) represent decimal numbers in binary coded decimals (BCD)
c) perform BCD arithmetic
d) explain the use of GRAY code
e) represent characters in various alphanumeric codes in digital systems
f) explain error detection and parity
CONTENT
11.1.6.3.T1 Explanation of need of binary codes
explain the reason of using binary codes in digital systems
define the following erms as applied to binary codes
- weighted binary codes
- reflective codes
- sequential codes
- non weighted codes
state the use of binary codes with characteristics
11.1.6.3.T2 Representation of BCD numbers
represent decimal number in the following BCD methods
- 8421 BC
- excess – 3
- comparison of 8421 and excess – 3
11.1.6.3.T3 Performance of BCD arithmetic
addition
subtraction
multiplication
division
11.1.6.3.T4 Gray codes
conversion of binary numbers into gray code and vice versa
compare the use of gray codes and straight binary description of an
application of gray code
11.1.6.3.T5 Representation of alphanumeric code
explanation of the need for alphanumeric code
representation of characters in
- EBCDIC
- ASCII
56
comparison of use and limitation of alphanumeric codes
11.1.6.3.T6 Explain of error detection and parity
odd and even parity
generation of parity signal
detection of errors using parity signals
correction of errors using parity signals
parity codes
11.1.6.1T LOGIC GATES AND BOOLEAN ALGEBRA (7 HOURS)
THEORY
11.1.6.1.T0 Specific Objectives
68 By the end of this topic, the trainee should be able to:
a) explain the AND operation
b) explain the OR operation
c) explain the NOT (invert, complement) operation
d) minimize logic expressions using Boolean algebra
e) explain NAND operation
f) explain NOR operation
g) implement logic circuits using NAND gate only or NOR gates only
h) explain the exclusive – OR (modulo – 2) operation
i) explain the exclusive – NOR (configuration) operation
CONTENT
11.1.6.1.T1 Explanation of AND operation
represent AND operation using series switches
derive truth table for AND operation
draw symbol for AND gate
11.1.6.1.T2 Explanation of OR operation
represent OR operation using parallel switches
derive the truth table for AND operation
draw symbol for AND gate
11.1.6.1.T3 Explanation of NOT (Invert, Complement) operation
Represent NOT operation using normally closed switch operationBya
relay
Derive the truth table of NOT operation
Draw the symbol for NOT gate
57
11.1.6.1.T4 Minimization of logic expression using Boolean Algebra
state Boolean identifiers for
prove Boolean laws
- commutative
- distributive
- associate
prove De Morgan’s theorem
implement logic circuits in AND, OR and NOT gates from Boolean
11.1.6.1.T5 Explanation of NAND operation
show that NAND operation is equivalent to AND followed by an inverter
derive the truth table for NAND gate
draw the symbol for NAND age
11.1.6.1.T6 Explanation of NOR operation
show that NOR operation is equivalent to OR followedByan inverter
derive the truth table for NOR
draw the symbol for NOR gate
11.1.6.1.T7 Implementation of logic circuits using NAND gate only and NOR gates only
show how NAND gates or NOR gates can be used as inverted gate to
perform the operation of
- NOT gate
- AND gate
- OR gate
explain equivalent logic representation in logic schematic diagrams and
draw the equivalent representation for AND, OR and NOR
implement logic circuits in NAND gate only and NOR gates only.
11.1.6.1.T8 Explanation of exclusive – OR (modulo – 2) operation
explain the exclusive OR operation
derive the truth table of exclusive – OR operation
draw the logic circuit of the exclusive - OR gate
draw the symbol for the exclusive – OR gate
11.1.6.1.T9 Explanation of exclusive NOR operation
explain the exclusive -NOR operation
derive the truth table of exclusive – NOR operation
draw the logic circuit of the exclusive - NOR gate
draw the symbol for the exclusive – NOR gate
58
11.1.6.2T ALGEBRA
THEORY
11.1.6.2.T0 Specific Objectives
69 By the end of this topic, the trainee should be able to:
a) solve quadratic equations
b) solve simultaneous equations
c) solve linear equations with three or more unknowns
d) define a matrix
e) identify various types of matrices
f) carry out matrix operation
g) determine the inverse of matrices
h) use matrices to solve equations
i) apply the knowledge of matrices in solving real-life problems
CONTENT
11.1.6.2.T1 Solving quadratic equations
factorization
completing the square
formula method
graphical method
11.1.6.2.T2 Reducing equations to quadratic
11.1.6.2.T3 Solving the reduces quadratic equations
11.1.6.2.T4 Solving linear equations with three unknowns
11.1.6.2.T5 Forming linear equations with three or more unknowns
11.1.6.2.T6 Defining a matrix
row matrix or row vector (1, 2)
column matrix or column vector [½]
rectangular matrix
square matrix
singular matrix
non-singular matrix
null matrix
identify matrix
11.1.6.2.T7 Carrying out matrix operations
additional/ subtraction
compatibility
59
multiplication
commutability and non-commutability
divisionBya scalat
11.1.6.2.T8 Determining the inverse of matrices up to order 3
co-factor method
row reduction method
11.1.6.2.T9 Using matrices to solve simultaneous equation
cramer’s rule
inverse method
row reduction (Gaussian Elimination)
11.1.6.2.T10 Applying the knowledge of matrice in solving real life problems industrial
demand problems.
out put vector of the economy of say two industries
message – coding
storage of information
11.1.6.3T DISCRETE COUNTING
THEORY
11.1.6.3.T0 Specific Objective
70 By the end of this topic, the trainee should be able to:
a) state the fundamental union and product rule on the finite set
b) use the rule to determine the number of elements in the union and product
of the finite sets
c) determine the number of selections of elements from elements in sets
d) define permutations and combinations
e) apply permutation and combination various cases
f) use binomial coefficient in computing combinations
g) state the binomial theorem
h) expand a given binomial theorem
i) use binomial theorem to estimate errors of small changes
j) use the theorem to derive power series
CONTENT
11.1.6.3.T1 Stating the fundamental union (addition) in finite sets
11.1.6.3.T2 Using the rule to determine the number of elements in the union and product
of finite sets.
60
11.1.6.3.T3 Determine the number of selection of elements in a set
with replacement
without replacement
11.1.6.3.T4 Define permutation and combination
11.1.6.3.T5 Apply permutation and combination in various cases
11.1.6.3.T6 Stating the binomial theorem
11.1.6.3.T7 Expanding a given binomial expression
positive integers indices
negative integers indices
fraction indices
general term of expression
range of values of X for which the binomial series is convergent
11.1.6.3.T8 Using the binomial theorem estimate errors and small changes
appreciation
depreciation
compound interest
small temperature changes
errors in measurement
11.1.6.3.T9 Derivatives of X power series
11.1.6.4T GRAPHS AND FUNCTION
THEORY
11.1.6.4.T0 Specific Objectives
71 By the end of this topic, the trainee should be able to:
a) plot linear graph
b) make interpretations from linear graph
c) plot parabolic curves
d) solve simultaneous and quadratic equations by the graphical methods
e) present data in appropriate chart
CONTENT
11.1.6.4.T1 Plotting linear graphs
Intercepts of the axes y = 0, x = 0
11.1.6.4.T2 Making interpretations
Intercepts
Gradients
11.1.6.4.T3 Making interpretations
61
y = mx + c
11.1.6.4.T4 Solution of simultaneous and quadratic equations by plotting (linear and
parabolic) graphs.
11.1.6.4.T5 Presentation of data in charts
Pie chart
Bar chart
Pictogram
Histogram
11.1.6.5T ELEMENTS OF PROBABILITY
THEORY
11.1.6.5.T0 Specific Objectives
72 By the end of this topic, the trainee should be able to:
a) discuss the basic concepts of probability
b) apply the techniques of counting and set to probability
c) apply the laws of probability
d) calculate conditional probability
e) apply probability distribution concepts to decision problems.
CONTENT
11.1.6.5.T1 Basic concepts
types of concepts
uses of probability
11.1.6.5.T2 Theory Counting techniques, set and probability
11.1.6.5.T3 Laws of probability and applications
addition law
multiplication law
11.1.6.5.T4 Conditional probability
calculation
bayes theorem
application to decision problems
probability trees
11.1.6.5.T5 Probability application and distribution
poisson
normal
62
11.1.6.6T DATA COLLECTION AND PRESENTATION
THEORY
11.1.6.6.T0 Specific Objectives
At the end of this topic, the trainee should be able to:
a) explain the basic considerations for data collection
b) classify collected data into various categories
c) tabulate collected data
d) present data diagrammatically and graphically
CONTENT
11.1.6.6.T1 Basic for data collection
objectives and scope
statistical units
data sources and types
collection methods and limitations
11.1.6.6.T2 Data classification
classification functions
rules
types of classification
11.1.6.6.T3 Data tabulation
definitions and parts of table
types of tabulation
applications
11.1.6.6.T4 Data presentation
types of construction of diagrams
types and construction of diagrams and graphs
11.1.6.7T MEASURES OF CENTRAL TENDENCY
THEORY
11.1.6.7.T0 Specific Objectives
73 By the end of this topic, the trainee should be able to:-
define the measures of central tendency
state the properties of measures of central tendency
determine the measures of central tendency
63
CONTENT
11.1.6.7.T1 Definition of measures
11.1.6.7.T2 Properties
11.1.6.7.T3 Calculations and interpretation
means (arithimetic geometric)
mode
medium
11.1.6.8T MEASURES OF DISPERSION
THEORY
11.1.6.8.T0 Specific Objectives
74 By the end of this topic, the trainee should be able to:
a) state the characteristics of a good measures of dispersion
b) differentiate between the absolute and relative measure
c) calculate and interpret the measures of dispersion
CONTENT
11.1.6.8.T1 Characteristics
11.1.6.8.T2 Relative and absolute measures
definition
types
merits and demerits
11.1.6.8.T3 Measure calculation and interpretation
Range
Mean deviation
Quartiles, deciles, percentiles and S.I.R.
Standard deviation
Skewness and kurtosis
TEACHING/LEARNING RESOURCES
Relevant text books and free e-books
Whiteboard
ASSESSMENT MODE
Written Tests
64
