Recent activity by dhingrak / GATE Overflow for GATE CSE

3 answers

1

GATE CSE 2001 | Question: 20
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two successive tracks is $0.2$ millisecond. Consider a set of disk ... at track $0$ and the elevator algorithm is used to schedule disk requests, what is the worse case time to complete all the requests?

Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two...

10.9k views

commented Sep 2, 2018

2 answers

2

GATE CSE 2007 | Question: 31
Which of the following languages is regular? $\left\{ww^R \mid w \in \{0, 1\}^+\right\}$ $\left\{ww^Rx \mid x,w \in \{0, 1\}^+\right\}$ $\left\{wxw^R \mid x, w \in \{0, 1\}^+\right\}$ $\left\{xww^R \mid x, w \in \{0, 1\}^+\right\}$

Which of the following languages is regular?$\left\{ww^R \mid w \in \{0, 1\}^+\right\}$$\left\{ww^Rx \mid x,w \in \{0, 1\}^+\right\}$$\left\{wxw^R \mid x, w \in \{0, 1\}...

14.2k views

commented Feb 3, 2015

3 answers

3

GATE CSE 1999 | Question: 2.8
Consider the circuit shown below. In a certain steady state, the line $Y$ is at $'1'$. What are the possible values of $A, B$ and $C$ in this state? $A=0, B=0, C=1$ $A=0, B=1, C=1$ $A=1, B=0, C=1$ $A=1, B=1, C=1$

Consider the circuit shown below. In a certain steady state, the line $Y$ is at $'1'$. What are the possible values of $A, B$ and $C$ in this state?$A=0, B=0, C=1$$A=0, B...

7.5k views

commented Feb 1, 2015

5 answers

4

GATE CSE 1999 | Question: 2.9
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function? XOR gates, NOT gates $2$ to $1$ multiplexers AND gates, XOR gates Three-input gates that output $(A.B) + C$ for the inputs $A, B$ and $C$.

Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?XOR gates, NOT gates$2$ to $1$ multiplexersAND gates, XOR gatesT...

15.2k views

commented Feb 1, 2015

9 answers

5

GATE CSE 2007 | Question: 34
Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of $n$ variables. What is the minimum size of the multiplexer needed? $2^n$ line to $1$ line $2^{n+1}$ line to $1$line $2^{n-1}$ line to $1$line $2^{n-2}$ line to $1$line

Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of $n$ variables. What is the minimum size of the multiplexer neede...

31.6k views

commented Jan 31, 2015

6 answers

6

GATE CSE 2008 | Question: 41
A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place? $3$ $4$ $5$ $6$

A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place?$3$$4$$5$$6$

21.8k views

commented Jan 30, 2015

3 answers

7

GATE CSE 2001 | Question: 22
We wish to construct a $B^+$ tree with fan-out (the number of pointers per node) equal to $3$ for the following set of key values: $80, 50, 10, 70, 30, 100, 90$ Assume that the tree is initially empty and the values are added in the order ... need not be shown. The key values $30$ and $10$ are now deleted from the tree in that order show the tree after each deletion.

We wish to construct a $B^+$ tree with fan-out (the number of pointers per node) equal to $3$ for the following set of key values:$80, 50, 10, 70, 30, 100, 90$Assume that...

4.8k views

commented Jan 30, 2015

2 answers

8

GATE CSE 1999 | Question: 21
Consider a B-tree with degree $m$, that is, the number of children, $c$, of any internal node (except the root) is such that $m \leq c \leq 2m-1$. Derive the maximum and minimum number of records in the leaf nodes for such a B-tree with height $h, h \geq 1. ($Assume that the root of a tree is at height $0).$

Consider a B-tree with degree $m$, that is, the number of children, $c$, of any internal node (except the root) is such that $m \leq c \leq 2m-1$. Derive the maximum and ...

8.0k views

commented Jan 30, 2015

5 answers

9

GATE CSE 1997 | Question: 19
A $B^+$ - tree of order $d$ is a tree in which each internal node has between $d$ and $2 d$ key values. An internal node with $M$ key values has $M + 1$ children. The root (if it is an internal node) has between $1$ and $2d$ key values. The distance ... $4$ with $52$ leaves? What is the minimum number of leaves in a $B^+$-tree of order $d$ and height $h(h\geq 1)$?

A $B^+$ - tree of order $d$ is a tree in which each internal node has between $d$ and $2 d$ key values. An internal node with $M$ key values has $M + 1$ children. The roo...

15.0k views

commented Jan 30, 2015

6 answers

10

GATE CSE 2014 Set 3 | Question: 50
There are two elements $x,\:y$ in a group $(G,*)$ such that every element in the group can be written as a product of some number of $x$'s and $y$'s in some order. It is known that $x*x=y*y=x*y*x*y=y*x*y*x=e$ where $e$ is the identity element. The maximum number of elements in such a group is ____.

There are two elements $x,\:y$ in a group $(G,*)$ such that every element in the group can be written as a product of some number of $x$'s and $y$'s in some order. It is ...

15.6k views

commented Jan 29, 2015

5 answers

11

GATE CSE 2014 Set 3 | Question: 2
Let $X$ and $Y$ be finite sets and $f:X \to Y$ be a function. Which one of the following statements is TRUE? For any subsets $A$ and $B$ of $X, |f(A \cup B)| = |f(A)| + |f(B)|$ For any subsets $A$ and $B$ of $X, f(A \cap B) = f(A) \cap f(B)$ For any subsets $A$ ... $S$ and $T$ of $Y, f^{-1}(S \cap T) = f^{-1}(S) \cap f^{-1}(T)$

Let $X$ and $Y$ be finite sets and $f:X \to Y$ be a function. Which one of the following statements is TRUE?For any subsets $A$ and $B$ of $X, |f(A \cup B)| = |f(A)| + |f...

14.1k views

commented Jan 28, 2015

6 answers

12

GATE CSE 2001 | Question: 2.23
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition? $A \rightarrow B, B \rightarrow CD$ $A \rightarrow B, B \rightarrow C, C \rightarrow D$ $ AB \rightarrow C, C \rightarrow AD$ $A \rightarrow BCD$

$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition?$A \rightarrow B, B \rightarrow CD$$A \righta...

52.1k views

commented Jan 28, 2015

2 answers

13

Index
S1 is true and S3 is False as secondary index is dense...Please explain whether S2 is true or false

S1 is true and S3 is False as secondary index is dense...Please explain whether S2 is true or false

462 views

asked Jan 27, 2015

4 answers

14

GATE CSE 1997 | Question: 9
Consider a graph whose vertices are points in the plane with integer co-ordinates $(x,y)$ such that $1 \leq x \leq n$ and $1 \leq y \leq n$, where $n \geq 2$ is an integer. Two vertices $(x_1, y_1)$ ... only the answer without any explanations. What is the weight of a maximum weight-spanning tree in this graph? Write only the answer without any explanations.

Consider a graph whose vertices are points in the plane with integer co-ordinates $(x,y)$ such that $1 \leq x \leq n$ and $1 \leq y \leq n$, where $n \geq 2$ is an intege...

6.5k views

commented Jan 27, 2015

1 answer

15

Direct Mapped Cache

910 views

asked Jan 27, 2015

1 answer

16

GATE CSE 1997 | Question: 4.10
The trapezoidal method to numerically obtain $\int_a^b f(x) dx$ has an error E bounded by $\frac{b-a}{12} h^2 \max f’’(x), x \in [a, b]$ where $h$ is the width of the trapezoids. The minimum number of trapezoids guaranteed to ensure $E \leq 10^{-4}$ in computing $\ln 7$ using $f=\frac{1}{x}$ is 60 100 600 10000

The trapezoidal method to numerically obtain $\int_a^b f(x) dx$ has an error E bounded by $\frac{b-a}{12} h^2 \max f’’(x), x \in [a, b]$ where $h$ is the widt...

1.5k views

commented Jan 27, 2015

4 answers

17

GATE CSE 2014 Set 1 | Question: 54
Given the following schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary) departments(dept-id, dept-name, manager-id, location-id) You want to display the last names and hire dates of all latest hires in their ... of pairwise comparison. It generates an error because of the GROUP BY clause cannot be used with table joins in a sub-query.

