ASoE/Chapter 9/Read MCQs
๐Ÿ“– Back to Study Notes
9

Chapter 9 ยท MCQ Read Mode

Real Time Systems, Distributed Systems, Cloud Computing

ASOE09ยท68 Total MCQs
Question 1 of 68Introduction to real time system and real time scheduling

A real-time system's correctness depends on:

AOnly the logical correctness of results
BBoth the logical correctness of results and the time they are produced
COnly the speed of the CPU
DOnly the amount of memory available
Answer is hidden
Question 2 of 68Introduction to real time system and real time scheduling

In a hard real-time system, missing a deadline is considered:

AA minor inconvenience
BA catastrophic failure
CAlways acceptable
DIrrelevant to system correctness
Answer is hidden
Question 3 of 68Introduction to real time system and real time scheduling

Which real-time scheduling approach relies on a static, precomputed schedule?

APriority-driven scheduling
BClock-driven scheduling
CWeighted round-robin only
DBest-effort scheduling
Answer is hidden
Question 4 of 68Introduction to real time system and real time scheduling

Which algorithm assigns dynamic priority based on the nearest absolute deadline?

ARate Monotonic
BEarliest-Deadline-First (EDF)
CWeighted Round-Robin
DClock-driven scheduling
Answer is hidden
Question 5 of 68Introduction to real time system and real time scheduling

EDF is optimal in the sense that:

AIt always uses the least memory
BIt is optimal among all algorithms for uniprocessor preemptive scheduling
CIt requires no knowledge of deadlines
DIt only works for aperiodic jobs
Answer is hidden
Question 6 of 68Introduction to real time system and real time scheduling

The Rate Monotonic algorithm assigns priority based on:

ATask deadline only
BTask period, with shorter period getting higher priority
CRandom assignment
DTask arrival order
Answer is hidden
Question 7 of 68Introduction to real time system and real time scheduling

Which algorithm is optimal specifically among FIXED-priority algorithms for periodic tasks?

AEDF
BLST
CRate Monotonic
DWeighted Round-Robin
Answer is hidden
Question 8 of 68Introduction to real time system and real time scheduling

Least-Slack-Time-first (LST) scheduling prioritizes the task with:

AThe most slack time
BThe least slack time
CThe shortest execution time regardless of deadline
DThe earliest release time only
Answer is hidden
Question 9 of 68Introduction to real time system and real time scheduling

A sporadic job differs from an aperiodic job mainly because it has:

ANo timing requirements at all
BA hard deadline and a minimum inter-arrival time
CA fixed period like periodic tasks
DOnly soft deadlines
Answer is hidden
Question 10 of 68Introduction to real time system and real time scheduling

Offline scheduling differs from online scheduling in that it:

AMakes all decisions at run time as tasks arrive
BComputes the schedule in advance, before execution begins
CCannot be used for real-time systems
DRequires no scheduling algorithm at all
Answer is hidden
Question 11 of 68Resources sharing and real time communication

Priority inversion occurs when:

AA high-priority task runs before a low-priority task, as expected
BA lower-priority task holding a resource blocks a higher-priority task waiting for it
CTwo tasks have identical priorities
DA task has no assigned priority
Answer is hidden
Question 12 of 68Resources sharing and real time communication

The Basic Priority-Inheritance Protocol addresses blocking by:

ATerminating the blocking task
BTemporarily raising the blocking task's priority to that of the task it is blocking
CPreventing any task from ever blocking
DIgnoring priority altogether
Answer is hidden
Question 13 of 68Resources sharing and real time communication

In the Priority-Ceiling Protocol, a resource's 'ceiling' is defined as:

AThe lowest priority of any task using it
BThe highest priority of any task that may lock it
CA fixed system-wide constant
DThe number of tasks waiting for it
Answer is hidden
Question 14 of 68Resources sharing and real time communication

One major benefit of the Priority-Ceiling Protocol is that it:

AEliminates the need for any locking
BPrevents deadlock and bounds blocking to at most one critical section
COnly works for aperiodic tasks
DRequires unlimited memory
Answer is hidden
Question 15 of 68Resources sharing and real time communication

Non-preemptive critical sections are a simple RAC approach where:

AA task can always be preempted at any time
BA task cannot be preempted once it enters a critical section, until it exits
CCritical sections are never used
DOnly the highest-priority task may ever enter a critical section
Answer is hidden
Question 16 of 68Resources sharing and real time communication

Hard real-time communication is characterized by:

