The distributed system is a collection of (P) and communication is achieved in distributed system by (Q) , where (P) and (Q) are : (A) Loosely coupled hardware on tightly coupled software and disk sharing, respectively. (B) Tightly coupled hardware on loosely coupled software and shared memory, respectively. (C) Tightly coupled software on loosely coupled hardware and message passing ,respectively. (D) Loosely coupled software on tightly coupled hardware and file sharing, respectively.

The distributed system is a collection of (P) and communication is achieved in distributed system by (Q) , where (P) and (Q) are : (A) Loosely coupled hardware on tightly coupled software and disk sharing, respectively.  (B) Tightly coupled hardware on loosely coupled software and shared memory, respectively. (C) Tightly coupled software on loosely coupled hardware and message passing ,respectively. (D) Loosely coupled software on tightly coupled hardware and file sharing, respectively.
by

1 Answer

Answer :

(C) Tightly coupled software on loosely coupled hardware and message passing ,respectively. 
by

Related questions

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

Description : 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

Last Answer : Answer: 3

Which of the following is not valid with reference to Message Passing Interface (MPI)? (A) MPI can run on any hardware platform (B) The programming model is a distributed memory model. (C) All parallelism is implicit. (D) MPI - Comm - Size returns the total number of MPI processes in specified communication.

Description : Which of the following is not valid with reference to Message Passing Interface (MPI)? (A) MPI can run on any hardware platform (B) The programming model is a distributed memory model. (C) All ... implicit. (D) MPI - Comm - Size returns the total number of MPI processes in specified communication.

Last Answer : (C) All parallelism is implicit.

………. Involves treating main memory as a resource to be allocated to and shared among a number of active processes. A) Partition management B) Memory management C) Disk management D) All of the above

Description : ………. Involves treating main memory as a resource to be allocated to and shared among a number of active processes. A) Partition management B) Memory management C) Disk management D) All of the above

Last Answer : B) Memory management

Explain Shared memory, Mutex, Message passing and Dead lock.

Last Answer : Shared memory :For sharing of data faster and communication between programs, we use shared memory. Shared memory can be used with multiprocessors and single processors. Means Program ... No resource preemption4. Circular waitIf the four conditions occur simultaneously then the deadlock occurs.

whya. A loosely knitted sweater will keep you warmer than a tightly knitted one.b. Small gaps are left between the joints of concrete slabs on bridges.?

Description : whya. A loosely knitted sweater will keep you warmer than a tightly knitted one.b. Small gaps are left between the joints of concrete slabs on bridges.?

Last Answer : to allow expansion in summer

Free electrons are: (a) Fixed (b) Loosely bounded (c) Strongly fixed (d) Tightly bound

Description : Free electrons are: (a) Fixed (b) Loosely bounded (c) Strongly fixed (d) Tightly bound

Last Answer : (b) Loosely bounded

A coil is said to be loosely coupled with which of the following conditions? a) K>1 b) K<1 c) K>0.5 d) K<0.5

Description : A coil is said to be loosely coupled with which of the following conditions? a) K>1 b) K0.5 d) K

Last Answer : d) K

Which of the following is correct? a) Layers are not strongly coupled to the layers above them b) Each layer is strongly coupled only to the layer immediately below it c) Overall Layered-style architectures are loosely coupled d) All of the mentioned

Description : Which of the following is correct? a) Layers are not strongly coupled to the layers above them b) Each layer is strongly coupled only to the layer immediately below it c) Overall Layered-style architectures are loosely coupled d) All of the mentioned

Last Answer : All of the mentioned

Which is considered as an emerging industry best practice for dealing with dynamic and loosely coupled trust relationships in the collaboration model of an organization in Identity and Access management a) Identity federation b) Cloud federation c) Security federation d) None of the above

Description : Which is considered as an emerging industry best practice for dealing with dynamic and loosely coupled trust relationships in the collaboration model of an organization in Identity and Access management a) Identity federation b) Cloud federation c) Security federation d) None of the above

Last Answer : Identity federation

What problem is caused in an rf amplifier by a loosely coupled transformer?

