UGC NET Solved Paper-II june2011

<--BACK                                                                                    NEXT-->

1. Any integer composed of 3n identical digits divisible by

(A) 2n (B) 3n (C) 5n  (D) 7n

2. The circumference of the two concentric disks are divided into 100 sections each. For the outer disk, 100 of the sections are painted red and 100 of the sections are painted blue. For the inner disk, the sections are painted red and blue in an arbitrary manner. It is possible to align the two disks so that

(A) 100 or more  (B) 125 or more  (C) 150 or more  (D) 175 or more

of the sections on the inner disks have their colours matched with the corresponding section on outer disk.

3. The proposition ~ p Ú q is equivalent to

(A) p ® q  (B) q ® p  (C) p « q  (D) p Ú q

4. The absorption law in Boolean algebra say that

(A) X + X = X  (B) X . X = X  (C) x + x . y = x  (D) None of the above

5. The number of 1’s present in the binary representation of 10 × 256 + 5 × 16 + 5 is

(A) 5    (B) 6    (C) 7   (D) 8

6. The hexadecimal number equivalent

to (1762.46)8 is

(A) 3F2.89     (B) 3F2.98     (C) 2F3.89     (D) 2F3.98

7. (A + B) ––– AB is equivalent to

(A) A Å B       (B) A u B       (C) (A Å B) u A        (D) (A u B) Å A

8. A latch is constructed using two cross-coupled

(A) AND and OR gates       (B) AND gates

(C) NAND and NOR gates (D) NAND gates

9. A multiplexer is a logic circuit that

(A) accepts one input and gives several output

(B) accepts many inputs and gives many output

(C) accepts many inputs and gives one output

(D) accepts one input and gives one output

10. 8-bit 1’s complement form of  –77.25 is

(A) 01001101.0100  (B) 01001101.0010

(C) 10110010.1011  (D) 10110010.1101

11. From the point of view of the programmer, what are the major advantages of using a high-level language rather than internal machine code or assembly language ?

(A) Program portability        (B) Easy development

(C) Efficiency                                    (D) None of the above

12. What features make C++ so powerful ?

(A) Easy implementation                (B) Reusing old code

(C) Easy memory management     (D) All of the above

13. The goal of operator overloading is

(A) to help the user of a class        (B) to help the developer of a class

(C) to help define friend function (D) None of the above

14. The scheme of which interpreter translates the source program is known as

(A) Paragraph by paragraph          (B) Instruction by instruction

(C) Line by line                                 (D) None of the above

15. Portable program means

(A) Program with wheels      (B) Independent from its authors

(C) Independent of platform (D) None of the above

16. Which of the following is the recovery management technique in DDBMS ?

(A) 2PC (Two Phase Commit)       (B) Backup

(C) Immediate update                      (D) All of the above

17. Which of the following is the process by which a user’s privileges ascertained ?

(A) Authorization (B) Authentication (C) Access Control (D) None of these

18. The basic variants of time-stampbased method of concurrency control are

(A) Total time stamp-ordering         (B) Partial time stamp ordering

(C) Multiversion Time stamp ordering (D) All of the above

19. A transaction can include following basic database access operations :

(A) Read_item(X) (B) Write_item(X) (C) Both (A) and (B) (D) None of these

20. Decomposition help in eliminating some of the problems of bad design

(A) Redundancy (B) Inconsistencies (C) Anomalies (D) All of the above

21. The number of different trees with 8 nodes is

(A) 256           (B) 255           (C) 248           (D) None of these

22. Given a binary tree whose inorder and preorder traversal are given by

Inorder : EICFBGDJHK       Preorder : BCEIFDGHJK

The post order traversal of the above binary tree is

(A) I E FCGJ KHDB             (B) I E FC J GKHDB

(C) I E FCGKJ HDB             (D) I E FCGJ KDBH

23. Number of disk accesses performed by insertion operation in B-tree of height h is

(A) 0(1)           (B) 0(1gh)      (C) 0(h)          (D) None of these

24. Consider a hash table of size m = 10000 and the hash function h(k) = m (kA mod 1) ' for A = ( 5 – 1) /2

. The location to the key k = 123456 is

(A) 46             (B) 47             (C) 41             (D) 43

25. When the priority queue is represented by max heap, the insertion and deletion of an element can be performed in (queue containing n elements)

(A) q(n) and q(1) respectively         (B) q(n) and q(n) respectively

(C) q(1) and q(1) respectively         (D) None of the above