Post details: Take the data literacy test

2007-11-29

Take the data literacy test

Warning: Parameter 1 to make_clickable_callback() expected to be a reference, value given in /home/vusers/domains/infocider.com/wwwdocs/blogs/inc/_misc/_misc.funcs.php on line 352
Permalink . bjorn . 08:25:59 . 422 Words . Basics . Email . 35536 views . 27 comments

Comments:

Comment from: dOgBOi [Visitor] Email · http://dogboi.info

Great post. Took the test and ended up with 24. I expected to get a lot less, actually. I don't consider myself an expert by any stretch. Intermediate seems a more accurate tag.

Still, it was fun. Thanks.

PermalinkPermalink 2007-11-29 @ 16:47
Comment from: Jorge Diaz Tambley [Visitor] Email

Great post... don't know what Steve McConnell would think, though.

PermalinkPermalink 2007-11-29 @ 17:16
Comment from: iongion [Visitor] Email · http://www.gion.ro

I never read any of the books that he mentions, period, and i had 28. What i've learned in 6 years of programming(for real, 5 years since i finished highschool and 1 year since i finished university).

I usually do not learn from books, i have many of them, my most precious book is C programming of Herbert Schild. Its the only book i had patience to read/experiment(except the C interpreter, i had no time at that period to experiment with it:P).

Otherwise is just basic knowledge that i've learned from my teachers in school. If you go to school, its guaranteed that you know what all of the above are, and much more. University does not help with any sht, u seem to learn about AI, compilers, operating systems, regular expressions, automata theory, but i tell u, they teach u sht, you better start learning on your own boy/girl!

To complete that guy, you should first as:

1) How to sort a vector (of course, not by using a.sort() that i always get at interviewing people)
2) What is divide-et-impera ?
3) What is backtracking.
4) Simple pseudocode to compute the factorial.
5) Quick-sort method.
6) Vector search multiple threads.
7) What is a stack, how do you implement a linked list.
8) Traverse a linked list.
9) Build binary tree, search it.
10) Analyze a polinesian expression.

If you know there, you are at least a beginner programmer, otherwise you are just a coder (there are also good codes, the ones that know the entire MFC/VCL/STL/SWING/.NET-CLASSES/SQL/REMOTING/COMPRESSION/XML.

PermalinkPermalink 2007-11-29 @ 20:34
Comment from: Timo Stamm [Visitor] Email · http://www.kyon.de

27 points. I didn't know character variables or structured variables.

PermalinkPermalink 2007-11-30 @ 02:47
Comment from: f+bomb [Visitor] Email

28

PermalinkPermalink 2007-11-30 @ 04:43
Comment from: Sam [Visitor]

I got 29. I even made a mental note to learn what "elongated stream" "retroactive synapse" and "value chain" were. Haha!

PermalinkPermalink 2007-11-30 @ 16:03
Comment from: pTymN [Visitor] Email

Yay! 3/4 of the ones I missed were fake. I'll go google referiential integrity right now. Sounds like stuff to do with smart pointers...

PermalinkPermalink 2007-11-30 @ 18:28
Comment from: Stranton Stantopps [Visitor] Email

"Put a 1 next to each teen that looks familiar."

What is this, some kind of pedophile sting?

PermalinkPermalink 2007-11-30 @ 18:30
Comment from: Fancey [Visitor] Email · http://edubba.org

It said I was an expert programmer so I declare the test useless.

PermalinkPermalink 2007-11-30 @ 19:14
Comment from: Jt [Visitor] Email

I got 26, but I would hardly consider myself knowledgeable enough to write a book about the subject :P

I know what the terms mean and explain what they are, but not necessarily how they work.

Also, I'm in my graduating year of computer science.

PermalinkPermalink 2007-11-30 @ 19:50
Comment from: Collin Cusce [Visitor] Email · http://onlinekarma.net/flash3d

I found it was easier to scan for ones I didn't know...

I didnt know elongated stream, retroactive synapse, and value chain....

If you have a college education in computer science and you do not know these terms, you should find a new career... you're just not into the field.

PS: You forgot "closure". Pretty important one, if you ask me.

PermalinkPermalink 2007-11-30 @ 20:49
Comment from: bharath [Visitor] Email · http://www.bharathtech.com

Got 28 !
was worried that i was way behind the pros, but, thanks man, nice to know that score more than 29 was fake ...

Great going....

PermalinkPermalink 2007-11-30 @ 21:54
Comment from: anonymouscoward [Visitor] · http://www.ihavenosite.com

"No results found for programatic.
Did you mean programmatic (in dictionary) or Pragmatic (in encyclopedia)?"

( dictionary.com )

PermalinkPermalink 2007-11-30 @ 22:18
Comment from: David [Visitor] Email · http://www.tomisimo.org/blog/

Scored 25.5 honest. :)

