DC SAMPLE QB A.

P SHAH CLUSTER

MODULE 1
Q A Parallel computer is the computer system capable of M 1
A Parallel Computing 1 1
A Centralized Computing 0 2
A Decentralized Computing 0 3
A Distributed Computing 0 4
Q A distributed computer running a distributed program is known as M 1
A Distributed Process 0 1
A Distributed Application 0 2
A Distributed Computing 0 3
A Distributed Program 1 4
Q Uni processor computing is known as M 1
A Centralized Computing 1 1
A Parallel Computing 0 2
A Distributed Computing 0 3
A Grid Computing 0 4
Q Which of the following is true about heterogeneous architecture? M 1
A There is no mixed architecture style at one abstraction level 0 1
A Heterogeneous architecture implies increased time efficiency 0 2

If the general structure of a system is connected using one architecture style, and each component 1
A can use a different one, this is one example of heterogeneous architecture 3
A Heterogeneous architecture implies decreased time efficiency 0 4
Q The transparency that enables multiple instances of resources to be used, is called M 1
A Replication transparency 1 1
A Scaling transparency 0 2
A Concurrency transparency 0 3
A Performance transparency 0 4
A paradigm of multiple autonomous computers, having a private memory, communicating through M
Q a computer network, is known as 1
A Distributed computing 1 1
A Cloud computing 0 2
A Centralized computing 0 3
A Parallel computing 0 4
Q Multithreading is also called as ____________ M 1
A Concurrency 1 1
A Simultaneity 0 2
A Crosscurrent 0 3
A Recurrent 0 4
Q The technique that increases the system’s productivity. M 1
A multiprogramming 1 1
A multitasking 0 2
A multiprocessing 0 3
A single-programming 0 4
Q Multithreading is also called as ____________ M 1
A Concurrency 1 1
A Simultaneity 0 2
A Crosscurrent 0 3
A Recurrent 0 4
A technique that allows more than one program to be ready for execution and provides the ability M
Q to switch from one process to another. 1
A multitasking 0 1
A multiprocessing 0 2
A multitasking 0 3
A multiprogramming 1 4
Q Multiprogramming is mainly accomplished by: M 1
A os 1 1
A software 0 2
A hardware 0 3
A program 0 4
In a multi-processor configuration two coprocessors are connected to host 8086 processor. The M
Q instruction sets of the two coprocessors 1
A must be same 0 1
A may overlap 0 2
A must be disjoint 0 3
A must be the same as that of host 1 4
Q Multiprogramming systems: M 1
A Are easier to develop than single programming systems 0 1
A Execute each job faster 0 2
A Execute more jobs in the same time period 1 3
A Are used only one large mainframe computers 0 4
Q A multiprocessor operating system must take care of M 1
A authorized data access and data protection 0 1
A unauthorized data access and data protection 1 2
A authorized data access 0 3
A data protection 0 4
With ................ only one process can execute at a time; meanwhile all other process are waiting
for the processer. With .............. more than one process can be running simultaneously each on a M
Q different processer. 1
A Multiprocessing, Multiprogramming 0 1
A Multiprogramming, Uniprocessing 0 2
A CMultiprogramming, Multiprocessing 0 3
A Uniprogramming, Multiprocessing 1 4
Q Asymmetric multiprocessing systems of the computer system use M 1
A master relationship 0 1
A slave relationship 0 2
A master slave relationship 1 3
A serial processing 0 4
Q What of the following system is not multi-processor system? M 1
A A system with multiple CPU, each CPU contains a single core. 0 1
A A system with a single CPU that has two core. 0 2
A A system with multiple CPU, each CPU contains two cores. 0 3
A A system with a single CPU that has a single core. 1 4
Q Which of the following is not an advantage of multiprocessor systems M 1
A Increased throughput 0 1
A Economy of scale 0 2
A Increased reliability 0 3
A Optimise the program size 1 4

