# Recent questions tagged ugcnetsep2013ii

1 vote
1
The speed up of a pipeline processing over an equivalent non-pipeline processing is defined by the ration: where $n \rightarrow$ no. of tasks $t_n \rightarrow$ time of completion of each tasks $k \rightarrow$ no. of segments of pipeline $t_p \rightarrow$ clock cycle time $S \rightarrow$ ... $S=\frac{n t_n}{(k-n+1)t_p}$ $S=\frac{(k+n-1)t_p}{n t_n}$
2
What type of logic circuit is represented by the figure shown below ? $\text{XOR}$ $\text{XNOR}$ $\text{XAND}$ $\text{XNAND}$
1 vote
3
Which of the following set of Unix commands will always display &ldquo;WELCOME&rdquo;? export title =WELCOME; Echo $\$title title =WELCOME; export $\$title ; sh &ndash;c &ldquo;echo $\$title&rdquo; title =WELCOME; export title ; sh &ndash;c &ldquo;echo $\$title&rdquo; title =WELCOME; echo $\$title
1 vote
4
Assume that an implementation of Unix operating system uses i-nodes to keep track of data blocks allocated to a file. It supports 12 direct block addresses, one in direct block address and one double indirect block address. The file system has 256 bytes block size and 2 bytes for disk block address. The maximum possible size of a file in this system is 16 MB 16 KB 70 KB 71 KB
5
Consider the input/output (I/O) request made at different instants of time directed at a hypothetical disk having 200 tracks as given in the following table: Serial. No 1 2 3 4 5 Track No. 12 85 40 100 75 Time of arrival 65 80 110 100 ... and look disk-arm scheduling algorithms respectively are: 144 and 123 milliseconds 143 and 123 milliseconds 149 and 124 milliseconds 256 and 186 milliseconds
1 vote
6
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
1 vote
7
Match the following: List-I Process state transition List-II Reason for transition a. Ready $\rightarrow$ Running i. Request made by the process is satisfied or an event for which it was waiting occurs b. Blocked $\rightarrow$ Ready ii. Process wishes to wait for some action by another process c. Running $\rightarrow$ ... d-iv a-iv, b-i, c-iii, d-ii a-iv, b-iii, c-i, d-ii a-iii, b-iv, c-ii, d-i
1 vote
8
Thoma&rsquo;s-write rule is Two phase locking protocol Timestamp ordering protocol One phase locking protocol Sliding window protocol
1 vote
9
A method to provide secure transmission of email is called TLS SA IPSec PGP
1 vote
10
Cross_tab displays permit users to view ____ of multidimensional data at a time. One dimension Two dimensions Three dimensions Multidimensions
1 vote
11
The decision tree classifier is a widely used technique for Classification Association Partition Clustering
1 vote
12
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
1 vote
13
The _____ language was originally designed as the Transformation Language for Style Sheet Facility XSTL XML XQuery XPath
1 vote
14
Usage of Preemption and Transaction Rollback prevents _____. Unauthorized usage of data file Deadlock situation Data manipulation File pre-emption
1 vote
15
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
1 vote
16
Assume that $x$ and $y$ are non-zero positive integers. What does the following program segment perform? while (x!=0) { if(x>y) x=x-y; else y=y-x; printf(“%d”, x) } Computes LCM of two numbers Computes GCD of two numbers Divides large number with small number Subtracts smaller number from larger number
1 vote
17
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
1 vote
18
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
1 vote
19
Consider the following characteristics: Correct and unambiguous Complete and consistent Ranked for importance and/or stability and verifiable Modifiable and Traceable Which of the following is true for a good SRS? I, II and III I, III and IV II, III and IV I, II, III and IV
1 vote
20
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
1 vote
21
Working software is not available until late in the process in Waterfall model Prototyping model Incremental model Evolutionary Development model
1 vote
22
The _____ of a program or computing system is the structure or structures of the system, which comprise software components, the externally visible properties of these components and the relationship among them. E-R diagram Data flow diagram Software architecture Software design
1 vote
23
In which one of the following continuous process improvement is done? ISO9001 RMMM CMM None of the above
1 vote
24
Match the following identities/laws to their corresponding name: a. x+x=x x $\cdot$ x =x i. Dominance b. x+0=x x $\cdot$ 1 =x ii. Absorption c. x+1=1 x $\cdot$ 1 =x iii. Idempotent d. x $\cdot$ ... a-iii, b-iv, c-i, d=ii a-iv, b-iii, c-i, d=ii a-iv, b-iii, c-ii, d=i a-iii, b-iv, c-ii, d=i
25
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 existential quantifications and logical operators? $\exists x P(x) \vee \forall x \forall y ((P(x) \vee P(y)) \rightarrow x=y)$ ... $\exists x P(x) \wedge \forall x \forall y ((P(x) \vee P(y)) \rightarrow x=y)$
26
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
27
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
1 vote
Assume the statements $S_1$ and $S_2$ given as: $S_1$: Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite. $S_2$: There exists an algorithm to determine whether two context free grammars generate the same language. Which one of the ... Both $S_1$ and $S_2$ are correct Both $S_1$ and $S_2$ are not correct $S_1$ is not correct and $S_2$ is correct