1. Which of the following data structure is Non-linear type?
(A) Strings (B) Lists
(C) Stacks (D) None of the above
Answer: D

2. The total number of comparisons in a bubble sort is
(A) 0(log n)
(B) 0(n log n)
(C) 0(n)
(D) None of the above
Answer: B

The total number of comparisons in a bubble sort is

3. Which of the following is a bad example of recursion?
(A) Factorial (B) Fibonacci numbers
(C) Tower of Hanai (D) Tree traversal
Answer: B

4. Domain and Range of the function
Y = –√(–2x + 3) is
(A) x≥3/2, y≥0 (B) x>3/2, y≤0
(C) x≥3/2, y≤0 (D) x≤3/2, y≤0
Answer: D

5. Maximum number of edges in a n-Node undirected graph without self loop is
(A) n2 (B) n(n – 1)
(C) n(n + 1) (D) n(n – 1)/2
Answer: D

if n=2 then no. of edges is 1

if n=3 then no. of edges are 3

if n= 5 then no. of edges are 10

all are true in option d 

6. A hash table has space for 75 records, then the probability of collision before the table is 6% full.
(A) .25 (B) .20
(C) .35 (D) .30
Answer: B
On .75th insertion probability of collision = 1/75
On 1.5th insertion probability of collision = 2/75
On 2.25th insertion probability of collision = 3/75
On 3th insertion probability of collision = 4/75
On 3.75th insertion probability of collision = 5/75
So the required probability is 1+2+3+4+5/75 = .20

7. BCC in the internet refers to
(A) Black carbon copy (B) Blind carbon copy
(C) Blank carbon copy (D) Beautiful carbon copy
Answer: B

8. Hub is a term used with
(A) A Star Networks (B) A Ring Networks
(C) A Router (D) A Bridge
Answer: A

9. The amount of uncertainty in a system of symbol is called
(A) Bandwidth (B) Entropy
(C) Loss (D) Quantum
Answer: B

10. Which of the following network access standard disassembler is used for connection station to a packet switched network?
(A) X.3 (B) X.21
(C) X.25 (D) X.75
Answer: C

X.25 is used in packed switched network. The idea is to connect a dumb terminal to a packet-switched network.

11. A station in a network in a network forward incoming packets by placing them on its shortest output queue. What routing algorithm is being used?
(A) Hot potato routing (B) Flooding
(C) Static routing (D) Delta routing
Answer: A

12. Start and stop bits are used in serial communications for
(A) Error detection (B) Error correction
(C) Synchronization (D) Slowing down the communication
Answer: C

13. For a data entry project for office staff who have never used computers before (user interface and user-friendliness are extremely important), one will use
(A) Spiral model (B) Component based model
(C) Prototyping (D) Waterfall model
Answer: C

14. An SRS
(A) establishes the basis for agreement between client and the supplier.
(B) provides a reference for validation of the final product.
(C) is a prerequisite to high quality software.
(D) all of the above.
Answer: D

15. McCabe’s cyclomatic metric V(G) of a graph G with n vertices, e edges and p connected component is
(A) e
(B) n
(C) e – n + p
(D) e – n + 2p
Answer: C

16. Emergency fixes known as patches are result of
(A) adaptive maintenance
(B) perfective maintenance
(C) corrective maintenance
(D) none of the above
Answer: C

17. Design recovery from source code is done during
(A) reverse engineering (B) re-engineering
(C) reuse (D) all of the above
Answer: D

18. Following is used to demonstrate that the new release of software still performs the old one did by rerunning the old tests :
(A) Functional testing (B) Path testing
(C) Stress testing (D) Regression testing
Answer: D

19. The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.
Answer: C

20. B + tree are preferred to binary tree in database because
(A) Disk capacities are greater than memory capacities
(B) Disk access much slower than memory access
(C) Disk data transfer rates are much less than memory data transfer rate
(D) Disk are more reliable than memory
Answer: B

21. What deletes the entire file except the file structure?
Answer: C

22. Which command classes text file, which has been created using “SET ALTERNATIVE” “Command” ?
Answer: A

23. Data security threats include
(A) privacy invasion
(B) hardware failure
(C) fraudulent manipulation of data
(D) encryption and decryption
Answer: C

24. Which of the following statements is true, when structure of database file with 20 records is modified?
(A) ? EOF ( ) Prints T
(B) ? BOF ( ) Prints F
(C) ? BOF ( ) Prints T
(D) ? EOF ( ) Prints F
Answer: A

25. The SQL Expression
Select distinct T. branch name from branch T, branch S where T. assets > S. assets and S. branch-city = DELHI, finds the name of
(A) all branches that have greater asset than any branch located in DELHI.
(B) all branches that have greater assets than allocated in DELHI.
(C) the branch that has the greatest asset in DELHI.
(D) any branch that has greater asset than any branch located in DELHI.
Answer: A

26. Dijkestra banking algorithm in an operating system, solves the problem of
(A) deadlock avoidance (B) deadlock recovery
(C) mutual exclusion (D) context switching
Answer: A