Description : What problem is caused in an rf amplifier by a loosely coupled transformer?

Last Answer : A too-narrow bandpass.

Why is the tunnel diode loosely coupled to the cavity in a tunnel-diode oscillator?

Description : Why is the tunnel diode loosely coupled to the cavity in a tunnel-diode oscillator?

Last Answer : To increase the stability.

Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.

Which of the following are the functions of operating system? i) recovering from errors ii) facilitating input/output iii) facilitating parallel operation iv) sharing hardware among users v) implementing user interface A) i, ii, ii, and v only B) i, ii, iii, and iv only C) ii, iii, iv and v only D) All i, ii, iii, iv and v

Description : Which of the following are the functions of operating system? i) recovering from errors ii) facilitating input/output iii) facilitating parallel operation iv) sharing hardware among users v) implementing user interface A) i, ii, ... only C) ii, iii, iv and v only D) All i, ii, iii, iv and v

Last Answer : D) All i, ii, iii, iv and v

Which of the following is/are the functions of operating system? i) Sharing hardware among users. ii) Allowing users to share data among themselves. iii) Recovering from errors. iv) Preventing users from interfering with one another. v) Scheduling resources among users. A) i, ii, iii and iv only B) ii, iii, iv and v only C) i, iii, iv and v only D) All i, ii, iii, iv and v

Description : Which of the following is/are the functions of operating system? i) Sharing hardware among users. ii) Allowing users to share data among themselves. iii) Recovering from errors. iv) Preventing users from interfering with one another. ... only C) i, iii, iv and v only D) All i, ii, iii, iv and v

Last Answer : D) All i, ii, iii, iv and v

In RSA algorithm,if p=5,q=7,e=7and message=3. What will be the value of ciphertext ?

Description : In RSA algorithm,if p=5,q=7,e=7and message=3. What will be the value of ciphertext ?

Last Answer : 17

Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1, P2 and P3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur? (A) 70 (B) 14 (C) 13 (D) 7

Description : Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1, P2 and P3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur? (A) 70 (B) 14 (C) 13 (D) 7

Last Answer : (B) 14

Let us assume that you construct ordered tree to represent the compound proposition (~(p˄q))↔(~p˅~q). Then, the prefix expression and post-fix expression determined using this ordered tree are given as ........... and ............. respectively. (A) ↔~˄pq˅ ~~pq, pq˄~p~q~˅↔ (B) ↔~˄pq˅ ~p~q, pq˄~p~q~˅↔ (C) ↔~˄pq˅ ~~pq, pq˄~p~ ~q˅↔ (D) ↔~˄pq˅ ~p~q, pq˄~p~~q˅↔

Description : Let us assume that you construct ordered tree to represent the compound proposition (~(p˄q))↔(~p˅~q). Then, the prefix expression and post-fix expression determined using this ordered tree are given as ........... and .......... ... ~p~q~˅↔ (C) ↔~˄pq˅ ~~pq, pq˄~p~ ~q˅↔ (D) ↔~˄pq˅ ~p~q, pq˄~p~~q˅↔

Last Answer : (B) ↔~˄pq˅ ~p~q, pq˄~p~q~˅↔

Which of the following is not typically a benefit of dynamic linking? I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory. III. Reduction in overall space consumption on disk. IV. Reduction in the cost of software updates. (A) I and IV (B) I only (C) II and III (D) IV only

Description : Which of the following is not typically a benefit of dynamic linking? I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory. III. Reduction in overall space consumption on disk. IV. ... updates. (A) I and IV (B) I only (C) II and III (D) IV only

Last Answer : (B) I only 

Brown adipose tissue is characterized by which of the following? (A) Present in large quantities in adult humans (B) Mitochondrial content higher than white adipose tissue (C) Oxidation and phosphorylation are tightly coupled (D) Absent in hibernating animals

Description : Brown adipose tissue is characterized by which of the following? (A) Present in large quantities in adult humans (B) Mitochondrial content higher than white adipose tissue (C) Oxidation and phosphorylation are tightly coupled (D) Absent in hibernating animals

