Related InterviewSolutions

• According to the ring algorithm, links between processes are ____________(a) bidirectional(b) unidirectional(c) both bidirectional and unidirectional(d) none of the mentionedI have been asked this question during an interview.This key question is from Distributed Synchronization topic in division Distributed File Systems of Operating System
• In distributed systems, election algorithms assumes that ____________(a) a unique priority number is associated with each active process in system(b) there is no priority number associated with any process(c) priority of the processes is not required(d) none of the mentionedI have been asked this question in an interview.This interesting question is from Distributed Synchronization in division Distributed File Systems of Operating System
• In case of failure, a new transaction coordinator can be elected by ____________(a) bully algorithm(b) ring algorithm(c) both bully and ring algorithm(d) none of the mentionedI have been asked this question in examination.My enquiry is from Distributed Synchronization topic in chapter Distributed File Systems of Operating System
• In distributed systems, what will the transaction coordinator do?(a) starts the execution of transaction(b) breaks the transaction into number of sub transactions(c) coordinates the termination of the transaction(d) all of the mentionedI had been asked this question in my homework.Query is from Distributed Synchronization in section Distributed File Systems of Operating System
• In the token passing approach of distributed systems, processes are organized in a ring structure ____________(a) logically(b) physically(c) both logically and physically(d) none of the mentionedI had been asked this question in an online quiz.This interesting question is from Distributed Synchronization topic in section Distributed File Systems of Operating System
• For proper synchronization in distributed systems ____________(a) prevention from the deadlock is must(b) prevention from the starvation is must(c) prevention from the deadlock & starvation is must(d) none of the mentionedThis question was addressed to me in my homework.My doubt stems from Distributed Synchronization topic in section Distributed File Systems of Operating System
• A process can enter into its critical section ____________(a) anytime(b) when it receives a reply message from its parent process(c) when it receives a reply message from all other processes in the system(d) none of the mentionedThe question was asked in homework.The above asked question is from Distributed Synchronization topic in chapter Distributed File Systems of Operating System
• If a process is executing in its critical section ____________(a) any other process can also execute in its critical section(b) no other process can execute in its critical section(c) one more process can execute in its critical section(d) none of the mentionedI got this question in an international level competition.The origin of the question is Distributed Synchronization in division Distributed File Systems of Operating System
• If timestamps of two events are same, then the events are ____________(a) concurrent(b) non-concurrent(c) monotonic(d) non-monotonicI got this question during a job interview.This interesting question is from Distributed Synchronization topic in chapter Distributed File Systems of Operating System
• In distributed systems, a logical clock is associated with ______________(a) each instruction(b) each process(c) each register(d) none of the mentionedI have been asked this question in an internship interview.This key question is from Distributed Synchronization in portion Distributed File Systems of Operating System