MODULE 2
Q What is the other name for object middleware? M 1
A Object request interface 0 1
A Object Request broker 1 2
A Object enabled broker 0 3
A Object enabled interface 0 4
Q A “glue” between client and server parts of application. M 1
A Middleware 1 1
A Firmware 0 2
A Package 0 3
A System Software 0 4
A type of middleware that allows for between the built-in applications and the real-time OS? M
Q 1
A Firmware 0 1
A Embedded Middleware 1 2
A Database middleware 0 3
A Portals 0 4
Q Middleware forms a layer between M 1
A application and distributed platforms 1 1
A several individual computers 0 2
A application and client 0 3
A server and client 0 4
Q Middleware systems follow M 1
A middleware solution 0 1
A specific model 0 2
A specific architecture style 1 3
A specific protocol 0 4
A typical _________ program creates some remote objects, makes references to these objects
M
Q accessible, and waits for clients to invoke methods on these objects. 1
A Server 1 1
A Client 0 2
A Thread 0 3
A Concurrent 0 4
Q From the following which is not a type of Communication M 1
A Persistent and transient communication 0 1
A Synchronous and asynchronous communication 0 2
A Persistent synchronous and persistent asynchronous communication 0 3
A Non persistent communication 1 4
Q What is true about asynchronous communication M 1
1
A in asynchronous communication most of the time there is no reply from the reciever end 1
A Sender and reciver process need to be active at the time of communication 0 2
A it uses procedure calling at the server's side 0 3
A in asynchronous communication there is always a reply from the reciever end 0 4
An email service is a typical example of messaging service, where a sender sends an email
message to recipient.
M
Q 1
A It never waits for a reply from the recipient 1 1
A it always waits for a reply from the reciepient before sending next 0 2
A it will always send the reply email message to the sender. 0 3
A it is a type of synchronous communication 0 4
Q Which of the following is not a classification of group communication? M 1
A One to Many 0 1
A Many to one 0 2
A Many to Many 0 3
A Many to All 1 4
Which of the following is not commonly used semantics for ordered delivery of multicast
messages are:
M
Q 1
A Absolute Ordering 0 1
A Consistent Ordering 0 2
A Casual 0 3
A Non- Casual 1 4
Q The data sequence of information that is time-dependent is called ___________ M 1
A Stream of data 1 1
A traditional data 0 2
A transactional data 0 3
A spatial data 0 4
Q Which of the following is not an example of stream data M 1
A Video 0 1
A Audio 0 2
A large data files 0 3
A text 1 4
Q MPI and sockets are examples of M 1
A Message oriented transient communication 1 1
A message oriented persistent communication 0 2
A Mobile Oriented Communication 0 3
A Object oriented permanent Communication 0 4
Q The sever and client computer interact with each other using ________ M 1
A Specific Port Number and IP Address 1 1
A MAC Address 0 2
A MAC Address and Port Number 0 3
A MAC Address and IP Address 0 4
In consistent ordering when recieving the message each member calculate its proposed sequence
number by using the function____________
M
Q 1
A max(Fmax, Pmax) + I + i/N 1 1
A min(Fmax, Pmax) + I + i/N 0 2
A min(Fmin, Pmax) + I + i/N 0 3
A max(Fmin, Pmin) + I + i/N 0 4
A socket uses ____________ to transmit data between the sender and the reciever. M
Q 1
A IPC 1 1
A IMC 0 2
A IBC 0 3
A API 0 4
The Resource Reservation Protocol is __________________ layer protocol designed to reserver
Q resources in Distributed Computing. 1
A Transport Layer 1 1
A Network Layer 0 2
A Interface Layer 0 3
A Internet Layer 0 4

MODULE 3

Q Which of the following disadvantages follows the single coordinator approach? M 1

A Bottleneck 1 1
A Slow response 0 2
A Deadlock 0 3
A One request per second 0 4

M 1
Q Which are the two complementary deadlock-prevention schemes using timestamps?
A The wait-die & wound-wait scheme 1 1
A The wait-n-watch scheme 0 2
A The wound-wait scheme 0 3
A The wait-wound & wound-wait scheme 0 4
Q A process can enter into its critical section ____________ M 1
A anytime 0 1
A when it receives a reply message from its parent process 0 2
A when it receives a reply message from all other processes in the system 1 3
A when it receives a reply message from its child process 0 4
Q If a process is executing in its critical section ____________ M 1
A any other process can also execute in its critical section 0 1
A no other process can execute in its critical section 1 2
A one more process can execute in its critical section 0 3
A every process can execute in its critical section 0 4
Q In distributed systems, a logical clock is associated with ______________ M 1
A each instruction 0 1
A each process 1 2
A each register 0 3
A Many registers 0 4

M 1
Q When resources have multiple instances ________ is used for deadlock Avoidance.
A Bankers algorithm 1 1
A Resource Allocation Graph 0 2
A Semaphores 0 3
A Phishing 0 4
Q Synchronization tool is? M 1
A thread 0 1
A pipe 0 2
A semaphore 1 3
A socket 0 4