Last Answer : Answer : B

All the following statements about brown adipose tissue are true except (A) It is rich in cytochromes (B) It oxidizes glucose and fatty acids (C) Oxidation and phosphorylation are tightly coupled in it (D) Dinitrophenol has no effect on it

Description : All the following statements about brown adipose tissue are true except (A) It is rich in cytochromes (B) It oxidizes glucose and fatty acids (C) Oxidation and phosphorylation are tightly coupled in it (D) Dinitrophenol has no effect on it

Last Answer : Answer : C

Calculate the mutual inductance of two tightly coupled coils with inductances 49H and 9H. a) 21 b) 58 c) 40 d) 49/9

Description : Calculate the mutual inductance of two tightly coupled coils with inductances 49H and 9H. a) 21 b) 58 c) 40 d) 49/9

Last Answer : a) 21

An amount of money is to be distributed among P, Q and R in the ratio of 5:4:7 respectively. If the total share of P and R is 3 times the share of Q, what is definitely Q’s share? a) 2000 b) 4000 c) 6000 d) Data inadequate e) None of these

Description : An amount of money is to be distributed among P, Q and R in the ratio of 5:4:7 respectively. If the total share of P and R is 3 times the share of Q, what is definitely Q’s share? a) 2000 b) 4000 c) 6000 d) Data inadequate e) None of these

Last Answer : Answer: D 

Which of the following is not the function of Microkernel? A) File management B) Low-level memory management C) Inter-process communication D) I/O interrupts management

Description : Which of the following is not the function of Microkernel? A) File management B) Low-level memory management C) Inter-process communication D) I/O interrupts management

Last Answer : A) File management

Javascript and Java has similar name because ........... is/are true. (a) Javascripts syntax is loosely based on Java’s syntax (b) Javascript is stripped down version of Java (c) Java and Javascript are originated from Island of Java Codes : (A) (a) only (B) (a), (b) and (c) (C) (a) and (b) (D) (a) and (c)

Description : Javascript and Java has similar name because ........... is/are true. (a) Javascripts syntax is loosely based on Java's syntax (b) Javascript is stripped down version of Java (c) Java and Javascript are originated from Island of Java ... only (B) (a), (b) and (c) (C) (a) and (b) (D) (a) and (c)

Last Answer : Answer: A

In the following diagram, the path of a ray of light passing through a glass prism is shown: In this diagram the angle of incidence, the angle of emergence and the angle of deviation respectively are (select the correct option): (a) X, R and T (b) Y, Q and T (c) X, Q and P (d) Y, Q and P

Description : In the following diagram, the path of a ray of light passing through a glass prism is shown: In this diagram the angle of incidence, the angle of emergence and the angle of deviation respectively are (select the correct option): (a) X, R and T (b) Y, Q and T (c) X, Q and P (d) Y, Q and P

Last Answer : (d) Y, Q and P

Terminals are required for a. real-time, batch processing & time-sharing b. real time, time-sharing & distributed message processing c. real time, distributed processing & manager inquiry d. real-time, time sharing & message switching

Description : Terminals are required for a. real-time, batch processing & time-sharing b. real time, time-sharing & distributed message processing c. real time, distributed processing & manager inquiry d. real-time, time sharing & message switching

Last Answer : real-time, time sharing & message switching

In UNIX operating system, when a process creates a new process using the fork() system call, which of the following state is shared between the parent process and child process? (A) Heap (B) Stack (C) Shared memory segments (D) Both Heap and Stack

Description : In UNIX operating system, when a process creates a new process using the fork() system call, which of the following state is shared between the parent process and child process? (A) Heap (B) Stack (C) Shared memory segments (D) Both Heap and Stack

Last Answer : (C) Shared memory segments 

In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called (A) NTFS file system (B) Hardware abstraction layer (C) Microkernel (D) Process Manager

Description : In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called (A) NTFS file system (B) Hardware abstraction layer (C) Microkernel (D) Process Manager

Last Answer : (B) Hardware abstraction layer

A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K