ABest-effort delivery only
BGuaranteed message delivery within a specified deadline
CNo timing requirements
DDelivery only over wireless networks
Answer is hidden
Question 17 of 68Resources sharing and real time communication

Weighted Round-Robin (WRR) as a network service discipline is used to:

ARandomly drop packets
BShare bandwidth among flows according to assigned weights
CAlways give equal bandwidth to all flows regardless of priority
DEncrypt network traffic
Answer is hidden
Question 18 of 68Resources sharing and real time communication

Which protocol type governs how nodes share access to a common broadcast transmission medium?

AResource Reservation Protocols
BMedium Access Control (MAC) protocols
CPriority Inheritance Protocols
DFile Transfer Protocols
Answer is hidden
Question 19 of 68Resources sharing and real time communication

RSVP (Resource Reservation Protocol) is used on the internet to:

ACompress data packets
BReserve bandwidth/resources along a path to provide QoS guarantees
CEncrypt all internet traffic
DAssign IP addresses
Answer is hidden
Question 20 of 68Resources sharing and real time communication

The Stack-Based Priority-Ceiling Protocol is specifically designed for:

ADynamic-priority systems only
BFixed-priority systems using a single shared run-time stack
CSystems with no shared resources
DWireless networks only
Answer is hidden
Question 21 of 68Introduction to distributed systems and cloud computing

A distributed system is best described as:

AA single powerful computer
BIndependent computers that appear as one coherent system via message passing
CA system with no network connection
DA purely theoretical concept
Answer is hidden
Question 22 of 68Introduction to distributed systems and cloud computing

Which of the following is NOT typically listed as a characteristic of distributed systems?

AResource sharing
BA single global clock shared by all nodes
CFault tolerance
DConcurrency
Answer is hidden
Question 23 of 68Introduction to distributed systems and cloud computing

Which model of distributed systems has no central server, with nodes communicating directly?

AClient-Server model
BPeer-to-Peer (P2P) model
CThree-tier model
DMainframe model
Answer is hidden
Question 24 of 68Introduction to distributed systems and cloud computing

Cluster computing is typically characterized by:

ALoosely coupled nodes spread across organizations
BTightly coupled, homogeneous nodes in close proximity with a high-speed interconnect
CNo interconnect between nodes
DNodes that never communicate
Answer is hidden
Question 25 of 68Introduction to distributed systems and cloud computing

Grid computing differs from cluster computing mainly in that grid computing is:

AAlways faster
BLoosely coupled and often spans multiple organizations geographically
CLimited to a single machine
DNot networked at all
Answer is hidden
Question 26 of 68Introduction to distributed systems and cloud computing

Which of the following is one of the five desired features of cloud computing (per NIST)?

AFixed, non-elastic resources
BRapid elasticity
CManual-only self-service
DNo network access required
Answer is hidden
Question 27 of 68Introduction to distributed systems and cloud computing

Cloud computing's roots can be traced back to:

AGrid computing, utility computing, virtualization, and SOA
BOnly punch-card systems
COnly mainframe batch processing
DOnly desktop computing
Answer is hidden
Question 28 of 68Introduction to distributed systems and cloud computing

A major risk associated with cloud computing is:

AGuaranteed zero downtime
BVendor lock-in and dependency on the provider
CComplete elimination of security concerns
DNo need for an internet connection
Answer is hidden
Question 29 of 68Introduction to distributed systems and cloud computing

Which of these is a key benefit of cloud computing?

ARequires large upfront infrastructure investment
BCost savings via pay-as-you-go pricing and elastic scalability
CWorks only without an internet connection
DRemoves the need for any security measures
Answer is hidden
Question 30 of 68Introduction to distributed systems and cloud computing

A key challenge in resource sharing over the web is:

APerfect homogeneity of all systems
BHeterogeneity of hardware/software across different systems
CThe complete absence of security concerns
DUnlimited bandwidth everywhere
Answer is hidden
Question 31 of 68Distributed file system and CORBA

RPC (Remote Procedure Call) allows a program to:

AOnly execute procedures on the local machine
BCall a procedure on a remote machine as if it were local
CDelete files on a remote server
DBypass all network protocols
Answer is hidden
Question 32 of 68Distributed file system and CORBA

In a File Service Architecture, which component maps human-readable file names to file identifiers?

AFlat File Service
BDirectory Service
CClient Module
DObject Request Broker
Answer is hidden
Question 33 of 68Distributed file system and CORBA

Sun NFS classic versions (NFSv2/v3) follow which server design?

