Recent activity by debasish paramanik / GATE Overflow for GATE CSE

8 answers

1

GATE CSE 2014 Set 2 | Question: 38
Suppose $P, Q, R, S, T$ are sorted sequences having lengths $20, 24, 30, 35, 50$ respectively. They are to be merged into a single sequence by merging together two sequences at a time. The number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is ____.

Suppose $P, Q, R, S, T$ are sorted sequences having lengths $20, 24, 30, 35, 50$ respectively. They are to be merged into a single sequence by merging together two sequen...

25.2k views

commented Oct 25, 2020

11 answers

2

GATE CSE 2003 | Question: 69
The following are the starting and ending times of activities $A, B, C, D, E, F, G$ and $H$ ... a room only if the room is reserved for the activity for its entire duration. What is the minimum number of rooms required? $3$ $4$ $5$ $6$

The following are the starting and ending times of activities $A, B, C, D, E, F, G$ and $H$ respectively in chronological order: $“a_s \: b_s \: c_s \: a_e \: d_s \: c_...

14.5k views

commented Oct 25, 2020

4 answers

3

NIELIT 2017 DEC Scientist B - Section B: 52
Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is $n(n-1)/2$ $n^{n-2}$ $nx$ $n$

Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is$n(n-1)/2$$n^{n-2}$$nx$$n$

3.1k views

answered Oct 24, 2020

1 answer

4

theory od computation
Find DFA for the language,L= {w: |w| mod 3 = 0, |w| ≠6}

Find DFA for the language,L= {w: |w| mod 3 = 0, |w| ≠6}

1.7k views

commented Oct 9, 2020

8 answers

5

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.8k views

commented Oct 3, 2020

10 answers