Description : A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K

Last Answer : (B) 335 K

In the case of parallelization, Amdahl's law states that if P is the proportion of a program that can be made parallel and (1-P) is the proportion that cannot be parallelized, then the maximum speed-up that can be achieved by using N processors is: (A) 1/((1-P)+N.P) (B) 1/((N-1)P+P) (C) 1/((1-P)+P/N) (D) 1/(P+(1-P)/N)

Description : In the case of parallelization, Amdahl's law states that if P is the proportion of a program that can be made parallel and (1-P) is the proportion that cannot be parallelized, then the maximum speed-up that can be achieved by using N processors is ... ((N-1)P+P) (C) 1/((1-P)+P/N) (D) 1/(P+(1-P)/N)

Last Answer : (C) 1/((1-P)+P/N)

File management function of the operating system includes i) File creation and deletion ii) Disk scheduling iii) Directory creation iv) Mapping file in secondary storage. A) i, ii and iii only B) i, iii and iv only C) ii, iii and iv only D) All i, ii, iii and iv

Description : File management function of the operating system includes i) File creation and deletion ii) Disk scheduling iii) Directory creation iv) Mapping file in secondary storage. A) i, ii and iii only B) i, iii and iv only C) ii, iii and iv only D) All i, ii, iii and iv

Last Answer : B) i, iii and iv only

A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry? (A) 30 GB (B) 64 GB (C) 16 GB (D) 1 GB

Description : A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry? (A) 30 GB (B) 64 GB (C) 16 GB (D) 1 GB

Last Answer : (C) 16 GB

................. maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table

Description : ................. maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table

Last Answer : (C) Super block 

In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Description : In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Last Answer : (B) Linked

A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Description : A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each? (A) 32 GB (B) 64 GB (C) 16 GB (D) 1 GB

Last Answer : (C) 16 GB

Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B) An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the file’s data. (C) Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks.

Description : Which of the following information about the UNIX file system is not correct? (A) Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks. (B ... Each i-node is 256-bytes long. (D) All the files and directories are stored in data blocks. 

Last Answer : (C) Each i-node is 256-bytes long.

A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph. A) Weakly connected B) Strongly Connected C) Tightly Connected D) Linearly Connected

Description : A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph. A) Weakly connected B) Strongly Connected C) Tightly Connected D) Linearly Connected

Last Answer : B) Strongly Connected

Consider a disk queue with request for input/output to block on cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively (A) 236 and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Description : Consider a disk queue with request for input/output to block on cylinders  98, 183, 37, 122, 14, 124, 65, 67  in that order. Assume that disk head is initially positioned at cylinder 53 and moving ... and 252 cylinders (B) 640 and 236 cylinders (C) 235 and 640 cylinders (D) 235 and 252 cylinders

Last Answer : Answer: 236 and 208 cylinders Explanation: SSTF Initial head position =53 The closest queue to initial head position=65 head moves from 53 to 65=12 head moves from 65 to 67=2 head moves from 67 ... 122=24 head moves from 122 to 124=2 head moves from 124 to 183=59 Total head movement=208 

Truly effective communication: 1. Depends on using multiple channels 2. Depends on selecting the right method for each message and avoiding duplication, since everyone is overloaded with information 3. Cannot depend solely on non-verbal signals which might be misunderstood 4. Can only be achieved by communication professional 5. a, b and c

Description : Truly effective communication: 1. Depends on using multiple channels  2. Depends on selecting the right method for each message and avoiding duplication, since  everyone is overloaded with information  3. ... misunderstood  4. Can only be achieved by communication professional  5. a, b and c

Last Answer : 5. a, b and c

_________ is a data area shared by hardware devices or program processes that operate at different speeds or with different sets of priorities. A. Flash memory B. Virtual memory C. Buffer D. None of the Above

Description : _________ is a data area shared by hardware devices or program processes that operate at different speeds or with different sets of priorities. A. Flash memory B. Virtual memory C. Buffer D. None of the Above

Last Answer : C. Buffer

