Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

The line graph L(G) of a simple graph G is defined as follows: There is exactly one vertex v(e) in L(G) for each edge e in G. For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e' are incident with the same vertex in G. Which of the following statements is/are TRUE? (P) The line graph of a cycle is a cycle. (Q) The line graph of a clique is a clique. (R) The line graph of a planar graph is planar. (S) The line graph of a tree is a tree.
Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is ?. Three semaphores empty, full and mutex are defined with respective initial values of 0, ? and 1. Semaphore empty denotes the number of available slots in the buffer, for the consumer to read from. Semaphore denotes the number of available slots in the buffer, for the producer to write to. The placeholder variables, denoted by P, Q, R, and S, in the code below can be assigned either empty or full. The valid semaphore operations are: wait ( ) and signal ( ). Producer: Consumer: do {         wait (P) ;         wait (mutex) ;         //Add item to buffer         signal (mutex) ;         signal (Q) ; } while (1) ; do {          wait (R) ;          wait (mutex) ;          //Consume item from buffer          signal (mutex) ;          signal (S) ; } while (1) ;   Which one of the following assignments to P, Q, R and S will yield the correct solution?
This question comprises 3 sentences - A, B and C each of which comprises a sentence using the word WAIT. Identify the sentences where the word has been correctly used and mark that combination (A) Wait your options before investing (B) How long must we wait? (C) The longer we wait time the less is the chance of recovery
Consider the following threads, T1, T2, and T3 executing on a single processor, synchronized using three binary semaphore variables, S1, S2, and S3, operated upon using standard wait() and signal(). The threads can be context switched in any order and at any time. T1 T2 T3 While(true) { Wait(S3); Print(“C”); Signal (S2); } While(true) { Wait(S1); Print(“B”); Signal (S3); } While(true) { Wait(S2); Print(“A”); Signal (S1); }   Which initialization of the semaphores would print the sequence BCABCABCA….?
The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0=1, S1=0, S2=0. Process P0 Process P1 Process P2 While (true) { Wait (S0); Print ‘0’ Release (S1); Release (S2); } Wait (S1); Release (S0); Wait (S2); Release (S0);   How many times will process P0 print ‘0’? 
Group I shows different heat addition processes in power cycles. Likewise, Group II shows different heat removal processes. Group III lists power cycles. Match items from Groups I, II and III. Group I Group II Group III P. Pressure constant S. Pressure constant 1. Rankine cycle Q. Volume constant T. Volume constant 2. Otto cycle R. Temperature constant U. Temperature constant 3. Carnot cycle     4. Diesel cycle     5. Brayton cycle
Which of the following are examples of the sedimentary biogeochemical cycle? A) Nitrogen cycle B) Carbon cycle C) Sulphur cycle D) Phosphorous cycle Select the correct answer using the code given below
1. A student drew a neat and error-free graph on a graph paper basing on the given data relating to physics. 2. The student answered the questions based on the graph correctly. 3. The student predicted the trend of the graph correctly by studying its nature. Out of the knowledge, understanding, application and skill based educational objectives, the above mentioned facts are based altogether on how many objectives?
There are four students in a class namely A, B, C and D. A tells that a triangle is a bipartite graph. B tells pentagon is a bipartite graph. C tells square is a bipartite graph. D tells heptagon is a bipartite graph. Who among the following is correct?
Which of the following statements are TRUE? 1. The problem of determining whether there exists a cycle in an undirected graph is in P. 2. The problem of determining whether there exists a cycle in an undirected graph is in NP. 3. If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.