Given the following schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary) departments(dept-id, dept-name, manager-id, location-id)You wan...

14.5k views

commented Jan 26, 2015

1 answer

18

Pumping lemma
To check L={02i |i is an integer} is regular or not ....i applied pumping lemma as below...Can anyone please explain why i am not getting it as regular ? Let Z=02n= 0n-1 0n 01 Take u= 0n-1 , v=0n, w=01 So, u (v)i w can be written as 0n-1 (0n)i 0 ...Take i=0, we get 0n-1.0=0n but 0n dont belong to language as n may be odd.So i am not getting it as regular...

To check L={02i |i is an integer} is regular or not ....i applied pumping lemma as below...Can anyone please explain why i am not getting it as regular ?Let Z=02n= 0n-1 0...

2.4k views

comment edited Jan 25, 2015

2 answers

19

C Programming

359 views

commented Jan 25, 2015

3 answers

20

GATE CSE 2004 | Question: 89
$L_1$ is a recursively enumerable language over $\Sigma$. An algorithm $A$ effectively enumerates its words as $\omega_1, \omega_2, \omega_3, \dots .$ Define another language $L_2$ over $\Sigma \cup \left\{\text{#}\right\}$ ... $S_1$ is true but $S_2$ is not necessarily true $S_2$ is true but $S_1$ is not necessarily true Neither is necessarily true

$L_1$ is a recursively enumerable language over $\Sigma$. An algorithm $A$ effectively enumerates its words as $\omega_1, \omega_2, \omega_3, \dots .$ Define another lang...

11.1k views

commented Jan 24, 2015

4 answers

21

GATE CSE 2003 | Question: 54
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a ... $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable

Define languages $L_0$ and $L_1$ as follows :$L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $$L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts o...

24.1k views

commented Jan 24, 2015

4 answers

22

GATE CSE 2014 Set 2 | Question: 16
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE? If $A\: \leq_m B$ and $B$ is recursive then $A$ ... then $A$ is recursively enumerable. If $A\: \leq_m B$ and $B$ is not recursively enumerable then $A$ is not recursively enumerable.

Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE?If $A\: \leq_...

17.5k views

commented Jan 24, 2015

1 answer

23

Consider the following languages
Consider the following languages $A=\left\{ \langle M\rangle \mid \text{ TM M accepts at most 2 distinct inputs} \right\}$ $B=\left\{\langle M \rangle \mid \text{ TM M accepts more than 2 distinct inputs} \right\}$ Identify the ... Turing recognizable $A$ is not Turing recognizable Both $A$ and $B$ are Turing recognizable Neither $A$ nor $B$ is Turing recognizable

Consider the following languages$A=\left\{ \langle M\rangle \mid \text{ TM M accepts at most 2 distinct inputs} \right\}$$B=\left\{\langle M \rangle \mid \text{ TM M acce...

10.7k views

commented Jan 23, 2015

1 answer

24

Thomas Write Rule

2.9k views

commented Jan 23, 2015

2 answers

25

Disk Scheduling algorithm
Which scheduling algorithm is optimum among the following disk scheduling algorithm in most of cases? a)FCFS b)SSTF c)SCAN d)LOOK Also please give reason

