• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

UGC NET CS 2015 Jun - II

Question 11

What is the output of the following program? (Assume that the appropriate preprocessor directives are included and there is no syntax error)
main ( ) 
     { char S[ ] = "ABCDEFGH"; 
      printf ("%C", *(&S[3]));
      printf ("%s", S + 4); 
      printf ("%u", S);		
      /* Base address of S is 1000 */		
     }
  • ABCDEFGH1000
  • CDEFGH1000
  • DDEFGHH1000
  • DEFGH1000

Question 12

Which of the following is incorrect in C++ ? (1)When we write overloaded function we must code the function for each usage. (2)When we write function template we code the function only once. (3)It is difficult to debug macros (4)Templates are more efficient than macros
  • (1) and (2)
  • (1), (2) and (3)
  • (3) and (4)
  • All are correct.

Question 13

When the inheritance is private, the private methods in base class are __________ in the derived class (in C++).
  • inaccessible
  • accessible
  • protected
  • public

Question 14

An Assertion is a predicate expressing a condition we wish database to always satisfy. The correct syntax for Assertion is :
  • CREATE ASSERTION ‘ASSERTION Name’ CHECK ‘Predicate’
  • CREATE ASSERTION ‘ASSERTION Name’
  • CREATE ASSERTION, CHECK Predicate
  • SELECT ASSERTION

Question 15

Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock? (a)z - phase Locking (b)Time stamp - ordering
  • Both (a) and (b)
  • (a) only
  • (b) only
  • Neither (a) nor (b)

Question 16

Drop Table cannot be used to drop a Table referenced by __________ constraint. (a)Primary key (b)Sub key (c)Super key (d)Foreign key
  • (a)
  • (a), (b) and (c)
  • (d)
  • (a) and (d)

Question 17

For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as:
  • Neighbour Set
  • Strong Entity Set
  • Owner Entity Set
  • Weak Set

Question 18

Consider the given graph "21 Its Minimum Cost Spanning Tree is __________. (1) "21 (2) "21 (3) "21 (4) "21
  • (1)
  • (2)
  • (3)
  • (4)

Question 19

The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal is __________.
  • dbefacg
  • debfagc
  • dbefcga
  • debfgca

Question 20

Level order Traversal of a rooted Tree can be done by starting from root and performing:
  • Breadth First Search
  • Depth First Search
  • Root Search
  • Deep Search

There are 49 questions to complete.

Last Updated :
Take a part in the ongoing discussion