Grade Graph (Assignment 1, 2, 3, & 4 + MT1, 2)Assuming similar performance in final exam and A5
0
5
10
15
20
25
30
35
100+ A
93- 100A
90- 93 A-
87- 90 B+
83- 87 B
80- 83 B-
75- 80 C+
70- 75 C
65- 70 C-
0- 65 Misc
Score Ranges
number of students
Actual DistributionExpectation from Survey I
Performance is better than expectation in (A, A-) range
Rule • Five/Four students form a group.
• After the questions show up, the team raises the # card first to get called on and MUST start to answer the question when TA calls on them with in 10 seconds (otherwise lost points)
• Each team gets one AND ONLY ONE answer per question (within reasonable time bound).
Difference from normal Jeopardy! game
• Questions are given, you provide the answer. (not vise versa)
• At most two questions in a row for a group. After that, all groups are allowed to compete for the next question.
• When you hear the bell you start to compete
• Only The Jeopardy Round and Final Jeopardy round– In final jeopardy round, you can bet up to
all you have
Other logistics• Gayn is charge of book keeping on white
board (one score per group)
• Priyesh is charge of identify the group that raise the card first and decided time-out
• Lecturer make FINAL decision whether an answer is correct or not, we can resolve disagreement later. No hard feeling ;)
• Some questions would be related to the final
Category AProcesses
Category BIO
Category D Comm.
Category EMisc.Level
100 $
200 $
300 $
400 $
500 $
100 $ 100 $ 100 $ 100 $Easy
200 $ 200 $ 200 $ 200 $Medium
300 $
400 $
500 $
300 $ 300 $ 300 $Hard
400 $ 400 $ 400 $Daunting
500 $ 500 $ 500 $ Impossible
Category CConcurrency
Question 5a In CSH/BASH, if you run following four commands: cd /mydirectory ls –l | wc -l find . –name *.txt > a.txt Echo success!How many processes the shell creates.
Question 1bThe name of the block that contains overarching
information about a file system such as size status. Total number of inodes, free blocks counter and so on.
Question 2btianhe@dio (/home/fac26/tianhe) % ls -l prw------- 1 tianhe mess 0 Dec 8 17:07 trace
What the first character P stands for?
Question 3bThe name of the situation, in which constant data swapping between RAM and disk occurs, when memory is insufficient for current running processes.
Question 4bWith in a directory, you create 5 symbolic links and 7 hard-links. How many free free-inode are used after these operations?
Question 5bConsider a file c (size of 10 bytes) in the Unix file system named /a/b/c. What is the minimum number of reads of data
blocks are required to get file c?
Question 1cA OS term describes the condition in which a process is indefinitely delayed, because other processes are always given preference.
Question 3cWhat is the name of the lock
where the thread simply waits in a loop repeatedly checking until the lock
becomes available.
Question 5cint i;for (i = 0; i < 100; i++) {execlp("echo", "echo", “Hello World\n", NULL);}
How many lines of text will be print out
Question 3dHow many sockets are created when 11 users query a DNS server at both client and server sides
Answer 5dEphemeral ports
Port 0 is reserved
Ports 1 - 1023 are named "well-known" ports
Ports 1024 - 49,151 are registered ports.
Ports 49,152 - 65,535 are ephemeral ports
Question 1eDOS was the first widely-installed operating system for personal computers. What does DOS stand for?
Question 2eThe name of problem a 32 bit time_t data structure
would cause?
Hint( it records the seconds elapsed since January 1, 1970 )
Question 3eThe name of a small privileged OS core that provides process scheduling, memory management, and communication services and relies on other processes to perform some of the functions traditionally associated with the operating system kernel.
Make your wager up to what you have
Write down the wager along with the answer on the back of the index card.
Final QuestionConsider the following piece of code.
int main(int argc, char ** argv){int i;for (i = 0; i < 3; i++) {
fork();printf("#%d, ", i);
}printf("\n");
} What is printed to standard output? Why?
Final Answer#0, #1, #2, #0, #1, #2, #0, #1, #2, #0, #1, #2, #0, #1, #2, #0, #1, #2, #0, #1, #2, #0, #1, #2,
This is because printf has an internal user level buffer that gets copied, when the fork happens, and since stdout isn’t flushed untilit sees a newline (or fills up the internal buffer), all 8 processes wind up with 0, 1, and 2 in their buffer. When they exit, the buffers are flushed.