Download
slide1 n.
Skip this Video
Loading SlideShow in 5 Seconds..
Performance is better than expectation in (A, A-) range PowerPoint Presentation
Download Presentation
Performance is better than expectation in (A, A-) range

Performance is better than expectation in (A, A-) range

90 Views Download Presentation
Download Presentation

Performance is better than expectation in (A, A-) range

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. Performance is better than expectation in (A, A-) range

  2. Jeopardy CSCI 4061 Introduction to Operating System Final Review

  3. 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).

  4. 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

  5. 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

  6. Trophies at stake • The winning team wins 5 4$ starbuck card. You can enjoy together after class.

  7. Jeopardy Click to begin.

  8. Choose a point value. Choose a point value. Click here for Final Jeopardy

  9. Level Category A Processes Category B IO Category C Concurrency Category D Comm. Category E Misc. Easy 100 $ 100 $ 100 $ 100 $ 100 $ Medium 200 $ 200 $ 200 $ 200 $ 200 $ Hard 300 $ 300 $ 300 $ 300 $ 300 $ Daunting 400 $ 400 $ 400 $ 400 $ 400 $ Impossible 500 $ 500 $ 500 $ 500 $ 500 $

  10. Question 1a When a process will experience an involuntary context switch.

  11. Answer 1a Quantum (allocated time) expired

  12. Question 2a Determine the screen output for following commands: variable="Dennis" echo '$variable'

  13. Answer 2a $variable

  14. Question 3a How c-shell evaluates #?var ?

  15. Answer 3a $?VAR gives “1” if VAR is set, “0” if not.

  16. Question 4a Which signal is generated when a privileged instruction is executed in user mode?

  17. Answer 4a SIGILL

  18. 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.

  19. Answer 5a 3 processes

  20. Question 1b • The 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.

  21. Answer 1b Superblock

  22. Question 2b tianhe@dio (/home/fac26/tianhe) % ls -l prw------- 1 tianhe mess 0 Dec 8 17:07 trace What the first character P stands for?

  23. Answer 2b NamedPIPE first-in, first-out (FIFO) special file.

  24. Question 3b The name of the situation, in which constant data swapping between RAM and disk occurs, when memory is insufficient for current running processes.

  25. Answer 3b Thrashing

  26. Question 4b With in a directory, you create 5 symbolic links and 7 hard-links. How many free free-inode are used after these operations?

  27. Answer 4b 5 Because hard-link only add a (name, pointer-to-iNode) pair within the directory file.

  28. Question 5b Consider 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?

  29. Answer 5b 4 Note directory is a file Data block of / Data block of a/ Data block of b/ Data block of c

  30. Question 1c A OS term describes the condition in which a process is indefinitely delayed, because other processes are always given preference.

  31. Answer 1c starvation

  32. Question 2c Name at least two necessary conditions for deadlock

  33. Answer 2c Hold and wait, circular wait, non-preempt, mutual exclusion

  34. Question 3c What is the name of the lock where the thread simply waits in a loop repeatedly checking until the lock becomes available.

  35. Answer 3c Spinlock

  36. Question 4c

  37. Answer 4c

  38. Question 5c int i; for (i = 0; i < 100; i++) { execlp("echo", "echo", “Hello World\n", NULL); } How many lines of text will be print out

  39. Answer 5c 1

  40. Question 1d List three main elements in protocol design.

  41. Answer 1d Format, Order, and Action (FOA)

  42. Question 2d The server that listens to port Number 21

  43. Answer 2d FTP

  44. Question 3d How many sockets are created when 11 users query a DNS server at both client and server sides

  45. Answer 3d 1 at the UDP server side, 11 at the client side, totally 12.

  46. Question 4d The name of a UNIX shell command used to query Internet domain name servers

  47. Answer 4d nslookup

  48. Question 5d The name of ports 49,152 through 65,535

  49. Answer 5d Ephemeral 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

  50. Question 1e DOS was the first widely-installed operating system for personal computers. What does DOS stand for?