Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of...
-
Upload
leo-mckinney -
Category
Documents
-
view
215 -
download
2
Transcript of Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of...
![Page 1: Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of Computer Science SUNY Geneseo.](https://reader036.fdocuments.us/reader036/viewer/2022082819/56649f325503460f94c4eb9f/html5/thumbnails/1.jpg)
Discrete Structuresand
The Three-Fold Introduction to Computer Science
Doug BaldwinDepartment of Computer Science
SUNY Geneseo
![Page 2: Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of Computer Science SUNY Geneseo.](https://reader036.fdocuments.us/reader036/viewer/2022082819/56649f325503460f94c4eb9f/html5/thumbnails/2.jpg)
Motivation
Computer science entails…• Design and implementation of algorithms,
programs, systems, etc• Mathematical analysis of algorithms, programs,
etc• Experimental analysis of algorithms, programs, etc
These should be taught concurrently and from day 1
![Page 3: Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of Computer Science SUNY Geneseo.](https://reader036.fdocuments.us/reader036/viewer/2022082819/56649f325503460f94c4eb9f/html5/thumbnails/3.jpg)
Ca 1992…
CS1(Pascal, selection, logic,
recursion, induction, recurrences, big-O, lists,
trees)
CS2(Object Pascal, iteration,
arrays, sorting, summations, …)
![Page 4: Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of Computer Science SUNY Geneseo.](https://reader036.fdocuments.us/reader036/viewer/2022082819/56649f325503460f94c4eb9f/html5/thumbnails/4.jpg)
Ca 1992…
CS1(Pascal, selection, logic,
recursion, induction, recurrences, big-O, lists,
trees)
CS2(Object Pascal, iteration,
arrays, sorting, summations, …) ? !
![Page 5: Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of Computer Science SUNY Geneseo.](https://reader036.fdocuments.us/reader036/viewer/2022082819/56649f325503460f94c4eb9f/html5/thumbnails/5.jpg)
Ca 1994…
CS1(Pascal, recursion,
induction, …)
CS2(Object Pascal, iteration,
summations, …)
CS0(CS overview,
computational thinking)
![Page 6: Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of Computer Science SUNY Geneseo.](https://reader036.fdocuments.us/reader036/viewer/2022082819/56649f325503460f94c4eb9f/html5/thumbnails/6.jpg)
Ca 1994…
CS1(Pascal, recursion,
induction, …)
CS2(Object Pascal, iteration,
summations, …)
CS0(CS overview,
computational thinking)
? !
![Page 7: Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of Computer Science SUNY Geneseo.](https://reader036.fdocuments.us/reader036/viewer/2022082819/56649f325503460f94c4eb9f/html5/thumbnails/7.jpg)
ca 1999
CS 1-1/2(logic, recursion,
induction, recurrences, big-O, lists, trees)
CS2(OOP, summations,
sorting, searching, E[…], hashing)
CS 1(Java)
Algorithms(graphs, greedy, dynamic
programming, …)
![Page 8: Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of Computer Science SUNY Geneseo.](https://reader036.fdocuments.us/reader036/viewer/2022082819/56649f325503460f94c4eb9f/html5/thumbnails/8.jpg)
ca 1999
?
CS 1-1/2(logic, recursion,
induction, recurrences, big-O, lists, trees)
CS2(OOP, summations,
sorting, searching, E[…], hashing)
CS 1(Java)
Algorithms(graphs, greedy, dynamic
programming, …)
![Page 9: Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of Computer Science SUNY Geneseo.](https://reader036.fdocuments.us/reader036/viewer/2022082819/56649f325503460f94c4eb9f/html5/thumbnails/9.jpg)
Ca 2003 - Present
CS 2(OOP, recursion, lists,
trees, Big O)
CS 2-1/2(logic, induction,
recurrences, summations, sorting, searching)
CS 1(Java)
Algorithms(probability, E[…], hashing,
graphs, greedy, …)
![Page 10: Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of Computer Science SUNY Geneseo.](https://reader036.fdocuments.us/reader036/viewer/2022082819/56649f325503460f94c4eb9f/html5/thumbnails/10.jpg)
Ca 2003 - Present
CS 2(OOP, recursion, lists,
trees, Big O)
CS 2-1/2(logic, induction,
recurrences, summations, sorting, searching)
CS 1(Java)
Algorithms(probability, E[…], hashing,
graphs, greedy, …)
If n = 0 …Assume T(k)T(k+1)…
![Page 11: Discrete Structures and The Three-Fold Introduction to Computer Science Doug Baldwin Department of Computer Science SUNY Geneseo.](https://reader036.fdocuments.us/reader036/viewer/2022082819/56649f325503460f94c4eb9f/html5/thumbnails/11.jpg)
Summary
• Workable model for integrating discrete structures into introductory/intermediate CS– Works for students– Works for department (10 year record)
• Covers most of CC 2001 (and CS 2013) core DS material (exceptions: counting, sets/functions/relations)