PermalinkPermalink 2007-12-01 @ 00:02
Comment from: utnapistim [Visitor] Email · http://utnapistim.blogspot.com

Hey, I made 29 (and I laughed when I read the explanation for 30-32 :)).

It's a nice test :)

PermalinkPermalink 2007-12-01 @ 01:11
Comment from: jim [Visitor] Email

what is value chain , and why is it important

PermalinkPermalink 2007-12-01 @ 03:42
Comment from: Joseph Pecoraro [Visitor] Email · http://bogojoker.com/weblog/

When I finished reading the list there were only three that I really had actually no idea what they were. I knew plenty of them and had at least heard of all but those three. Retroactive synapse sounded kinda made up and at that point the though actually crossed my mind that it might have been made up. It was absolutely great to read the final ranking. Made my night.

Although I realize the list was kept short, here are some possible general programming additional terms (since this list seemed to focus on database terms with B-trees, indexes, and referential integrity.)

- Object oriented terms like polymorphism, superclass/subclasses, generalization and specialization.

- Bitwise stuff like: 2's complement, most/least significant bit, the significance of 65,536, hexadecimal vs octal vs binary, big/little endian systems

- Other Data Structures: Hash Tables, Queues

- Algorithmic terms: a hash function, quicksort, recursive, tail recursion, Big O Complexity, NP Completeness

- General Terms that hopefully aren't buzzwords: Regular Expressions

Basically for a general programmer you should be able to deal with the 5 sections mentioned in Steve Yegge's blog post available here:
http://steve.yegge.googlepages.com/five-essential-phone-screen-questions

I highly recommend that read for anyone who was willing to read my comment!

PermalinkPermalink 2007-12-01 @ 05:44
Comment from: Faisal Feroz [Visitor] Email · http://faisalferoz.wordpress.com

typedef aslso doesnt refer to a data type, its basically a way to give an alias to an existing data type.

Good test, I scored 29 :)

PermalinkPermalink 2007-12-01 @ 08:13
Comment from: Amnon [Visitor]

Ha, nice one.
I got a 27, and when I read the 30-32 description I couldn't help but smile. I really was wondering what that elongated/retroactive chain babble was about.

PermalinkPermalink 2007-12-01 @ 09:09
Comment from: CAgan Senturk [Visitor] Email · http://www.mondus.net/te/cto

I was about to search google for 'elongated stream' ;)
Great post, thanks.

PermalinkPermalink 2007-12-01 @ 12:11
Comment from: sysprv [Visitor] Email

Retroactive synapse really could be a data structure in the future ;)

I got 22. And I'm a sysadmin. It's languages like C++ = STL, perl and python that I thank, for my knowledge of data structures.

PermalinkPermalink 2007-12-01 @ 19:26
Comment from: Enterit [Visitor] Email

I got 26.5. Should I start to write a computer book right know ? :)

PermalinkPermalink 2007-12-05 @ 08:56
Comment from: Squiko [Visitor] Email · http://squiko.com

All this article seems like a very bad excuse for putting a link to your book for some people who know nothing about programming

I noticed the fraud cpature trap the moment I saw it and didn't even bother to sum up my points I just jumped to the highest results section to see if you are as tricky as you seem, but even this did not ease my bad gut feeling that all this article has no practical value to the readers but to the (book) writer only

PermalinkPermalink 2007-12-05 @ 09:22
Comment from: Wouter Lievens [Visitor] Email

I learned all of these in classes at my University, except the three comical ones of course. I had a pretty damn good education :-)

PermalinkPermalink 2007-12-07 @ 12:44
Comment from: Jeff Standen [Visitor] Email · http://www.jeffstanden.com/blog/

29! I also had made a mental note to look up the other 3. :D

Honesty with myself: check!

PermalinkPermalink 2007-12-08 @ 05:00
Comment from: Drake [Visitor] Email · http://blog.organicz.net

So, where is the list of books?

PermalinkPermalink 2007-12-10 @ 05:14
Comment from: bjorn [Member] Email

what list of books? :-) .. this test is from a single book, Code Complete.

PermalinkPermalink 2008-01-02 @ 20:50

This post has 69 feedbacks awaiting moderation...

Leave a comment:

Your email address will not be displayed on this site.
Your URL will be displayed.

Allowed XHTML tags: <p, ul, ol, li, dl, dt, dd, address, blockquote, ins, del, span, bdo, br, em, strong, dfn, code, samp, kdb, var, cite, abbr, acronym, q, sub, sup, tt, i, b, big, small>
(Line breaks become <br />)
(Set cookies for name, email and url)
(Allow users to contact you through a message form (your email will NOT be displayed.))
This is a captcha-picture. It is used to prevent mass-access by robots.

Please enter the characters from the image above. (case insensitive)