1.1.1. Beginning Level


Students who pass CS46B should be able to perform the following tasks:

Task 1

Implement a search algorithm for a given abstract data type. For example, write a search algorithm for a binary search tree or for a hash table. (An exam question)

Task 2

Implement a data structure such as a linked list, stack, queue, or binary search tree. Use the data structure in the context of a simple application. (A programming assignment)

Task 3

Write in Java a recursive solution to a simple programming problem. (An exam question)

The report indicates that 61%, 83%, and 39% of passing students were able to execute the task questions for tasks 1, 2, and 3, respectively.