Recent questions tagged normal / GATE Overflow for GATE CSE

1 votes

3 answers

2431

GATE CSE 2008 | Question: 21
The minimum number of equal length subintervals needed to approximate $\int_1^2 xe^x\,dx$ to an accuracy of at least $\frac{1}{3}\times10^{-6}$ using the trapezoidal rule is 1000e 1000 100e 100

The minimum number of equal length subintervals needed to approximate $\int_1^2 xe^x\,dx$ to an accuracy of at least $\frac{1}{3}\times10^{-6}$ using the trapezoidal rule...

Kathleen

3.1k views

Kathleen asked Sep 11, 2014

32 votes

2 answers

2432

GATE CSE 2008 | Question: 20
The data blocks of a very large file in the Unix file system are allocated using continuous allocation linked allocation indexed allocation an extension of indexed allocation

The data blocks of a very large file in the Unix file system are allocated usingcontinuous allocationlinked allocationindexed allocationan extension of indexed allocation...

Kathleen

15.3k views

Kathleen asked Sep 11, 2014

31 votes

6 answers

2433

GATE CSE 2008 | Question: 19
The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is: $\text{MNOPQR}$ $\text{NQMPOR}$ $\text{QMNPRO}$ $\text{QMNPOR}$

The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is:$\text{MNOPQR}$...

Kathleen

35.9k views

Kathleen asked Sep 11, 2014

28 votes

4 answers

2434

GATE CSE 2008 | Question: 17
Which of the following system calls results in the sending of SYN packets? $\textsf{socket}$ $\textsf{bind}$ $\textsf{listen}$ $\textsf{connect}$

Which of the following system calls results in the sending of SYN packets?$\textsf{socket}$$\textsf{bind}$$\textsf{listen}$$\textsf{connect}$

Kathleen

15.3k views

Kathleen asked Sep 11, 2014

43 votes

5 answers

2435

GATE CSE 2008 | Question: 15
Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$? $\neg \exists t \in r \left(P\left(t\right)\right)$ $\exists t \notin r \left(P\left(t\right)\right)$ ... $\exists t \notin r \left(\neg P\left(t\right)\right)$ I only II only III only III and IV only