6

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 (...

48.5k views

answered Sep 27, 2020

8 answers

7

GATE CSE 2005 | Question: 65
Consider a three word machine instruction $\text{ADD} A[R_0], @B$ The first operand (destination) $ A[R_0] $ uses indexed addressing mode with $R_0$ as the index register. The second operand (source) $ @B $ uses indirect addressing mode. $A$ and $B$ ... (first operand). The number of memory cycles needed during the execution cycle of the instruction is: $3$ $4$ $5$ $6$

Consider a three word machine instruction$\text{ADD} A[R_0], @B$The first operand (destination) $“A[R_0]”$ uses indexed addressing mode with $R_0$ as the index regist...

34.6k views

commented Sep 26, 2020

1 answer

8

Relative Addressing Mode
A two- word instruction is stored in a location A. The operand part of instruction holds B. If the addressing mode is relative , the operand is available in location : A. A+B+2 B.A+B+1 C.B+1 D.A+B Explain with diagram.

A two- word instruction is stored in a location A. The operand part of instruction holds B. If the addressing mode is relative , the operand is available in location :A. ...

3.8k views

commented Sep 25, 2020

1 answer

9

GATE CSE 2001 | Question: 17
The syntax of the repeat-until statement is given by the following grammar $S \rightarrow\text{ repeat }S_1\text{ until }E$ where E stands for expressions, $S$ and $S_1$ stand for statements. The non-terminals $S$ and $S_1$ have an ... Use the operator '\\' to concatenate two strings and the function gen(s) to generate a line containing the string s.

The syntax of the repeat-until statement is given by the following grammar$S \rightarrow\text{ repeat }S_1\text{ until }E$where E stands for expressions, $S$ and $S_1$ st...

2.1k views

commented Sep 21, 2020

2 answers

10

GATE CSE 2010 | Question: 34
The weight of a sequence $a_0,a_1, \dots, a_{n-1}$ of real numbers is defined as $a_0+a_1/2+ \dots + a_{n-1}/2^{n-1}$. A subsequence of a sequence is obtained by deleting some elements from the sequence, keeping the order of the remaining elements the same. Let $X$ denote the ... $X$ is equal to $max(Y, a_0+Y)$ $max(Y, a_0+Y/2)$ $max(Y, a_0 +2Y)$ $a_0+Y/2$

The weight of a sequence $a_0,a_1, \dots, a_{n-1}$ of real numbers is defined as $a_0+a_1/2+ \dots + a_{n-1}/2^{n-1}$. A subsequence of a sequence is obtained by deleting...

17.9k views

commented Sep 20, 2020

4 answers

11

GATE CSE 2011 | Question: 38
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q, \:\:q \times r, \:\:r \times s$ and $s \times t$ respectively can be multiplied in several ways with different number of total scalar multiplications. For example when multiplied as ... $t=80$, then the minimum number of scalar multiplications needed is $248000$ $44000$ $19000$ $25000$

Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q, \:\:q \times r, \:\:r \times s$ and $s \times t$ respectively can be multiplied in several ways with d...

15.8k views

commented Sep 20, 2020

4 answers

12

GATE CSE 2008 | Question: 80
The subset-sum problem is defined as follows. Given a set of $n$ positive integers, $S = \{ a_1, a_2, a_3, \dots , a_n \}$, and positive integer $W$, is there a subset of $S$ whose elements sum to $W$? A dynamic program for solving this problem uses a $\text{2-dimensional}$ Boolean array, ... $X[i, j] = X[i-1, j] \wedge X[i-1, j-a_i]$

The subset-sum problem is defined as follows. Given a set of $n$ positive integers, $S = \{ a_1, a_2, a_3, \dots , a_n \}$, and positive integer $W$, is there a subset of...

11.9k views

commented Sep 20, 2020

1 answer

13

Test series
Consider a set of 156 elements to find minimum and maximum elements in the given set, the minimum number of comparisons required is___? You have given an array of 512 elements,minimum number of comparisons required to find out second largest element among all will be___? 230 & 517 229 & 516 231 & 518 232 & 519

Consider a set of 156 elements to find minimum and maximum elements in the given set, the minimum number of comparisons required is___? You have given an array of 512 ele...

630 views

answered Sep 19, 2020

2 answers

14

Compiler design

362 views

answered Sep 19, 2020

8 answers

15

GATE CSE 2007 | Question: 53
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE? Both P and Q are true P is true and Q is false P is false and Q is true Both P and Q are false

Consider the following two statements:P: Every regular grammar is LL(1)Q: Every regular set has a LR(1) grammarWhich of the following is TRUE?Both P and Q are trueP is tr...

36.0k views

comment edited Sep 19, 2020

1 answer

16

Self Doubt
True or False ..detalied explanation will be helpful 1.Every DCFL has corresponding LR(k) Grammar 2.Every NCFL has corresponding LR(k) Grammar 3.Some NCFL which are not inherently ambigous have LR(k) grammar

True or False ..detalied explanation will be helpful1.Every DCFL has corresponding LR(k) Grammar 2.Every NCFL has corresponding LR(k) Grammar3.Some NCFL which are not inh...

249 views

answered Sep 19, 2020

3 answers

17

Ace Test Series

1.3k views

answered Sep 13, 2020

3 answers

18

Viable Prefix

2.8k views

commented Sep 10, 2020

5 answers

19

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.1k views

answered Sep 2, 2020

3 answers

20

Whether decomposion is lossless and dependency preserving. #testseries
Consider a Relation R {A,B,C,D,E,F} with FDs {${A \rightarrow B, AB \rightarrow C, D \rightarrow AC, D \rightarrow E}$} . R is decomposed into R1 {ABC}, R2{DE} and ... decomposition. lossless and dependency preserving. lossless but not dependency preserving. lossy and dependency preserving. lossy and not dependency preserving.

Consider a Relation R {A,B,C,D,E,F} with FDs {${A \rightarrow B, AB \rightarrow C, D \rightarrow AC, D \rightarrow E}$} . R is decomposed into R1 {ABC}, R2{DE} and R3{ACD...

1.1k views

answered Aug 26, 2020

8 answers

21

GATE CSE 2010 | Question: 43
The following functional dependencies hold for relations $R(A, B, C)$ and $S(B, D, E).$ $ B \to A$ $A \to C$ The relation $R$ contains $200$ tuples and the relation $S$ contains $100$ tuples. What is the maximum number of tuples possible in the natural join $R \bowtie S$? $100$ $200$ $300$ $2000$

The following functional dependencies hold for relations $R(A, B, C)$ and $S(B, D, E).$ $ B \to A$$A \to C$The relation $R$ contains $200$ tuples and the relation $S$ con...

13.4k views

commented Aug 25, 2020

5 answers

22

GATE CSE 2002 | Question: 16
For relation R = (L, M, N, O, P), the following dependencies hold: $ M \rightarrow O,$ $NO \rightarrow P,$ $P \rightarrow L$ and $L \rightarrow MN$ R is decomposed into R1 = (L, M, N, P) and R2 = ( ... above decomposition dependency-preserving? If not, list all the dependencies that are not preserved. What is the highest normal form satisfied by the above decomposition?

For relation R = (L, M, N, O, P), the following dependencies hold:$ M \rightarrow O,$ $NO \rightarrow P,$ $P \rightarrow L$ and $L \rightarrow MN$R is decomposed into R1 ...

16.8k views

commented Aug 24, 2020

1 answer

23

ER Diagram
Consider the following $ER$ model: If $‘n’$ entries in $E_1$ and $‘m’$ entries in $E_2$. How many entries in relationship set $(R)$? At least $n$ At most $n$ Exactly $n$ At least $n$ and atmost $m$

Consider the following $ER$ model: If $‘n’$ entries in $E_1$ and $‘m’$ entries in $E_2$. How many entries in relationship set $(R)$?At least $n$At most $n$Exactly...

1.3k views

commented Aug 23, 2020

1 answer

24

MadeEasy Subject Test: Databases - Er Diagram
what will be the key for total participation 1:1 combining tables??? plz give the Candidate keys and foreign keys seperately?? Also what if in 1:1 relation total participation is on both side than what will be key?? Composite key to both tables or key of anyone table will be selected???

what will be the key for total participation 1:1 combining tables??? plz give the Candidate keys and foreign keys seperately??Also what if in 1:1 relation total participa...

516 views

answered Aug 23, 2020

3 answers

25

Self Doubt
Do we need to create a separate table for each of the multivalued attribute irrespective of normal form always?

Do we need to create a separate table for each of the multivalued attribute irrespective of normal form always?

634 views

commented Aug 23, 2020

2 answers

26

E R model
why not b) option

why not b) option

759 views

answered Aug 23, 2020

4 answers

27

Minimum number of tables to represent ER-Diagram
The minimum number of tables to represent ER-Diagram such that the relational database satisfies 1NF.

The minimum number of tables to represent ER-Diagram such that the relational database satisfies 1NF.

11.8k views

answered Aug 23, 2020

3 answers

28

Self doubt
The number of tables required in SELF-REFERENTIAL relation when different mappings(1: M, M:1, 1:1, M: N) are used with different participation (Partial Participation at both sides, Total Participation at both sides and partial participation at one side). (Tabular Format answer will be appreciated).

The number of tables required in SELF-REFERENTIAL relation when different mappings(1: M, M:1, 1:1, M: N) are used with different participation (Partial Participation at b...

6.6k views

commented Aug 23, 2020

2 answers

29

One to one relationship with total participation of one entity. Can a single table be formed?
I am confused whether we need to have 2 tables or a single table when 2 strong entities are in 1:1 relationship with one having complete participation. Ex: How is it possible that we join Person and ... Bank Account may refer to some of the Person records which may go away on joining Person and License.

I am confused whether we need to have 2 tables or a single table when 2 strong entities are in 1:1 relationship with one having complete participation.Ex: How is it possi...

13.1k views

answered Aug 23, 2020

2 answers

30

ER MODEL
HOW many minimum relation which satisfy BCNF.??

HOW many minimum relation which satisfy BCNF.??

1.7k views

commented Aug 22, 2020

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