UGC-NET CS 2017 Nov - II

Last Updated :
Discuss
Comments

Question 1

Consider the graph given below : kruskal 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 chosen 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

  • (1)
  • (1),(2)
  • (1),(2),(3)
  • (1),(2),(3),(4)
Discuss it

Question 2

Let P and Q be two propositions, ¬ (P ↔ Q) is equivalent to: (I) P ↔ ¬ Q (II) ¬ P ↔ Q (III) ¬ P ↔ ¬ Q (IV) Q → P
  • Only (I) and (II)
  • Only (II) and (III)
  • Only (III) and (IV)
  • None of the above
Discuss it

Question 3

How many distinguishable permutations of the letters in the word BANANA are there ?

  • 720

  • 120

  • 60

  • 360

Discuss it

Question 4

Let m=(313)4 and n=(322)4. Find the base 4 expansion of m+n.

  • (635)4

  • (32312)4

  • (21323)4

  • (1301)4

Discuss it

Question 5

54454 Find the boolean product A⊙B of the two matrices. answer

  • (1)

  • (2)

  • (3)

  • (4)

Discuss it

Question 6

If the time is now 4 O’clock, what will be the time after 101 hours from now ?

  • 9 O’clock

  • 8 O’clock

  • 5 O’clock

  • 4 O’clock

Discuss it

Question 7

The Boolean function with the Karnaugh map

q6

is:

  • (A+C).D+B

  • (A+B).C+D

  • (A+D).C+B

  • (A+C).B+D

Discuss it

Question 8

The Octal equivalent of the binary number 1011101011 is :
  • 7353
  • 1353
  • 5651
  • 5657
Discuss it

Question 9

‘ptrdata’ is a pointer to a data type. The expression *ptrdata++ is evaluated as (in C++) :
 

  • Depends on compiler
     

  • (*ptrdata)++
     

  • *(ptrdata)++
     

  • *(ptrdata++)
     

Discuss it

Question 10

A member function can always access the data in __________ , (in C++).
  • the class of which it is member
  • the object of which it is a member
  • the public part of its class
  • the private part of its class
Discuss it
Tags:
UGC-NET

There are 50 questions to complete.

Take a part in the ongoing discussion
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy