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
130
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
320
Computer Science: The Good Parts (2016)
jeffcohen
3
210
Computer Science: The Good Parts
jeffcohen
1
200
Secrets Revealed: Web Development is for Everyone
jeffcohen
0
440
Coding for MBA's
jeffcohen
0
79
Other Decks in Programming
See All in Programming
Enterprise Web App. Development (1): Build Tool Training Ver. 5
knakagawa
1
120
PHPバージョンアップから始めるOSSコントリビュート / how2oss-contribute
dmnlk
1
1.1k
個人開発の学生アプリが企業譲渡されるまで
akidon0000
0
1.1k
ウォンテッドリーの「ココロオドル」モバイル開発 / Wantedly's "kokoro odoru" mobile development
kubode
1
220
Orleans + Sekiban + SignalR でリアルタイムWeb作ってみた
tomohisa
0
180
[NG India] Event-Based State Management with NgRx SignalStore
markostanimirovic
1
180
Dissecting and Reconstructing Ruby Syntactic Structures
ydah
2
1.4k
プロダクト横断分析に役立つ、事前集計しないサマリーテーブル設計
hanon52_
2
490
KawaiiLT 登壇資料 キャリアとモチベーション
hiiragi
0
160
GitHub Copilot for Azureを使い倒したい
ymd65536
1
260
RuboCop: Modularity and AST Insights
koic
2
2.1k
Bedrock × Confluenceで簡単(?)社内RAG
iharuoru
1
100
Featured
See All Featured
"I'm Feeling Lucky" - Building Great Search Experiences for Today's Users (#IAC19)
danielanewman
227
22k
The Art of Delivering Value - GDevCon NA Keynote
reverentgeek
14
1.4k
Put a Button on it: Removing Barriers to Going Fast.
kastner
60
3.8k
Learning to Love Humans: Emotional Interface Design
aarron
273
40k
Building a Scalable Design System with Sketch
lauravandoore
462
33k
Intergalactic Javascript Robots from Outer Space
tanoku
270
27k
Adopting Sorbet at Scale
ufuk
76
9.3k
ReactJS: Keep Simple. Everything can be a component!
pedronauck
667
120k
Measuring & Analyzing Core Web Vitals
bluesmoon
7
400
Improving Core Web Vitals using Speculation Rules API
sergeychernyshev
13
810
The Psychology of Web Performance [Beyond Tellerrand 2023]
tammyeverts
47
2.7k
JavaScript: Past, Present, and Future - NDC Porto 2020
reverentgeek
47
5.3k
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