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
Codeaholics Pub Quiz
Search
Matthew Rudy Jacobs
March 13, 2013
Technology
0
1.6k
Codeaholics Pub Quiz
A quiz for programmers
held at Codeaholics in Hong Kong
on Wednesday 13th March 2013
Matthew Rudy Jacobs
March 13, 2013
Tweet
Share
More Decks by Matthew Rudy Jacobs
See All by Matthew Rudy Jacobs
From Developer to Architect (and back again)
matthewrudy
3
230
Humans are Hard
matthewrudy
0
140
[Alpha] Humans Are Hard
matthewrudy
0
100
From Developer To Architect
matthewrudy
0
90
Git Commit Signing: Code we can trust?
matthewrudy
0
190
We Need To Talk About Postgres
matthewrudy
0
96
Coding as a Team At GoGoVan
matthewrudy
3
440
10 Years of Code
matthewrudy
0
110
Elixir - Part 1
matthewrudy
1
200
Other Decks in Technology
See All in Technology
Agentic AIが変革するAWSの開発・運用・セキュリティ ~Frontier Agentsを試してみた~ / Agentic AI transforms AWS development, operations, and security I tried Frontier Agents
yuj1osm
0
200
業務の煩悩を祓うAI活用術108選 / AI 108 Usages
smartbank
9
19k
わが10年の叡智をぶつけたカオスなクラウドインフラが、なくなるということ。
sogaoh
PRO
1
190
20251225_たのしい出張報告&IgniteRecap!
ponponmikankan
0
110
RALGO : AIを組織に組み込む方法 -アルゴリズム中心組織設計- #RSGT2026 / RALGO: How to Integrate AI into an Organization – Algorithm-Centric Organizational Design
kyonmm
PRO
3
570
研究開発部メンバーの働き⽅ / Sansan R&D Profile
sansan33
PRO
4
21k
あの夜、私たちは「人間」に戻った。 ── 災害ユートピア、贈与、そしてアジャイルの再構築 / 20260108 Hiromitsu Akiba
shift_evolve
PRO
0
370
Keynoteから見るAWSの頭の中
nrinetcom
PRO
1
160
1万人を変え日本を変える!!多層構造型ふりかえりの大規模組織変革 / 20260108 Kazuki Mori
shift_evolve
PRO
5
660
ESXi のAIOps だ!2025冬
unnowataru
0
470
人工知能のための哲学塾 ニューロフィロソフィ篇 第零夜 「ニューロフィロソフィとは何か?」
miyayou
0
330
_第4回__AIxIoTビジネス共創ラボ紹介資料_20251203.pdf
iotcomjpadmin
0
170
Featured
See All Featured
How GitHub (no longer) Works
holman
316
140k
Unsuck your backbone
ammeep
671
58k
AI Search: Where Are We & What Can We Do About It?
aleyda
0
6.8k
Measuring & Analyzing Core Web Vitals
bluesmoon
9
720
The Limits of Empathy - UXLibs8
cassininazir
1
200
Why You Should Never Use an ORM
jnunemaker
PRO
61
9.7k
The Power of CSS Pseudo Elements
geoffreycrofte
80
6.1k
Rails Girls Zürich Keynote
gr2m
95
14k
How STYLIGHT went responsive
nonsquared
100
6k
How to Ace a Technical Interview
jacobian
281
24k
Self-Hosted WebAssembly Runtime for Runtime-Neutral Checkpoint/Restore in Edge–Cloud Continuum
chikuwait
0
270
コードの90%をAIが書く世界で何が待っているのか / What awaits us in a world where 90% of the code is written by AI
rkaga
58
41k
Transcript
Codeaholics Pub Quiz Presented by Matthew Rudy @Codeaholics HK
The Rules
No Cheating No Computers No Phones
Teams of 4(ish) One Answer Sheet per team Choose a
funny team name
Marking We’ll mark the first 3 rounds Then take a
break, and finish it.
Have fun! That’s the most important thing.
Round 1: Codeaholics
10 questions: 1+1 points each
Extra point: Name a speaker at this meeting #1 When
was the first Codeaholics meetup? a) August 2010 b) December 2010 c) February 2011
Extra point: What is their github handle? #2 Who created
the name “Codeaholics”? a) Eddie Lau b) Matthew Rudy c) Steve Holmes
Extra point: What was their original name? #3 Who sponsors
Codeaholics? a) Enterproid b) Softlayer c) Thought Sauce
Extra point: Which group did Codeaholics come from? #4 Which
group did Steve previously organise? a) Agile Hong Kong b) Hong Kong Java User Group c) Hong Kong Linux User Group
Extra point: when did he talk about it at Codeaholics?
#5 What is the name of Jonas Karlsson’s language? a) Bamboo b) Beanstalk c) Panda
Extra point: how many github stars does it have? #6
What is the name of Jimmy’s Backbone Data Grid library? a) BackboneData b) BackGrid c) DataBack
Extra point: how many teams presented? #7 How many teams
took part in Code Camp #01? a) 7 b) 8 c) 9
Extra point: how many parts was it? #8 Who gave
“an Introduction to Haskell” in 2011? a) Leonard Siu b) William Taysom c) YKY
Extra point: which HK githubber joined first? #9 How many
Githubbers are there in Hong Kong? a) 624 b) 724 c) 824
Extra point: Where was it held? #10 In which year
was the first Hong Kong Bar Camp? a) 2006 b) 2007 c) 2008
Round 1: * / 20
Round 2: Initialisms
10 questions: 2 points each
#11 ACID What do the letters stand for:
#12 BASIC What do the letters stand for:
#13 CRUD What do the letters stand for:
#14 FIFO What do the letters stand for:
#15 MINASWAN What do the letters stand for:
#16 PCCW prior to 2001 What do the letters stand
for:
#17 REST What do the letters stand for:
#18 SGML What do the letters stand for:
#19 VRML What do the letters stand for:
#20 WYSIWYG What do the letters stand for:
Round 2: * / 20
Round 3: Authors, Designers, Dictators
10 Questions 2 points each
#21 C Name the Designer of:
#22 Coffeescript Name the Designer of:
#23 Django Name a Dictator of:
#24 GNU, GCC, Emacs Name the Creator of:
#25 Javascript Name the Designer of:
#26 Linux Name the Dictator of:
#27 Python Name the Designer of:
#28 Ruby Name the Designer of:
#29 Ruby on Rails Name the Creator of:
#30 Scala Name the Designer of:
Round 3: * / 20
Halfway Time for a break!
Round 4: Name The Language
10 Questions 2 points each
#31 def fibIter(n): if n < 2: return n fibPrev
= 1 fib = 1 for num in xrange(2, n): fibPrev, fib = fib, fib + fibPrev return fib What language is this?
#32 fib(0) -> 0; fib(1) -> 1; fib(N) when N
> 1 -> fib(N-1) + fib(N-2). What language is this?
#33 ++++++++++ >>+<<[->[->+>+<<]>[-<+>]>[-<+>]<<<] What language is this?
#34 iterfibo <- function(n) { if ( n < 2
) n else { f <- c(0, 1) for (i in 2:n) { t <- f[2] f[2] <- sum(f) f[1] <- t } f[2] } } print.table(lapply(0:20, iterfibo)) What language is this?
#35 |fibo| fibo := [ :i | |ac t| ac
:= Array new: 2. ac at: 1 put: 0 ; at: 2 put: 1. ( i < 2 ) ifTrue: [ ac at: (i+1) ] ifFalse: [ 2 to: i do: [ :l | t := (ac at: 2). ac at: 2 put: ( (ac at: 1) + (ac at: 2) ). ac at: 1 put: t ]. ac at: 2. ] ]. What language is this?
#36 (defn fibs [] (map first (iterate (fn [[a b]]
[b (+ a b)]) [0 1]))) (nth (fibs) 5) What language is this?
#37 fib_iter = (n) -> if n < 2 return
n [prev, curr] = 0, 1 for i in [1..n] [prev, curr] = [curr, curr + prev] return curr What language is this?
#38 FUNCTION itFib (n) n1 = 0 n2 = 1
FOR k = 1 TO ABS(n) sum = n1 + n2 n1 = n2 n2 = sum NEXT k IF n < 0 THEN itFib = n1 * ((-1) ^ ((-n) + 1)) ELSE itFib = n1 END IF END FUNCTION What language is this?
#39 a=0 b=1 max=$1 for (( n=1; "$n" <= "$max";
$((n++)) )) do a=$(($a + $b)) echo "F($n): $a" b=$(($a - $b)) done What language is this?
#40 -(long)fibonacci:(int)position { long result = 0; if (position <
2) { result = position; } else { result = [self fibonacci:(position -1)] + [self fibonacci:(position -2)]; } return result; } What language is this?
Round 4: * / 20
Round 5: General Knowledge
10 Questions 2 point each
#41 Where was Tim Berners Lee working when he invented
the World Wide Web?
#42 What does HTTP status code 418 stand for?
#43 Who did Charles Babbage refer to as “The Enchantress
of Numbers”?
#44 What is the name of Jetbrains’ web dev IDE?
#45 What is the development version of Google Chrome called?
#46 What does the prefix NS in Objective-C stand for?
#47 What is special about jQuery 2.0?
#48 Which JVM instruction was added in Java7 to improve
dynamic language support?
#49 Which HTML 5.1 tag should be used for “content
that is directly related to or expands upon the central topic of a document or central functionality of an application”?
#50 Which “K” is the next version of Android rumored
to be called?
Round 5: * / 20
Round 6: Anagrams
Anagram • Take the given letters • Rearrange them to
form new words • eg. “Acne Hijack”
5 Questions 2 points each
#51 “Choice Loads”
#52 “Romantic Yob”
#53 “Clip More”
#54 “Sly, Prim Oomph”
#55 “Due Icon”
Bonus Anagram 10 points
#56 “I’d Wow Conformists”
Round 6: * / 20
Round 7: The Snowball Round
1 Question 9 Answers 2 points each
30 points for all 9 0 points any wrong
#SNOWBALL HTTP 1.1 + RFC5789 Specify 9 HTTP Verbs! Name
as many as you can!
Round 7: * / 30
Total: * / 150
That’s it.
Thanks!
Sources • http://anagramgenius.com • http://github.com • http://rosettacode.org • http://wikipedia.org •
http://w3.org