ONLINE LABS
Student Check Off Form
Instructions: In this form you are asked to take a moment to reflect on your lab
activities. To earn credit for your participation in lab activities, be sure to address all six
questions in the Check-Off form and then su
Software Testing Fundamentals
Introduction to Testing
testing can demonstrate the presence of bugs, but not their absence Edsger Dijkstra
Debugging and testing are not the same thing!
Testing is a systematic attempt to break a program.
o Bug-free progra
Regular Expressions
Definition
Regular expressions are a powerful tool for text processing.
They allow for the description and parsing of text.
With additional support, tools employing regular expressions can modify text and data.
Example Problems
Che
Design by Failure
What do you do when things go wrong?
What went wrong?
o Timing deadlines missed
o Missing functionality cant make somethings work
o Fragile testing is incomplete and known bugs exist in the code
When did, things go wrong? at the beginn
The Basics of Counting
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
The Basics of Counting
1 / 36
Combinatorics
Definition
Combinatorics is the study of the arrangement of objects. An important area of
combinatorics is enumeration
Introduction to Logic
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Introduction to Logic
1 / 46
Logic: What is it Good For?
The rules of logic apply directly to future topics in computer science:
I design of computer circuits
I de
Boolean Algebra
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Boolean Algebra
1 / 28
Outline
Topics:
I
Boolean variables, functions, operators
I
Relationship with logic
I
Combinatorial circuits (gating networks)
I
Duality
I
Sum of
Discrete Probability
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Discrete Probability
1 / 23
Where do we use Probability?
I
Average case analysis of running times for algorithms
I
Inheritance of genetic traits
I
Gambling
I
Random
Methods of Proof
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Methods of Proof
1 / 26
Definitions
Definition
A theorem is a statement that can be shown to be true.
We demonstrate that a theorem is true with a sequence of statement
Sequences and Sums
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Sequences and Sums
1 / 17
Sequences
Definition
Sequences are used to represent ordered lists of elements.
They can be finite (we call them strings), or infinite. We w
Functions
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Functions
1 / 16
Functions
The theory that has had the greatest development in recent times
is without any doubt the theory of functions.
- Vito Volterra, 1888.
The assigning
Introduction to Graphs
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Introduction to Graphs
1 / 10
Problems Solved Using Graphs
Graphs are frequently used to model real world problems. Many of these
problems can be solved by applyi
Trees and Their Applications
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Trees and Their Applications
1 / 14
Trees
We already know that graphs can be used to model many problems. Trees are a
special type of graph with many nice p
Integer Representations
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Integer Representations
1 / 12
Other Integer Representations
It is often useful to represent integers in bases other than the standard base 10.
Other common base
Induction
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Induction
1 / 16
Induction
What is Induction?
I reasoning from the particular to the general; whats true for particulars should
(might) be true for all other instances
I a pro
Planar Graphs
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Planar Graphs
1/8
Planar Graphs
Circuit Design
When designing electronic circuits or computer chips, it is often desirable to implement
the designs without wires crossing.
Sets and Set Operations
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Sets and Set Operations
1 / 20
Sets
Definition: Set
A set is an unordered collection of objects.
Sets are the fundamental discrete structure for:
I
Databases: re
Connectivity
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Connectivity
1/7
Connectivity
Definition
Let G = (V, E) be a simple graph. A path is a sequence of vertices v0 , v1 , . . . , vn where
there is an edge between each consecu
Generalized Permutations and Combinations
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Generalized Permutations and Combinations
1 / 21
Permutations with Repetition
So far weve looked at permutations and combinations of objects wh
Relations
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Relations
1 / 14
Relations
Common relationships:
I a business and its clients
I staff and their time sheets
I clients and their invoices
I staff and the projects they work on
Terminology and Special Types of Graphs
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Terminology and Special Types of Graphs
1 / 16
Terminology for Undirected Graphs
Definition
Two vertices u and v are said to be adjacent or neigh
Discrete Mathematics Introduction
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Discrete Mathematics Introduction
1/7
What is Discrete Mathematics?
Definition: Discrete Mathematics
Discrete Mathematics is the part of mathematics th
Graph Coloring
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Graph Coloring
1/7
Graph Coloring
Consider the problem of assigning frequencies to various radio transmitting stations. If
the transmission ranges overlap, then it is not
Representing Graphs and Isomorphism
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Representing Graphs and Isomorphism
1/7
Representing Graphs
For large graphs, we want to apply computers to solve tasks such as:
I Finding the shorte
Euler and Hamilton Paths
CIS 2130 (DE)
Notes by: Joe Sawada
University of Guelph
CIS 2130 (DE)
Euler and Hamilton Paths
1/7
Euler Paths and Cycles
The Seven Bridges of K
onigsberg
The town of K
onigsberg has 4 land regions separated by a river with 7 brid
Discussion questions:
1. Based on Ibarra & Linkebacks criteria of a good story, was Brendas story
good?
a. -On page 262 of the textbook
2. What was the theme/purpose of the story?
3. What general did the story make?
4. Do you think the story was exaggerat
Chapter 7 & 3.1,2,8
3.1
3.2
Spam
2000, spam accounted for 8% of emails
2009, spam accounted for 90% of emails
useful to company because it cost a lot less to send via email than through the postal service
Spammers get the email addresses from web site
Encryption
turning a plaintext message M into a cipher test C such that the substance and meaning of M are
hidden
usually done in C
Decryption is doing the opposite
Cipher
the algorithm used for encryption and decryption
the key is the password
Symm
CIS*3000 - Chapter 5 + chapter 3.5-6
3.5 Censorship
the attempt to suppress or regulate public access to material considered oensive or harmful
Direct Censorship has three forms
government monopolization, prepublication review, licensing and registrati
Midterm Exam Review
October 12, 2014
EXAM
27 MC questions
6 Short Answer questions, technically, but in reality
there are more than 6 b/c there are sub-questions.
Experience tells me the first person will finish around
45-50 minutes, will be left after