foundations of computer science focs
TRANSCRIPT
FoCS
Foundations of Computer Science
Rechenmaschine (1623) von Wilhelm Schickard
(1592-1635), gebaut für seinen Freund Johannes
Kepler
Eerste college: -introductie -verzamelingen I
docent: Jeannette de Graaf assistentie: Hendrik Jan Hoogeboom collegetijd voorlopig: di. 14.15-16.00 uur collegezaal: Gorlaeus, wisselend [email protected] liacs.leidenuniv.nl/~graafjmde/FoCS studentassistenten
slides + opgaven + discussie + video’s
FoCS
Brightspace website
colleges
per zaal maximaal 75 studenten
verdeling in groepen, roulerend fysiek college
komende drie weken:
- groep 1: achternaam A t/ G nu, C1
- groep 2: achternaam H t/m O 14 september, C2
- groep 3: achternaam P t/m Z 21 september, C2
- anderen: thuis live stream / video (zie BS)
daarna ...
toets en tentamen
Toets: 26 oktober 2021 test voor jezelf! 2 uur, tien opgaven 10% bonus (indien toetscijfer≥5,0) Tentamen: 13 januari 2022 6 studiepunten (EC); 3 uur, twintig opgaven Om je eventuele bonus te laten meetellen moet je ≥5,0 voor je tentamen hebben behaald. Herkansing 1 april 2022 Oude tentamens/toetsen liacs.leidenuniv.nl/~graafjmde/FoCS
Brightspace vs website
- De collegeslides en de opgaven met uitwerkingen staan op de vakwebsite; dit geldt ook voor oude tentamens: liacs.leidenuniv.nl/~graafjmde/FoCS - Link naar livestream en video’s van colleges op Brightspace. Kijk aldaar bij Algemene Informatie - De website van vorig jaar (docent H.J. Hoogeboom) is ook nog beschikbaar. Daar vind je kortere filmpjes per onderwerp. Die filmpjes en bijbehorende sheets zijn ook dit jaar nog bruikbaar. De stof zal dit studiejaar min of meer hetzelfde zijn als in 2020/21. Zie liacs.leidenuniv.nl/~hoogeboomhj/focs
Schaum's Outline of Discrete Mathematics (Third edition) by Lipschutz & Lipson ISBN 978-0-07161586-0 McGraw-Hill
literatuur
discrete wiskunde
...the study of mathematical structures that are fundamentally
discrete rather than continuous. In contrast to real numbers that
have the property of varying "smoothly", the objects studied in
discrete mathematics – such as integers, graphs, and statements in
logic– do not vary smoothly in this way, but have distinct,
separated values.
From Wikipedia, the free encyclopedia 4/9/2021
Concepts and notations from discrete mathematics are useful in
studying and describing objects and problems in branches of
computer science, such as computer algorithms, programming
languages, cryptography, automated theorem proving and software
development.
discrete wiskunde
...the study of mathematical structures that are fundamentally
discrete rather than continuous. In contrast to real numbers that
have the property of varying "smoothly", the objects studied in
discrete mathematics – such as integers, graphs, and statements in
logic– do not vary smoothly in this way, but have distinct,
separated values.
From Wikipedia, the free encyclopedia 4/9/2021
Concepts and notations from discrete mathematics are useful in
studying and describing objects and problems in branches of
computer science, such as computer algorithms, programming
languages, cryptography, automated theorem proving and software
development.
inhoudsopgave
verzamelingen ch. 1 Set Theory relaties ch. 2 Relations functies ch. 3 Functions recursie & inductie combinatoriek ch. 5 Counting grafen ch. 8 Graph Theory 9 Directed Graphs bomen ch.10 Binary Trees 8.8 Tree Graphs 9.4 Rooted Trees equivalenties ch.2.8 Equivalence Relations 3.4 Modular Arithmetic 3.7 Cardinality talen & ch.12 Languages, Automata automaten
Farmer Goes to Market maze. By Robert Abbott. http://www.mathpuzzle.com/MAA : multi-state mazes
grafen
13
algoritmiek
Key Constraints
• Consider Works_In: An employee can work in many departments; a dept can have many employees.
• In contrast, each dept has at most one manager, according to the key constraint on Manages.
Many-to-Many 1-to-1 1-to Many Many-to-1
dname
budget did
since
lot
name
ssn
Manages Employees Departments
Database Management Systems 3ed, R.Ramakrishnan and J. Gehrke
relaties
databases