27. The multiuser operating system, 20 requests are made to use a particular resource per hour, on an average the probability that no request are made in 45 minutes is
(A) e-15 (B) e-5
(C) 1 – e-5 (D) 1 – e-10
Answer: A

28. On receiving an interrupt from an I/O device, the CPU
(A) halts for predetermined time.
(B) branches off to the interrupt service routine after completion of the current instruction
(C) branches off to the interrupt service routine immediately.
(D) hands over control of address bus and data bus to the interrupting device.
Answer: B

29. The maximum amount of information that is available in one portion of the disk access arm for a removal disk pack (without further movement of the arm with multiple heads)
(A) a plate of data (B) a cylinder of data
(C) a track of data (D) a block of data
Answer: B

30. 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?
(A) 9 bits (B) 11 bits
(C) 13 bits (D) 15 bits
Answer: D

The word size is 1024. So, the number of bits required to calculate the offset into each page = 210=1024=10 bits. 
So for 32 frames(25) of 1024 words each,we would require a total of 5+10 bits = 15 bits.

  1. CPU does not perform the operation

(A) data transfer                       (B) logic operation

(C) arithmetic operation          (D) all of the above

Answer: D

  1. A chip having 150 gates will be classified as

(A) SSI               (B) MSI

(C) LSI               (D) VLSI

Answer: B

  1. If an integer needs two bytes of storage, then the maximum value of unsigned integer is

(A) 216 – 1

(B) 215 – 1

(C) 216

(D) 215

Answer: A

  1. Negative numbers cannot be represented in

(A) signed magnitude form

(B) 1’s complement form

(C) 2’s complement form

(D) none of the above

Answer: D

Negative numbers can be represented in signed magnitude form, or ‘1’ complement form or ‘2”s complement form

  1. The cellular frequency reuse factor for the cluster size N is

(A) N                  (B) N2

(C) 1/N               (D) 1/N2

Answer: C

  1. X – = Y + 1 means

(A) X = X – Y + 1

(B) X = –X – Y – 1

(C) X = –X + Y + 1

(D) = X – Y – 1

Answer: A

  1. Handoff is the mechanism that

(A) transfer an ongoing call from one base station to another

(B) initiating a new call

(C) dropping an ongoing call

(D) none of above

Answer: A

  1. Which one of the following statement is false?

(A) Context-free languages are closed under union.

(B) Context-free languages are closed under concatenation.

(C) Context-free languages are closed under intersection.

(D) Context-free languages are closed under Kleene closure.

Answer: D

Explanation:- CFL’s are closed under union, concatenation, and Kleene closure. But not under intersection or difference. So the correct answer is option C.

  1. All of the following are examples of real security and privacy risks except

(A) Hackers       (B) Spam

(C) Viruses       (D) Identify theft

Answer: B

  1. Identify the incorrect statement :

(A) The ATM adoption layer is not service dependent.

(B) Logical connections in ATM are referred to as virtual channel connections.

(C) ATM is streamlined protocol with minimal error and flow control capabilities

(D) ATM is also known as cell delays.

Answer: A

  1. Software risk estimation involves following two tasks :

(A) Risk magnitude and risk impact

(B) Risk probability and risk impact

(C) Risk maintenance and risk impact

(D) Risk development and risk impact

Answer: B

  1. The number of bits required for an IPV6 address is

(A) 16     (B) 32

(C) 64     (D) 128

Answer: D

  1. The proposition ~qvp is equivalent to

(A) p→q             (B) q→p

(C) p↔q             (D) p˅q

Answer: B

  1. Enterprise Resource Planning (ERP)

(A) has existed for over a decade.

(B) does not integrate well with the functional areas other than operations.

(C) is inexpensive to implement.

(D) automate and integrates the majority of business processes.

Answer: D

  1. Which of the following is false concerning Enterprise Resource Planning (ERP)?

(A) It attempts to automate and integrate the majority of business processes.

(B) It shares common data and practices across the enterprise.

(C) It is inexpensive to implement.

(D) It provides and access information in a real-time environment.

Answer: C

  1. To compare, overlay or cross analyze to maps in GIS

(A) both maps must be in digital form

(B) both maps must be at the same equivalent scale.

(C) both maps must be on the same coordinate system

(D) All of the above

Answer: D

  1. Web Mining is not used in which of the following areas?

(A) Information filtering

(B) Crime fighting on the internet

(C) Online transaction processing

(D) Click stream analysis.

Answer: B

  1. A telephone conference call is an example of which type of communications?

(A) same time / same place

(B) same time / different place

(C) different time / different place

(D) different time / same place

Answer: B

  1. What is the probability of choosing correctly an unknown integer between 0 and 9 with 3 chances?

(A) 963/1000

(B) 973/1000

(C) 983/1000

(D) 953/1000

Answer: A

  1. The number of nodes in a complete binary tree of height h (with roots at level 0) is equal to

(A) 20 + 21 + ….. 2h

(B) 20 + 21 + ….. 2h-1

(C) 20 + 21 + ….. 2h+1

(D) 21 + ….. 2h+1

Answer: A