In which the access takes place when different processes try to access the same data concurrently
and the outcome of the execution depends on the specific order, is called M 1
Q
A dynamic condition 0 1
A race condition 1 2
A essential condition 0 3
A critical condition 0 4
Q Process synchronization can be done on which of the following levels M 1
A hardware 0 1
A software 0 2
A both hardware and software 1 3
A BIOS 0 4

M 1
Q Which of the following process can be affected by other processes during execution in the system?
A init process 0 1
A child process 0 2
A parent process 0 3
A cooperating process 1 4
Q How can we avoid deadlock M 1
A Resource Allocation must be done at once 0 1
A there must be a fixed number of resources to allocate 1 2
A all deadlock process must be aborted 0 3
A inversion technique can be used 0 4
 A minimum of _____ variable(s) is/are required to be shared between processes to solve the M 1
Q critical section problem.
A 1 0 1
A 2 1 2
A 3 0 3
A 4 0 4

M 1
Q Which of the following conditions is not requied to solve the critical section problem?
A Mutual Exclusion 0 1
A Progress 0 2
A Bounded Waiting 0 3
A Sharing 1 4
The segment of code in which the process may change common variables, update tables, write into M 1
Q files is known as ____________
A program 0 1
A critical section 1 2
A non – critical section 0 3
A synchronizing 0 4
A situation where several processes access and manipulate the same data concurrently and the
outcome of the execution depends on the particular order in which access takes place is called M 1
Q ____________
A Data consistency 0 1
A race condition 1 2
A aging 0 3
A starvation 0 4

MODULE 4
The address of the next instruction to be executed by the current process is provided by the
__________
M 1
Q
A Program counter 1 1
A CPU registers 0 2
A Process stack 0 3
A Pipe 0 4
Q Which system call returns the process identifier of a terminated child? M 1
A wait 1 1
A exit 0 2
A fork 0 3
A get 0 4

A thread shares its resources(like data section, code section, open files, signals) with ___________ M 1
Q
A other process similar to the one that the thread belongs to 0 1
A other threads that belong to similar processes 0 2
A other threads that belong to the same process 1 3
A different threads that belong to the different process 0 4

_________________ is often used for implementing specialized threads within a process. M 1

Q
A Team model 1 1
A Dispatcher worker model 0 2
A Pipeline model 0 3
A Light model 0 4

M 1
Q The capability of a system to adapt the increased service load is called ___________
A scalability 1 1
A tolerance 0 2
A capacity 0 3
A polling 0 4
Q Logical extension of computation migration is M 1
A process migration 1 1
A system migration 0 2
A thread migration 0 3
A data migration 0 4

M 1
Q No special machines manage the network of architecture in which resources are known as
A Peer-to-Peer 1 1
A Space based 0 2
A Tightly coupled 0 3
A Loosely coupled 0 4
Q Scheduuling of threads done by M 1
A input 0 1
A output 0 2
A operating system 1 3
A memory 0 4
Q For execution on process need M 1
A Throughput 0 1
A Timer 0 2
A Resources 1 3
A Access Time 0 4
Q Message passing system allows processes to __________ M 1
A communicate with one another without resorting to shared data 1 1
A communicate with one another by resorting to shared data 0 2
A share data 0 3
A name the recipient or sender of the message 0 4
Q Which is not an examples of state information ? M 1
A Mounting information 0 1
A Description of HDD space 1 2
A Session keys 0 3
A Lock status 0 4
Q Which policy used in load balancing algorithm M 1
A standard policy 0 1
A variant policy 0 2
A location policy 1 3
A random policy 0 4
Q Select the correct sequence for process migration M 1
freezing the process- Transfer the process- forward the message- communicate between 1 1
A cooperating process
Transfer the process- forward the message- communicate between cooperating process-freezing 0 2
A the process
forward the message- communicate between cooperating process-freezing the process- Transfer 0 3
A the process
communicate between cooperating process-freezing the process- Transfer the process- forward the 0 4
A message
____ can be defined as a lightweight process, a part of process which is to be executed M 1
Q sequentially on one core
A method 0 1
A Thread 1 2
A virtualization 0 3
A client server 0 4
Q _____ is defined as that feeling something when it is not actually present M 1
A method 0 1
A Thread 0 2
A virtualization 1 3
A client server 0 4
Q What is common problem found in distributed system ? M 1
A Process Synchronization 0 1
A Communication synchronization 0 2
A Deadlock problem 1 3
A Power failure 0 4

