CS 206 Concepts of Operations

1. Convert regular notation -rw-r-x-wx to its octal notation. (5pts) Convert octal notation 641 to its regular notation. (5pts) Convert regular notation-rws-wS-t to its octal notation. (5pts) Convert octal notation 5742 to its regular notation. (5pts) 2. Given a key's array of inputs (19.15, 6, 9, 13, 7, 20, 0, 18, 4) and hash(x)=x(x-1), insert the keys to the hash table when the length of the hashcode array is 5 (10pts) 3. Given a function of a program: void function (int a) { int b=a+1; } Where a (5pts) and b (5pts) will be stored in the memory when the function is called. 4. From where can the state of a process become running?(5pts) Which state a running process is not able to turn to? (5pts) 5. Given the following processes information: Process Arrive Time Execution Time Priority 1 7 0 p1 2 2 n2 DELL =8 F9 F10 F11 F12 PrtScr De Insert & ( * 00 ) 0 Bad 0) } Where a (5pts) and b (5pts) will be stored in the memory when the function is called. 4. From where can the state of a process become running?(5pts) Which state a running process is not able to turn to? (5pts) Priority Execution Time 5. Given the following processes information: Process Arrive Time 1 7 0 p1 2 2 3 p2 3 5 5 p3 2 p4 6 5 What's the running table when Shortest Remaining Time Next is deployed?(10pts) What's the running table when Highest Response Ratio Next is deployed?(10pts) What's the running table when preemptive Priority is deployed? (10pts) What's the running table when Round Robin is deployed (quantum=2)?(10pts) What's the running table when Multiple Queues is deployed(quantum=2)?(10pts)