NETW Assignment 2
Linux, Static IP address/subnets configuration
Task 1: Do Linux Tutorial
Go to http:/www.ee.surrey.ac.uk/Teaching/Unix/unix2.html and do the 2nd
basic Unix tutorial.
Provide screenshots of all exercises 2a and 2b. Do all subsections of t
NTWST Assignment 3
IP Routing
Task 1: A bit more complex network: Part 2
Last week you did the configuration of your IP network for the preconfigured lab.
If you have done well and used either scripts or network/interfaces files, you should
be able to res
NETW Assignment 1
Linux, Netkit, TCP/IP Layers in Wireshark
Task 1: Install Linux Environment
Follow these steps:
1. Make sure you have 20 GB of free disk space
2. Download the virtual guest OS image from:
www.fhict.nl/docent/downloads/TI/P4/Lubuntu_14.04
Solutions to selected exercises of Chapters 711
Bas Luttik
September 16, 2015
This document contains solutions to the following exercises in the book [1]:
7.1, 7.2(c), 7.3(b), 7.7(b), 8.2(e), 8.7(c), 8.9(b),(d), 9.5(b), 9.6(b),11.4(c),11.6.
We strongly ad
Calculation: strenghts and weaknesses
3/53
P (P Q)
val
= cfw_ True/False-elimination
(P False) (P Q)
Reasoning
Conclusions:
val
I
P (P Q) = P
I
P (P Q) P is a
tautology
val
= cfw_ Distributivity
P (False Q)
Lecture 4, 5 and 6 (Chapters 1115)
val
= cfw_
Solutions to selected exercises about induction
Bas Luttik
October 16, 2012
This document contains solutions to exercises in the book [1] and exercises from
the set of Additional Exercises about induction, available as http:/www.win.tue.
nl/~luttik/Course
Solutions to selected exercises about induction
Bas Luttik
January 12, 2012
This document contains solutions to exercises in the book [1]. The document
contains solutions to the following exercises:
20.4, 20.6, 20.7, 20.13, 20.16, 20.17(a,c)
We strongly a
Relation between sets
2/15
A relation R between sets A and B is a predicate on A B.
R(x, y) means x A and y B are related.
Example (Arrow Graph)
The relation is child of is a
predicate on
Relations
Lectures 89 (Chapter 17)
anna
Children Parents .
ron
bert
Example
2/20
8
Let R be a binary relation on Z defined by
Mappings
x R y if y = x2 1 .
Lectures 9 and 10 (Chapter 18)
3
On every vertical line exactly 1 point.
3 2
/
/
department of mathematics and computer science
Mapping (1)
department of mathematics an
Sets
2/31
We will not give a precise definition of what is a set, but we
will say precisely what you can do with it.
(Think of a set as a collection of things of which order and multiplicity
do not matter.)
Sets
Lectures 68 (Chapter 16)
Examples:
/
/
depa
Solutions to selected exercises of Chapters 16
Bas Luttik
November 17, 2011
This document contains solutions to the following exercises in the book [1]:
2.4(c),(d), 2.6, 2.8, 3.1, 4.4(e), (f), 5.5 (c), (d), 6.5(b) and 6.6(c).
We strongly advise you to fir
What is a proof?
2/38
A proof of a statement is a complete and convincing argument that
the statement is true.
A proof is a means of communication.
Induction
Lectures 1113 (Chapter 19)
The desired form of the proof and the required amount of detail will
d
Predicates and abstract function values
I
Other Binders
2/5
6m
9n > 3 is a binary predicate
| +cfw_z
sentence
(we get a propostion by filling out values for m and n)
Lecture 3 (Chapter 10)
I
6m
+ 9n is an abstract function value
| cfw_z
noun
(we get an ob
Propositions
2/52
A proposition is a statement that is true or false.
Examples:
Propositional Logic
Lectures 1 and 2 (Chapters 27)
I
grass is green
I
5>3
I
5<3
I
grass is green and roses are blue
I
if x > 1, then x2 6= x
Non-examples:
/
/
department of ma
A Tennis Tournament
Consider the following:
Logic and Set Theory
Introduction and Motivation
Bas Luttik
[email protected]
MetaForum 6.072
+31 40 247 5142
September 2, 2015
/
I
a tennis club with 1025 registered players
I
organises a tournament to determin
Solutions to selected exercises of Chapters 17 and 18
Bas Luttik
October 10, 2013
This document contains solutions to the following exercises in the book [1]:
17.7, 17.9(c), 17.10, 18.3(c), 18.4(c), 18.7, 18.8(b).
We strongly advise you to first try all t
Solutions to selected exercises of Chapters 1215
Bas Luttik
September 17, 2015
This document contains solutions to the following exercises in the book [1]:
12.4(d), 13.1(b), 13.2(b), 14.2(a), 14.6, 14.8(b,c), 14.9(b), 14.10(b), 15.5,
15.8, 15.9.
We strong
Solutions to selected exercises of Chapter 16
Bas Luttik
October 6, 2015
This document contains solutions to the following exercises in the book [1]:
16.4(d), 16.7(c,d), 16.8, 16.12(c,d).
We strongly advise you to first try all these exercises by yourself
Limitations of propositional logic
2/34
Propositional logic only describes how to reason about
complete statements about things; it does not describe how
to reason about things themselves.
Predicate Logic
Consider an instance of Aristotles syllogism:
Lect
PEER ASSESSMENT FORM
For each aspect, rate your groups member a scale from A to D using the
following guide:
A: did this very well
adequately
D: did this poor
GROUP NUMBER:
MODULE:
YEAR:
Aspects
Std name
B: did this adequately
C: did this less than
PEER A
NETW 2 - IP Addressing
Score:
1.Home many nodes can we specify in a network 192.168.1.0/24?
2.What is the IP address of the first host that we can specify for the network
143.256.34.128/25 ?
A
143.256.34.0
B
143.256.34.1
C
143.256.34.255
D
143.256.34.129
LIMBAJUL PHP
Ce este PHP?
PHP este un limbaj de script care funcioneaz alturi de un server Web.
PHP este un limbaj destinat scrierii scripturilor care vor fi interpretate de server-ul Web.
Limbajul face parte din categoria open source , gratuite si este r
NETW 3 - Routing
Score:
1.Look at the routing table on the picture. When a host is using this routing table,
which route is it going to take when it wants to route to the destination 131.175.17.9
?
A
1
B
2
C
3
D
4
E
5
2.Look at the routing table on the pi