Recent questions tagged ugcnetcse-june2012-paper3 / GATE Overflow for GATE CSE

2 votes

2 answers

61

UGC NET CSE | June 2012 | Part 3 | Question: 4
What is Granularity? The size of database The size of data item The size of record The size of file

What is Granularity?The size of databaseThe size of data itemThe size of recordThe size of file

go_editor

2.8k views

go_editor asked Jul 6, 2016

2 votes

1 answer

62

UGC NET CSE | June 2012 | Part 3 | Question: 3
The concept of pipelining is a most effective in improving performance in the tasks being performed in different stages: require different amount of time require about the same amount of time require different amount of time ... between any two tasks being same require different amount with time difference between any two tasks being different

The concept of pipelining is a most effective in improving performance in the tasks being performed in different stages:require different amount of timerequire about the ...

go_editor

9.2k views

go_editor asked Jul 6, 2016

3 votes

2 answers

63

UGC NET CSE | June 2012 | Part 3 | Question: 2
In Delta Rule for error minimization weights are adjusted w.r.to change in the output weights are adjusted w.r.to difference between desired output and actual output weights are adjusted w.r.to difference between output and output none of the above

In Delta Rule for error minimizationweights are adjusted w.r.to change in the outputweights are adjusted w.r.to difference between desired output and actual outputweights...

go_editor

5.1k views

go_editor asked Jul 6, 2016

2 votes

1 answer

64

UGC NET CSE | June 2012 | Part 3 | Question: 1
Consider the following Pseudo-code segment: k:=0 for $i_1$:=1 to n for $i_2$ := 1 to $i_1$ : : : for $i_m$:=1 to $i_{m-1}$ k:=k+1 The value of k after the execution of this code shall be $C(n+m-1, m)$ $C(n-m+1, m)$ $C(n+m-1, n)$ $C(n-m+1, n)$

Consider the following Pseudo-code segment:k:=0for $i_1$:=1 to nfor $i_2$ := 1 to $i_1$:::for $i_m$:=1 to $i_{m-1}$k:=k+1The value of k after the execution of this code s...

go_editor

2.3k views

go_editor asked Jul 6, 2016

2 votes

2 answers

65

UGC NET CSE | June 2012 | Part 3 | Question: 60
Radio signals generally propagate according to the following mechanisms: Modulation, Amplification, Scattering Reflection, Diffraction, Scattering Amplification, Diffraction, Modulation Reflection, Amplification, Diffraction

Radio signals generally propagate according to the following mechanisms:Modulation, Amplification, ScatteringReflection, Diffraction, ScatteringAmplification, Diffraction...

Sanjay Sharma

1.7k views

Sanjay Sharma asked Jun 1, 2016

2 votes

1 answer

66

UGC NET CSE | June 2012 | Part 3 | Question: 61
Identify the devices given below with their $\textsf{IC}$ ... $\text{(a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)}$

