100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached 4.2 TrustPilot
logo-home
Summary

Summary and Flashcards - Foundations of Computer Science

Rating
-
Sold
-
Pages
87
Uploaded on
25-06-2024
Written in
2023/2024

In-depth coverage going over mathematics for computer scientists. Probability, permutations, bionomial and pascals triangle. Axioms, logic and proofs, regular languages and finite automata, sets and venn diagrams and their relationships. In depth coverage of number theory. Strings, concatenation and formal languages. Regular expressions, DFAs, NFAs, Kleene's Theorem, atomic and compound syntax rules. Automata construction in detail, truth tables and boolean algebra, basic natural language processing, predicate and universal logic, existential and negated quantifiers, universal discourse. Graphs in detail, paths and circuits. Euler and Hamilitonian paths, trees, transversals.

Show more Read less











Whoops! We can’t load your doc right now. Try again or contact support.

Document information

Uploaded on
June 25, 2024
Number of pages
87
Written in
2023/2024
Type
Summary

Content preview

Foundations of Computing (COM1026)


https://www.cl.cam.ac.uk/teaching/1213/RLFA/reglfa-notes.pdf
(Regular Languages
and Finite Automata)
https://www.cl.cam.ac.uk/teaching/2122/DiscMath/materials.html]
(Discrete Mathematics)
https://www.cl.cam.ac.uk/teaching/2122/LogicProof/logic-notes.pdf
(Logic and Proof)
https://github.com/EasyCrypt/easycrypt
(EasyCrypt)
http://mfleck.cs.illinois.edu/building-blocks/version-1.0/proofs.pdf
(Direct Proofs)
https://courses.engr.illinois.edu/cs173/fa2009/lectures/lect_07.pdf
(Proofs by contrapositive and by contradiction)
http://mfleck.cs.illinois.edu/building-blocks/version-1.3/contradiction.pdf
http://www.oxfordmathcenter.com/drupal7/node/317
http://www.personal.kent.edu/~rmuhamma/Philosophy/Logic/ProofTheory/proo
f_by_contradictionExamples.htm
(Proofs by contradiction)
http://mfleck.cs.illinois.edu/building-blocks/version-1.3/induction.pdf
http://www.oxfordmathcenter.com/drupal7/node/114
http://www.oxfordmathcenter.com/drupal7/node/117
(Proofs by induction)

,1) What is a set? “A set is a collection of objects called
elements”

2) How do we describe a set in • An enumeration of elements
mathematics? A={1,2,3,4,5,6}
• Give a verbal description:
A is the set of all integers from 1 to 6,
inclusive
• Give a mathematical inclusion rule:
A={ Integers x | 1 ≤ x ≤ 6}

3) What is the Abstraction Axiom? Given a property P, there exists the set S of
objects that satisfy this property P.

(whatever property P, there exists a set S
containing the objects that satisfy P and only
these objects).

4) What is the empty set? The empty set is a set with no elements.

,5) What are the basic operations on sets? Membership:
– `x is in A’ 𝒙 ∈ 𝑨
– `x is not in A’ 𝒙 ∉ 𝑨
– `A is a subset of B, but A can be equal to
B’ 𝑨 ⊆ 𝑩
– `A is a proper subset of B, i.e., A cannot be equal
to B’ 𝑨 ⊂ 𝑩
or, specifically, 𝑨 ⊊ 𝑩

Operations:
– Union: putting sets together. 𝑨 ∪ 𝑩
– Intersection: what’s in both. 𝑨 ∩ 𝑩
– Set difference: what’s in the first but not in the
2nd. 𝑨 ∖ 𝑩

6) What are some examples of basic A = {alice, ben, cora}
operations on sets? B = {ben, dan, fran}
Membership:




Operations:
– Union:
– Intersection:
– Set difference:

, 7) How do we use Venn Diagrams in Set
Theory?




8) What are the basic operations of Venn
Diagrams?




9) What are subsets? Set A is a subset of set B if every element of A
is an element of B.
" A is a subset of B" is
denoted A ⊆ B
£4.49
Get access to the full document:

100% satisfaction guarantee
Immediately available after payment
Both online and in PDF
No strings attached

Get to know the seller
Seller avatar
williamdaniel

Also available in package deal

Thumbnail
Package deal
1st Year Computer Science Notes
-
8 2024
£ 35.92 More info

Get to know the seller

Seller avatar
williamdaniel University of Surrey
View profile
Follow You need to be logged in order to follow users or courses
Sold
0
Member since
1 year
Number of followers
0
Documents
8
Last sold
-

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Recently viewed by you

Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their exams and reviewed by others who've used these revision notes.

Didn't get what you expected? Choose another document

No problem! You can straightaway pick a different document that better suits what you're after.

Pay as you like, start learning straight away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and smashed it. It really can be that simple.”

Alisha Student

Frequently asked questions