What are the advantages of token(with rings) passing approach ? I. One processor as coordinator
which handles all requests II. No starvation if the ring is unidirectional III. There are many M 1
messages passed per section entered if few users want to get in section IV. One processor as
Q coordinator which handles all requests V. Only one message/entry if everyone wants to get in
A I, II and V 0 1
A I, II and IV 1 2
A II, III and IV 0 3
A II, IV and V 0 4

M 1
Q Which are the two complementary deadlock-prevention schemes using time stamps ?
A The wait-die & wound-wait scheme 1 1
A The wait-n-watch scheme 0 2
A The wound-wait scheme 0 3
A The wait-wound & wound-wait scheme 0 4
In wound-wait If a young process wants a resource held by an old process, the young process will M 1
Q _____
A Killed 0 1
A Wait 1 2
A Preempt 0 3
A Restarts and wait 0 4
Q Election message is always sent to the process with _______ M 1
A Lower numbers 0 1
A Waiting processes 0 2
A Higher numbers 1 3
A Requesting Lower number of resources 0 4

Which algorithms are used for selecting a process to act as coordinator or sequencer? I. M 1
Q Centralized algorithm II. Election algorithm III. Ring algorithm IV. Chandy-Misra-Haas algorithm
A II and IV 0 1
A II, III, IV 0 2
A II and III 1 3
A II 0 4
Q What is interprocess communication? M 1
A communication within the process 0 1
A communication between two process 1 2
A communication between two threads of same process 0 3
A Comunication of process 0 4

M 1
Q _____________ enables the migration of the virtual image from one physical machine to another.
A Visualization 0 1
A Virtualization 1 2
A Migration 0 3
A Virtual transfer 0 4
Q If one thread opens a file with read privileges then ___________ M 1
A other threads in the another process can also read from that file 0 1
A other threads in the same process can also read from that file 0 2
A any other thread can not read from that file 0 3
A all of the mentioned 1 4

MODULE 5

Q A replica set can have only ________ primary. M 1

A One 1 1
A two 0 2
A three 0 3
A zero 0 4
Q Two types of subscriptions present for replication is _____________ M 1
A push and pull 1 1
A throw and pull 0 2
A push and throw 0 3
A Pull and throw 0 4
Q _________ class contains an implementation of a proxy. M 1
A client 1 1
A server 0 2
A RMI 0 3
A object 0 4
Q In GFS, Chunk replicas are created for three reasons: ___________________ M 1
A chunk creation, re-replication, and rebalancing 1 1
A chunk deletion, re-replication, and rebalancing 0 2
A chunk creation, re-replication, and resharing 0 3
A chunk creation, chunk deletion, and rebalancing 0 4
Hide differences in data representation and how a resource is accessed” which type of
transparency is this? M
Q
A Relocation 0 1
A Failure 0 2
A Concurrency 0 3
A Access 1 4
Q Logical extension of computation migration is M
A process migration 1 1
A system migration 0 2
A thread migration 0 3
A data migration 0 4
Q Processes on the remote systems are identified by ___________ M
A host ID 0 1
A host name and identifier 1 2
A identifier 0 3
A process ID 0 4
Q To what extent inconsistencies can be tolerated depends highly on the usage of a M
A replication 0 1
A duplication 0 2
A resource 1 3
A data 0 4

