search
Log In

Recent questions tagged ugcnetsep2013ii

1 vote
2 answers
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}$
asked Jul 21, 2016 in Operating System jothee 955 views
2 votes
1 answer
2
What type of logic circuit is represented by the figure shown below ? $\text{XOR}$ $\text{XNOR}$ $\text{XAND}$ $\text{XNAND}$
asked Jul 21, 2016 in Digital Logic jothee 709 views
1 vote
1 answer
3
Which of the following set of Unix commands will always display “WELCOME”? export title =WELCOME; Echo $\$title title =WELCOME; export $\$title ; sh –c “echo $\$title” title =WELCOME; export title ; sh –c “echo $\$title” title =WELCOME; echo $\$title
asked Jul 21, 2016 in Others jothee 790 views
1 vote
1 answer
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
asked Jul 21, 2016 in Operating System jothee 1.4k views
3 votes
1 answer
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
asked Jul 21, 2016 in Operating System jothee 1.8k views
1 vote
1 answer
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
asked Jul 21, 2016 in Operating System jothee 1.5k views
1 vote
3 answers
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
asked Jul 21, 2016 in Operating System jothee 628 views
1 vote
2 answers
8
Thoma’s-write rule is Two phase locking protocol Timestamp ordering protocol One phase locking protocol Sliding window protocol
asked Jul 21, 2016 in Databases jothee 636 views
1 vote
2 answers
9
1 vote
2 answers
10
Cross_tab displays permit users to view ____ of multidimensional data at a time. One dimension Two dimensions Three dimensions Multidimensions
asked Jul 21, 2016 in Databases jothee 702 views
1 vote
2 answers
11
The decision tree classifier is a widely used technique for Classification Association Partition Clustering
asked Jul 21, 2016 in Data Mining and Warehousing jothee 685 views
1 vote
2 answers
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
asked Jul 21, 2016 in Databases jothee 795 views
1 vote
1 answer
13
The _____ language was originally designed as the Transformation Language for Style Sheet Facility XSTL XML XQuery XPath
asked Jul 21, 2016 in Web Technologies jothee 426 views
1 vote
1 answer
14
Usage of Preemption and Transaction Rollback prevents _____. Unauthorized usage of data file Deadlock situation Data manipulation File pre-emption
asked Jul 21, 2016 in Databases jothee 859 views
1 vote
3 answers
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
asked Jul 21, 2016 in Programming and DS jothee 1.3k views
1 vote
1 answer
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
asked Jul 21, 2016 in Programming jothee 411 views
1 vote
1 answer
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
asked Jul 21, 2016 in Programming and DS jothee 755 views
1 vote
2 answers
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
asked Jul 21, 2016 in Programming and DS jothee 1.2k views
1 vote
2 answers
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
asked Jul 21, 2016 in IS&Software Engineering jothee 1.1k views
1 vote
1 answer
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
asked Jul 21, 2016 in IS&Software Engineering jothee 303 views
1 vote
1 answer
21
Working software is not available until late in the process in Waterfall model Prototyping model Incremental model Evolutionary Development model
asked Jul 21, 2016 in IS&Software Engineering jothee 767 views
1 vote
1 answer
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
asked Jul 21, 2016 in IS&Software Engineering jothee 320 views
1 vote
2 answers
23
In which one of the following continuous process improvement is done? ISO9001 RMMM CMM None of the above
asked Jul 21, 2016 in IS&Software Engineering jothee 654 views
1 vote
1 answer
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
asked Jul 21, 2016 in Digital Logic jothee 410 views
2 votes
1 answer
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)$
asked Jul 20, 2016 in Mathematical Logic jothee 852 views
2 votes
2 answers
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
asked Jul 20, 2016 in Digital Logic jothee 1.6k views
3 votes
1 answer
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
asked Jul 20, 2016 in Graph Theory jothee 1.9k views
1 vote
1 answer
28
Consider the In-order and Post-order traversals of a tree as given below: In-order: j e n k o p b f a c l g m d h i Post-order: j n o p k e f b c l m g h I d a The Pre-order traversal of the tree shall be a b f e j k n o p c d g l m h i a b c d e f j k n o p g l m h i a b e j k n o p f c d g l m h i j e n o p k f b c l m g h I d a
asked Jul 20, 2016 in DS jothee 2.2k views
1 vote
1 answer
29
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
asked Jul 20, 2016 in Others jothee 2k views
1 vote
1 answer
30
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
asked Jul 20, 2016 in Theory of Computation jothee 1.3k views
...