Register

UGC NET CSE | January 2017 | Part 2 | Question: 40

• recategorized
834 views
2 votes
2 votes

Distributed operating systems consist of:

  1. Loosely coupled O.S. software on a loosely coupled hardware.
  2. Loosely coupled O.S. software on a tightly coupled hardware.
  3. Tightly coupled O.S. software on a loosely coupled hardware.
  4. Tightly coupled O.S. software on a tightly coupled hardware.
• recategorized
User Avatar

2 Answers

2 votes
2 votes
A Distributed operating system is usually defined as running on more loosely coupled hardware .

There is no shared memory, but provides the “feel” of a single memory by Tightly-coupled software .

There is one single OS, the goal of Distributed system is to make the collection of machines behave more like a single machine.  So that means there is tightly coupled OS running on a loosely coupled hardware.

Hence option C is correct choice.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
5 answers
2
go_editor asked Mar 24, 2020
2,291 views
UGC NET CSE | January 2017 | Part 2 | Question: 37
In a paging system, it takes $30$ ns to search translation Look-a-side Buffer (TLB) and $90$ ns to access the main memory. If the TLB hit ratio is $70\%$, the effective memory access time is : $48$ ns $147$ns $120$ns $84$ns
In a paging system, it takes $30$ ns to search translation Look-a-side Buffer (TLB) and $90$ ns to access the main memory. If the TLB hit ratio is $70\%$, the effective m...
User Avatar
1 votes
1 votes
4 answers
3
go_editor asked Mar 24, 2020
1,009 views
UGC NET CSE | January 2017 | Part 2 | Question: 38
Match the following w.r.t Input/Output management : ...
Match the following w.r.t Input/Output management :$\begin{array}{ll} &{\text{List – I}} & & {\text{List – II}} \\ \text{a.} & \text{Device controller} & \text{i.} &...
User Avatar
2 votes
2 votes
4 answers
4
go_editor asked Mar 24, 2020
4,584 views
UGC NET CSE | January 2017 | Part 2 | Question: 39
Which of the following scheduling algorithms may cause starvation ? First-come-first-served Round Robin Priority Shortest process next Shortest remaining time first a, c and e c, d and e b, d and e b, c and d
Which of the following scheduling algorithms may cause starvation ?First-come-first-servedRound RobinPriorityShortest process nextShortest remaining time first a, c and e...
User Avatar
Link Copied!