Recent activity by skrahul / GATE Overflow for GATE CSE

4 answers

1

GATE CSE 1997 | Question: 6.5
Which one of the following is not decidable? Given a Turing machine $M$, a string $s$ and an integer $k$, $M$ accepts $s$ within $k$ steps Equivalence of two given Turing machines Language accepted by a given finite state machine is not empty Language generated by a context free grammar is non-empty

Which one of the following is not decidable?Given a Turing machine $M$, a string $s$ and an integer $k$, $M$ accepts $s$ within $k$ stepsEquivalence of two given Turing m...

10.1k views

commented Jan 26, 2016

1 answer

2

GATE CSE 1995 | Question: 2.9
A language with string manipulation facilities uses the following operations head(s): first character of a string tail(s): all but exclude the first character of a string concat(s1, s2): s1s2 For the string "$acbc$" what will be the output of concat(head(s), head(tail(tail(s)))) $ac$ $bc$ $ab$ $cc$

A language with string manipulation facilities uses the following operationshead(s): first character of a string tail(s): all but exclude the first character of a stringc...

4.3k views

commented Jan 24, 2016

15 answers

3

GATE CSE 2005 | Question: 39
Suppose there are $\lceil \log n \rceil$ sorted lists of $\lfloor n /\log n \rfloor$ elements each. The time complexity of producing a sorted list of all these elements is: (Hint:Use a heap data structure) $O(n \log \log n)$ $\Theta(n \log n)$ $\Omega(n \log n)$ $\Omega\left(n^{3/2}\right)$

Suppose there are $\lceil \log n \rceil$ sorted lists of $\lfloor n /\log n \rfloor$ elements each. The time complexity of producing a sorted list of all these elements i...

26.4k views

commented Jan 23, 2016

2 answers

4

GATE CSE 1996 | Question: 18
Consider the following program that attempts to locate an element $x$ in an array $a[ ]$ using binary search. Assume $N > 1$. The program is erroneous. Under what conditions does the program fail? var i,j,k: integer; x: integer; a: array; [1..N] of ... ; if (a[k] = x) then writeln ('x is in the array') else writeln ('x is not in the array') end;

Consider the following program that attempts to locate an element $x$ in an array $a[ ]$ using binary search. Assume $N 1$. The program is erroneous. Under what conditio...

3.5k views

answered Jan 23, 2016

6 answers

5

GATE CSE 2001 | Question: 1.1
Consider the following statements: S1: The sum of two singular $n \times n$ matrices may be non-singular S2: The sum of two $n \times n$ non-singular matrices may be singular Which one of the following statements is correct? $S1$ and $S2$ both are true $S1$ is true, $S2$ is false $S1$ is false, $S2$ is true $S1$ and $S2$ both are false

Consider the following statements:S1: The sum of two singular $n \times n$ matrices may be non-singularS2: The sum of two $n \times n$ non-singular matrices may be singul...

8.5k views

commented Jan 17, 2016

2 answers

6

GATE CSE 2004 | Question: 1
The goal of structured programming is to: have well indented programs be able to infer the flow of control from the compiled code be able to infer the flow of control from the program text avoid the use of GOTO statements

The goal of structured programming is to:have well indented programsbe able to infer the flow of control from the compiled codebe able to infer the flow of control from t...

9.0k views

commented Jan 15, 2016

2 answers

7

GATE2011 MN: GA-63
$L, M$ and $N$ are waiting in a queue meant for children to enter the zoo. There are $5$ children between $L$ and $M$, and $8$ children between $M$ and $N$. If there are $3$ children ahead of $N$ and $21$ children behind $L$, then what is the minimum number of children in the queue? $28$ $27$ $41$ $40$

$L, M$ and $N$ are waiting in a queue meant for children to enter the zoo. There are $5$ children between $L$ and $M$, and $8$ children between $M$ and $N$. If there are ...

2.7k views

commented Jan 12, 2016

5 answers

8

GATE CSE 2005 | Question: 27
An organization has a class $B$ network and wishes to form subnets for $64$ departments. The subnet mask would be: $255.255.0.0$ $255.255.64.0$ $255.255.128.0$ $255.255.252.0$

An organization has a class $B$ network and wishes to form subnets for $64$ departments. The subnet mask would be:$255.255.0.0$$255.255.64.0$$255.255.128.0$$255.255.252.0...

