Skip to content

Latest commit

 

History

History
145 lines (139 loc) · 6.54 KB

topics.md

File metadata and controls

145 lines (139 loc) · 6.54 KB

Possible topics

Please add your topics at the end of the table, and assign a new number so that the topics keep their numbering.

This is a first provisional list without any ranking.

  • * means: draft was written
  • ! means: draft was moved to the production repo (an old version may still be in this repo)

Topics

nr added topic
000* cft Kleene star
001* ml Halting problem
002! mv Camel Case
003* mv Divide and Conquer
004 mv Leetspeak
005* mv How to count
006 mv Tabs vs Spaces
007* mv What is null?
008 mv How to format plain text
009 mv Coding is Creative
010! mv Hash functions
011 mv Search for the exception
012 mv Make things generic (overlap with topic #83)
013! mv Exclusive OR
014 mv Set vs Bag
015 mv Stack vs Heap
016 mv Difference between a process and a thread
017 mv Context Switching is Costly
018 mv Loss of significance
019* mv The Turing Machine
020 mv Quick Sort
021 mv Merge Sort
022 mv Deterministic and Non-deterministic Algorithms
023! mv The more FLOPS the better
024 mv Atomic Operation
025! mv Why we all hate Bugs!
026 mv Debugging
027 mv Why Indexes speed-up things
028 mv Machine Language vs. Programming Language (And Compiling)
029* mv Recursion
030* mv Big O Notation
031* mv Greedy Algorithm
032* mv Deadlock
033! mv Brute force
034 mv Separation of concerns
035 mv Syntactic sugar
036 mv Moore's Law
037 mv Scalability
038* mv Turing Test
039* mv Binary & Hexadecimal
040 mv Functional Programming vs Imperative programming
041 mv Endian
042 mv Escape sequence
043 mv Polymorphism
044 mv Lambda calculus
045 mv Middleware
046* mv Overflow
047* mv Game of Life
048 mv Play in a Sandbox
049 mv Fuzzy Logic
050* mv Hello world
051 mv Gaussian pyramid
052! mv Diff
053 mv Zombie Process
054 mv Unit test
055* mv Turing completeness
056 mv Random Seed
057 mv Tuple
058* mv Mutex
059 mv Backbone
060! mv Handshaking
061 mv Multiplexer
062 mv Shell
063* mv Reverse engineering
064 mv Parity bit
065* mv Information hiding
066 cft Mythical Man Month
067 mv Hungarian notation
068 mv Agile Manifesto
069 mv Kernel panic
070 mv Interrupt
071 mv Metadata
072 mv A matter of style: Coding conventions
073 mv Regular expressions
074 mv How to specify dates: Unix Time Stamp
075 mv Trojan Horse
076* mv Always use a Version Control System (VCS)
077 mv Cloud
078 mv Choose the proper level of abstraction
079* mv Fork
080 mv Writing good documentation
081 mv Pair programming
082 mv Script kiddie
083! mv Being lazy is a good thing
084 mv The Noble prize of Computer Science: The Turing Award
085 mv A Accumulator is not always a rechargeable battery and ALU is not always a metal
086* slp Year 2038 Problem
087 fat Kernel Trick
088 fat There is no such thing as a free lunch (Free Lunch Theorem)
089 fat Keep it simple, stupid (KISS)
090 fat Bias-Variance Tradeoff
091* fat Bayes Theorem: Updating Prior Beliefs With Data
092 fat Premature Optimization is the Root of all Evil
093* slp Rice's Theorem - Or Why There Is No Perfect Anti-Virus
094 fat The Curse of Dimensionality
095 cft GOTO considered harmful
096 cft little endian vs big endian
097 cft Metcalfe's law
098 fat Complexity of Algorithms: Should we care about the best, worst or average case?
099 fat Embarrassingly Parallel Problems
100 fat Errors propagate, or why you should sometimes care about that tiny inaccuracy.
101 fat Waterfalls are dangerous. (Software Development)
102 mv Sheffer stroke
103 slp How big is Big Data?
104* omn Monte carlo methods
105* omn Livelock
106 omn What's an Operating System?
107 nb P vs. NP (Complexity Classes)
108* mz Recursion vs Iteration
109* rd World of triangles
110* slp Speculative Execution - Guess Fast Or Wait!
111* sd Binary counting
112! cft Machines within Machines (compiler)
113* ml Lisp
114* slp Why Uptime Matters
115* rd When use if
116* rd esoteric programming languages
117* rd Why it is good to always use the same example
118* mv State machine
119* ts Supervised Learning
120* omn Random variables
121! cft Quine
122* rd ASCII
123* omn Dynamic programming
124* mz Counting systems
125* sd Euler path

Quotes

nr Author (year) Quote
Q000 Vladimir Vapnik (1998) "When solving a problem of interest, do not solve a more general problem as an intermediate step. Try to get the answer that you really need but not a more general one."
Q001 John Naisbitt "We are drowning in information and starving for knowledge."