The ----------- of distributed system is determined primarily by the degree to which new resource- M
Q sharing services can be added and be made available for use by a variety of client programs
A Openness 1 1
A Resource Sharing 0 2
A Transparency 0 3
A Scalability 0 4
Q Hide that a resource is replicated is known as___________transparency M
A Replication 1 1
A Location 0 2
A Migration 0 3
A Relocation 0 4
Q Hide the failure and recovery of a resource is known as which transparency M
A Failure 1 1
A Location 0 2
A Migration 0 3
A Relocation 0 4
Q Hide where a resource is located which type of transparency is this? M
A Location 1 1
A Migration 0 2
A Relocation 0 3
A Access 0 4
Q What is WPA? M 1
A wi-fi protected access 1 1
A wired protected access 0 2
A wired process access 0 3
A wi-fi process access 0 4
Q Which is not an examples of state information ? M 1
A Mounting information 0 1
A Description of HDD space 1 2
A Session keys 0 3
A Lock status 0 4
Q What are the advantages of file replication ? M 1
A Improves availability &performance 1 1
A Decreases performance 0 2
A They are consistent 0 3
A Improves speed 0 4
The portion of the process scheduler in an operating system that dispatches processes is
M
Q concerned with ____________ 1
A assigning ready processes to CPU 1 1
A assigning ready processes to waiting queue 0 2
A assigning running processes to blocked queue 0 3
A assigning new processes to cpu 0 4
Q What are the characteristics of data migration? M 1
A transfer data by entire file or immediate portion required 1 1
A transfer the computation rather than the data 0 2
A execute an entire process or parts of it at different sites 0 3
A execute limited portion of data 0 4
Q What are the characteristics of process migration? M 1
A transfer data by entire file or immediate portion required 0 1
A transfer the computation rather than the data 0 2
A execute an entire process or parts of it at different sites 1 3
A execute limited portion of data 0 4
Q Which one of the following is not shared by threads? M 1
A program counter 0 1
A stack register 0 2
A program counter and stack 1 3
A register 0 4
Q A process can be ___________ M 1
A single threaded 0 1
A tripalthreaded 0 2
A single threaded and multithreaded 1 3
A doublethreaded 0 4
Q Replication should be used when which of the following exist? M 1
When transmission speeds and capacity in a network prohibit frequent refreshing of large
0
A tables. 1
0
A When using many nodes with different operating systems and DBMSs and database designs. 2
A The application's data can be somewhat out-of-date. 1 3
A When using some nodes with selected operating system. 0 4
M
Q Storing a separate copy of the database at multiple locations is which of the following? 1
A Data Replication 1 1
A Horizontal Partitioning 0 2
A Vertical Partitioning 0 3
A Horizontal and Vertical Partitioning 0 4
Q A distributed database is which of the following? M 1
1
A A single logical database that is spread to multiple locations and is interconnected by a network 1
0
A A loose collection of file that is spread to multiple locations and is interconnected by a network 2
A A single logical database that is limited to one location. 0 3
A A loose collection of file that is limited to one location. 0 4
Q Which of the following is a disadvantage of replication? M 1
A Reduced network traffic 0 1
A If the database fails at one site, a copy can be located at another site. 0 2
A Each site must have the same storage capacity. 1 3
A Each transaction may proceed without coordination across the network. 0 4
 Message passing provides a mechanism to allow processes to communicate and to synchronize
M
Q their actions ________ 1
A By sharing the same address space 1 1
A without sharing the same address space 0 2
A by sharing the same Process Identifier 0 3
A by sharing the same process number 0 4
Q Which layer is the layer closest to the transmission medium ? M 1
A Physical 1 1
A Data link 0 2
A Network 0 3
A Transport 0 4
Q A group server is responsible for_______ & ________ groups M 1
A clean and deduct 0 1
A program and make funtional 0 2
A create and destroy 1 3
A advance and fail 0 4
TCP is reliable _______ protocol which supports reliable point to point communication in
M
Q distributed system. 1
A network 0 1
A transport 1 2
A communication 0 3
A system 0 4
Q Communication channels may suffer through M 1
A protocol 0 1
A transport 0 2
A arbitrary failures 1 3
A reliable communication 0 4
Q Arbitrary failure may ouccur in form of M 1
A duplicate message 1 1
A protocol 0 2
A reliable communication 0 3
A address spacde 0 4
Q SRM protocol stands for M 1
A Scalable Reliable Multispreading 0 1
A Scalable Recovery Multicasting 0 2
A Scalable Reliable Multicasting 1 3
A Scalable Recovery Multispreading 0 4
Q In RPC system, which of the following failure may not occur M 1
A The client cannot locate server 0 1
A The client crashes after sending a request 0 2
A The server crashs after receiving a request 0 3
A The request message from the client to the server is obtained 1 4
 MODULE 6

Q Hide the failure and recovery of a resource is known as which transparency M