Which scheduling algorithm is optimum among the following disk scheduling algorithm in most of cases?a)FCFSb)SSTFc)SCANd)LOOKAlso please give reason

2.6k views

asked Jan 22, 2015

2 answers

26

Semaphore
What is value of binary semaphore "S" after executing 10 P (Wait) operations and 14 V (Signal) operations if the initial value of "S" is 1 ?

What is value of binary semaphore "S" after executing 10 P (Wait) operations and 14 V (Signal) operations if the initial value of "S" is 1 ?

2.2k views

commented Jan 22, 2015

11 answers

27

GATE CSE 2007 | Question: 59
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}{\text{studId}},{\text{ courseId}})$ gives which student has enrolled for ... Courses in which a proper subset of female students are enrolled. Courses in which only male students are enrolled. None of the above

Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}{\text{stu...

20.6k views

commented Jan 22, 2015

5 answers

28

GATE IT 2007 | Question: 66
Consider the following two transactions$: T1$ and $T2.$ ...

Consider the following two transactions$: T1$ and $T2.$$\begin{array}{clcl} T1: & \text{read (A);} & T2: & \text{read (B);} \\ & \text{read (B);} & & \text{read (A);} \\ ...

18.0k views

commented Jan 22, 2015

1 answer

29

Transactions
To check whether a given schedule is serializable or not , do we need to check only for conflict serializability or both conflict serializability and view serializability ..?

To check whether a given schedule is serializable or not , do we need to check only for conflict serializability or both conflict serializability and view serializabil...

2.0k views

asked Jan 21, 2015

4 answers

30

GATE CSE 2001 | Question: 1.24
Suppose the adjacency relation of vertices in a graph is represented in a table Adj $(X,Y).$ Which of the following queries cannot be expressed by a relational algebra expression of constant length? List all vertices adjacent to a given ... self loops List all vertices which belong to cycles of less than three vertices List all vertices reachable from a given vertex

Suppose the adjacency relation of vertices in a graph is represented in a table Adj $(X,Y).$ Which of the following queries cannot be expressed by a relational algebra ex...

7.9k views

commented Jan 21, 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