Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
Computer Science: The Good Parts
Search
Jeff Cohen
August 04, 2017
Programming
0
140
Computer Science: The Good Parts
Kansas City Developers Conference
Jeff Cohen
August 04, 2017
Tweet
Share
More Decks by Jeff Cohen
See All by Jeff Cohen
Modern Cryptography for Absolute Beginner
jeffcohen
0
170
(RubyConf 2016) Computer Science: The Good Parts
jeffcohen
0
330
Computer Science: The Good Parts (2016)
jeffcohen
3
220
Computer Science: The Good Parts
jeffcohen
1
200
Secrets Revealed: Web Development is for Everyone
jeffcohen
0
450
Coding for MBA's
jeffcohen
0
85
Other Decks in Programming
See All in Programming
地方に住むエンジニアの残酷な現実とキャリア論
ichimichi
5
1.5k
Select API from Kotlin Coroutine
jmatsu
1
210
来たるべき 8.0 に備えて React 19 新機能と React Router 固有機能の取捨選択とすり合わせを考える
oukayuka
2
880
システム成長を止めない!本番無停止テーブル移行の全貌
sakawe_ee
1
160
PicoRuby on Rails
makicamel
2
120
git worktree × Claude Code × MCP ~生成AI時代の並列開発フロー~
hisuzuya
1
520
Team operations that are not burdened by SRE
kazatohiei
1
290
たった 1 枚の PHP ファイルで実装する MCP サーバ / MCP Server with Vanilla PHP
okashoi
1
220
Create a website using Spatial Web
akkeylab
0
310
設計やレビューに悩んでいるPHPerに贈る、クリーンなオブジェクト設計の指針たち
panda_program
6
1.8k
Webの外へ飛び出せ NativePHPが切り拓くPHPの未来
takuyakatsusa
2
460
What Spring Developers Should Know About Jakarta EE
ivargrimstad
0
380
Featured
See All Featured
The Cost Of JavaScript in 2023
addyosmani
51
8.5k
I Don’t Have Time: Getting Over the Fear to Launch Your Podcast
jcasabona
32
2.4k
ReactJS: Keep Simple. Everything can be a component!
pedronauck
667
120k
Writing Fast Ruby
sferik
628
62k
Raft: Consensus for Rubyists
vanstee
140
7k
CoffeeScript is Beautiful & I Never Want to Write Plain JavaScript Again
sstephenson
161
15k
Building Flexible Design Systems
yeseniaperezcruz
328
39k
Chrome DevTools: State of the Union 2024 - Debugging React & Beyond
addyosmani
7
720
Evolution of real-time – Irina Nazarova, EuRuKo, 2024
irinanazarova
8
800
Performance Is Good for Brains [We Love Speed 2024]
tammyeverts
10
940
Art, The Web, and Tiny UX
lynnandtonic
299
21k
JavaScript: Past, Present, and Future - NDC Porto 2020
reverentgeek
48
5.4k
Transcript
Computer Science: The Good Parts csthegoodparts.com @jeffcohen
None
None
1. Encoding All The Things 2. Containers for Things 3.
Doing Things 4. Building Big Things 5. Thinking About Things
Data Structures
Data Structures
Linked List 60 31 5 45 70 head
Queue New elements are appended to the end of the
list 60 31 5 45 70 head
Stack 60 45 70 31 5 head New elements are
inserted at the front of the list
60 31 5 45 80 70 74 99 87 68
Binary Tree root
Graph
None
None
None
Algorithms
Babbage and Lovelace
Apollo 11
Margaret Hamilton Source code of the Apollo Guidance Computer
Complexity
Complexity Some computer programming implementations are more complex than others.
Complexity A "green" test suite is not an indicator of
sustainability nor is it a guarantee of an optimal solution.
Complexity Science relies on standard systems of weights and measures.
For software, we measure resources, which are typically time and space.
O(n) def search(name_to_find, names) for name in names if name
== name_to_find return true end end return false end
def search(name_to_find, names) for name in names if name ==
name_to_find return true end end return false end O(n) 0 100 200 300 O(n)
O(log n) def search(name_to_find, sorted_names) return false if sorted_names.size
== 0 midpoint = sorted_names.length / 2 if name < sorted_names[midpoint].name search(name_to_find, sorted_names[0, midpoint]) elsif name > sorted_names[midpoint].name search(name_to_find, sorted_names[midpoint, -1]) end return true end
def search(name_to_find, sorted_names) return false if sorted_names.size == 0
midpoint = sorted_names.length / 2 if name < sorted_names[midpoint].name search(name_to_find, sorted_names[0, midpoint]) elsif name > sorted_names[midpoint].name search(name_to_find, sorted_names[midpoint, -1]) end return true end O(log n) 0 100 200 300 O(log n) O(n)
Atom.io blog post
O(n2) def all_permuations(items) items.map do |item| items.map { |inner_item| [item,
inner_item] } end end [1,2,3] => [[1,1], [1,2], [1,3], [2, 1], [2, 2], [2, 3], [3, 1], [3, 2], [3, 3]]
def all_permuations(items) items.map do |item| items.map { |inner_item| [item, inner_item]
} end end O(n2) 0 100 200 300 O(n2) O(n) O(log n)
Cryptography
Cryptography
Cryptography
Cryptography
The Future
Traditions We know our history. We value progress over reinvention.
We seek solutions to meaningful problems.
Alan Turing
Alan Turing Computer science is not computer programming
Alan Turing It's a way of thinking
Grace Hopper
Grace Hopper
Grace Hopper Humans are allergic to change. They love to
say, "We've always done it this way." I try to fight that. That's why I have a clock on my wall that runs counter-clockwise.
Grace Hopper A ship in port is safe; but that
is not what ships are built for. Sail out to sea and do new things.
Questions? Thoughts? Find me on twitter @jeffcohen Notes, Links, Resources:
csthegoodparts.com