Which of the following tuple relational calculus expression(s) is/are equivalent to $\forall t \in r \left(P\left(t\right)\right)$?$\neg \exists t \in r \left(P\left(t\ri...

Kathleen

14.3k views

Kathleen asked Sep 11, 2014

41 votes

6 answers

2436

GATE CSE 2008 | Question: 12
Some code optimizations are carried out on the intermediate code because They enhance the portability of the compiler to the target processor Program analysis is more accurate on intermediate code than on machine code The information from ... analysis cannot otherwise be used for optimization The information from the front end cannot otherwise be used for optimization

Some code optimizations are carried out on the intermediate code becauseThey enhance the portability of the compiler to the target processorProgram analysis is more accur...

Kathleen

15.6k views

Kathleen asked Sep 11, 2014

60 votes

3 answers

2437

GATE CSE 2008 | Question: 11
Which of the following describes a handle (as applicable to LR-parsing) appropriately? It is the position in a sentential form where the next shift or reduce operation will occur It is non-terminal whose production will be used for reduction in the ... in the next step along with a position in the sentential form where the right hand side of the production may be found

Which of the following describes a handle (as applicable to LR-parsing) appropriately?It is the position in a sentential form where the next shift or reduce operation wil...

Kathleen

13.6k views

Kathleen asked Sep 11, 2014

28 votes

6 answers

2438

GATE CSE 2008 | Question: 7
The most efficient algorithm for finding the number of connected components in an undirected graph on $n$ vertices and $m$ edges has time complexity $\Theta(n)$ $\Theta(m)$ $\Theta(m+n)$ $\Theta(mn)$

The most efficient algorithm for finding the number of connected components in an undirected graph on $n$ vertices and $m$ edges has time complexity$\Theta(n)$$\Theta(m)$...

Kathleen

13.7k views

Kathleen asked Sep 11, 2014

29 votes

2 answers

2439

GATE CSE 2008 | Question: 6
Let $r$ denote number system radix. The only value(s) of $r$ that satisfy the equation $\sqrt{121_r}={11}_r$ is/are decimal $10$ decimal $11$ decimal $10$ and $11$ any value $> 2$

Let $r$ denote number system radix. The only value(s) of $r$ that satisfy the equation $\sqrt{121_r}={11}_r$ is/aredecimal $10$decimal $11$decimal $10$ and $11$any value ...

Kathleen

12.1k views

Kathleen asked Sep 11, 2014

29 votes

8 answers

2440

GATE CSE 2008 | Question: 2
If $P, Q, R$ are subsets of the universal set U, then $(P\cap Q\cap R) \cup (P^c \cap Q \cap R) \cup Q^c \cup R^c$ is $Q^c \cup R^c$ $P \cup Q^c \cup R^c$ $P^c \cup Q^c \cup R^c$ U

If $P, Q, R$ are subsets of the universal set U, then $$(P\cap Q\cap R) \cup (P^c \cap Q \cap R) \cup Q^c \cup R^c$$ is$Q^c \cup R^c$$P \cup Q^c \cup R^c$$P^c \cup Q^c \c...

Kathleen

9.5k views

Kathleen asked Sep 11, 2014

3 votes

1 answer

2441

GATE CSE 1991 | Question: 01,i

Kathleen

1.2k views

Kathleen asked Sep 11, 2014

58 votes

4 answers

2442

GATE CSE 2008 | Question: 50
Which of the following statements are true? Every left-recursive grammar can be converted to a right-recursive grammar and vice-versa All $\epsilon$-productions can be removed from any context-free grammar by suitable transformations The language generated by a context-free grammar all ... trees I, II, III and IV II, III and IV only I, III and IV only I, II and IV only

Which of the following statements are true?Every left-recursive grammar can be converted to a right-recursive grammar and vice-versaAll $\epsilon$-productions can be remo...

Kathleen

13.9k views

Kathleen asked Sep 11, 2014

47 votes

5 answers

2443

GATE CSE 2008 | Question: 84
Consider the following C program that attempts to locate an element $x$ in an array $Y[ \ ]$ using binary search. The program is erroneous. f (int Y[10] , int x) { int i, j, k; i= 0; j = 9; do { k = (i+ j) / 2; if( Y[k] < x) i = k;else j = k; } while (Y[k] != x ... $Y$ is $[2 \ 4 \ 6 \ 8 \ 10 \ 12 \ 14 \ 16 \ 18 \ 20]$ and $ 2 < x < 20$ and $x$ is even

Consider the following C program that attempts to locate an element $x$ in an array $Y[ \ ]$ using binary search. The program is erroneous. f (int Y[10] , int x) { int i,...

Kathleen

21.8k views

Kathleen asked Sep 11, 2014

64 votes

6 answers

2444

GATE CSE 2008 | Question: 82
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is $2$ $3$ $4$ $5$

Consider the following $\text{ER}$ diagramThe minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is$2$$3$$4$$5$

Kathleen

27.2k views

Kathleen asked Sep 11, 2014

107 votes

7 answers

2445

GATE CSE 2013 | Question: 52
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $\text{(T1)}$ ... is $64$ bytes. What is the size of a page in $\textsf{KB}$ in this computer? $2$ $4$ $8$ $16$

A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three–level paged page table organization. The page table base register stores ...

kanikool

38.0k views

kanikool asked Sep 10, 2014

57 votes

1 answer

2446

GATE CSE 1999 | Question: 1.6
Let $L_1$ be the set of all languages accepted by a PDA by final state and $L_2$ the set of all languages accepted by empty stack. Which of the following is true? $L_1 = L_2$ $L_1 \supset L_2$ $L_1 \subset L_2$ None

Let $L_1$ be the set of all languages accepted by a PDA by final state and $L_2$ the set of all languages accepted by empty stack. Which of the following is true?$L_1 = L...

Keith Kr

22.1k views

Keith Kr asked Sep 10, 2014

4 votes

1 answer

2447

Consider two processors P1 and P2 executing the same instruction set.
Consider two processors P1 and P2 executing the same instruction set. Assume that under identical conditions, for the same input, a program running on P2 takes 25% less time but incurs 20% more CPI (clock cycles per instruction) ... of P1 is 1GHz, then the clock frequency of P2 (in GHz) is _________. please do explain also

Consider two processors P1 and P2 executing the same instruction set. Assume that under identical conditions, for the same input, a program running on P2 takes 25% less t...

kanikool

5.1k views

kanikool asked Sep 9, 2014

45 votes

3 answers

2448

GATE CSE 2003 | Question: 52
Consider two languages $L_1$ and $L_2$ each on the alphabet $\Sigma$. Let $f : \Sigma^* \to \Sigma^*$ be a polynomial time computable bijection such that $(\forall x) [ x\in L_1$ iff $f(x) \in L_2]$. Further, let $f^{-1}$ be also polynomial ... $\in NP$ and $L_2$ $\in P$ $L_1$ is undecidable and $L_2$ is decidable $L_1$ is recursively enumerable and $L_2$ is recursive

Consider two languages $L_1$ and $L_2$ each on the alphabet $\Sigma$. Let $f : \Sigma^* \to \Sigma^*$ be a polynomial time computable bijection such that $(\forall x) [ x...

Arjun

8.5k views

Arjun asked Sep 8, 2014

97 votes

10 answers

2449

GATE CSE 2013 | Question: 45
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are ... during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$

Consider an instruction pipeline with five stages without any branch prediction:Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (...

Kriss Singh

48.5k views

Kriss Singh asked Sep 5, 2014

129 votes

19 answers

2450

GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$

Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An avera...

gatecse

64.4k views

gatecse asked Sep 5, 2014

58 votes

3 answers

2451

GATE CSE 2005 | Question: 62
Consider the following circuit involving a positive edge triggered D FF. Consider the following timing diagram. Let $A_{i}$ represents the logic level on the line $A$ in the $i$-th clock period. Let $A'$ represent the complement of $A$. The correct output sequence on $Y$ over the ... $A_{1} A_{2}' A_{3} A_{4} A_{5}'$

Consider the following circuit involving a positive edge triggered D FF.Consider the following timing diagram. Let $A_{i}$ represents the logic level on the line $A$ in t...

Isha Karn

17.2k views

Isha Karn asked Sep 3, 2014

1 votes

1 answer

2452

GATE CSE 1993 | Question: 01.5
Fourier series of the periodic function (period 2π) defined by ... $\frac{{\pi }^2 }{4}$ $\frac{{\pi }^2 }{6}$ $\frac{{\pi }^2 }{8}$ $\frac{{\pi }^2 }{12}$

Fourier series of the periodic function (period 2π) defined by$$f(x) = \begin{cases} 0, -p < x < 0\\x, 0 < x < p \end{cases} \text { is }\\ \frac{\pi}{4} + \sum \left [ ...

srinath

2.7k views

srinath asked Sep 2, 2014

67 votes

5 answers

2453

GATE CSE 2008 | Question: 70
Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$ ... -level blocks in the multi-level index are respectively $8$ and $0$ $128$ and $6$ $256$ and $4$ $512$ and $5$

Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$. The file is ordered on a non-key field, and the...

ABG

24.2k views

ABG asked Sep 2, 2014

107 votes

8 answers

2454

GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$

The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is rep...

Nishant T-rex

24.6k views

Nishant T-rex asked Sep 2, 2014

78 votes

6 answers

2455

GATE CSE 1992 | Question: 92,xv
Which of the following predicate calculus statements is/are valid? $(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x))$ $(\exists (x)) P(x) \wedge (\exists (x))Q(x) \implies (\exists (x)) (P(x) \wedge Q(x))$ ... $(\exists (x)) (P(x) \vee Q(x)) \implies \sim (\forall (x)) P(x) \vee (\exists (x)) Q(x)$

Which of the following predicate calculus statements is/are valid?$(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x))$$(\exists (x)) P(x) \w...

Arjun

16.8k views

Arjun asked Sep 2, 2014

4 votes

2 answers

2456

Pankaj and Mythili were both asked to write the code to evaluate the following expression
Pankaj and Mythili were both asked to write the code to evaluate the following expression: $a - b + c/(a-b) + (a-b)^2 $ Pankaj writes the following code statements (Code A): print (a-b) + c/(a-b) ... Code B Code A uses more memory and is faster than Code B Code A uses more memory and is slower than Code B

Pankaj and Mythili were both asked to write the code to evaluate the following expression: $$a - b + c/(a-b) + (a-b)^2 $$Pankaj writes the following code statements (Code...

Arjun

96.7k views

Arjun asked Aug 31, 2014

19 votes

5 answers

2457

TIFR CSE 2011 | Part A | Question: 1
If either wages or prices are raised, there will be inflation. If there is inflation, then either the government must regulate it or the people will suffer. If the people suffer, the government will be unpopular. Government will not be ... raised Prices are not raised If the inflation is not regulated, then the prices are not raised Wages are not raised

If either wages or prices are raised, there will be inflation.If there is inflation, then either the government must regulate it or the people will suffer.If the people s...

Marv Patel

3.0k views

Marv Patel asked Aug 31, 2014

5 votes

2 answers

2458

What is the time complexity?
double foo(int n) { int i; double sum; if(n == 0) { return 1.0; } else { sum = 0.0; for(i = 0; i < n; i++) { sum += foo(i); } return sum; } } The time complexity of the above code is?

double foo(int n) { int i; double sum; if(n == 0) { return 1.0; } else { sum = 0.0; for(i = 0; i < n; i++) { sum += foo(i); } return sum; } }The time complexity of the ab...

Arjun

2.5k views

Arjun asked Aug 29, 2014

3 votes

1 answer

2459

What does the function brian return?
def brian(n): count = 0 while ( n != 0 ) n = n & ( n-1 ) count = count + 1 return count Here n is meant to be an unsigned integer. The operator & considers its arguments in binary and computes their bit wise AND ... , and the bit-wise AND of these binary strings is 00000110, which is the binary representation of 6. What does the function brian return?

def brian(n): count = 0 while ( n != 0 ) n = n & ( n-1 ) count = count + 1 return countHere n is meant to be an unsigned integer. The operator & considers its arguments i...

nitin.nilesh

738 views

nitin.nilesh asked Aug 29, 2014

5 votes

2 answers

2460

Is the following statement valid? $$\log(n!) = \Theta(n \log n)$$

er_prashantshukla

2.9k views

er_prashantshukla asked Aug 28, 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