AStateful server
BStateless server
CNo server design at all
DPeer-to-peer only
Answer is hidden
Question 34 of 68Distributed file system and CORBA

DNS (Domain Name System) is best described as:

AA file transfer protocol
BThe internet's hierarchical, distributed name service mapping domain names to IP addresses
CA cloud storage service
DA type of firewall
Answer is hidden
Question 35 of 68Distributed file system and CORBA

Middleware in a distributed system primarily serves to:

AReplace the need for a network entirely
BProvide common services that abstract away heterogeneity among system components
CEncrypt all network data automatically
DAct only as a user interface
Answer is hidden
Question 36 of 68Distributed file system and CORBA

CORBA's Interface Definition Language (IDL) is used to:

AWrite the entire application in one specific language
BDescribe object interfaces independent of any specific programming language
CEncrypt network traffic
DReplace the Object Request Broker
Answer is hidden
Question 37 of 68Distributed file system and CORBA

The component in CORBA responsible for routing method calls between distributed objects is the:

ADirectory Service
BObject Request Broker (ORB)
CDNS server
DFile Service
Answer is hidden
Question 38 of 68Distributed file system and CORBA

Which of these is a standard CORBA service?

AHTTP Service
BNaming Service
CDHCP Service
DCompiler Service
Answer is hidden
Question 39 of 68Distributed file system and CORBA

A discovery service in a distributed system is used to:

APermanently delete unused files
BLet clients dynamically locate available services on a network
CEncrypt file contents
DCompile source code remotely
Answer is hidden
Question 40 of 68Distributed file system and CORBA

Comparing different DFS implementations, such as NFS and AFS, typically considers differences in:

AOnly their marketing names
BCaching strategy, consistency model, and scalability
CThe color of their logos
DOnly their release year
Answer is hidden
Question 41 of 68Virtualization, cloud architecture, services and storage and cloud security

A Type 1 (bare-metal) hypervisor:

ARuns on top of a host operating system
BRuns directly on the physical hardware
CCannot host multiple virtual machines
DIs only used for desktop virtualization
Answer is hidden
Question 42 of 68Virtualization, cloud architecture, services and storage and cloud security

Which type of virtualization allows an application to run in an isolated environment without being fully installed on the local OS?

AServer virtualization
BDesktop virtualization
CApplication virtualization
DNetwork virtualization
Answer is hidden
Question 43 of 68Virtualization, cloud architecture, services and storage and cloud security

A private cloud is characterized by:

AShared infrastructure open to any customer
BDedicated infrastructure for a single organization
CNo security controls at all
DBeing accessible only via a hybrid model
Answer is hidden
Question 44 of 68Virtualization, cloud architecture, services and storage and cloud security

Which cloud service model provides virtualized computing infrastructure such as servers and storage?

ASaaS
BPaaS
CIaaS
DDaaS
Answer is hidden
Question 45 of 68Virtualization, cloud architecture, services and storage and cloud security

Google App Engine is a well-known example of which cloud service model?

AIaaS
BPaaS
CSaaS
DNone of these
Answer is hidden
Question 46 of 68Virtualization, cloud architecture, services and storage and cloud security

Which cloud deployment model combines both public and private cloud resources?

APublic cloud
BPrivate cloud
CHybrid cloud
DCommunity cloud (not covered here)
Answer is hidden
Question 47 of 68Virtualization, cloud architecture, services and storage and cloud security

Dynamic resource provisioning differs from static provisioning because it:

AAllocates fixed resources in advance that never change
BAllocates/releases resources on demand based on actual usage
CCannot be used in cloud computing
DRequires manual reconfiguration for every request
Answer is hidden
Question 48 of 68Virtualization, cloud architecture, services and storage and cloud security

Cloud infrastructure security must be addressed at which levels?

AOnly the application level
BNetwork, host, and application levels
COnly the hardware level
DOnly the database level
Answer is hidden
Question 49 of 68Virtualization, cloud architecture, services and storage and cloud security

Which of the following is a key privacy issue specific to cloud computing?

AData ownership and jurisdiction over where data is stored
BThe color scheme of the cloud dashboard
CThe speed of the local CPU
DThe type of monitor used
Answer is hidden
Question 50 of 68Virtualization, cloud architecture, services and storage and cloud security

Multi-tenancy in cloud computing refers to:

AA single customer using dedicated hardware only
BMultiple customers sharing the same underlying physical infrastructure
CA cloud with no other users
DA type of encryption algorithm
Answer is hidden
Question 51 of 68Agreement in distributed system

