If there was time for only one topic I would suggest big O notation and deriving bigO values for basic data operations. For example, what's the complexity of inserting in the middle of an array, into a hash, into a linked list. (bigO = complexity of program, time+memory), see http://bigocheatsheet.com . If there was time for a second topic, then Graphs/Trees and searching on them. Third topic? AI
For an adrenaline-filled learning curve, enter coding competitions. For example, codingame (saw it mentioned on cb and liked it) has challenges to practice (and not necessarily compete) that come with tags like "binary search", "reverse eng", "brute force", so you can research and practice at the same time. And does Perl too.
My very personal opinion: CS degrees are overrated. CS is not a science. It's probably the only field where self-taught people exceed in talent most CS graduates. The CS degree I knew offered very little in terms of applied mathematics, geometry, algebra, physics (e.g. for raytracing, simulations, AI). Only Computer Engineering offered some of these. And then one got the Business computing students which had no clue apart from being early adapters of the bulsh*t lingo. Future managers on petascale salaries. Steve Jobs clones without vision, passion or aesthetics. Soon, none of us Wozniak folks will fit anywhere within current IT. Any text on how to fit in? (apart from shooting myself)
In reply to Re: OT: Computer Science for (a couple steps up from) Dummies
by bliako
in thread OT: Computer Science for (a couple steps up from) Dummies
by Your Mother
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |