Algorithms

20 Minutes

10 Questions

This test will assess a student's knowledge of technology, algorithms, and the basics of computer science. It will include questions on topics such as programming languages, data structures, software engineering principles, and basic problem-solving techniques. The test will also cover topics related to algorithms such as sorting, searching, and graph traversal. Finally, the test will evaluate a student's understanding of fundamental concepts in computer science such as memory management and operating systems.

Example Question:

Multiple-Choice

Fill in the missing line to make the binary search function below work properly.
FUNCTION binarySearch(search:Array ,  find:Integer) 
 start:Integer
 end:Integer
 foo:Integer
 start = 0
 end = search length - 1
 DO WHILE start <= end 
 
//missing line goes here

    IF search[foo] == find 
      return foo
    ELSE IF search[foo] < find
       start = foo + 1
    ELSE
       end = foo - 1                         
 END DO
END FUNCTION

Answers

1. foo = start * 2;

2. foo = (start + end) / 2;

3. foo = (end - foo) / 2;

4. foo = (end + foo) / 2;