Register

Recent questions tagged ugcnetcse-dec2010-paper2

0 votes
1 answer
31
UGC NET CSE | December 2010 | Part 2 | Question: 20
Which of the following is the process by which a user’s access to physical data in the application is limited, based on his privileges? Authorization Authentication Access Control All of these
Which of the following is the process by which a user’s access to physical data in the application is limited, based on his privileges?AuthorizationAuthenticationAccess...
User Avatar
2 votes
2 answers
32
UGC NET CSE | December 2010 | Part 2 | Question: 19
Optical storage is a High-speed direct access storage device. Low-speed direct access storage device. Medium-speed direct access storage device. High-speed sequential access storage device.
Optical storage is aHigh-speed direct access storage device.Low-speed direct access storage device.Medium-speed direct access storage device.High-speed sequential access ...
User Avatar
0 votes
2 answers
33
UGC NET CSE | December 2010 | Part 2 | Question: 18
Which of the following is an optimistic concurrency control method ? Validation based Time stamp ordering Lock-based None of these
Which of the following is an optimistic concurrency control method ?Validation basedTime stamp orderingLock-basedNone of these
User Avatar
0 votes
3 answers
35
UGC NET CSE | December 2010 | Part 2 | Question: 16
In generalisation, the differences between members of an entity is Maximized Minimized Both (A) & (B) None of these
In generalisation, the differences between members of an entity isMaximizedMinimizedBoth (A) & (B)None of these
User Avatar
1 votes
2 answers
38
UGC NET CSE | December 2010 | Part 2 | Question: 13
Which one of the following will set the value of $y$ to $5$ if $x$ has the value $3$, but not otherwise ? If $(x = 3) y = 5$ If $x = = 3 (y = 5)$ If $(x = = 3); y = 5$ If $(x = = 3) y = 5$
Which one of the following will set the value of $y$ to $5$ if $x$ has the value $3$, but not otherwise ?If $(x = 3) y = 5$ If $x = = 3 (y = 5)$If $(x = = 3); y = 5$ If $...
User Avatar
1 votes
1 answer
40
UGC NET CSE | December 2010 | Part 2 | Question: 11
How many of the following declarations are correct ? int $z = 7.0$; double void = $0.000$; short array $[2] = {0, 1, 2}$; char c = “\n”; None One is correct Two are correct All four are correct
How many of the following declarations are correct ?int $z = 7.0$;double void = $0.000$;short array $ = {0, 1, 2}$; char c = “\n”;NoneOne is correctTwo are correctAl...
User Avatar
0 votes
2 answers
43
UGC NET CSE | December 2010 | Part 2 | Question: 8
An Astable multivibrator has : One stable state Two stable states No stable states None of these
An Astable multivibrator has :One stable stateTwo stable statesNo stable statesNone of these
User Avatar
0 votes
1 answer
44
UGC NET CSE | December 2010 | Part 2 | Question: 7
$AB + (\bar{A+B})$ is equivalent to $A \bigoplus B$ $A \bigodot B$ $(A \bigoplus B) \bigodot A$ $(A \bigodot B) \bigoplus A$
$AB + (\bar{A+B})$ is equivalent to$A \bigoplus B$ $A \bigodot B$$(A \bigoplus B) \bigodot A$$(A \bigodot B) \bigoplus A$
User Avatar
2 votes
2 answers
46
UGC NET CSE | December 2010 | Part 2 | Question: 5
Consider the problem of connecting $19$ lamps to a single electric outlet by using extension cords each of which has four outlets. The number of extension cords required is $4$ $5$ $6$ $7$
Consider the problem of connecting $19$ lamps to a single electric outlet by using extension cords each of which has four outlets. The number of extension cords required ...
User Avatar
1 votes
2 answers
47
UGC NET CSE | December 2010 | Part 2 | Question: 4
The minimum number of edges in a connected graph with $‘n’$ vertices is equal to $n (n – 1)$ $\frac{n(n-1)}{2}$ $n^{2}$ $n – 1$
The minimum number of edges in a connected graph with $‘n’$ vertices is equal to$n (n – 1)$ $\frac{n(n-1)}{2}$$n^{2}$$n – 1$
User Avatar
0 votes
2 answers
48
UGC NET CSE | December 2010 | Part 2 | Question: 3
A partially ordered set is said to be a lattice if every two elements in the set have A unique least upper bound A unique greatest lower bound Both $(A)$ and $(B)$ None of the above
A partially ordered set is said to be a lattice if every two elements in the set haveA unique least upper boundA unique greatest lower boundBoth $(A)$ and $(B)$None of th...
User Avatar
3 votes
1 answer
49
UGC NET CSE | December 2010 | Part 2 | Question: 2
An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are All of even degree All of odd degree Of any degree Even in number
An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices areAll of even degreeAll of odd degreeOf any degreeEven in number
User Avatar
Page: