Could Computing – Coursera (Week 1 Quiz)

Cloud Computing Concepts (C3), Part 1 Syllabus

Skip to Main Content

Cloud Computing Concepts, Part 1Week 1Prerequisite QuizPrevNext

Practice Quiz • 50 min

Prerequisite Quiz

Submit your assignmentReceive gradeTo Pass90% or higherGrade—

Prerequisite Quiz

Practice Quiz • 50 min

Prerequisite Quiz

Total points 25

1.Question 1

The value of 5 + 3 + 77 is _____.

85

90

77

1001 point

2.Question 2

The value of 5*3*2 is ____.

15

35

50

301 point

3.Question 3

The value of 525^252 + 323^232 + 77277^2772 + 10210^2102 is _____.

190

None of these

6063

70031 point

4.Question 4

The value of 1+2+3+4+5+6+7+8+9+10 is _____.

33

55

77

661 point

5.Question 5

The value of 21+22+23+24+25 is _____.

62

126

125

1271 point

6.Question 6

In a queue data structure, the following items are inserted in the following order: Bob, Alice, Charlie, Eve, Zebra. Then an item is removed from the queue. That item will be _____.

Eve

None – this will be an error

Alice

Bob1 point

7.Question 7

In a queue data structure, the following items are inserted in the following order: Bob, Alice, Charlie, Eve, Zebra. Then three items are removed from the queue. Then two further items are inserted: Yelp, Pinion. Then two more items are removed from the queue. The next item removed will be _____.

Yelp

Charlie

Alice

Bob1 point

8.Question 8

In a stack data structure, the following items are inserted in the following order: Bob, Alice, Charlie, Eve, Zebra. Then an item is removed from the stack. That item will be _____.

None – this will be an error

Charlile

Zebra

Bob1 point

9.Question 9

In a stack data structure, the following items are inserted in the following order: Bob, Alice, Charlie, Eve, Zebra. Then three items are removed from the stack. Then two further items are inserted: Yelp, Pinion. Then two more items are removed from the stack. The next item removed will be _____.

Charlie

Bob

Alice

Zebra1 point

10.Question 10

You write a C++ program and it’s in two files: myprogram.h, and myprogram.cpp. Then a “process” is _____.

The compiled version (executable) of this program in action, with stack, heap, registers, code, program counter, etc.

The executable file created when this program is compiled

The two C++ files myprogram.h and myprogram.cpp

Any object (.o) files created when this program is compiled 1 point

11.Question 11

Which of the following in a process typically DOES NOT change its value or contents over the lifetime?

Program counter

Stack

Heap

Code1 point

12.Question 12

For an executing process, which of the following actually executes the instructions of the process?

Memory

Cache

Disk

CPU1 point

13.Question 13

The CPU can access data stored in different levels of the memory hierarchy. Which of these is the fastest to access?

Disk

Cache

None of these

Registers1 point

14.Question 14

In an executing process, the program counter points __________.

To the top of the stack

To the currently-being-executed line number of low-level (e.g., machine-level) program derived by compiling the C++ program you wrote

To the bottom of the stack

To the program or process that is currently being executed (among the many processes that are running in the Operating System) 1 point

15.Question 15

Searching for an element in an unsorted array (or vector) of N elements takes time _____.

O(N/2)

O(N)

O(1)

O(N2) 1 point

16.Question 16

Insertion sorting of an unsorted array of size N takes time _____.

O(N)

O(N3)

O(1)

O(N2) 1 point

17.Question 17

You are given an array (vector) of N integers that is sorted in increasing order. You are asked to create a sorted list of the same integers but in decreasing order. You can use any extra arrays, and creating extra arrays takes O(1) time. The most efficient algorithm to achieve this takes time ______.

O(N/2)

O(1)

O(N)

O(N2) 1 point

18.Question 18

An algorithm to process a set of N elements takes time (in microseconds) = f(N) = 0.03*N3+1000*N+3. This algorithm is _____.

O(N3)

O(N2)

O(N) because 1000 is the highest constant

None of these 1 point

19.Question 19

You are given a bag with 10 balls, of which 3 are red, 3 are blue, 1 is yellow, 2 are black, and 1 is white. You pick one ball at random from the bag. The probability that this ball is black is _____.

2/5

1/5

3/10

01 point

20.Question 20