Why is clock synchronization needed in a distributed system?

AAll nodes already share one perfect physical clock
BEach node's local clock can drift, and there is no global clock
CSynchronization is never needed in distributed systems
DIt is only needed for centralized systems
Answer is hidden
Question 52 of 68Agreement in distributed system

Lamport's logical clocks order events using which relation?

AThe 'happens-before' relation
BPhysical GPS time
CA single centralized timestamp authority
DRandom ordering
Answer is hidden
Question 53 of 68Agreement in distributed system

Which physical clock synchronization algorithm has a coordinator poll all nodes and compute an average time?

ACristian's algorithm
BBerkeley algorithm
CLamport's algorithm
DVector clock algorithm
Answer is hidden
Question 54 of 68Agreement in distributed system

In centralized distributed mutual exclusion, the main drawback is:

AIt is too complex to implement
BThe single coordinator is a potential bottleneck/single point of failure
CIt requires a token to circulate
DIt cannot guarantee mutual exclusion at all
Answer is hidden
Question 55 of 68Agreement in distributed system

Which distributed mutual exclusion approach uses a circulating token, allowing only its holder to enter the critical section?

ACentralized approach
BToken-based approach
CVector clock approach
DBerkeley approach
Answer is hidden
Question 56 of 68Agreement in distributed system

The Ricart-Agrawala algorithm is an example of which type of mutual exclusion approach?

ACentralized
BToken-based
CDistributed, non-token-based (message exchange with timestamps)
DPhysical clock synchronization
Answer is hidden
Question 57 of 68Agreement in distributed system

A fault-tolerant system continues to operate correctly despite failures mainly through the use of:

ARedundancy
BEliminating all backups
CIgnoring failed components permanently
DRemoving replication
Answer is hidden
Question 58 of 68Agreement in distributed system

In active replication, how do replicas handle incoming requests?

AOnly one replica ever processes requests
BAll replicas independently process every request in parallel
CReplicas never communicate
DRequests are discarded randomly
Answer is hidden
Question 59 of 68Agreement in distributed system

In passive replication, which replica processes client requests?

AAll replicas simultaneously
BOnly a single primary replica, which then updates the backups
CNo replica processes requests
DA randomly chosen replica each time
Answer is hidden
Question 60 of 68Agreement in distributed system

Quorum-based replication considers an operation successful only when:

AA single replica acknowledges it
BNo replicas acknowledge it
CA sufficient quorum (majority) of replicas acknowledge it
DThe operation is never acknowledged
Answer is hidden
Question 61 of 68Information Theory & Signals

The Fourier Transform is used to:

AConvert a signal from the time domain to the frequency domain
BConvert a signal from the frequency domain to the time domain
CCompress digital signals
DEncrypt data transmissions
Answer is hidden
Question 62 of 68Information Theory & Signals

When a square wave is applied to an integrator op-amp circuit, the output is:

ASquare wave
BSine wave
CTriangle wave
DSawtooth wave
Answer is hidden
Question 63 of 68Information Theory & Signals

The Z-transform is primarily used for:

AAnalysing continuous-time signals
BAnalysing discrete-time signals and systems
CImage compression
DFrequency modulation
Answer is hidden
Question 64 of 68Information Theory & Signals

Interleaving in digital communications provides what type of diversity?

ATime diversity
BFrequency diversity
CSpace diversity
DPolarization diversity
Answer is hidden
Question 65 of 68Information Theory & Signals

In FDM, increasing the modulation index results in:

ADecreased bandwidth requirements
BIncreased bandwidth requirements
CNo change in bandwidth
DIncreased signal-to-noise ratio without bandwidth change
Answer is hidden
Question 66 of 68Information Theory & Signals

Adding zeros to the end of a discrete signal before taking its DFT is called:

AZero Padding
BWindowing
CDecimation
DInterpolation
Answer is hidden
Question 67 of 68Information Theory & Signals

In TDM (Time Division Multiplexing), the component essential for recovering individual channels at the receiver is:

AEqualizer
BFrame synchronization
CBandwidth filter
DDemodulator
Answer is hidden
Question 68 of 68Information Theory & Signals

In a common-collector (emitter follower) BJT amplifier, the phase relationship between input and output is:

A180 degrees (inverted)
B90 degrees
C0 degrees (in phase)
D45 degrees
Answer is hidden
โ† PREVIOUS CHAPTERCh 8: Java Programming and Web Technology NEXT CHAPTER โ†’Ch 10: Project Planning, Design and Implementation