var date = new Date();
document.write(date.getDate();
document.write("/");
document.write(date.getMonth() + 1);
document.write("/");
document.write(date.getFullYear();
document.write("<br>");
document.write("<br>");
var test1 = Number(prompt("Please enter

R. J. Sadus, Lecture Notes in Computer Logic Essentials
7. Probability
Probability is the study of random non-deterministic experiments. For example, if
we toss a coin in the air, we know for certain1 that it will either land on heads or
tails but we cann

R. J. Sadus, Lecture Notes in Computer Logic Essentials
6. Combinatorial Analysis
Combinatorial analysis or combinatorics allows us to determine the number of
logical possibilities of an event. It involves the study of permutations,
combinations and parti

R. J. Sadus, Lecture Notes in Computer Logic Essentials
5. Boolean Algebra, Logic Gates and Logic Circuits
Boolean1 algebra is a mathematical structure that incorporates the properties of
logic and sets discussed in previous lectures. Some of the symbols

R. J. Sadus, Lecture Notes in Computer Logic Essentials
3. Set Theory
At the outset, studying set theory might seem like an esoteric topic in the context
of a course in computing. However, the rationale for understanding set theory will
be quickly apparen

R. J. Sadus, Lecture Notes in Computer Logic Essentials
4.1.1.2 Conjunction, p q
A conjunction is any two statements combined with the word and to form a
compound statement. Symbolically this is represented as p q, which can be
read as p and q. The truth

R. J. Sadus, Lecture Notes in Computer Logic Essentials
3.11 Functions
3.11.1 Definition
Functions are a special form of relation. If each element of set A can be assigned
a unique element of set B, the collection of such assignments is called a function

R. J. Sadus, Lecture Notes in Computer Logic Essentials
3.6 Algebra of Sets and Duality
The operations of sets (, and /) obey the following laws of set algebra.
Idempotent :
Associative :
Commutative:
Distributive:
Idenity:
Involution:
Complement:
DeMorga

R. J. Sadus, Lecture Notes in Computer and Logic Essentials
the process description itself or via the process description. For example,
consider the two alternative ways of adding every second number from 0 to n,
represented via the formula:
s=
n
i
i = 0,

R. J. Sadus, Lecture Notes in Computer and Logic Essentials
1. Algorithms
1.1 What is an algorithm?
An algorithm is a well-defined series of actions that is used to solve a problem
or generate a desired outcome. It is clear from this broad definition that

Lab - Configuring VLANs and Trunking
Topology
Spare PC
F0/24
PC1
PC2
Modifications to Network Drawing
Configure the spare PC as an Ethernet PC on a computer near you if available
Addressing Table
Device
Interface
IP Address
Subnet Mask
Default Gateway
S1

PROGRAMMING CHEAT SHEET/HINTS
Basic HTML Document
HTML Code
Role
<!DOCTYPE html>
<html lang="en">
<meta charset="UTF-8"/>
<head>
<title>
<h1>
<h2>
<h3>
<h4>
<p>
Defines the type of file
Sets the language
Defines the characters used
Labels the Tab Name
Siz

My HTML Page
Student Name: 101319590
Headings
HTML 5 has 6 different levels of headings ranging from h1 to h6.
Headings are useful to seperate different thoughts on a single webpage
Space
Web browsers ignore multiple spaces in a text file and the end of l

R. J. Sadus, Lecture Notes in Computer and Logic Essentials
2. Data Representation on a Computer
2.1 Analog versus Digital
Most of this lecture is devoted to understanding binary numbers. The reason that
binary numbers are so important is that they map di