Friday, 9 December 2016

UGC-NET JULY 2016 PAPER 2 QUESTIONS

UGC-NET JULY 2016 PAPER 2 QUESTIONS


Q::11. Given i = 0, j = 1, k = –1 x = 0.5, y = 0.0 What is the output of the following expression in C language ?
 x * y < i + j || k

 (1) – 1              (2) 0
 (3) 1                 (4) 2

Answer:: (3)

For Explanation Visit::
http://cbsenetmaterial.blogspot.in/2016/12/ugc-net-computer-science-july-2016_19.html

Q::12. The following statement in ‘C’ 
          int (*f())[ ];
declares?

(1) a function returning a pointer to an array of integers.
(2) a function returning an array of pointers to integers.
(3) array of functions returning pointers to integers.
(4) an illegal statement.

Answer:: (4)

Q::13. Which one of the following is correct, when a class grants friend status to another class ?

(1) The member functions of the class generating friendship can access the members of
the friend class.

(2) All member functions of the class granted friendship have unrestricted access to the
members of the class granting the friendship.

(3) Class friendship is reciprocal to each other.

(4) There is no such concept.

Answer:: (2)

Q::14. When a method in a subclass has the same name and type signatures as a method in the
superclass, then the method in the subclass _____ the method in the superclass.

(1) Overloads                           (2) Friendships
(3) Inherits                              (4) Overrides

Answer:: (4)

Q::15. What is the value returned by the function f given below when n = 100 ?
           int f (int n)
          { 
                 if (n = = 0) then 
                      return n;
                else
                      return n + f(n-2);
          }

(1) 2550                    (2) 2556
(3) 5220                    (4) 5520

Answer:: (1)

For Explanation Visit::
http://cbsenetmaterial.blogspot.in/2016/08/ugc-net-computer-science-july-2016_13.html

Q::16. In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as :
(1) Referential integrity

(2) Multi-valued dependency

(3) Entity Integrity

(4) Functional dependency

Answer::(3)

Q::17. Which of the following statement(s) is/are FALSE in the context of Relational DBMS ?

 I. Views in a database system are important because they help with access control by allowing users to see only a particular subset of the data in the database.

II. E-R diagrams are useful to logically model concepts.

III. An update anomaly is when it is not possible to store information unless some other, unrelated information is stored as well.

IV. SQL is a procedural language.

(1) I and IV only                      (2) III and IV only

(3) I, II and III only                (4) II, III and IV only

Answer:: (4)

Q::18. In a relational database model, NULL values can be used for all but which one of the following ?

(1) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.

(2) To avoid confusion with actual legitimate data values like 0 (zero) for integer columns and ’’ (the empty string) for string columns.

(3) To leave columns in a tuple marked as ’’unknown’’ when the actual value is unknown.

(4) To fill a column in a tuple when that column does not really ”exist” for that particular tuple.

Answer:: (3)

Q::19. Consider the following two commands C1 and C2 on the relation R from an SQL database :

C1 : drop table R;

C2 : delete from R;

Which of the following statements is TRUE ?

  I. Both C1 and C2 delete the schema for R.

 II. C2 retains relation R, but deletes all tuples in R.

III. C1 deletes not only all tuples of R, but also the schema for R.

(1) I only                           (2) I and II only
(3) II and III only             (4) I, II and III

Answer:: (3)

Q::20. Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table :
                                       A B C D
                                      a1 b1 c1 d1
                                      a2 b3 c3 d1
                                      a1 b2 c1 d2

I : {B}         II : {B, C}            III : {A, D}             IV : {C, D}

If different symbols stand for different values in the table (e.g., d1 is definitely not equal to d2), then which of the above could not be the candidate key for the database table ?

(1) I and III only                          (2) III and IV only

(3) II only                                     (4) I only


Answer:: (3)

                                                                     1 2 3 4 5 


UGC-NET JULY 2016 PAPER 2 QUESTIONS

UGC-NET JULY 2016 PAPER 2 QUESTIONS


Q:: 1 How many different equivalence relations with exactly three different equivalence classes are there on a set with five elements
A. 10
B. 15
C. 25
D. 30
 
Answer:: (C)


 
Q:: 2 The number of different spanning trees in complete graph, K4 and bipartite graph, K2,2 have ____ and ____ respectively.

A. 14,14
B. 16,14
C. 16,4
D. 14,4

Answer: C

For Explanation Visit:
http://cbsenetmaterial.blogspot.in/2016/12/ugc-net-computer-science-july-2016.html
 
 
Q:: 3 Suppose that R1 and R2 are reflexive relations on a set A.  Which of the following statements is correct ?

