You are on page 1of 4

1. A router has an IP address of

It sends “direct broadcast packet” and “limited broadcast packet” to all hosts in the same network. The destination IP addresses used in these packets could be: a., b., c., d. Ans (a) 2. An organization is granted the block The administrator wants to create 500 fixed-length subnets then the number of addresses in each subnets will be: a. 512 b. 1024 c. 16384 d. 32768 Ans (d) 3. A group of N stations share a 56-kbps pure ALOHA channels. Each station outputs a 1000-bit frame on an average of once every 100sec, even if the previous one has not been yet sent. What can be the maximum value of N? a. 510 b. 1008 c. 1020 d. 1125 Ans (b) 4. The number of different join orders with N relations are a. N! b. (2(N-1))! / N! c. (2(N-1))! / ((N-1)! d. (2(N-1))! / ((N+1)! Ans (c) 5. Lowest-cost join order can be computed in time a. O(2n) b. O(3n) c. O(n2) d. O(n3) Ans (b) 6. Level order traversal of a rooted tree can be done by starting from the root and performing a. Preorder traversal b. Postorder traversal c. DFS d. BFS

} else { a = a . 60. printf (“%d. 29. Every internal node has exactly k children. which one of the following is FALSE? a. 22.y be the values printed by the child process. 9. T(n) = Θ(nlogn) Ans (c) 10. u + 10 = x and v != y Ans (d) . 25. 27. d. u + 10 = x and v = y d. 27. 50. &a). T produces the following sequence of keys 10. 40. 9. 25. T(n) = O(n2). n(k-1) Ans (c) 9. 27. 25.5. 27. 29 Which one of the following sequences of keys can be the result of an inorder traversal of the tree T? a. T(n) = Ω(n2). 29 Ans (a) 8. T(n) = O(nlogn). 50. 15. 95. 23. T(0) = T(1) = 1. u = x + 10 and v = y b. 95. 10. 15. a.v be the values printed by the parent process and x. b. 60. 23. 25. The number of leaves in such a tree with n internal nodes is: a. 23. 10. 95. 29. 15. 40. printf (“%d. 50. 50. 10. 27. %d”. 29 c. u = x + 10 and v != y c. } Let u. 9. 95 b. 22. Consider the following code fragment: if(fork() == 0) { a = a + 5. 9. 50. 15. 60. &a). 23. a. nk b. 40. In a complete k-ary tree. 22. 60. 22. Suppose T(n) = 2T(n/2) + n. 60. 95 d. Which one of the following is TRUE? a. 25. %d”. (n-1)k + 1 c. 9. 15. n(k-1) + 1 d. 40. Postorder traversal of a given binary search tree. 23.Ans (d) 7. 40. 10. c. 22.

O(n) c. but C1 assumes C2 is on a different network d.53) c. Let d(r. Which one of the following statement is true? a. A2….u) > d(r.11. but C2 assumes C1 is on a different network c. O(n2logn) Ans (a) 14.u) ≤ d(r. O(n3) Ans (c) 15.192. O(n3) c. If the GCD algorithm takes k-iteration then the worst case time complexity to prove smaller number of GCD is greater or equal to kth Fibonacci number is: a.255. d(r. d(r.u) < d(r.v) c.197. The best time complexity to multiply 2 x 2 matrix is a. C1 and C2 both assumes they are on the same network b. O(n2) b. Let a breadth-first traversal of G be done starting from a node r.128. nxl … respectively) using dynamic programming? a. O(n2.v) Ans (b) 13. If u is visited before v during the breadth-first traversal which of the following statement is correct? a. C1 has IP address 203. C2 assumes C1 on same network.255. O(nlogn) d.201 and net mask 255. Θ(n2) d. O(logn) b. O(n2.v) b. Consider the undirected unweighted graph G.53 and net mask 255.25) b.u) and d(r. What could be the best space complexity of multiplying chain of matrices (A1X A2 X A3 … where A1.2. C2 has IP address 203.75.0. C1 and C2 both assumes they are on the different network Ans (b) 12. O(n2.0.v) d.v) be the lengths of the shortest paths from r to u and v respectively in G.197.81) d.u) ≥ d(r. d(r. d(r. Two computers C1 and C2 are configured as follows. Θ(n3) Ans (c) .An are the matrix having sizes mxn. C1 assumes C2 on same network.

Fair-Share Scheduling Ans (c) 18. What could be the optimum page size P for this system? a. 2KB b. However is some process B asks them in order R.1 c. N + 1 d. Suppose process A ask for the records in order 1.R-1. 16KB Ans (c) .….…2. the page size is P bytes and each page entry requires 8 bytes. 1/(R!)N-1 b.1 then deadlock is possible.16. N . 4KB c. Lottery scheduling d. If there are N philosophers then how many semaphore required to solve “The Dining Philosopher Problem”? a. If there are N processes competing for R records in database. R/(R!)N-1 d. R/(R!)N+1 Ans (a) 19. Which of the following process scheduling algorithm is highly responsive? a. Let the average process size in the system is 4MB. Priority scheduling with multiple queues c. 2N – 1 Ans (c) 17. 8KB d. N b. 1/(R!)N+1 c. Round Robin scheduling b. What are the percentages of all the combinations of requests for resources are guaranteed to be deadlock free? a.R and all other processes also asks for them in same order then deadlock is not possible.2.