Register

Recent questions tagged ugcnetsep2013ii

2 votes
2 answers
2
UGC NET CSE | September 2013 | Part 2 | Question: 49
What type of logic circuit is represented by the figure shown below ? $\text{XOR}$ $\text{XNOR}$ $\text{XAND}$ $\text{XNAND}$
What type of logic circuit is represented by the figure shown below ?$\text{XOR}$$\text{XNOR}$$\text{XAND}$$\text{XNAND}$
User Avatar
1 votes
2 answers
6
UGC NET CSE | September 2013 | Part 2 | Question: 45
The hit ratio of a Transaction Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is _____ 36 ns 140 ns 122 ns 40 ns
The hit ratio of a Transaction Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access ...
User Avatar
1 votes
2 answers
7
UGC NET CSE | September 2013 | Part 2 | Question: 44
Match the following $:$ ... $\text{a-iv, b-iii, c-i, d-ii}$ $\text{a-iii, b-iv, c-ii, d-i}$
Match the following $:$$\begin{array}{} & \textbf{List – I} && \textbf{List – II} \\ & \textbf{Process state} && \textbf{Reason for transition}\\ & \textbf{transiti...
User Avatar
1 votes
2 answers
8
UGC NET CSE | September 2013 | Part 2 | Question: 43
Thoma’s-write rule is Two phase locking protocol Timestamp ordering protocol One phase locking protocol Sliding window protocol
Thoma’s-write rule isTwo phase locking protocolTimestamp ordering protocolOne phase locking protocolSliding window protocol
User Avatar
1 votes
2 answers
10
UGC NET CSE | September 2013 | Part 2 | Question: 41
Cross_tab displays permit users to view ____ of multidimensional data at a time. One dimension Two dimensions Three dimensions Multidimensions
Cross_tab displays permit users to view ____ of multidimensional data at a time.One dimensionTwo dimensionsThree dimensionsMultidimensions
User Avatar
1 votes
2 answers
11
UGC NET CSE | September 2013 | Part 2 | Question: 40
The decision tree classifier is a widely used technique for Classification Association Partition Clustering
The decision tree classifier is a widely used technique forClassificationAssociationPartitionClustering
User Avatar
1 votes
2 answers
12
UGC NET CSE | September 2013 | Part 2 | Question: 39
Views are useful for ____ unwanted information, and for collecting together information from more than one relation into a single view. Hiding Deleting Highlighting All of the above
Views are useful for ____ unwanted information, and for collecting together information from more than one relation into a single view.HidingDeletingHighlightingAll of th...
User Avatar
2 votes
1 answer
13
UGC NET CSE | September 2013 | Part 2 | Question: 38
The _____ language was originally designed as the Transformation Language for Style Sheet Facility XSTL XML XQuery XPath
The _____ language was originally designed as the Transformation Language for Style Sheet FacilityXSTLXMLXQueryXPath
User Avatar
1 votes
1 answer
14
UGC NET CSE | September 2013 | Part 2 | Question: 37
Usage of Preemption and Transaction Rollback prevents _____. Unauthorized usage of data file Deadlock situation Data manipulation File pre-emption
Usage of Preemption and Transaction Rollback prevents _____.Unauthorized usage of data fileDeadlock situationData manipulationFile pre-emption
User Avatar
1 votes
3 answers
15
UGC NET CSE | September 2013 | Part 2 | Question: 36
Consider the following program segment: d=0; for(i=1; i<31, ++i) for (j=1; j < 31; ++j) for (k=1; k < 31; ++k) if((i+j+k%3)==0)) d=d+1; printf(“%d”, d); The output will be 9000 3000 90 2700
Consider the following program segment:d=0; for(i=1; i<31, ++i) for (j=1; j < 31; ++j) for (k=1; k < 31; ++k) if((i+j+k%3)==0)) d=d+1; printf(“%d”, d);The output will...
User Avatar
1 votes
1 answer
17
UGC NET CSE | September 2013 | Part 2 | Question: 34
What is the output of the following program segment? sum(n) { if (n<1) return n; else return (n+sum(n-1)); } main() { printf(&ldquo;%d&rdquo;, sum(5)); } 10 16 15 14
What is the output of the following program segment?sum(n) { if (n<1) return n; else return (n+sum(n-1)); } main() { printf(&ldquo;%d&rdquo;, sum(5)); }10161514
User Avatar
1 votes
2 answers
18
UGC NET CSE | September 2013 | Part 2 | Question: 33
What is the size of the following union? Assume that the size of int=2, size of float =4, size of char=1 union tag { int a; float b; char c; }; 2 4 1 7
What is the size of the following union? Assume that the size of int=2, size of float =4, size of char=1union tag { int a; float b; char c; };2417
User Avatar
1 votes
1 answer
20
UGC NET CSE | September 2013 | Part 2 | Question: 30
Equivalence partitioning is a _____ testing method that divides the input domain of a program into classes of data from which test cases can be derived. White box Black box Regression Smoke
Equivalence partitioning is a _____ testing method that divides the input domain of a program into classes of data from which test cases can be derived.White boxBlack box...
User Avatar
1 votes
1 answer
24
UGC NET CSE | September 2013 | Part 2 | Question: 26
Match the following identities/laws to their corresponding name $:$ ... $\text{(a)-iv, (b)-iii, (c)-ii, (d)-i}$ $\text{(a)-iii, (b)-iv, (c)-ii, (d)-i}$
Match the following identities/laws to their corresponding name $:$$\begin{array}{} \text{(a)} & \text{x+x = x} & \text{i.} & \text{Dominance} \\ & \text{x $\cdot$x = x}...
User Avatar
2 votes
1 answer
25
UGC NET CSE | September 2013 | Part 2 | Question: 24
The quantification $\exists ! x P(x)$ ... $\exists x P(x) \wedge \forall x \forall y ((P(x) \vee P(y)) \rightarrow x=y)$
The quantification $\exists ! x P(x)$ denotes the proposition “There exists a unique x such that P(x) is true”, express he quantification using universal and existent...
User Avatar
2 votes
2 answers
26
UGC NET CSE | September 2013 | Part 2 | Question: 23
Which one of the following set of gates is best suited for &lsquo;parity&rsquo; checking and &lsquo;parity&rsquo; generation? AND, OR, NOT NAND, NOR EX-OR, EX-NOR None of the above
Which one of the following set of gates is best suited for &lsquo;parity&rsquo; checking and &lsquo;parity&rsquo; generation?AND, OR, NOTNAND, NOREX-OR, EX-NORNone of the...
User Avatar
3 votes
1 answer
27
UGC NET CSE | September 2013 | Part 2 | Question: 22
A simple graph G with n vertices is connected if the graph has (n-1)(n-2)/2 edges more than (n-1) (n-2)/2 edges less than (n-1) (n-2)/2 edges $\Sigma_{i=1}^k C(n_i, 2)$ edges
A simple graph G with n vertices is connected if the graph has(n-1)(n-2)/2 edgesmore than (n-1) (n-2)/2 edgesless than (n-1) (n-2)/2 edges$\Sigma_{i=1}^k C(n_i, 2)$ edges...
User Avatar
1 votes
1 answer
29
UGC NET CSE | September 2013 | Part 2 | Question: 19
Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow and the rest ones white. 55,440 1,66,320 4.790E+08 39,91,680
Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow and the rest ones white.55,4401,66,3204.790E+0839,91,680
User Avatar
Page: