1. When the most significant byte of a word is at the smallest address, the architecture is called

A. Big Indian

B. Little Endian

C. Big Endian

D. Little Indian

2. Polymorphism means

A. that data fields should be declared private

B. that a class can extend another class

C. that a class can contain another class

D. that a variable of supertype can refer to a subtype object

3. A computer system has a RAM of 4 GB and a cache of 512MB. Assuming that the least significant bit is b0, the cache location using direct mapping is given by

A. the bits b31 ... b4

B. the bits b2 . •. b0

C. the bits b31 ... b29

D. the bits b28 • .. b0

4. Which of the following is TRUE about vectoredinterrupts?

A. the interrupt service routine is determined by the interrupt-generating device

B. the interrupt service routine polls the devices to find the device that generated the interrupt

C. the interrupt is generated not by one device but byseveral devices simultaneously

D. None of the above

5. The maximum number of items in a B-tree of order m and height his

A. mh

B. mh-1

C. m h+1

D. mh 1

6. Each B-tree node can have at-most p tree pointers, P-1 data pointers and p-1 search key field values. These Inust fit into a single disk block if each B-tree node is to correspond to a disk block. Suppose the search field is V 9 bytes long, the disk block size is B 512 bytes, record (data) pointer is Pr 7 bytes and a block pointer is P 6 bytes. What is the value of

A. 22

B. 23

c. 24

D. 25

7. What is the order p of a tree given that the search key field is V 9 bytes long, the block size is B 512 bytes, record pointer is Pr 7 bytes and a block pointer is P 6 bytes.

A. 32

B. 33

C. 34

D. 24

8. Consider a schema with functional dependencies A B BC A D A Which of the following is not a key?

A. A

B. E

C. B,C

D. D

9. The tuples in relation are and the tuples in relation are The number of tuples in the result of the following SQL query are:
Select *From R Natural Outer Join

A. 2

B. 4

C. 6

D. None of the above

10. A unit of storage that can store one or more records in a hash file organization is denoted as

A. Buckets

B. Disk Pages

C. Blocks

D. Nodes

11. Which of the following will undo all statements upto commit?

A. Transaction

B. Flashback

C. Rollback

D. Abort

12. If a system has a 32-bit processor, what are the number of page table entries if the page size is 16KB?

A. 16K entries

B. 256K entries

C. 8K entries

D. 64K entries

13. Zombie process is a process

A. that lives forever in all situations

B. has terminated and is waiting for its parent to check its status

C. whose parent has died

D. None of the above

14. Wireless LANs do not use CSMA/CD because

A. CSMA/CD is not efficient

B. CSMA/CD requires duplex operation

C. Wireless networks have a high BER

D. Wireless networks are not secure

15. If a host has an IP address 201.40.67.31/25, what are the network ID and broadcast address of the network to which this host belongs:

A. 201.40.67.31, 201.40.67.63

B. 201.40.67.0, 201.40.67.255

C. 201.40.67.0, 201.40.67.63

D. 201.40.67.31, 201.40.67.255

16. If the MF bit=O, Fragment Offset 1480 aud Total Lenght 520 iu all IP data­gram, then the lenght of datagram is

A. 520

B. 1480

C. 1500

D. 2000

17. When the TTL of a datagram sent from a host H1 is the data can reach a host which is

A. within the same network

B. any host in the world

C. within the same network and the network reached through one router

no host at all

18. Five segements of data of sizes 100B, 400B, 200B, 300B and SOB are sent usine; TCP and PSH bit is set on each of the segements. There are no retransmission timeouts. The acks received are 101, 101, 701, 701 and 1051. In which order are the segements received

A. 100B, 200B, 400B, 300B, 50B

B. 100B,400B, 200B, 50B, 300B

C. 100B, 400B, 200B, 300B, 50B

D. 100B, 200B, 400B, 50B, 300B

19. One major difference between RIPv1 and RIPv2 are:

A. RIPv1 is an IGP whereas RIPv2 is an EGP

B. RIPv1 uses UDP whereas RIPv2 uses TCP

C. RIPv1 supports Classful networks only whereas RIPv2 supports CIDR

D. None of the above

20. The Memory Buffer Register(MBR) is best understood by which of the following descriptions

A. is a hardware rnemory device which denotes the location of the current instruc­.tion being executed

B. is a group of electrical circuits (hardware) that performs the intent of instruc­tions fetched from memory

C. contains the address of the memory location that is to be read from or stored into

D. contains a copy of designated memory location specified by the MAR after a "read" or the new contents of the memory prior to "write"

21. A Program that allows multiple operating systems to share a single hardware pro­cessor, in current terminology is called as

A. Loader

B. Boot strap controller

C. Hypervisor

D. Cross compiler

22. Which type of operating system would be needed to allow the students in a class to read a file that the teacher also had open?

A. Batch processing

B. Multi-user

C. Multitasking

D. None of the above

Read the passage below and then answer the'questions (23
I thank the ACM for this award. I can't help but feel that I am receiving this honor for and serendipity as much as technical merit. UNIX swept into popularity .. with an industry-wide change from central main frames to autonomous minis. There is an old adage, "Dance with the one that brought you," which means that I should talk about UNIX.. I have not worked on mainstream UNIX in many years, yet I continue to get undeserved credit for the work of others. Therefore, I am not going to talk about UNIX, but I want to thank everyone who has contributed. That brings me to Dennis Ritchie. Our collaboration has been a thing of beauty. In the ten years that we have worked together, 1can recall only one case of miscoordination of work. On that occasion, I discovered that we both had written the same 2D-line assembly language program. I compared the sources and was astounded to find that they matched character-for-character. The result of our work together has been far greater than the work that we each contributed.

23. Whom did the speaker of the above paragraph work with for 10 years?

A. Brian Kernighan

B. Dennis Ritchie

C. Steve Jobs

D. None of the above

24. Who or what is the speaker NOT going to talk about?

A. UNIX

B. Dennis Ritchie

C. Assembly Language Programming

D. None of the above

25. What astounded the speaker?

A. His ability to dance

B. The success of UNIX

C. Industry-wide change from mainframes to minis

D. Writing the same 20-line program as Dennis Ritchie

26. "I thank the ACM for this award." What award can it be?

A. Fields Medal

B. Nobel Prize

C. Computer Scientist of the Year

D. Turing Award

27. It is not possible to construct a graph having

A. Even number of nodes with even degree

B. Even number of nodes with odd degree

C. Odd number of nodes with even degree

D. Odd number of nodes with odd degree

28. N x N N is a function where 2m .3n . Then f is

A. Only 1-1

B. Only Onto

C. both 1-1 and onto

D. neither 1-1 nor onto

29. The time complexity of the following code segement is NOT of the order
while

n


A.

B.

C. Q(logn)

D.

30. Two algorithlllS A and B are being cOlnpared for their efficiencey on an input of size n. The running time of A is n3 seconds and the running time of B is n2 hours. Find the smallest n for which B is faster than A.

A. 61

B. 121

C. 3601

D. 72

31. Let (all a2, a3, ......, an)be a list of numbers in ascending order except for an, where an al. Then the time taken by insertion sort and bubble sort algorithms respectively to sort the list are

A.

B.

C.

D.

32. A Regular Expression for the language L over the alphabet E consisting of strings with exactly 2b's is

A.

B. a*bba*

C. bba*

D. a*bb

33. Which of the following generates the same language as Where L {xnyn In
I:E xy
II:xy


A. I only

B. I and II

C. II and III

D. II only


34. How many new processes will be created in case a process executes the following code:




A. 9

B. 7

C. 6

D. 8

35. As n infinite, the function 2 sq.rt of n grows faster than

A. sq.rt of n but slower than n

B. n but slower than n2

C. n2 but slower than sq.rt of 2n

D. sq.rt of 2n, but slower than 2n

36. Which of the foillowing holds under the assumption that P not equal to NP

A. P n NP -Complete Q

B. NP -Hard NP -Complete

C. NP NP -Complete U P

D. None of the above

37. Let G be a connected graph with "v" nodes and "e" edges. The number of edges to be dropped to form a tree are

A. e-v 1 where e v

B. e-v 1 where e v

C. v-e 1 where e v

D. v-e 1 where e v

38. Let G be a Eulerian weighted graph with sum of the weights of edges as 1000. What is the weight of Eulerian circuit of G

A. Eulerian circuit need not exist

B. Eulerian circuit exist with weight greater than 1000

C. Eulerian circuit exist with weight less than 1000

D. Eulerian circuit exist with weight equal to 1000

39. Let L be a bounded, distributive, complimented Lattice and be the elements of then which of the following is valid

A. a b a

B. aVb a

C. a b}Vc

D. a

40. Convert FEDCBA into octal number

A. 77556272

B. 77565271

C. 76556272

D. 77565472

41. Thrashing can be reduced by

A. increasing the CPU power

B. increasing degree of multiprogramming

C. increasing memory

D. increasing the swap space

42. Let m and n be the natural numbers and let prime be true if n is a prime. Which of the following expression says that there are infinite number of primes

A. prime(n)

B. prime(n)

C. prime(n)

D. prime(n)

43. A disadvantage of an inverted page table as compared to a normal page table is

A. It is very large in size

B. It cannot support large virtual memory

C. It is inefficient in translation of logical to physical address

D. None of the above

44. Consider the following two Statements:
(A)There are infinitely many interesting whole numbers
(B)There are finitely many uninteresting whole numbers
Which of the following is TRUE

A. A and B are equivalent

B. B implies A

C. A implies B

D. None of the above

45. A simple graph on 8 vertices is given such that there is a vertex of degree a vertex of degree a vertex of degree a vertex of degree a vertex of degree a vertex of degree 6 and a vertex of degree 7. Which of the following can be degree of the last vertex

A. 3

B. 0

C. 5

D. 4

46. Consider the set of all 2x2 matrices whose entries are either 0 or 1. A matrix is randomly chosen from that set. What is the probability that the determinant of the chosen matrix is -ve

A. 3/16

B. 13/10

C. 10/16

D. 1
47. The Program counter contains the number 9ABC and the address part of instruction contains 134. If relative mode if addressing is find the effective address.

A. 9BF0

B. 9ABD

C. 9ABC

D. 9BF1

48. The function below has a flaw. Which one of the following describes the deficiency?

int fibonacci(int

if


switch(n)

default: return (fibonacci(n-1) fibonacci(n-2);
case
case return


return


A. Since the default case is given first,it will be executed before any case matching n

B. A break statement should be inserted after each case.Fall through is not desirable here

C. For some values of the environment will almost certainly exhaust its stack space before the calculation completes

D. An error in the algorithm causes unbounded recursion for all values of n

49. What is the output of the following code?

public class Testl{
public static void main(String[] args){
ChildClass c new ChildClass();
c.printO;


class ParentClass{
int
void print()
System.out.println(id);


class ChildClass extends ParentClass{
int


A. 0

B. 1

C. 2

D. Nothing appears in output

50. Let A A1= A2= A3= Which of the following are partitions of A

A.

B.

C.

D.

51. The main memory can store 32K words of 12 bits each. If direct cache mapping is used with a cache capability of 512 words, what is the size of each cache location.

A. 18

B. 36

C. 9

D. 27

52. Let R be a relation on Which one of the following .. is transitive closure of

A.

B.

C.

D.

53. If G is a polyhedral graph with 12 vertices and 30 edges then

A. Degree of each region is greater than 3

B. Degree of each region is equal to 3

C. Degree of each region is greater than 2

D. Degree of each region is equal to 2

54. How many queues are needed to implement a priority queue

A. 1

B. 2

C. 3

D. 0

55. What is the most suitable data structure to store permutation of a given set of alphabets in terms of search complexity

A. Tree

B. Stack

C. Queue

D. Adjacency list

56. Comment on the output of the given C code
#include<stdio.h>
struct temp

int
int
int

main()

struct temp
printf("%d", .a)


A. No compile time error, generates an array of structure of size 3

B. No compile time error, generates an array of structure of size 9

C. Run time error, in accessing the members of

D. Compile time error, illegal assignment to members of structure

57. What is the search complexity of finding nearest neighbors in a huge data set of size n

A.

B. O(nlogn)

C.

D.

58. A min-max heap is defined as follows: Each node at an even level in the tree is less than all of its descendants, while each node at an odd level in the tree is greater than all of its descendents
If the values are inserted in the order in the min-max heap, what value would be found at position 5 in min-max heap (root is counted as position

A. 6

B. 27

C. 48

D. 50

59. Which is the suitable data structure that finds duplicate in a list of numbers whose range is small

A. Hash

B. Binary Search tree

C. Linear queue

D. Linked list

60. If two function declarations were made as follows: f(int pf(int Which of the following statement is TRUE?

A. argulnents to f and pf takes arrays starting at different addresses

B. arguments of f and Pf take array starting at the same address

C. both can have different ending addresses

D. arr size in both statements is different

61. What is the output of the following Java code
int count=1;
int num=25;
while (count<25)

num= num-1;


System.out.println(count

A. 240

B. 241

C. 250

D. 251

62. An example of NP-Hard decision problem which is not NP-Complete.

A. Satisfiability problem

B. Halting problem

C. Travelling Salespersons problem

D. None of the above

63. Which algorithm can be used for the solution of Single Source Shortest Path problem when the edges are of negative lengths:

A. Prims algorithm

B. Dijkstras algorithm

C. Bellman-Ford algorithm

D. None of the above

64. If a complete binary tree with n nodes is represented sequentially using array then for any node with index 1 i n we have:

A. Right-CHILD(i) is at 2i if 2i 1 n

B. Right-CHILD(i) is at 2i, if 2i n

C. Right-CHILD(i) is at 2i if 2i n

D. None of the above

65. If X ABCB, Y BDCAB, the Longest Common Subsequence of X and Y is

A. ABC

B. BCB

C. BB

D. None of the above

66. Consider the following program (Assume no syntax errors)

#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
int main()
{cout Enter the number n
int
cin
int sum
for (int
for (int
for (int

cout "
UoH

Asymptotic running time of the segment is

A. nlog2n

B. n3

C. O(nlog2n

D. None of the above

67. How many times "UoH" will be printed for the value of n=8 for the code of question number 66

A. 240

B. 60

C. 120

D. None of the above

68. The relationship between time slice of a round-robin scheduler and the context switch time is as follows:

A. They are independent of each other

B. Time slice must be smaller than the context switch time

C. Time slice must be equal to the context switch time

D. Time slice must be much higher than the context switch time

69. In an operating system, a process refers to 5 pages, E in the order: If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is

A. 8

B. 10

C. 9

D. 7

70. An operating system supports multi-threading system. In Many to Many model when athread performs a blocking system call

A. other threads are allowed to run

B. other threads are strictly prohibited from running

C. other threads only from other processes are allowed to run

D. None of the above

71. Consider a disk where blocks and 27 are free and the rest of the blocks are allocated. If the block numbering starts from then the free space bit map would be

A. 10000110000001110011111100011111

B. 110000110000001110011111100011111

C. 01111001111110001100000011100000

D. 001111001111110001100000011100000

72. A system with 5 processes PO through P4 and three resource types C has A with 10 instances, B with 5 instances, and C with 7 instances. At time to, the following snap shotha Process(PO, PI, P2, P3, P4) Allocation(process -wise: POthroughP4toptobottom)
A B C
0 1 0
2 0 0
3 0 2
2 1 1
0 0 2
Max (process-wise PO through P4 top to bottom)
A B C
7 5 3
3 2 2
9 0 2
2 2 2
4 3 3
Available
A B C
3 3 2
The sequence leads the system to

A. unsafe state

B. a safe state

C. a protected state

D. a deadlock

73. A disadvantage of an inverted page table as compared to a normal page table is

A. It is very large in size

B. It cannot support large virtual memory

C. It is inefficient in translation of logical to physical address

D. None of the above

74. In how many ways can nine students be partitioned into three teams containing four, three and two students respectively

A.

B. 630

C. 315

D. None of the above

75. A connected planar graph with 15 vertices divides the plane into 12 regions. How many edges does the graph have

A. 15

B. 24

C. 25

D. Insufficient data