1. How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ?
2. Web Mining is not used in which of the following areas ?
4. If a packet arrive with an M-bit value is ‘1’ and a fragmentation offset value ‘0’, then it is______ fragment
5. Testing of software with actual data and in actual environment is called
6. A hash function f defined as f (key) = key mod 13, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79 ?
7. The amount of uncertainty in a system of symbol is called
8. What is the size of the Unicode character in Windows Operating System?
9. Match the following IC families with their basic circuits :
a. TTL 1. NAND
b. ECL 2. NOR
c. CMOS 3. Inverter Code
10. Which of the following is true ?
11. The worst case time complexity of AVL tree is better in comparison to binary search tree for
12. The time complexity to build a heap of n elements is
13. The Mobile Application Protocol (MAP) typically runs on top of which protocol ?
14. A station in a network forward incoming packets by placing them on its shortest output queue. What routing algorithm is being used ?
15. What is the result of the following expression ?
(l&2) + (3&4)
16. How many edges are there in a forest of t-trees containing a total of n vertices ?
17. Encryption and Decryption is the responsibility of Layer.
18. Component level design is concerned with
19. Basis path testing falls under
20. A chip having 150 gates will be classified as
21. Which API is used to draw a circle ?
22. Match the following :
List-I List – II
a. Wireless Application Environment i. HTTP
b. Wireless Transaction Protocol ii. IP
c. Wireless Datagram Protocol iii. Scripts
d. Wireless iv. UDP
23. Encoding of data bits 0011 into 7-bit even Parity Hamming Code is
24. Consider a logical address space of 8 pages of 1024 words mapped with memory of 32 frames. How many bits are there in the physical address ?
25. In how many ways can 15 indistinguishable fish be placed into 5 different ponds, so that each pond contains atleast one fish ?
26. “Black” refers in the “Black-box” testing means
27. Linux operating system uses
28. Active X controls are Pentium binary programs that can be embedded in ____________
29. The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using :
30. All of the following are examples of real security and privacy risks except
31. Which of the following is a bad example of recursion ?
32. RAD stands for______.
33. The value of the following expression (13 / 4 * 3) % 5 + 1 is
34. In which tree, for every node the height of its left subtree and right subtree differ almost by one
35. Emergency fixes known as patches are result of
36. Data security threats include
38. The number of bits required for an IPV 6 address is
39. Dijkestra banking algorithm in an operating system, solves the problem of
40. The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.
41. The maturity levels used to measure a process are
42. B + tree are preferred to binary tree in database because
43. The VLF and LF bauds use propagation for communication
44. Which of the following can be the sequence of nodes examined in binary search tree while searching for key 88 ?
45. A graph is non-planar if and only if it contains a subgraph homomorphic to
46. In UNIX, which of the following command is used to set the task priority ?
47. Match the following with respect to C++ data types :
a. User defined type 1. Qualifier
b. Built in type 2. Union
c. Derived type 3. Void
d. Long double 4. Pointer
48. Consider the tree given below :

Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree.
49. The design issue of Datalink Layer in OSI Reference Model is
50. The number of bit strings of length eight that will either start with a 1 bit or end with two bits 00 shall be
51. The relationship of data elements in a module is called