A. R1 ∩R2 is Reflexive and R1 ∪R2 is irreflexive
B. R1 ∩R2 is irReflexive and R1 ∪R2 is reflexive
C. Both R1 ∩R2 and R1 ∪R2 are reflexive
D. Both R1 ∩R2 and R1 ∪R2 are irreflexive


Answer: C

For Explanation Visit:
http://cbsenetmaterial.blogspot.in/2016/08/ugc-net-computer-science-july-2016.html
 
 
Q:: 4 There are three cards in a box. Both sides of one card are black, both sides of one card are red, and the third card has one black side and one red side. we pick a card at random and observe only one side. What is the probability that the opposite side is the same colour as the one side we observed ?

A. 3/4
B. 2/3
C. 1/2
D. 1/3
 

Answer: B

For Explanation Visit: 
http://cbsenetmaterial.blogspot.in/2016/12/ugc-net-computer-science-july-2016_4.html

Q:: 5 A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in the graph shown below.



A. 2
B. 4
C. 5
D. 6
 
 
Answer: Marks to All

For Explanation Visit:  
http://cbsenetmaterial.blogspot.in/2016/12/ugc-net-computer-science-july-2016_85.html

Q:: 6 Which of the following logic expressions is incorrect ?

A. 1⊕0 = 1
B. 1⊕1⊕1 = 1
C. 1⊕1⊕0 = 1
D. 1⊕1 = 0

 
Answer: C

For Explanation Visit:
http://cbsenetmaterial.blogspot.in/2016/12/ugc-net-computer-science-july-2016_48.html
 
Q:: 7 The IEEE-754 double precision format to represent floating point numbers, has a length of _____ bits.

A. 16
B. 32
C. 48
D. 64
 
Answer:: (D)
 
Q:: 8 The Simplified form of a Boolean equation for the following truth table is

A. F = yz' + y'z
B. F = xy' + x'y
C. F = x'z + xz'
D. F = x'z + xz' + xyz
 
Answer:: (C)
 