Identify the devices given below with their $\textsf{IC}$ numbers :$\begin{array}{clcl} \text{(a)} & \text{USART} & \text{(i)} & \text{8251} \\ \text{(b)} & \text{Micro...

Sanjay Sharma

1.3k views

Sanjay Sharma asked Jun 1, 2016

2 votes

2 answers

67

UGC NET CSE | June 2012 | Part 3 | Question: 5
Suppose that the given application is run on a 64-processor machine and that 70 percent of the application can be parallelized. Then the expected performance improvement using Amdahl’s law is 4.22 3.22 3.32 3.52

Suppose that the given application is run on a 64-processor machine and that 70 percent of the application can be parallelized. Then the expected performance improvement ...

Sanjay Sharma

3.8k views

Sanjay Sharma asked May 3, 2016

43 votes

7 answers

68

GATE IT 2005 | Question: 19, UGCNET-June2012-III: 57
A user level process in Unix traps the signal sent on a Ctrl-C input, and has a signal handling routine that saves appropriate files before terminating the process. When a Ctrl-C input is given to this process, what is the mode in which the signal handling routine executes? User mode Kernel mode Superuser mode Privileged mode

A user level process in Unix traps the signal sent on a Ctrl-C input, and has a signal handling routine that saves appropriate files before terminating the process. When ...

Ishrat Jahan

11.2k views

Ishrat Jahan asked Nov 3, 2014

5 votes

3 answers

69

GATE IT 2007 | Question: 55, UGCNET-June2012-III: 40
Consider the following pseudo-code: IF ((A > B) AND (C > D)) THEN A = A + 1 B = B + 1 ENDIF The cyclomatic complexity of the pseudo-code is 2 3 4 5

Consider the following pseudo-code:IF ((A B) AND (C D)) THEN A = A + 1 B = B + 1 ENDIFThe cyclomatic complexity of the pseudo-code is2345

Ishrat Jahan

6.2k views

Ishrat Jahan asked Oct 30, 2014

34 votes

4 answers

70

GATE IT 2007 | Question: 3, UGCNET-June2012-III: 34
Consider a weighted, undirected graph with positive edge weights and let $uv$ be an edge in the graph. It is known that the shortest path from the source vertex $s$ to $u$ has weight 53 and the shortest path from $s$ to $v$ has weight 65. Which one of the ... $(u,v) \leq 12$ Weight $(u,v) = 12$ Weight $(u,v) \geq 12$ Weight $(u,v) > 12$

Consider a weighted, undirected graph with positive edge weights and let $uv$ be an edge in the graph. It is known that the shortest path from the source vertex $s$ to $u...

Ishrat Jahan

11.5k views

Ishrat Jahan asked Oct 29, 2014

65 votes

6 answers

71

GATE CSE 2006 | Question: 63, UGCNET-June2012-III: 45
A computer system supports $32$-bit virtual addresses as well as $32$-bit physical addresses. Since the virtual address space is of the same size as the physical address space, the operating system designers decide to ... more efficient now Hardware support for memory management is no longer needed CPU scheduling can be made more efficient now

A computer system supports $32$-bit virtual addresses as well as $32$-bit physical addresses. Since the virtual address space is of the same size as the physical address ...

Rucha Shelke

26.1k views

Rucha Shelke asked Sep 26, 2014

47 votes

9 answers

72

GATE CSE 1998 | Question: 2.18, UGCNET-June2012-III: 48
If an instruction takes $i$ microseconds and a page fault takes an additional $j$ microseconds, the effective instruction time if on the average a page fault occurs every $k$ instruction is: $i + \dfrac{j}{k}$ $i +(j\times k)$ $\dfrac{i+j}{k}$ $({i+j})\times {k}$

If an instruction takes $i$ microseconds and a page fault takes an additional $j$ microseconds, the effective instruction time if on the average a page fault occurs every...

Kathleen

19.4k views

Kathleen asked Sep 25, 2014

13 votes

3 answers

73

GATE CSE 2005 | Question: 3, UGCNET-June2012-III: 15
A common property of logic programming languages and functional languages is: both are procedural languages both are based on $\lambda$-calculus both are declarative both use Horn-clauses

A common property of logic programming languages and functional languages is:both are procedural languages both are based on $\lambda$-calculusboth are declarativeboth us...

Kathleen

12.4k views

Kathleen asked Sep 22, 2014

26 votes

4 answers

74

GATE CSE 2009 | Question: 8, UGCNET-June2012-III: 58
A CPU generally handles an interrupt by executing an interrupt service routine: As soon as an interrupt is raised. By checking the interrupt register at the end of fetch cycle. By checking the interrupt register after finishing the execution of the current instruction. By checking the interrupt register at fixed time intervals.

A CPU generally handles an interrupt by executing an interrupt service routine:As soon as an interrupt is raised.By checking the interrupt register at the end of fetch cy...

Kathleen

15.9k views

Kathleen asked Sep 22, 2014

28 votes

2 answers

75

GATE2001-1.23, UGCNET-June2012-III: 18
Consider a schema $R(A,B,C,D)$ and functional dependencies $A \rightarrow B$ and $C \rightarrow D$. Then the decomposition of R into $R_1 (A,B)$ and $R_2(C,D)$ is dependency preserving and lossless join lossless join but not dependency preserving dependency preserving but not lossless join not dependency preserving and not lossless join

Consider a schema $R(A,B,C,D)$ and functional dependencies $A \rightarrow B$ and $C \rightarrow D$. Then the decomposition of R into $R_1 (A,B)$ and $R_2(C,D)$ isdependen...

Kathleen

8.3k views

Kathleen asked Sep 14, 2014

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true