Which of the following genres does Hadoop produce? a) Distributed file system b) JAX-RS c) Java Message Service d) Relational Database Management System

Description : Which of the following genres does Hadoop produce? a) Distributed file system b) JAX-RS c) Java Message Service d) Relational Database Management System

Last Answer : Distributed file system

Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which the colour of each pixel is represented by a n-bit number, (in an 8 bit machines) is (A) n × 8 MB (B) n / 8 MB (C) (1024 × 1024) / 8 MB (D) 1024 MB

Description : Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which the colour of each pixel is represented by a n-bit number, (in an 8 bit machines) is (A) n × 8 MB (B) n / 8 MB (C) (1024 × 1024) / 8 MB (D) 1024 MB

Last Answer : (B) n / 8 MB

Which of the following statements is incorrect for Parallel Virtual Machine (PVM)? (A) The PVM Communication model provides asynchronous blocking send, asynchronous blocking receive and non-blocking receive function. (B) Message buffers are allocated dynamically. (C) The PVM communication model assumes that any task can send a message to any other PVM task and that there is no limit to the size or number of such messages. (D) In PVM Model, the message order is not preserved.

Description : Which of the following statements is incorrect for Parallel Virtual Machine (PVM)? (A) The PVM Communication model provides asynchronous blocking send, asynchronous blocking receive and non-blocking receive function. ... of such messages. (D) In PVM Model, the message order is not preserved. 

Last Answer : (D) In PVM Model, the message order is not preserved.

Data store in a DFD represents. A) a sequential file B) a disk store C) a repository of data

Description : Data store in a DFD represents. A) a sequential file B) a disk store C) a repository of data

Last Answer : C) a repository of data

A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a ……………. A) virtual memory, true memory B) virtual memory, real memory C) real memory, virtual memory D) imaginary memory, real memory

Description : A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a ……………. A) virtual memory, true memory B) virtual memory, real memory C) real memory, virtual memory D) imaginary memory, real memory

Last Answer : C) real memory, virtual memory

State true of false. i) With paging, each process is divided into relatively small, fixed-size pages. ii) Segmentation provides for the use of pieces of varying size. A) Partition management B) Memory management C) Disk management D) All of the above

Description : State true of false. i) With paging, each process is divided into relatively small, fixed-size pages. ii) Segmentation provides for the use of pieces of varying size. A) Partition management B) Memory management C) Disk management D) All of the above

Last Answer : B) Memory management

The ............... transfers the executable image of a C++ program from hard disk to main memory. (A) Compiler (B) Linker (C) Debugger (D) Loader

Description : The ............... transfers the executable image of a C++ program from hard disk to main memory. (A) Compiler (B) Linker (C) Debugger (D) Loader

Last Answer : (D) Loader

Superficially the term “object-oriented”, means that, we organize software as a (A) collection of continuous objects that incorporates both data structure and behaviour. (B) collection of discrete objects that incorporates both discrete structure and behaviour. (C) collection of discrete objects that incorporates both data structure and behaviour. (D) collection of objects that incorporates both discrete data structure and behaviour.

Description : Superficially the term object-oriented , means that, we organize software as a (A) collection of continuous objects that incorporates both data structure and behaviour. (B) collection of ... and behaviour. (D) collection of objects that incorporates both discrete data structure and behaviour.

Last Answer : (C) collection of discrete objects that incorporates both data structure and behaviour.

Which one of the following statements is false regarding the Distributed Cache? a) The Hadoop framework will ensure that any files in the Distributed Cache are distributed to all map and reduce tasks. b) The files in the cache can be text files, or they can be archive files like zip and JAR files. c) Disk I/O is avoided because data in the cache is stored in memory. d) The Hadoop framework will copy the files in the Distributed Cache on to the slave node before any tasks for the job are executed on that node.

Description : Which one of the following statements is false regarding the Distributed Cache? a) The Hadoop framework will ensure that any files in the Distributed Cache are distributed to all map and reduce tasks. b) ... Cache on to the slave node before any tasks for the job are executed on that node.

Last Answer : MapReduce tries to place the data and the compute as close as possible