1. Which string searching algorithm is faster?

• Morris-Pratt correct answer (ref)
• Brute force
• Rabin-Karp

2. Can you use radix sort for sorting floats?

• Yes
• No correct answer (ref)

3. Quicksort needs additional memory space?

• Yes
• No
• Only in iterative implementation correct answer (ref)
• Only in recursive implementation

4. In the worst case scenario which is slower?

• Quicksort
• Bubble sort
• They are equally slow correct answer (ref)

5. Is merge sort faster than quicksort in general?

• Yes, its complexity is O(n.log(n)) always!
• No, in practice quicksort is often faster than merge sort correct answer (ref)

The answers will be published a week after the quiz has started!

1. What will be the output of the following code?

echo date('Y-m-d', strtotime('-1 month ago'));

• Error
• One month ago from the current date and time
• One month in the future from the current date and time correct answer (ref)

2. Is it possible to extend an interface with an abstract class?

• Yes correct answer (ref)
• No

3. What is the output of the following code?

$arr = array(1 => 10, "1" => 20); 
echo count($arr);

• Error
• 0
• 1 correct answer (ref)
• 2

4. What is the output of the following code?

$str = "hello world"; echo $str{1};

• An error
• h
• e correct answer (ref)
• ello world

5. What is the output of the following code?

$str = "foo Bar"; 
echo ucwords($str);

• Foo bar
• Foo Bar correct answer (ref)
• FOO BAR
• foo bar

The answers will be published a week after the quiz has started!

1. Which loop is faster in JavaScript?

• for
• while correct answer

var str = 'my-'; alert(str.split('-')[1]);

• Error
• An empty string correct answer
• “-“
• “my”

3. What is server-side JavaScript?

• JS scripts files placed on the server that can be publicly accessed by the client
• JS engine running on the server accessible via http correct answer

4. Is it possible to have private and public methods in a JavaScript object

• Yes correct answer
• No

Note that the quiz will remain open, but no results will be published!

• Jump search
• Binary search correct answer
• Interpolation search

• O(log(n*n))
• O(log(n)) correct answer
• O(n*log(n))

3. Which search algorithm is faster?

• Binary search correct answer
• Fibonacci search

4. Which is better for natural language encoding?

• Run-length encoding
• Diagram encoding
• Pattern substitution correct answer

5. What is the complexity of searching into a hash table?

• Quadratic
• Logaritmic
• Linear

Note! – here (my fault) there’s no correct answer. The correct answer is that searching into a hash table has constant complexity – O(1). However I’ll assume that all of you that answered with “Linear” are right!

The answers will be published a week after the quiz has started!