Q:: 9 The Simplified form of a Boolean equation (AB'+AB'C+Ac)(A'C' +B') is

A. AB'
B. AB'C
C. A'B
D. ABC
 
 
Answer: C

For Explanation Visit:
http://cbsenetmaterial.blogspot.in/2016/12/ugc-net-computer-science-july-2016_8.html
 
Q:: 10 In a Positive edge triggered JK flip-flop, if J and K both are high then the output will be _______ on the rising edge of the clock.

A. No Change
B. Set
C. Reset
D. Toggle

Answer:: (D)
                                                      1 2 3 4 5 

Thursday, 8 December 2016

UGC-NET Computer Science July 2016 Solved Paper 2

UGC-NET Computer Science July 2016 Solved Paper 2

Q:: 32 The content of the accumulator after the execution of the following 8085 assembly 

language program, is :

MVI A, 42H

MVI B, 05H

UGC: ADD B

DCR B

JNZ UGC

ADI 25H

HLT

(1) 82 H                                (2) 78 H

(3) 76 H                                (4) 47 H

Answer:: (3)


Explanation::


Content of accumulator register (A):-    01000010

Content of register (B)                   :-    00000101


                                                         A : 01000010
                                                       +B : 00000101
                                                             : 01000111
                                                         B = B - 1
                                                         B = 00000100

                                                          A : 01000111
                                                        +B : 00000100
                                                             :  01001011
                                                         B = B - 1
                                                         B = 00000011
                                                     
                                                          A : 01001011
                                                        +B : 00000011
                                                             :  01001110
                                                         B = B - 1
                                                         B = 00000010


                                                          A : 01001110
                                                        +B : 00000010
                                                              : 01010000           
                                                         B = B - 1
                                                         B = 00000100


                                                        A :  01010000 
                                                      +B :  00000001
                                                           :   01010001           
                                                         B = B - 1
                                                         B = 00000000

Now the loop exits as contents of B register becomes 00000000.

Add 25H to A register
                                       A:-   01010001
                                             +00100101
                                               01110110

So, Contents of accumulator (A) becomes 01110110 i.e. 76H.









UGC-NET Computer Science july 2016 solved paper,UGC-NET Computer Science july 2016 paper 2,cbse-net july 2016 solved paper
ugc net computer science question papers,ugc net computer science december 2014 question papers,
ugc net computer science june 2014 question papers,
ugc net computer science december 2014 question papers,
ugc net computer science june 2013 question papers,
ugc net computer science december 2013 question papers,
ugc net computer science june 2012 question papers,
ugc net computer science december 2012 question papers,
ugc net computer science june 2011 question papers,
ugc net computer science december 2011 question papers,
ugc net computer science june 2010 question papers,
ugc net computer science december 2010 question papers,
ugc net computer science june 2009 question papers,
ugc net computer science december 2009 question papers,
ugc net computer science june 2008 quest

UGC-NET Computer Science July 2016 Solved Paper 2

UGC-NET Computer Science July 2016 Solved Paper 2


Q::11 Given i = 0, j = 1, k = –1, x = 0.5, y = 0.0

         What is the output of the following expression in C language ?

          x * y < i + j || k

          (1) – 1                                      (2)   0

          (3)    1                                      (4)   2


Answer:: (3)


Explanation::

  = x * y < i + j || k

  = 0.5 * 0.0 < 0 + 1 || -1

  = 0.0 <  0 + 1 || -1

  = 0.0 < 1 || -1

  = 1 || -1

 = 1


Here is operator precedence table for you::

CategoryOperatorAssociativity
Postfix() [] -> . ++ - -Left to right
Unary+  -  !  ~  ++  - -   (type)* & sizeofRight to left
Multiplicative* / %Left to right
Additive+ -Left to right
Shift<< >>Left to right
Relational< <= > >=Left to right
Equality== !=Left to right
Bitwise AND&Left to right
Bitwise XOR^Left to right
Bitwise OR|Left to right
Logical AND&&Left to right
Logical OR||Left to right
Conditional?:Right to left
Assignment= += -= *= /= %=>>= <<= &= ^= |=Right to left
Comma,Left to right





UGC-NET Computer Science july 2016 solved paper,UGC-NET Computer Science july 2016 paper 2,cbse-net july 2016 solved paper
ugc net computer science question papers,ugc net computer science december 2014 question papers,
ugc net computer science june 2014 question papers,
ugc net computer science december 2014 question papers,
ugc net computer science june 2013 question papers,
ugc net computer science december 2013 question papers,
ugc net computer science june 2012 question papers,
ugc net computer science december 2012 question papers,
ugc net computer science june 2011 question papers,
ugc net computer science december 2011 question papers,
ugc net computer science june 2010 question papers,
ugc net computer science december 2010 question papers,
ugc net computer science june 2009 question papers,
ugc net computer science december 2009 question papers,
ugc net computer science june 2008 quest

UGC-NET Computer Science July 2016 Solved Paper 2

UGC-NET Computer Science July 2016 Solved Paper 2


Q::9  The simplified form of a boolean equation (AB'+AB'C+AC)(A'C'+B') is :

(1) AB'                                           (2) AB'C
(3) A'B                                           (4) ABC



Answer:: (1)

Explanation::

 =( AB' + AB'C + AC ) ( A'C' + B' )

 =( AB'( 1 + C ) + AC ) ( A'C' + B' )                       [ x + 1 = 1 ]

 =( AB' + AC ) ( A'C' + B' )

 =( AA'B'C' + AB'B' + AA'CC' + AB'C )

 =( 0 + AB' + 0 + AB'C )                                         [ x . x' = 0 ]

 = AB'( 1 + C )

 = AB'
































UGC-NET Computer Science july 2016 solved paper,UGC-NET Computer Science july 2016 paper 2,cbse-net july 2016 solved paper
ugc net computer science question papers,ugc net computer science december 2014 question papers,
ugc net computer science june 2014 question papers,
ugc net computer science december 2014 question papers,
ugc net computer science june 2013 question papers,
ugc net computer science december 2013 question papers,
ugc net computer science june 2012 question papers,
ugc net computer science december 2012 question papers,
ugc net computer science june 2011 question papers,
ugc net computer science december 2011 question papers,
ugc net computer science june 2010 question papers,
ugc net computer science december 2010 question papers,
ugc net computer science june 2009 question papers,
ugc net computer science december 2009 question papers,
ugc net computer science june 2008 quest

Sunday, 4 December 2016

UGC-NET Computer Science July 2016 Solved Paper 2

UGC-NET Computer Science July 2016 Solved Paper 2


Q:: 6  Which of the following logic expressions is incorrect ?
(1) 1 ⊕ 0 = 1
(2) 1 ⊕ 1 ⊕ 1 = 1
(3) 1 ⊕ 1 ⊕ 0 = 1
(4) 1 ⊕ 1 = 0

Answer:: (3)

Explanation::

The symbol  ⊕  stands for X-OR gate. X-OR gives output as 1 when only one of the two inputs are supplied as 1 otherwise 0.

A     B      AB
0      0          0
0      1          1
1      0          1
1      1          0

 So, on inspecting option (3) produce 1 ⊕ 1 ⊕ 0 = 0 ⊕ 0 = 0.
 Hence it is incorrect. All others are correct.


























UGC-NET Computer Science july 2016 solved paper,UGC-NET Computer Science july 2016 paper 2,cbse-net july 2016 solved paper
ugc net computer science question papers,ugc net computer science december 2014 question papers,
ugc net computer science june 2014 question papers,
ugc net computer science december 2014 question papers,
ugc net computer science june 2013 question papers,
ugc net computer science december 2013 question papers,
ugc net computer science june 2012 question papers,
ugc net computer science december 2012 question papers,
ugc net computer science june 2011 question papers,
ugc net computer science december 2011 question papers,
ugc net computer science june 2010 question papers,
ugc net computer science december 2010 question papers,
ugc net computer science june 2009 question papers,
ugc net computer science december 2009 question papers,
ugc net computer science june 2008 quest

UGC-NET Computer Science July 2016 Solved Paper 2

UGC-NET Computer Science July 2016 Solved Paper 2


Q:: A clique in a simple undirected graph is a complete subgraph that is not contained in any
larger complete subgraph. How many cliques are there in the graph shown below ?
(1) 2                       (2) 4
(3) 5                       (4) 6

Answer:: Marks to All

Explanation::


So, there are total 8 cliques in all and no option matches.




























UGC-NET Computer Science july 2016 solved paper,UGC-NET Computer Science july 2016 paper 2,cbse-net july 2016 solved paper
ugc net computer science question papers,ugc net computer science december 2014 question papers,
ugc net computer science june 2014 question papers,
ugc net computer science december 2014 question papers,
ugc net computer science june 2013 question papers,
ugc net computer science december 2013 question papers,
ugc net computer science june 2012 question papers,
ugc net computer science december 2012 question papers,
ugc net computer science june 2011 question papers,
ugc net computer science december 2011 question papers,
ugc net computer science june 2010 question papers,
ugc net computer science december 2010 question papers,
ugc net computer science june 2009 question papers,
ugc net computer science december 2009 question papers,
ugc net computer science june 2008 quest

UGC-NET Computer Science July 2016 Solved Paper 2

UGC-NET Computer Science July 2016 Solved Paper 2

Q::4 There are three cards in a box. Both sides of one card are black, both sides of one card are
red, and the third card has one black side and one red side. We pick a card at random and
observe only one side.
What is the probability that the opposite side is the same color as the one side we
observed ?
(1) 3/4                                  (2) 2/3
(3) 1/2                                  (4) 1/3

Answer:: (2)

Explanation::

Total number of cases = 3 i.e. (BB,RR,BR) Preferred number of cases =2 (BB,RR) since 2 cards have the same colour both sides. Probability = 2/3.






















UGC-NET Computer Science july 2016 solved paper,UGC-NET Computer Science july 2016 paper 2,cbse-net july 2016 solved paper
ugc net computer science question papers,ugc net computer science december 2014 question papers,
ugc net computer science june 2014 question papers,
ugc net computer science december 2014 question papers,
ugc net computer science june 2013 question papers,
ugc net computer science december 2013 question papers,
ugc net computer science june 2012 question papers,
ugc net computer science december 2012 question papers,
ugc net computer science june 2011 question papers,
ugc net computer science december 2011 question papers,
ugc net computer science june 2010 question papers,
ugc net computer science december 2010 question papers,
ugc net computer science june 2009 question papers,
ugc net computer science december 2009 question papers,
ugc net computer science june 2008 quest

Saturday, 3 December 2016

UGC-NET Computer Science July 2016 Solved Paper 2

UGC-NET Computer Science July 2016 Solved Paper 2

Q::2 The number of different spanning trees in complete graph, K4 and bipartite graph, K2,2 have ______ and _______ respectively.

 (1) 14, 14  (2) 16, 14

 (3) 16, 4    (4) 14, 4

Answer:: (3)

Explanation::

Let 'n' be total number of vertices in complete graph Kn then total different spanning trees are nn-2 
n = 4 as given then total different spanning trees are 44-2 = 4= 16.

The number of labelled spanning trees in a bipartite graph Km,n is given by mn-1*nm-1 .
As given in question number of spanning trees in bipartite graph K2,2 = 22-1 * 22-1 = 4.








UGC-NET Computer Science july 2016 solved paper,UGC-NET Computer Science july 2016 paper 2,cbse-net july 2016 solved paper
ugc net computer science question papers,ugc net computer science december 2014 question papers,
ugc net computer science june 2014 question papers,
ugc net computer science december 2014 question papers,
ugc net computer science june 2013 question papers,
ugc net computer science december 2013 question papers,
ugc net computer science june 2012 question papers,
ugc net computer science december 2012 question papers,
ugc net computer science june 2011 question papers,
ugc net computer science december 2011 question papers,
ugc net computer science june 2010 question papers,
ugc net computer science december 2010 question papers,
ugc net computer science june 2009 question papers,
ugc net computer science december 2009 question papers,
ugc net computer science june 2008 quest

Complete Result of candidates qualified UGC NET July-August 2016