# UGC NET Computer Science Solved Paper II Nov 2017

## UGC NET Computer Science Solved Paper II Nov 2017

1. If the time is now 4 O’clock, what will be the time after 101 hours from now ?
(1) 9 O’clock        (2) 8 O’clock            (3) 5 O’clock             (4) 4 O’clock

2. Let m=(313)4 and n=(322)4. Find the base 4 expansion of m+n.
(1) (635)4           (2) (32312)4            (3) (21323)4            (4) (1301)4

3.

4. How many distinguishable permutations of the letters in the word BANANA are there ?
(1) 720       (2) 120         (3) 60        (4) 360

5. Consider the graph given below :

Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edges of the tree in the order in which they are choosen is ?
(1) AD, AE, AG, GC, GB, BF                   (2) GC, GB, BF, GA, AD, AE
(3) GC, AD, GB, GA, BF, AE                  (4) AD, AG, GC, AE, GB, BF

6. The Boolean function with the Karnaugh map

is :
(1) (A+C).D+B                            (2) (A+B).C+D
(3) (A+D).C+B                           (4) (A+C).B+D

7. The Octal equivalent of the binary number 1011101011 is :
(1) 7353          (2) 1353            (3) 5651            (4) 5657

8. Let P and Q be two propositions, ¬ (P ↔ Q) is equivalent to :
(1) P ↔ ¬ Q            (2) ¬ P ↔ Q              (3) ¬ P ↔ ¬ Q              (4) Q → P

9. Negation of the proposition x H(x) is :
(1) x ¬ H(x)                  (2) ∀ x ¬ H(x)                    (3) ∀ x H(x)                 (4) ¬ x H(x)

10. The output of the following combinational circuit is F.

The value of F is :
(1) P1+P’2P3             (2) P1+P’2P’3                               (3) P1+P2P’3                  (4) P’1+P2P3

11. ‘ptrdata’ is a pointer to a data type. The expression *ptrdata++ is evaluated as (in C++) :
(1) *(ptrdata++)             (2) (*ptrdata)++             (3) *(ptrdata)++          (4) Depends on compiler

12. The associativity of which of the following operators is Left to Right, in C++ ?
(1) Unary Operator                (2) Logical not             (3) Array element access               (4) addressof

13. A member function can always access the data in __________ , (in C++).
(1) the class of which it is member                           (2) the object of which it is a member
(3) the public part of its class                                   (4) the private part of its class

14. Which of the following is not correct for virtual function in C++ ?
(1) Must be declared in public section of class.
(2) Virtual function can be static.
(3) Virtual function should be accessed using pointers.
(4) Virtual function is defined in base class.

15. Which of the following is not correct (in C++) ?
(1) Class templates and function templates are instantiated in the same way.
(2) Class templates differ from function templates in the way they are initiated.
(3) Class template is initiated by defining an object using the template argument.
(4) Class templates are generally used for storage classes.

16. Which of the following is/are true with reference to ‘view’ in DBMS ?
(a) A ‘view’ is a special stored procedure executed when certain event occurs.
(b) A ‘view’ is a virtual table, which occurs after executing a pre-compiled query.
Code :
(1) Only (a) is true                           (2) Only (b) is true
(3) Both (a) and (b) are true          (4) Neither (a) nor (b) are true

17. In SQL, __________ is an Aggregate function.
(1) SELECT                  (2) CREATE                   (3) AVG                    (4) MODIFY

18. Match the following with respect to RDBMS :
(a) Entity integrity                 (i) enforces some specific business rule that do not fall into entity or domain
(b) Domain integrity             (ii) Rows can’t be deleted which are used by other records
(c) Referential integrity       (iii) enforces valid entries for a column
(d) Userdefined integrity    (iv) No duplicate rows in a table
Code :
(a) (b) (c) (d)
(1) (iii) (iv) (i) (ii)
(2) (iv) (iii) (ii) (i)
(3) (iv) (ii) (iii) (i)
(4) (ii) (iii) (iv) (i)

19. In RDBMS, different classes of relations are created using __________ technique to prevent modification anomalies.
(1) Functional Dependencies         (2) Data integrity            (3) Referential integrity          (4) Normal Forms

20. __________ SQL command changes one or more fields in a record.
(1) LOOK-UP                           (2) INSERT                         (3) MODIFY                                 (4) CHANGE

21. Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i<=n), the index of the parent is :
(1) floor ((i+1)/2)                       (2) ceiling ((i+1)/2)                 (3) floor (i/2)                   (4) ceiling (i/2)

22. The following numbers are inserted into an empty binary search tree in the given order :
10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree ?
(1) 3                   (2) 4               (3) 5               (4) 6

23. Let G be an undirected connected graph with distinct edge weight. Let Emax be the edge with maximum weight and Emin the edge with minimum weight. Which of the following statements is false ?
(1) Every minimum spanning tree of G must contain Emin.
(2) If Emax is in minimum spanning tree, then its removal must disconnect G.
(3) No minimum spanning tree contains Emax.
(4) G has a unique minimum spanning tree.

24. A list of n strings, each of length n, is sorted into lexicographic order using merge – sort algorithm. The worst case running time of this computation is :
(1) O(n log n)                             (2) O(n2 log n)                          (3) O(n2 + log n)               (4) O(n3)

25. Postorder traversal of a given binary search tree T produces following sequence of keys :
3, 5, 7, 9, 4, 17, 16, 20, 18, 15, 14
Which one of the following sequences of keys can be the result of an in-order traversal of the tree T ?
(1) 3, 4, 5, 7, 9, 14, 20, 18, 17, 16, 15
(2) 20, 18, 17, 16, 15, 14, 3, 4, 5, 7, 9
(3) 20, 18, 17, 16, 15, 14, 9, 7, 5, 4, 3
(4) 3, 4, 5, 7, 9, 14, 15, 16, 17, 18, 20