Logic Programming
1.
Introduction
Logic programming offers a formalism for specifying a computation in terms of logical relations between entities. A
logic program consists of a collection of logic statements describing a certain state of affairs. In orde

Complexity Analysis of
Algorithms (1)
Some background knowledge:
What is an Algorithm?
Why consider Efficiency and Correctness?
What is Computational Complexity?
What are the factors affecting efficiency?
What is the Motivation for studying
Algorithms?
Al

ICS 2301:
Design and
Analysis of
Algorithms
Backtracking Algorithms
Introduction:
Backtracking is a general algorithm
design technique for finding all (or
some) solutions to some computational
problem, that incrementally builds
candidates to the solutions

3. HTML Introduction
What is HTML?
HTML is a language for describing web pages.
HTML stands for Hyper Text Markup Language
HTML is a markup language
A markup language is a set of markup tags
The tags describe document content
HTML documents contain

FLIP-FLOPS
R-S Flip-Flop
A flip-flop is a bistable circuit. Both of its output states are stable. The circuit remains in a particular
output state indefinitely until something is done to change that output status. The R-S flip-flop is the
most basic of al

Digital Logic
Logic Gates
Logic Operations
D. Gakinya
2
Logical Operations
D. Gakinya
3
Logical Operations
D. Gakinya
4
Boolean Algebra (George Boole, 1815-1864)
D. Gakinya
5
De Morgan's Theorem
D. Gakinya
6
Distributive Law
D. Gakinya
7
Distributive Law

SYSTEM DEVELOPMENT
METHODOLOGIES
Lecturer: Bildad Mbagara
Definition
A methodology is a formalized approach to
implementing the SDLC (i.e., it is a list of steps
and deliverables)
Some methodologies are formal methods used
by the govt agencies, others b