Q2➡| Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die?
Q4➡| Consider the following statements: (a) Depth first search is used to traverse a rooted tree. (b) Preorder, Postorder and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman’s algorithm is used to find an optimal binary tree with given weights. (d) Topological sorting provides a labelling such that the parents have larger labels than their children. Which of the above statements are true?
Q5➡| Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? (a) deg (v) ≥ n / 2 for each vertex of G (b) |E(G)| ≥ 1 / 2 (n – 1) (n – 2) + 2 edges (c) deg (v) + deg (w) ≥ n for every n and v not connected by an edge.
Q6➡| Consider the following statements : (a)Boolean expressions and logic networks correspond to labelled acyclic digraphs. (b)Optimal boolean expressions may not correspond to simplest networks. (c)Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression. Which of these statement(s) is/are correct ?
Q7➡| Consider a full – adder with the following input values: (a)x = 1, y = 0 and C i (carry input) = 0 (b)x = 0, y = 1 and C i = 1 Compute the values of S(sum) and C o (carry output) for the above input values.
Q8➡| “If my computations are correct and I pay the electric bill, then I will run out of money. If I don’t pay the electric bill, the power will be turned off. Therefore, if I don’t run out of money and the power is still on, then my computations are incorrect.” Convert this argument into logical notations using the variables c, b, r, p for propositions of computations, electric bills, out of money and the power respectively. (Where ¬ means NOT)
Q10➡| Consider a proposition given as : “ x ≥ 6, if x 2 ≥ 5 and its proof as: If x ≥ 6, then x 2 = x.x ≥ 6.6 = 36 ≥ 25 Which of the following is correct w.r.to the given proposition and its proof? (a)The proof shows the converse of what is to be proved. (b)The proof starts by assuming what is to be shown. (c)The proof is correct and there is nothing wrong.
Q11➡| What is the output of the following program? (Assume that the appropriate preprocessor directives are included and there is no syntax error) main( ) { char S[ ] = “ABCDEFGH”; printf (“%C”, (&S[3])); printf (“%s”, S+4); printf (“%u”, S); / *Base address of S is 1000 */ }
Q14➡| Which of the following is incorrect in C++ ? (A) When we write overloaded function we must code the function for each usage. (B) When we write function template we code the function only once. (C) It is difficult to debug macros (D) Templates are more efficient than macros
Q17➡| Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock? (a) Z-Phase Locking (b) Timestamp ordering
Q19➡| Database applications were built directly on top of file system to overcome the following drawbacks of using file-systems: (a) Data redundancy and inconsistency (b) Difficulty in accessing Data (c) Data isolation (d) Integrity problems
Q20➡| For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as:
Q36➡| A disk drive has 100 cyclinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes 6 msec per cyclinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm?
Q37➡| Let P i and P j be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes P i and P j which of the following conditions is not true?
Q38➡| A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string 0172327103 if the four frames are initially empty?
Q40➡| The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of the following information is not the part of user structure?
Q46➡| 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:
Q47➡| Which of the following statements is incorrect for Parallel Virtual Machine (PVM) ?
i ➥ The PVM communication model provides asynchronous blocking send, asynchronous blocking receive, and non-blocking receive function.
ii ➥ Message buffers are allocated dynamically.
iii ➥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.
iv ➥In PVM model, the message order is not preserved.