40.0k views

commented Jan 2, 2016

4 answers

9

GATE CSE 2000 | Question: 2.16
Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited `in a postorder, inorder and preorder traversal respectively, of a complete binary tree. Which of the following is always true? LASTIN = LASTPOST LASTIN = LASTPRE LASTPRE = LASTPOST None of the above

Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder traversal respectively, of a complete binary tree. Which of the foll...

17.6k views

commented Dec 30, 2015

7 answers

10

GATE IT 2008 | Question: 4
What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes? $5$ $4$ $3$ $2$

What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes?$5$$4$$3$$2$

59.0k views

answered Dec 30, 2015

7 answers

11

GATE IT 2006 | Question: 46
Which of the following is the correct decomposition of the directed graph given below into its strongly connected components? $\left \{ P, Q, R, S \right \}, \left \{ T \right \},\left \{ U \right \}, \left \{ V \right \}$ ... $\left \{ P, Q, R, S, T, U, V \right \}$

Which of the following is the correct decomposition of the directed graph given below into its strongly connected components?$\left \{ P, Q, R, S \right \}, \left \{ T \...

11.9k views

commented Dec 30, 2015

8 answers

12

GATE IT 2004 | Question: 12, ISRO2016-77
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $1$ $ns$, $10$ $ns$, and $500$ $ns$ respectively. The hit rates of Level $1$ and Level $2$ caches are $0.8$ and $0.9$, respectively. What is the average access time of the system ignoring the search time within the cache? $13.0$ $12.8$ $12.6$ $12.4$

Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $1$ $ns$, $10$ $ns$, and $500$ $ns$ respectively. The hit rat...

29.6k views

commented Jan 28, 2015

5 answers

13

GATE CSE 2006 | Question: 74
Consider two cache organizations. First one is $32 \; \textsf{KB}\;2\text{-way}$ set associative with $32 \; \text{byte}$ block size, the second is of same size but direct mapped. The size of an address is $32\; \text{bits}$ in both cases . A $2\text{-to-}1$ multiplexer has ... The value of $h_1$ is: $2.4 \text{ ns} $ $2.3 \text{ ns}$ $1.8 \text{ ns}$ $1.7 \text{ ns}$

Consider two cache organizations. First one is $32 \; \textsf{KB}\;2\text{-way}$ set associative with $32 \; \text{byte}$ block size, the second is of same size but dire...

29.0k views

commented Jan 27, 2015

9 answers

14

GATE IT 2008 | Question: 39
Consider a CPU where all the instructions require $7$ clock cycles to complete execution. There are $140$ instructions in the instruction set. It is found that $125$ control signals are needed to be generated by the control unit. While designing the horizontal ... size of the control word and control address register? $125, 7$ $125, 10$ $135, 9$ $135, 10$

Consider a CPU where all the instructions require $7$ clock cycles to complete execution. There are $140$ instructions in the instruction set. It is found that $125$ cont...

17.9k views

answered Jan 27, 2015

5 answers

15

GATE CSE 2003 | Question: 29, ISRO2009-73
Which of the following scenarios may lead to an irrecoverable error in a database system? A transaction writes a data item after it is read by an uncommitted transaction A transaction reads a data item after it is read by an ... it is written by a committed transaction A transaction reads a data item after it is written by an uncommitted transaction

Which of the following scenarios may lead to an irrecoverable error in a database system?A transaction writes a data item after it is read by an uncommitted transactionA ...

14.8k views

answered Jan 26, 2015

9 answers

16

GATE CSE 2006 | Question: 20, ISRO2015-17
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$ interest. T1 start T1 B old $=12000$ new $=10000$ ... $3$ because transaction T1 has committed We can apply redo and undo operations in arbitrary order because they are idempotent

Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$...

28.0k views

answered Jan 26, 2015

8 answers

17

GATE CSE 2009 | Question: 55
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... of all suppliers who have supplied only non-blue part. Find the names of all suppliers who have not supplied only blue parts.

Consider the following relational schema:$\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\tex...

38.5k views

commented Jan 26, 2015

5 answers

18

GATE CSE 2003 | Question: 25, ISRO2009-12
Using a larger block size in a fixed block size file system leads to better disk throughput but poorer disk space utilization better disk throughput and better disk space utilization poorer disk throughput but better disk space utilization poorer disk throughput and poorer disk space utilization

Using a larger block size in a fixed block size file system leads tobetter disk throughput but poorer disk space utilizationbetter disk throughput and better disk space u...

15.0k views

answered Jan 26, 2015

6 answers

19

GATE IT 2004 | Question: 63
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let $P_h$ ... but starvation-free The scheme is neither deadlock-free nor starvation-free The scheme is both deadlock-free and starvation-free

In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same ti...

13.4k views

commented Jan 26, 2015

4 answers

20

GATE IT 2004 | Question: 62
A disk has $200$ tracks (numbered $0$ through $199$). At a given time, it was servicing the request of reading data from track $120$, and at the previous request, service was for track $90$ ... Time First) and FCFS (First Come First Serve)? $2$ and $3$ $3$ and $3$ $3$ and $4$ $4$ and $4$

A disk has $200$ tracks (numbered $0$ through $199$). At a given time, it was servicing the request of reading data from track $120$, and at the previous request, service...

10.4k views

commented Jan 26, 2015

2 answers

21

GATE CSE 2004 | Question: 45
Consider the grammar with the following translation rules and $E$ ... root of the parse tree for the expression:$2$ # $3$ & $5$ # $6$ & $4$ $200$ $180$ $160$ $40$

Consider the grammar with the following translation rules and $E$ as the start symbol$$\begin{array}{lll}E \rightarrow E_ 1\# \: T & \qquad\left\{E.value = E_1.value * ...

11.0k views

answered Jan 24, 2015

7 answers

22

GATE IT 2006 | Question: 63, ISRO2015-57
A router uses the following routing table: \begin{array}{|l|l|l|} \hline \textbf {Destination} & \textbf { Mask} & \textbf{Interface} \\\hline \text {144.16.0.0} & \text{255.255.0.0} & \text{eth$0$} \\\hline\text { ... address $144.16.68.117$ arrives at the router. On which interface will it be forwarded? eth$0$ eth$1$ eth$2$ eth$3$

A router uses the following routing table:\begin{array}{|l|l|l|} \hline \textbf {Destination} & \textbf { Mask} & \textbf{Interface} \\\hline \text {144.16.0.0} & \text...

42.8k views

commented Jan 21, 2015

8 answers

23

GATE CSE 2005 | Question: 73
In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is $24$ bytes and each packet contains a header of $3$ bytes, then the optimum packet size is: $4$ $6$ $7$ $9$

In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is $24$ bytes and each...

42.6k views

answered Jan 20, 2015

4 answers

24

GATE CSE 2002 | Question: 2.20
Dynamic linking can cause security concerns because Security is dynamic The path for searching dynamic libraries is not known till runtime Linking is insecure Cryptographic procedures are not available for dynamic linking

Dynamic linking can cause security concerns becauseSecurity is dynamicThe path for searching dynamic libraries is not known till runtimeLinking is insecureCryptographic p...

6.9k views

answered Jan 20, 2015

5 answers

25

GATE IT 2007 | Question: 31
Consider the C program given below : #include <stdio.h> int main () { int sum = 0, maxsum = 0, i, n = 6; int a [] = {2, -2, -1, 3, 4, 2}; for (i = 0; i < n; i++) { if (i == 0 || a [i] < 0 || a [i] < a [ ... } if (sum > maxsum) maxsum = sum ; printf ("%d\n", maxsum); } What is the value printed out when this program is executed? $9$ $8$ $7$ $6$

Consider the C program given below : #include <stdio.h int main () { int sum = 0, maxsum = 0, i, n = 6; int a [] = {2, -2, -1, 3, 4, 2}; for (i = 0; i < n; i++) { if (i =...

10.8k views

answered Jan 19, 2015

4 answers

26

GATE IT 2008 | Question: 71
A Binary Search Tree (BST) stores values in the range $37$ to $573$. Consider the following sequence of keys. $81, 537, 102, 439, 285, 376, 305$ $52, 97, 121, 195, 242, 381, 472$ $142, 248, 520, 386, 345, 270, 307$ ... list nodes in the order in which we could have encountered them in the search? II and III only I and III only III and IV only III only

A Binary Search Tree (BST) stores values in the range $37$ to $573$. Consider the following sequence of keys.$81, 537, 102, 439, 285, 376, 305$$52, 97, 121, 195, 242, 381...

14.7k views

commented Jan 19, 2015

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