A Failure 1 1
A Location 0 2
A Migration 0 3
A Relocation 0 4
Q Hide where a resource is located which type of transparency is this? M
A Location 1 1
A Migration 0 2
A Relocation 0 3
A Access 0 4
Q What is WPA? M 1
A wi-fi protected access 1 1
A wired protected access 0 2
A wired process access 0 3
A wi-fi process access 0 4
Q Which is not an examples of state information ? M 1
A Mounting information 0 1
A Description of HDD space 1 2
A Session keys 0 3
A Lock status 0 4
Q What are the advantages of file replication ? M 1
A Improves availability &performance 1 1
A Decreases performance 0 2
A They are consistent 0 3
A Improves speed 0 4
The portion of the process scheduler in an operating system that dispatches processes is concerned M
Q with ____________ 1
A assigning ready processes to CPU 1 1
A assigning ready processes to waiting queue 0 2
A assigning running processes to blocked queue 0 3
A assigning new processes to cpu 0 4
Q What are the characteristics of data migration? M 1
A transfer data by entire file or immediate portion required 1 1
A transfer the computation rather than the data 0 2
A execute an entire process or parts of it at different sites 0 3
A execute limited portion of data 0 4
Q What are the characteristics of process migration? M 1
A transfer data by entire file or immediate portion required 0 1
A transfer the computation rather than the data 0 2
A execute an entire process or parts of it at different sites 1 3
A execute limited portion of data 0 4
Q Which one of the following is not shared by threads? M 1
A program counter 0 1
A stack register 0 2
A program counter and stack 1 3
A register 0 4
Q A process can be ___________ M 1
A single threaded 0 1
A tripalthreaded 0 2
A single threaded and multithreaded 1 3
A doublethreaded 0 4
Q Replication should be used when which of the following exist? M 1
0
A When transmission speeds and capacity in a network prohibit frequent refreshing of large tables. 1
0
A When using many nodes with different operating systems and DBMSs and database designs. 2
A The application's data can be somewhat out-of-date. 1 3
A When using some nodes with selected operating system. 0 4
M
Q Storing a separate copy of the database at multiple locations is which of the following? 1
A Data Replication 1 1
A Horizontal Partitioning 0 2
A Vertical Partitioning 0 3
A Horizontal and Vertical Partitioning 0 4
Q A distributed database is which of the following? M 1
1
A A single logical database that is spread to multiple locations and is interconnected by a network 1
0
A A loose collection of file that is spread to multiple locations and is interconnected by a network 2
A A single logical database that is limited to one location. 0 3
A A loose collection of file that is limited to one location. 0 4
Q Which of the following is a disadvantage of replication? M 1
A Reduced network traffic 0 1
A If the database fails at one site, a copy can be located at another site. 0 2
A Each site must have the same storage capacity. 1 3
A Each transaction may proceed without coordination across the network. 0 4
Message passing provides a mechanism to allow processes to communicate and to synchronize M
Q their actions ________ 1
A By sharing the same address space 1 1
A without sharing the same address space 0 2
A by sharing the same Process Identifier 0 3
A by sharing the same process number 0 4
Q Which layer is the layer closest to the transmission medium ? M 1
A Physical 1 1
A Data link 0 2
A Network 0 3
A Transport 0 4
Q A group server is responsible for_______ & ________ groups M 1
A clean and deduct 0 1
A program and make funtional 0 2
A create and destroy 1 3
A advance and fail 0 4
TCP is reliable _______ protocol which supports reliable point to point communication in M
Q distributed system. 1
A network 0 1
A transport 1 2
A communication 0 3
A system 0 4
Q Communication channels may suffer through M 1
A protocol 0 1
A transport 0 2
A arbitrary failures 1 3
A reliable communication 0 4
Q Arbitrary failure may ouccur in form of M 1
A duplicate message 1 1
A protocol 0 2
A reliable communication 0 3
A address spacde 0 4
Q SRM protocol stands for M 1
A Scalable Reliable Multispreading 0 1
A Scalable Recovery Multicasting 0 2
A Scalable Reliable Multicasting 1 3
A Scalable Recovery Multispreading 0 4
Q In RPC system, which of the following failure may not occur M 1
A The client cannot locate server 0 1
A The client crashes after sending a request 0 2
A The server crashs after receiving a request 0 3
A The request message from the client to the server is obtained 1 4
Which application-level protocol plays a crucial role in carrying out the data definition and M
Q manipulation in addition to X-500 features? 1
A TCP 0 1
A LDAP 1 2
A FTP 0 3
A UDP 0 4

X.500 Directory Service is a standard way to develop an electronic directory of people in an M

