Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-june2015-paper2
1
votes
1
answer
31
UGC NET CSE | Junet 2015 | Part 2 | Question: 18
Drop Table cannot be used to drop a Table referenced by _______ constraint Primary key Sub key Super key Foreign key a a, b and c d a and d
Drop Table cannot be used to drop a Table referenced by _______ constraintPrimary keySub keySuper keyForeign keyaa, b and cda and d
go_editor
2.6k
views
go_editor
asked
Jul 30, 2016
Databases
ugcnetcse-june2015-paper2
databases
sql
+
–
2
votes
1
answer
32
UGC NET CSE | Junet 2015 | Part 2 | Question: 16
An Assertion is 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
An Assertion is predicate expressing a condition we wish database to always satisfy. The correct syntax for Assertion is:CREATE ASSERTION 'ASSERTION Name' CHECK 'Predicat...
go_editor
3.0k
views
go_editor
asked
Jul 30, 2016
Databases
ugcnetcse-june2015-paper2
databases
sql
+
–
2
votes
1
answer
33
UGC NET CSE | Junet 2015 | Part 2 | Question: 15
When the inheritance is private, the private methods in base class are _____ in the derived class (in C++) inaccessible accessible protected public
When the inheritance is private, the private methods in base class are _____ in the derived class (in C++)inaccessible accessibleprotectedpublic
go_editor
7.4k
views
go_editor
asked
Jul 30, 2016
Object Oriented Programming
ugcnetcse-june2015-paper2
oops
inheritance
+
–
1
votes
2
answers
34
UGC NET CSE | Junet 2015 | Part 2 | Question: 14
Which of the following is incorrect in C++? when we write overloaded function we must code the function for each usage when we write function template we code the function only once it is difficult to debug macros templates are more efficient than macros
Which of the following is incorrect in C++?when we write overloaded function we must code the function for each usagewhen we write function template we code the function ...
go_editor
3.2k
views
go_editor
asked
Jul 30, 2016
Object Oriented Programming
ugcnetcse-june2015-paper2
oops
template-vs-macro
+
–
1
votes
2
answers
35
UGC NET CSE | Junet 2015 | Part 2 | Question: 13
Given that $x=7.5, j=-1.0, n=1.0, m=2.0$ the value of $--x+j==x>n>=m$ is: $0$ $1$ $2$ $3$
Given that $x=7.5, j=-1.0, n=1.0, m=2.0$ the value of $ x+j==x>n>=m$ is:$0$$1$$2$$3$
go_editor
3.0k
views
go_editor
asked
Jul 30, 2016
Programming in C
ugcnetcse-june2015-paper2
programming-in-c
+
–
2
votes
3
answers
36
UGC NET CSE | Junet 2015 | Part 2 | Question: 12
Which of the following, in C++, is inherited in a derived class from base class? constructor destructor data members virtual methods
Which of the following, in C++, is inherited in a derived class from base class?constructordestructordata membersvirtual methods
go_editor
6.8k
views
go_editor
asked
Jul 30, 2016
Object Oriented Programming
ugcnetcse-june2015-paper2
oops
inheritance
+
–
1
votes
3
answers
37
UGC NET CSE | Junet 2015 | Part 2 | Question: 11
What is the output of the following program: (Assume that the appropriate preprocessor directives are included and there is not syntax error) main( ) { char S[]="ABCDEFGH"; printf("%C", *(&S[3])); printf("%s", S+4 ... of S is 1000 */ } $\text{ABCDEFGH}1000$ $\text{CDEFGH}1000$ $\text{DDEFGHH}1000$ $\text{DEFGH}1000$
What is the output of the following program: (Assume that the appropriate preprocessor directives are included and there is not syntax error)main( ) { char S[]="ABCDEFGH"...
go_editor
2.4k
views
go_editor
asked
Jul 30, 2016
Programming in C
ugcnetcse-june2015-paper2
programming-in-c
array
+
–
4
votes
1
answer
38
UGC NET CSE | Junet 2015 | Part 2 | Question: 10
Consider a proposition given as: $x \geq 6$, if $x^2 \geq 25 $ and and its proof as: If $x \geq 6$, then $x^2 =x.x \geq 6.6 = 36 \geq 25$ Which of the following is correct with respect to the given proposition and its proof? ... assuming what is to be shown The proof is correct and there is nothing wrong $ i$ only $iii$ only $i$ and $ii$ $ii$ only
Consider a proposition given as:$x \geq 6$, if $x^2 \geq 25 $ and and its proof as:If $x \geq 6$, then $x^2 =x.x \geq 6.6 = 36 \geq 25$Which of the following is correct w...
go_editor
2.0k
views
go_editor
asked
Jul 30, 2016
Mathematical Logic
ugcnetcse-june2015-paper2
discrete-mathematics
propositional-logic
+
–
3
votes
2
answers
39
UGC NET CSE | Junet 2015 | Part 2 | Question: 9
Match the following : ... $\text{(a)-(iv), (b)-(ii), (c)-(iii), (d)-(i)}$
Match the following :$\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II} \\ \text{(a)}&(p \rightarrow q) \Leftrightarrow (\neg q \rightarrow \neg p) & \text{(i)} ...
go_editor
1.6k
views
go_editor
asked
Jul 30, 2016
Mathematical Logic
ugcnetcse-june2015-paper2
mathematical-logic
propositional-logic
+
–
4
votes
2
answers
40
UGC NET CSE | Junet 2015 | Part 2 | Question: 8
"If my computations are correct and I pay the electric bill, then I will run out of money. If I don't pay the electric bill, the power will be turned off. Therefore, If I don't run out of money and the power is still on then my ...
"If my computations are correct and I pay the electric bill, then I will run out of money. If I don't pay the electric bill, the power will be turned off. Therefore, If I...
go_editor
2.7k
views
go_editor
asked
Jul 30, 2016
Mathematical Logic
ugcnetcse-june2015-paper2
mathematical-logic
+
–
1
votes
3
answers
41
UGC NET CSE | Junet 2015 | Part 2 | Question: 7
Consider a full-adder with the following input values : $x=1, y=0$ and $C_i$(carry input)$=0$ $x=0, y=1$ and $C_i =1$ Compute the value of S(sum) and $C_o$ (carry output) for the above input values : $S=1, C_o=0$ and $S=0, C_o=1$ $S=0, C_o=0$ and $S=1, C_o=1$ $S=1, C_o=1$ and $S=0, C_o=0$ $S=0, C_o=1$ and $S=1, C_o=0$
Consider a full-adder with the following input values :$x=1, y=0$ and $C_i$(carry input)$=0$$x=0, y=1$ and $C_i =1$Compute the value of S(sum) and $C_o$ (carry output) fo...
go_editor
2.9k
views
go_editor
asked
Jul 30, 2016
Digital Logic
ugcnetcse-june2015-paper2
digital-logic
full-adder
+
–
4
votes
1
answer
42
UGC NET CSE | Junet 2015 | Part 2 | Question: 6
Consider the following statements: Boolean expressions and logic gates networks correspond to labelled acyclic digraphs Optimal boolean expressions may not correspond to simplest networks. Choosing essential blocks first in a Karnaugh map and then greedily choosing the ... these statement(s) is/are correct? i only ii only i and ii i, ii, and iii
Consider the following statements:Boolean expressions and logic gates networks correspond to labelled acyclic digraphsOptimal boolean expressions may not correspond to si...
go_editor
1.9k
views
go_editor
asked
Jul 30, 2016
Digital Logic
ugcnetcse-june2015-paper2
digital-logic
boolean-algebra
+
–
3
votes
3
answers
43
UGC NET CSE | Junet 2015 | Part 2 | Question: 5
Consider a Hamiltonian Graph(G) with no loops and parallel edges. Which of the following is true with respect to this graph (G)? $\deg (v) \geq n/2$ for each vertex of $G$ $\mid E(G) \mid \geq 1/2 (n-1)(n-2)+2$ edges $\deg(v) + \deg(w) \geq n$ ... $v$ and $\omega$ not connected by an edge $i$ and $ii$ $ii$ and $iii$ $i$ and $iii$ $i$, $ii$, and $iii$
Consider a Hamiltonian Graph(G) with no loops and parallel edges. Which of the following is true with respect to this graph (G)?$\deg (v) \geq n/2$ for each vertex of $G$...
go_editor
4.4k
views
go_editor
asked
Jul 30, 2016
Graph Theory
ugcnetcse-june2015-paper2
discrete-mathematics
graph-theory
+
–
3
votes
1
answer
44
UGC NET CSE | Junet 2015 | Part 2 | Question: 4
Consider the following statements: Depth-first search is used to traverse a rooted tree Pre-order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. Huffman's algorithm is used to find an optimal binary tree with given weights Topological ... $\text{iii and iv}$ $\text{i, ii, and iii}$ $\text{i, ii, iii, and iv}$
Consider the following statements:Depth-first search is used to traverse a rooted treePre-order, Post-order and Inorder are used to list the vertices of an ordered rooted...
go_editor
2.3k
views
go_editor
asked
Jul 30, 2016
Algorithms
ugcnetcse-june2015-paper2
tree
tree-traversal
+
–
3
votes
3
answers
45
UGC NET CSE | Junet 2015 | Part 2 | Question: 3
In how many ways can $15$ indistinguishable fish be placed into $5$ different ponds, so that each pond contains at least one fish? $1001$ $3876$ $775$ $200$
In how many ways can $15$ indistinguishable fish be placed into $5$ different ponds, so that each pond contains at least one fish?$1001$$3876$$775$$200$
go_editor
4.6k
views
go_editor
asked
Jul 30, 2016
Combinatory
ugcnetcse-june2015-paper2
combinatory
counting
+
–
1
votes
2
answers
46
UGC NET CSE | Junet 2015 | Part 2 | Question: 2
Considering an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die? $\dfrac{22}{36} \\$ $\dfrac{12}{36} \\$ $\dfrac{14}{36} \\$ $\dfrac{6}{36}$
Considering an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die?$\dfrac{...
go_editor
3.6k
views
go_editor
asked
Jul 30, 2016
Probability
ugcnetcse-june2015-paper2
probability
+
–
5
votes
2
answers
47
UGC NET CSE | Junet 2015 | Part 2 | Question: 1
How many strings of $5$ digits have the property that the sum of their digits is $7$? $66$ $330$ $495$ $99$
How many strings of $5$ digits have the property that the sum of their digits is $7$?$66$$330$$495$$99$
go_editor
2.8k
views
go_editor
asked
Jul 30, 2016
Combinatory
ugcnetcse-june2015-paper2
discrete-mathematics
counting
+
–
0
votes
2
answers
48
UGC NET CSE | June 2014 | Part 3 | Question: 27, UGCNET-June2015-II: 17
Which of the following concurrency protocol ensues both conflict serializability and freedom from deadlock: $2$-phase locking Time phase ordering Both I & II II only I only Neither I nor II
Which of the following concurrency protocol ensues both conflict serializability and freedom from deadlock:$2$-phase lockingTime phase orderingBoth I & IIII onlyI onlyNei...
makhdoom ghaya
1.6k
views
makhdoom ghaya
asked
Jul 9, 2016
Databases
ugcnetjune2014iii
databases
concurrency
protocol
ugcnetcse-june2015-paper2
+
–
1
votes
1
answer
49
UGC NET CSE | Junet 2015 | Part 2 | Question: 40
The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure? File descriptor table System call state Scheduling parameters Kernel stack
The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user s...
Sanjay Sharma
2.0k
views
Sanjay Sharma
asked
Jun 28, 2016
Operating System
ugcnetcse-june2015-paper2
unix
+
–
17
votes
3
answers
50
GATE CSE 2007 | Question: 39, UGCNET-June2015-II: 22
The inorder and preorder traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$, respectively The postorder traversal of the binary tree is: $\text{d e b f g c a}$ $\text{e d b g f c a}$ $\text{e d b f g c a}$ $\text{d e f g b c a}$
The inorder and preorder traversal of a binary tree are$\text{d b e a f c g}$ and $\text{a b d e c f g}$, respectivelyThe postorder traversal of the binary tree is:$\text...
Kathleen
7.8k
views
Kathleen
asked
Sep 21, 2014
DS
gatecse-2007
data-structures
binary-tree
normal
ugcnetcse-june2015-paper2
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register