Computer System Engineering 6.033 Spring 2006

Author:

Access: Public Instant Grading

Start FlashCards Download PDF

Get the best College algebra course in your pocket!

This course covers topics on the engineering of computer software and hardware systems: techniques for controlling complexity; strong modularity using client-server design, virtual memory, and threads; networks; atomicity and coordination of parallel activities; recovery and reliability; privacy, security, and encryption; and impact of computer systems on society. Case studies of working systems and readings from the current literature provide comparisons and contrasts. Two design projects are required, and students engage in extensive written communication exercises.

There are 12 questions and 12 pages in this quiz booklet. Answer each question according to the instructions given.

You have 50 minutes to answer the questions.

Most questions are multiple-choice questions. Next to each choice, circle the word True or False,

as appropriate. A correct choice will earn positive points, a wrong choice may earn negative

points, and not picking a choice will score 0.

Exam PDF eBook: 
Computer System Engineering 6.033 Spring 2006
Download Computer Engineering Exam PDF eBook
15 Pages
2014
English US
Educational Materials



Sample Questions from the Computer System Engineering 6.033 Spring 2006 Exam

Question: 2. [8 points]: The UNIX designers chose to have the process created by a fork() share (inherit) the open file descriptors of its parent. Which of the following would become more complicated had they decided on an alternate fork() semantics, in which the child process is created with no open file descriptors?

Choices:

True

False

Question: 1. [6 points]: Which of the following statements are true of the X Windows System (as described in the X Windows paper, reading # 5)?

Choices:

True

False

Question: 2. [8 points]: The UNIX designers chose to have the process created by a fork() share (inherit) the open file descriptors of its parent. Which of the following would become more complicated had they decided on an alternate fork() semantics, in which the child process is created with no open file descriptors?

Choices:

True

False

Question: 3. [8 points]: Ben Bitdiddle is using a MapReduce cluster (as described in reading #8) to process some data. He finds that some of his programs are running slowly and needs your help to understand which performance enhancements to try. For each of the following MapReduce configurations and suggested enhancements, circle True if the statement about the enhancement is true, and False otherwise.

Choices:

True

False

Question: 2. [8 points]: The UNIX designers chose to have the process created by a fork() share (inherit) the open file descriptors of its parent. Which of the following would become more complicated had they decided on an alternate fork() semantics, in which the child process is created with no open file descriptors?

Choices:

True

False

Question: 3. [8 points]: Ben Bitdiddle is using a MapReduce cluster (as described in reading #8) to process some data. He finds that some of his programs are running slowly and needs your help to understand which performance enhancements to try. For each of the following MapReduce configurations and suggested enhancements, circle True if the statement about the enhancement is true, and False otherwise.

Choices:

True

False

Question: 1. [6 points]: Which of the following statements are true of the X Windows System (as described in the X Windows paper, reading # 5)?

Choices:

True

False

Question: 2. [8 points]: The UNIX designers chose to have the process created by a fork() share (inherit) the open file descriptors of its parent. Which of the following would become more complicated had they decided on an alternate fork() semantics, in which the child process is created with no open file descriptors?

Choices:

True

False

Question: 3. [8 points]: Ben Bitdiddle is using a MapReduce cluster (as described in reading #8) to process some data. He finds that some of his programs are running slowly and needs your help to understand which performance enhancements to try. For each of the following MapReduce configurations and suggested enhancements, circle True if the statement about the enhancement is true, and False otherwise. the entire 1000-node cluster can complete these MapReduce operations in 100 seconds then doubling the CPU performance (task processing rate) of each machine in the cluster may improve performance somewhat but not significantly.

Choices:

True

False

Question: 1. [6 points]: Which of the following statements are true of the X Windows System (as described in the X Windows paper, reading # 5)?

Choices:

True

False

Question: 3. [8 points]: Ben Bitdiddle is using a MapReduce cluster (as described in reading #8) to process some data. He finds that some of his programs are running slowly and needs your help to understand which performance enhancements to try. For each of the following MapReduce configurations and suggested enhancements, circle True if the statement about the enhancement is true, and False otherwise.

Choices:

True

False

Start FlashCards Download PDF
Source:  Morris, Robert, and Samuel Madden. 6.033 Computer System Engineering, Spring 2009. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-033-computer-system-engineering-spring-2009 (Accessed 2 May, 2014). License: Creative Commons BY-NC-SA
Copy and paste the following HTML code into your website or blog.
<iframe src="https://www.quizover.com/embed/computer-system-engineering-exam-by-prof-samuel-madden-mit" width="600" height="600" frameborder="0" marginwidth="0" marginheight="0" scrolling="yes" style="border:1px solid #CCC; border-width:1px 1px 0; margin-bottom:5px" allowfullscreen webkitallowfullscreen mozallowfullscreen> </iframe>