1.1.2. Intermediate Level

 

Outcome 9 is assessed in two courses at the intermediate level: CS149 and CS151.

1.1.2.1. CS 149

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

Task 1

Select an appropriate CPU scheduling algorithm or mechanism that is suited to a particular Operating System. Justify the answer in detail, possibly using metrics (e.g., average turnaround time, average response time). (Assessed with an exam question.)

Task 2

Describe the main characteristics of a page replacement algorithm. Write the algorithm in detail using pseudocode. (Assessed with an exam question.)

Task 3

Describe a page table of a certain kind that can be used to keep track of where pages are located in memory and to maintain page usage information. Describe how the table is used by means of pseudocode. (Assessed with an exam question.)

The report indicates that on the average 81%, 73%, and 55% of passing students could execute tasks 1, 2, and 3, respectively.

1.2.2.2. CS 151

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

Task 1

Given a UML class diagram including a class, C, that has a UML association endpoint with unbounded multiplicity, implement C in Java. (Assessed with an exam question.)

Task 2

Given a Java class that overrides the equals method, define an appropriate hashCode method that would be suitable for use with a hash table. (Assessed with an exam question.)

The report indicates that on the average 86% and 71% of passing students could execute tasks 1 and 2, respectively.