Q organization so that it can be part of a available to anyone in the world with Internet access. 1
A social directory 0 1
A local directory 0 2
A global directory 1 3
A personal directory 0 4
Q X.500 Directory is also called M 1
A global Yellow Pages directory 0 1
A global Blue Pages directory 0 2
A global White Pages directory 1 3
A global Black Pages directory 0 4
In X.500 Directory you can search for hundreds of thousands of people from a single place on the M
Q _______________. 1
A World Wide Web. 1 1
A at one place 0 2
A World directory 0 3
A Words largest file 0 4
The distributed global directory works through a __________________ and one or more central M
Q places that manage many directories. 1
A registration process 1 1
A saccession process 0 2
A application process 0 3
A distribution process 0 4
Q X.500 directory uses _______. M 1
A User Information Tree 0 1
A Directory Information Tree 1 2
A Person Information Tree 0 3
A system Information Tree 0 4
Q In X.500, each local directory is called a _____________________. M 1
A Directory System Agent 1 1
A Local System Agent 0 2
A Personal System Agent 0 3
A Secret System Agent 0 4
M
Q In X.500 the user interface program for access to one or more DSAs is a ___________________. 1
A Directory User Agent 1 1
A System User Agent 0 2
A Network User Agent 0 3
A World User Agent 0 4
Q DUAs include whois, finger, and programs that offer a_____________. M 1
A graphical user interface. 1 1
A system interface. 0 2
A Local user interface. 0 3
A global user interface. 0 4
M
Q X.500 is implemented as part of the ______________ in its Global Directory Service 1
A Distributed Computing Environment 1 1
A User fraindly Environment 0 2
A Global Computing Environment 0 3
A World Computing Environment 0 4
M
Q X.500 is a way to route e-mail as well as to provide name lookup, using the _________________. 1
A Lightweight Directory Access Protocol 1 1
A Directory Access Protocol 0 2
A Global Directory Access Protocol 0 3
A Local Directory Access Protocol 0 4
Q X.500 is a series of ________________ covering electronic directory services. M 1
A system standards 0 1
A networking standards 0 2
A computer networking standards 1 3
A operating system standards 0 4
Q The protocols defined by X.500 include M 1
A DISP,DOP 1 1
A TCP,IP 0 2
A ISO,OSI 0 3
A IP 0 4
GNS allows you to locate services via an _________ wherever the service is located, whether on M
Q the local system or on a remote node. 1
A user name 0 1
A arbitrary name 1 2
A system name 0 3
A address name 0 4
The ___________ can be deployed such that it services all or a portion of your Qnet nodes. And M
Q you can have redundant GNS servers. 1
A GNS server 1 1
A IS server 0 2
A DNS server 0 3
A system server 0 4
Q Google Distributed System is M 1
A arbitrary system 0 1
A search engine is now a major player in cloud computing. 1 2
A GNS server 0 3
A computer networking standards 0 4
Q Google is a _______based corporation M 1
A Japan 0 1
A US 1 2
A Rasia 0 3
A UK 0 4
M
Q Google was born out of a research project at Standford with the company launched in 1
A 1995 0 1
A 1992 0 2
A 1997 0 3
A 1998 1 4
Q In global google sysytem The user can expect query result in M 1
A 0.7 seconds 0 1
A 0.4 seconds 0 2
A 0.2 seconds 1 3
A 0.8 seconds 0 4
to locate and retrieve the contents of the web and pass the content onto the indexing subsystem. M
Q Performed by a software called 1
A Googlebot. 1 1
A Gobot. 0 2
A bot. 0 3
A lebot. 0 4
Q In global google sysytem indexing define as M 1
A index for the contents of the web that is similar to an index at the back of a book 1 1
A Serial nos 0 2
A Serial nos in parrallel 0 3
A index of data 0 4
In global google system index of links is also M
Q maintained to keep track of 1
A links to a given site 1 1
A links of user 0 2
A links to programs 0 3
A links of user queries 0 4
Q In global google system Ranking algorithm is called M 1
A SyatemRank 0 1
A LinkRank 0 2
A PageRank 1 3
A IPRank 0 4
In global google system offering application-level software over the Internet M
Q as 1
A web application 1 1
A user application 0 2
A link application 0 3
A system application 0 4
Q With the launch of Google App Engine, Google went beyond _____________. M 1
A software as a service 1 1
A service provider 0 2
A quality as a service 0 3
A data as a service 0 4
M
Q Other organizations are able to run their ______________on the Google platform. 1
A own web applications 1 1
A own services 0 2
A own queries 0 3
A own network programs 0 4