Professional Documents
Culture Documents
Week 01
Week 01
2. ______ computing is a model where service provider makes computing resources available to the
customer as needed.
Ubiquitous
Utility
Online
Virtual
3. In live migration a running virtual machine or application can be moved between different physical
machines ______.
by disconnecting the client or application
without disconnecting the client or application
by moving application data to the cloud
without updating the client or application
True or False ?
7. Infrastructure as a Service (IaaS) delivery model is an example of a cloud computing environment that
provides users access to ______
Physical Machines
Virtual Machines
Storage Space
Virtual Memory
8. The figure depicts a Bare-Metal Hypervisor. The statement is,
True
False
9. In Sandpiper architecture, the Nucleus is responsible for,
Monitoring Resources
Allocating Resources
Migrating Resources
Detecting hotspots
9. NOX is a ________
Routing Control Platform
4D architecture
OpenFlow Controller
Virtual Switch
10. Google’s B4 architecture comprises a hierarchy of controllers in which at the top level we have
the ______ responsible for which is talking to an SDN gateway.
Global controller
Data center controller
Local controller
Cloud controller
O(n2)�(�2)
O(nlogn)�(�����)
O(n3)�(�3)
O(n)�(�)
The lower bound on message complexity for an leader election algorithm for asynchronous rings whose
size is not known a priori is,
Ω(nlogn)Ω(�����)
Ω(n2)Ω(�2)
Ω(n)Ω(�)
Ω(2n)Ω(2�)
Select the time complexity of below algorithm:
O(n)�(�)
O(logn)�(����)
O(n2)�(�2)
O(1)�(1)
In the O(nlogn) messages leader election algorithm, the probe distance in phase k is _______ and the
Number of messages initiated by a processor in phase k is at most ______________including probes and
replies in both directions.
2k−1,4k2�−1,4�
2k,4∗2k2�,4∗2�
k,2k�,2�
2k,4∗2k2�,4∗2�
____________ occurs when two processes are competing with each other potentially causing data
corruption.
Deadlock
Race Condition
Exclusion
Locking
In Zookeeper coordination activity, Sequential Consistency implies that,
Successful update will be persisted and cannot be undone.
Update from clients either succeed or fail
Update from clients are applied in order
Nothing
____________ occurs when two processes are waiting for each other directly or indirectly.
Overflow
Race Condition
Deadlock
Synchronization
Statement 1: The Ricart-Agrawala algorithm assumes the communication channels are FIFO. The
algorithm uses two types of messages: REQUEST and REPLY.
Statement 2: A process sends a REQUEST message to all other processes to request their
permission to enter the critical section. A process sends a REPLY message to a process to give its
permission to that process.
Only statement 1 is true
Only statement 2 is true
Both statements are true
Both statements are false
9. The Chandy-Lamport algorithm uses a control message, called a marker whose role in a FIFO system
is to separate messages in the channels. This statement is,
True
False
10. For the given event diagram, identify the correct events with vector clocks. Assume that the vector
elements are all set to zero at the beginning.
a: (2, 2, 4), b: (0, 0, 3), c: (3, 0, 3), d: (0, 0, 2), e: (2, 3, 2), f: (1, 0, 0), g: (2, 0, 0), h: (2, 1, 0), i: (2, 2, 0), k:
(0, 0, 1)
a: (2, 2, 0), b: (0, 0, 1), c: (2, 2, 4), d: (1, 0, 0), e: (2, 0, 0), f: (2, 1, 0), g: (0, 0, 3), h: (3, 0, 3), i: (0, 0, 2), k:
(2, 3, 2)
a: (1, 0, 0), b: (2, 0, 0), c: (2, 1, 0), d: (2, 2, 0), e: (0, 0, 1), f: (2, 2, 4), g: (0, 0, 3), h: (3, 0, 3), i: (0, 0, 2), k:
(2, 3, 2)
a: (2, 1, 0), b: (2, 2, 0), c: (0, 0, 1), d: (2, 2, 4), e: (0, 0, 3), f: (1, 0, 0), g: (2, 0, 0), h: (3, 0, 3), i: (0, 0, 2), k:
(2, 3, 2)
Week 05: Assignment 05
The due date for submitting this assignment has passed.
Due on 2024-02-28, 23:59 IST.
5. In the ________, all processes have an initial value, whereas in the ___________, a single process
has the initial value.
agreement problem, consensus problem
consensus problem, agreement problem
agreement problem, learder-election problem
consensus problem, learder-election problem
6. Find out the correct problem for the following problem specification:
Agreement: All non-faulty processes must agree on the same (single) value.
Validity: If all the non-faulty processes have the same initial value, then the agreed upon value by all
the non-faulty processes must be that same value.
Termination: Each non-faulty process must eventually decide on a value
Byzantine Agreement Problem
Consensus Problem
Interactive Consistency Problem
Consistency Problem
7. In ______________________, process coordinate their checkpoints in order to save a system-wide
consistent state. This consistent set of checkpoints can be used to bound the rollback.
Uncoordinated Checkpointing
Coordinated Checkpointing
Communication-induced Checkpointing
Livelock Checkpointing
8. ____________________ is a cascaded rollback which causes the system to roll back to too far in the
computation (even to the beginning), in spite of all the checkpoints.
Rollback
Phantom Effect
Domino Effect
Livelock problem
9. ______ is widely used implementation of a safe, _______ consensus protocol for ______ systems.
Paxos protocol, consistent, synchronous
Leader election, eventually-live, synchronous
Apache Zookeeper, consistent, asynchronous
Paxos protocol, eventually-live, asynchronous
10. Messages whose ‘send’ is done but ‘receive’ is undone due to rollback are called_________________.
In-transit message
Lost messages
Orphan messages
Duplicate messages
Week06: Assignment 06
The due date for submitting this assignment has passed.
Due on 2024-03-06, 23:59 IST.
List 1:
1. Consistency
2. Availability
3. Partition-tolerance
List 2:
A. All nodes see same data at any time, or reads return latest written value by any client.
B. The system continues to work in spite of network partitions
C. The system allows operations all the time, and operations return quickly.
1-A, 2-C, 3-B
1-A, 2-B, 3-C
1-C, 2-A, 3-B
1-C, 2-B, 3-A
3. Choose the correct items for X, Y, and Z.
X is a free and open-source, distributed, wide column store, Y database management system designed
to handle large amounts of data across many commodity servers, providing high availability with no Z.
X- Apache Cassandra, Y- SQL, Z- single point of failure
X- Hbase, Y- NoSQL, Z- failure
X- Zookeeper, Y- NoSQL, Z- multiple failure
X- Apache Cassandra, Y- NoSQL, Z- single point of failure
4. A small chunk of data residing in one machine which is part of a cluster of machines holding one
Hbase table is known as _____.
Rowarea
Tablearea
Split
Region
5. Choose the correct items for X, Y, and Z.
X in HBase Table is a combination of row, Y, Z and contains a value and a timestamp.
X- Row, Y- row family, Z- row qualifier
X- Cell, Y- column family, Z- column qualifier
X- Row, Y- rowkey, Z- column qualifier
X- Rowkey, Y- column family, Z- column qualifier
6. In Cassandra, ____ maps IPs to racks and data centers configured in cassandra.yaml config file.
Client requests
Partitioner
Snitch
Distributed Hash tables
7. Cell in HBase Table is a combination of ____ .
Row and column family
Row, column family and column qualifier
Row, column family, column qualifier and row keys
Row, column family, column qualifier and contains a value and a timestamp
8. ______ is a memory cache to store the in memory copy of the data. It accumulates writes and provides
read for data which are not yet stored to disk.
Distributed Hash tables
Collection
SSTable
Memtable
9. Consider the following statements:
Statement 1: Scale out means grow your cluster capacity by replacing with more powerful machines.
Statement 2: Scale up means incrementally grow your cluster capacity by adding more COTS
machines (Components Off the Shelf).
Only statement 2 is true
Only statement 1 is true
Both statements are true
Both statements are false
10. HBase is a distributed ________ database built on top of the Hadoop file system.
Row-oriented
Tuple-oriented
Column-oriented
None of the mentioned
2. In Chord a supernode stores a directory listing a subset of nearby (<filename,peer pointer>), similar to
Napster servers. The statement is,
True
False
3. _____ systems use _____ organization of the _____ for flexibly sharing resources (e.g., files and
multimedia documents) stored across network-wide computers.
Chord, Network-level, local network
DHT, Physical-level, network overlay
Peer-to-peer (P2P) network, Transport-level, network overlay
Peer-to-peer (P2P) network, Application-level, network overlay
4. In a Gnutella P2P network with N nodes, how many number of messages would a lookup operation
require?
N
N/2
log(N)
log(logN)
5. Users specify a ___________function that processes a key/value pair to generate a set of intermediate
key/value pairs, and a ____________ function that merges all intermediate values associated with the
same intermediate key.
Reduce, Map
Map, Reduce
Chunk, Grep
None of the mentioned
6. The Map phase is subdivided into M pieces and the reduce phase into R pieces. There are practical
bounds on how large M and R can be, since the master must make X scheduling decisions and keeps
Y state in memory.
X: O(M*R), Y: O(M * R)
X: O(M + R), Y: O(M + R)
X: O(M + R), Y: O(M * R)
X: O(M * R), Y: O(M + R)
7. Select the characteristic of P2P network.
Fault Tolerance
Dealing with instability
Low Latency
Self-Adaptation
8. Peer-to-peer (P2P) network systems use ___________________organization of the network overlay
for flexibly sharing resources (e.g., files and multimedia documents) stored across network-wide
computers.
Physical-level
Network-level
Transport-level
Application-level
9. Which of these P2P system uses a 1 hop Lookup DHT (Distributed Hash Table)?
CAN
Kelips
CHORD
Gnutella
10. Select the correct statement with regard to BitTorrent.
Prefer early download of blocks that are least replicated among neighbors
Centralized serve
Some peers designated as super nodes
Clients act as servers too, called servents