Thursday, September 16, 2010

Simple Interview Questions (part 1)

Here are the results of several failed interviews (ie. material to review).


Write C code to count the number of bits in an integer:

http://mecrospace.blogspot.com/2008/11/how-to-count-how-many-bits-set-in-dword.html


Write C code to reverse a character string without using strrev() function:


http://www.geekinterview.com/question_details/21969


Write some java code to implement the readers/writers problem:

http://devcentral.iticentral.com/articles/Java/thread_sync/code.html#crul
(Full article)


Write some C++/Java code for the qsort algorithm:

http://www.algolist.net/Algorithms/Sorting/Quicksort


Understanding the C++ friend methods:

http://www.cprogramming.com/tutorial/friends.html
http://www.parashift.com/c++-faq-lite/friends.html


Understanding the Introspection/Reflection in Java:

http://java.sys-con.com/node/35980
http://www.cs.grinnell.edu/~rebelsky/Courses/CS223/2004F/Handouts/introspection.html
http://java.sun.com/developer/technicalArticles/ALT/Reflection/
http://tutorials.jenkov.com/java-reflection/index.html


Understanding the SecureClassLoader Java infrastructure:

http://docstore.mik.ua/orelly/java-ent/security/ch03_04.htm
http://www.securingjava.com/chapter-two/chapter-two-7.html


Understanding the two phase commit process:

http://publib.boulder.ibm.com/infocenter/iadthelp/v6r0/index.jsp?topic=/com.ibm.etools.j2c.ims.doc/concepts/cims2pc.html

1 comment:

tachjava said...

Your article helped me my interview. All the links mentioned in your blog were very useful. Thanks for sharing.

Cheers,
http://www.flowerbrackets.com/how-to-implement-quick-sort-in-java-program/