You are given a bag with 10 balls, of which 3 are red, 3 are blue, 1 is yellow, 2 are black, and 1 is white. You pick one ball, note its color, put the ball back in the bag, and then pick another ball. The probability that it was the case that the first ball was black and the second ball was red is _____.

0.5

2

None of these

0.061 point

21.Question 21

Someone claims that the big O notation does not make sense at all, and they give the following example. An algorithm A that processes an input set of N elements takes time, in seconds, given by T(N) = 10000*N + 0.00001*N^3. They say that the large constant (10000) associated with the N will always dominate over the small constant (0.00001) associated with the N^3. You say that this algorithm A is _____.









O(N)

O(N3)

Confusing

O(1) 1 point

22.Question 22

Someone writes the following piece of code. What is its Big O complexity?









O(N2)

None of these

O(N)

O(1) 1 point

23.Question 23

You are given the following graph. In this graph, each edge has a weight that denotes the time taken to move between those cities (in hours). A “path” is defined as a sequence of edges that can be joined together to create, well, a path from a source node to a destination node. For instance, one path from node E to node D goes like: E to B to C to D. The “path cost” is obtained by adding up the costs of all its constituent edges – for the above example, the path’s cost is 9 + 2 + 4 = 15. There might be multiple paths between a pair of source, destination nodes. Among all these paths, we say that “shortest path” between a source and destination node pair is that path which has the lowest path cost.

Answer the following question: the shortest path that goes from node A to node C passes via which sequence of nodes?

Direct edge from A to C

A to B to C

A to D to C

A to E to B to C 1 point

24.Question 24

In the following graph, the shortest path that goes from node D to node E has what cost?

None of these

15

14

171 point

25.Question 25

In a graph containing N nodes, an edge can only join a pair of nodes. The maximum number of edges that can be present in this graph is best described as _____.

O(N4)

O(N2)

O(N)

O(N3) 1 pointI, Shu Yang, understand that submitting work that isn’t my own may result in permanent failure of this course or deactivation of my Coursera account. 

Cloud Computing Concepts (C3), Part 1 Syllabus

Course Description

Cloud computing systems today, whether open source or used inside companies, are built using a common set of core techniques, algorithms, and design philosophies, all of which are centered around distributed systems. Learn about such fundamental distributed computing “concepts” for cloud computing. Understand how these techniques work inside today’s most widely-used cloud computing systems. Get your hands dirty using these concepts with provided homework exercises. In the programming track, implement some of these concepts in template assignments provided in C++ programming language.

Course Goals and Objectives

At the end of this two-part Cloud Computing Concepts course, you will be able to:

  • Identify classical distributed computing problems that arise in today’s cloud computing problems.
  • Know and apply classical solutions to common distributed computing problems that arise in today’s cloud computing systems.
  • Know and apply the fundamental limitations of what is possible and what is not in cloud computing systems.
  • Know and apply knowledge of popular distributed systems used in industry today.
  • Analyze a given distributed algorithm in terms of computation and communication complexity, scalability, and fault tolerance.
  • Design algorithms and systems solutions to the core distributed computing problems arising in today’s cloud computing systems.
  • Build and debug a fully-working cloud computing system inside an emulated framework.

Textbook and Readings

No textbook is required. You will learn the content through video lectures, homework, exams, and programming assignments. Links to some extra reading materials will be provided in the corresponding weeks.

Course Outline

Part 1 of the course consists of 5 weekly modules which focus on the fundamental distributed computing “concepts” for cloud computing.

Week 1: Orientation, Introduction to Clouds, MapReduce

Key Concepts:

  • Course Overview
  • Part 1 Introduction
  • Clouds
  • MapReduce
  • Sumeet Singh Interview

Week 2: Gossip, Membership, and Grids

Key Concepts:

  • Gossip
  • Membership
  • Grids
  • William Gropp Interview

Week 3: P2P Systems

Key Concepts:

  • Peer-to-peer systems

Week 4: Key-value stores, and Time and Ordering

Key Concepts:

  • Key-value stores NoSQL
  • Time and ordering
  • Marcos Aguilera Interview

Week 5: Classical Distributed Algorithms

Key Concepts:

  • Snapshots
  • Multicast
  • Paxos (aka Consensus)
  • Tushar Chandra Interview

Elements of This Course

