COMPUTER SOFTWARE ENGINEERING - NBTE

fffffff
NID in Software Engineering (Draft)
)
2.3 State De Morgan’s theorem.
2.4 Construct a truth table for up
to 4 variables.
2.5 Form logic expression from
statements of conditions.
2.6 Minimize a logic expression
algebraically.
2.7 Explain a karnaugh map
(K.Map)
2.8 Construct a .K –Map for 2, 3,
4 variable.
from statements of
condition.
Using the stated Boolean
postulate explain the steps
in minimizing a logic
expression algebraically,
there after, demonstrate
the action.
Define and discuss the
karnaugh map.
Progressively design a
karnaugh map for 2
variable, 3 and 4 variables
and explain each step.
White board.
2.9 Minimize a logic expression
using a k-map
Use the principles in K-
Map and minimize logic
expression.
Week GENERAL OBJECTIVE 3: KNOW THE IMPLEMENTATION OF THE ADDITION OPERATION IN THE COMPUTER.
8 3.1 Design of an adder hardware. To explain:
The design of Half Adder.
PC connected to an
OHP projector.
• Implement various
adders, hardware. (Half
and Full adder)
The design of Full Adder.
The serial adder
The parallel adder
Power point
presentation of
lecture notes.
Online lecture
notes.
White board.
Week GENERAL OBJECTIVE 4: UNDERSTAND SMALL–SCALE INTEGRATED CIRCUIT
9 – 11 4.1 List the various terminologies
used to characterise integrated
circuits e.g. fan-out, fan –in
threshold, heat dissipation,
noise margin etc.
The teacher should:
Explain the various
terminologies used to
characterize integrated
circuits.
PC connected to an
OHP projector.
Power point
presentation of
lecture notes.
• Note the characteristics
of various logical gates.
• Identify technological
advances in
Assist student in their
practical work
Assist student in their
practical work
Networked PC lab,
with MS office
professional
Logic Simulator
packages such as
Electronic work
Bench, or Digital
work.
Networked PC lab,
with MS office
professional
Logic Simulator
packages such as
14