Suppose that the head of a disk drive is currently at track 9, that the disk has 32 tracks per surface, and the disk-queue contains the following sequence of access requests: Request 1 2 3 4 5 6 7 8 Track 18 22 14 26 10 30 75 For each of the following disk scheduling algorithms, find the total distance (in tracks) that the disk head moves. Please make your answer boldface.

Simon says is a memory game where "simon" outputs a sequence of 10 characters (r, g, b, y) and the user must repeat the sequence. create a for loop that compares the two strings starting from index 0. for each match, add one point to userscore. upon a mismatch, exit the loop using a break statement. assume simonpattern and userpattern are always the same length. ex: the following patterns yield a userscore of 4: simonpattern: rrgbryybgy userpattern: rrgbbrybgy

In vista and windows 7, the appearance and personalization option allows you to change the

Write a fragment of code that reads in strings from standard input, until end-of-file and prints to standard output the largest value. you may assume there is at least one value. (cascading/streaming logic, basic string processing)