Related InterviewSolutions

• Let pA be a problem that belongs to the class NP. Then which one of the following is TRUE?(A) There is no polynomial time algorithm for pA(B) If pA can be solved deterministically in polynomial time,then P = NP(C) If pA is NP-hard, then it is NP-complete.(D) pA may be undecidable.
• Which of the following statement(s)is / are correct regarding Bellman-Ford shortest path algorithm?P: Always finds a negative weighted cycle, if one exist s.Q: Finds whether any negative weighted cycle is reachable from the source. (A) P Only(B) Q Only(C) Both P and Q(D) Neither P nor Q
• A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because(A) It reduces the memory access time to read or write a memory location.(B) It helps to reduce the size of page table needed to implement the virtual address space of a process.(C) It is required by the translation lookaside buffer.(D) It helps to reduce the number of page faults in page replacement algorithms.
• The coupling between different modules of a software is categorized as follows: I. Content coupling II. Common coupling III. Control coupling IV. Stamp coupling V. Data coupling Coupling between modules can be ranked in the order of strongest (least desirable) to weakest (most desirable) as follows:(A) I-II-III-IV-V(B) V-IV-III-II-I(C) I-III-V -II-IV(D) IV-II-V-III-I
• What is the minimum number of gates required to implement the Boolean function (AB+C)if we have to use only 2-input NOR gates?(A) 2(B) 3(C) 4(D) 5
• The running time of an algorithm is represented by the following recurrence relation: if n <= 3 then T(n) = n else T(n) = T(n/3) + cnWhich one of the following represents the time complexity of the algorithm? <pre>(A) (n)(B) (n log n)(C) (n^2)(D) (n^2log n) </pre>(A) A(B) B(C) C(D) D
• Which one of the following in NOT necessarily a property of a Group?(A) Commutativity(B) Associativity(C) Existence of inverse for every element(D) Existence of identity
• Consider a disk system with 100 cylinders. The requests to access the cylinders occur in following sequence:4, 34, 10, 7, 19, 73, 2, 15, 6, 20Assuming that the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 1ms to move from one cylinder to adjacent one and shortest seek time first policy is used?(A) 95 ms(B) 119 ms(C) 233 ms(D) 276 ms
• The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows:void enter_CS(X){ while test-and-set(X) ;}void leave_CS(X){ X = 0;}In the above solution, X is a memory location associated with the CS and is initialized to 0. Now consider the following statements:I. The above solution to CS problem is deadlock-freeII. The solution is starvation free.III. The processes enter CS in FIFO order.IV More than one process can enter CS at the same time.Which of the above statements is TRUE?(A) I only(B) I and II(C) II and III(D) IV only
• How many 32K x 1 RAM chips are needed to provide a memory capacity of 256K-bytes?(A) 8(B) 32(C) 64(D) 128