The course is comprised of the following elements:

  • Lecture videos. In each module the concepts you need to know will be presented through a collection of short video lectures. You may stream these videos for playback within the browser by clicking on their titles or download the videos. You may also download the slides that go along with the videos.
  • In-video Questions. Some lecture videos have questions associated with them to help verify your understanding of the topics. These questions will automatically appear while watching the video if you stream the video through your browser. These questions do not contribute toward your final score in the class.

The following description applies to only students who pay. Students who don’t pay can still view all graded assignments, but will not be able to submit any graded assignments for grading.

  • Homework. Each module will include homework which is for-credit quiz. You will be allowed three attempts every eight hours for each quiz. There is no time limit on how long you take to complete each attempt at the quiz. Each attempt may present a different selection of questions to you. Your highest score will be used when calculating your final score in the class.
  • Exams. To complete this course, you will not only finish all the homework but also an exam (one at the end of each part of the C3 course). The material, homework, and exam for C3 – Part 2 will utilize knowledge gained from C3 – Part 1. You will be allowed ONE attempt every 24 hours. Like homework, your highest score will be used in your final grade.
  • Programming Assignment. You are required to finish the programming assignment as well. This is required for all paid students, regardless of whether you are enrolled in the Cloud Computing Specialization or not. The programming assignment will give you working knowledge of many of the concepts and principles covered in this course.
  • Discussion. Use the discussion forums to learn more with your peers. Be sure to make the most of them in this class.

How to Pass This Course

To qualify for a Course Certificate, simply start verifying your coursework at the beginning of the course and pay the $79 fee. Coursera Financial Aid is available to offset the registration cost for learners with demonstrated economic needs. If you have questions about Course Certificates, please see the help topics here.

Also note that this course is the first course in the Cloud Computing Specialization offered by the University of Illinois at Urbana-Champaign. By earning a Course Certificate in this course, you are on your way toward earning a Specialization Certificate in Cloud Computing. To earn the Specialization Certificate, you must also complete the Programming Assignment in each course in the specialization sequence and in the Capstone Project. You may pay for each course individually or pre-pay for the entire Specialization. There is a discounted rate for pre-paying for the entire Specialization. See more information about Specialization payments here.

If you choose not to pay the fee, you can still audit the course. You will still be able to view all videos, submit practice quizzes, and view required assessments. Auditing does not include the option to submit required assessments. As such, you will not be able to earn a grade or a Course Certificate.

The following table explains the breakdown for what is required in order to pass the class and qualify for a Course Certificate and Specialization Certificate. You must pass each and every required activity to pass this course.

ActivityRequired for Course Certificate?Required for Specialization Certificate?Number per moduleEstimated time per module% required to pass
Lecture VideosYesYes8-1310 hoursN/A
Weekly HomeworkYesYes18 hours80%
Final ExamYesYes1 (in Week 5)1.5 hours80%
Programing AssignmentYesYes1 (runs week 1-5)8 hours80%

Cloud Computing Concepts, Part 2 and the Specialization Certificate in Cloud Computing

Do you want to continue your journey in specializing in cloud computing? Then be sure to register for Cloud Computing Concepts, Part 2, which is the second half of the course you are in now. Cloud Computing Concepts, Part 2 begins where Part 1 leaves off and covers additional essential cloud computing concepts like classical precursors, widely-used algorithms, scalability, and trending areas. If you would like to extend your knowledge even further, you can explore a specialization in Cloud Computing. Cloud Computing Concepts, Part 1and Part 2 are part of a course cluster that make up the Cloud Computing Specialization. By earning a course certificate and finishing the programming assignment, you are on your way toward earning a Specialization Certificate in Cloud Computing from the University of Illinois at Urbana-Champaign and Coursera.

Getting and Giving Help

You can get/give help via the following means:

  • Use the Learner Help Center to find information regarding specific technical problems. For example, technical problems would include error messages, difficulty submitting assignments, or problems with video playback. If you cannot find an answer in the documentation, you can also report your problem to the Coursera staff by clicking on the Contact Us! link available on each topic’s page within the Learner Help Center.
  • Use the Content Issues forum to report errors in lecture video content, assignment questions and answers, assignment grading, text and links on course pages, or the content of other course materials. University of Illinois staff and Community Mentors will monitor this forum and respond to issues.

Note: Due to the large number of learners enrolled in this course, I am unable to answer emails sent directly to my account. Rather, all questions should be reported as described above.