Dark Mode

Recent questions tagged ugcnetsep2013ii

1 vote

2 answers

1

UGC NET CSE | September 2013 | Part 2 | Question: 50
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 $ ... $S=\frac{n t_n}{(k-n+1)t_p}$ $S=\frac{(k+n-1)t_p}{n t_n}$

go_editor asked in Operating System Jul 21, 2016

2.5k views

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}$

go_editor asked in Digital Logic Jul 21, 2016

1.9k views

1 vote

1 answer

3

UGC NET CSE | September 2013 | Part 2 | Question: 48
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

go_editor asked in Others Jul 21, 2016

1.4k views

1 vote

3 answers

4

UGC NET CSE | September 2013 | Part 2 | Question: 47
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 ... disk block address. The maximum possible size of a file in this system is 16 MB 16 KB 70 KB 71 KB

go_editor asked in Operating System Jul 21, 2016

3.0k views

5 votes

1 answer

5

UGC NET CSE | September 2013 | Part 2 | Question: 46
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 $:$ ... : $144$ and $123$ milliseconds $143$ and $123$ milliseconds $149$ and $124$ milliseconds $256$ and $186$ milliseconds

go_editor asked in Operating System Jul 21, 2016

4.1k views

1 vote

1 answer

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

go_editor asked in Operating System Jul 21, 2016

4.7k views

1 vote

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}$

go_editor asked in Operating System Jul 21, 2016

2.7k views

1 vote

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

go_editor asked in Databases Jul 21, 2016

1.5k views

1 vote

2 answers

9

UGC NET CSE | September 2013 | Part 2 | Question: 42
A method to provide secure transmission of email is called TLS SA IPSec PGP

go_editor asked in Computer Networks Jul 21, 2016

2.8k views

1 vote

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

go_editor asked in Databases Jul 21, 2016

1.3k views

1 vote

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

go_editor asked in Data Mining and Warehousing Jul 21, 2016

1.9k views

1 vote

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

go_editor asked in Databases Jul 21, 2016

2.0k views

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

go_editor asked in Web Technologies Jul 21, 2016

3.2k views

1 vote

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

go_editor asked in Databases Jul 21, 2016

1.8k views

1 vote

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

go_editor asked in Programming and DS Jul 21, 2016

2.6k views

1 vote

1 answer

16

UGC NET CSE | September 2013 | Part 2 | Question: 35
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

go_editor asked in Programming in C Jul 21, 2016

823 views

1 vote

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(“%d”, sum(5)); } 10 16 15 14

go_editor asked in Programming and DS Jul 21, 2016

1.7k views

1 vote

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

go_editor asked in Programming and DS Jul 21, 2016

3.6k views

1 vote

1 answer

19

UGC NET CSE | September 2013 | Part 2 | Question: 31
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

go_editor asked in IS&Software Engineering Jul 21, 2016

3.5k views

1 vote

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

go_editor asked in IS&Software Engineering Jul 21, 2016

817 views

1 vote

1 answer

21

UGC NET CSE | September 2013 | Part 2 | Question: 29
Working software is not available until late in the process in Waterfall model Prototyping model Incremental model Evolutionary Development model

go_editor asked in IS&Software Engineering Jul 21, 2016

1.9k views

1 vote

1 answer

22

UGC NET CSE | September 2013 | Part 2 | Question: 28
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

go_editor asked in IS&Software Engineering Jul 21, 2016

955 views

1 vote

1 answer

23

UGC NET CSE | September 2013 | Part 2 | Question: 27
In which one of the following continuous process improvement is done? ISO9001 RMMM CMM None of the above

go_editor asked in IS&Software Engineering Jul 21, 2016

2.7k views

1 vote

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}$

go_editor asked in Digital Logic Jul 21, 2016

977 views

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)$

go_editor asked in Mathematical Logic Jul 20, 2016

2.1k views

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 ‘parity’ checking and ‘parity’ generation? AND, OR, NOT NAND, NOR EX-OR, EX-NOR None of the above

go_editor asked in Digital Logic Jul 20, 2016

5.8k views

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

go_editor asked in Graph Theory Jul 20, 2016

10.3k views

1 vote

1 answer

28

UGC NET CSE | September 2013 | Part 2 | Question: 21
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

go_editor asked in DS Jul 20, 2016

4.8k views

1 vote

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

go_editor asked in Others Jul 20, 2016

4.1k views

1 vote

1 answer

30

UGC NET CSE | September 2013 | Part 2 | Question: 17
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 ... $S_2$ are correct Both $S_1$ and $S_2$ are not correct $S_1$ is not correct and $S_2$ is correct

go_editor asked in Theory of Computation Jul 20, 2016

3.4k views

Page:

Recent questions tagged ugcnetsep2013ii