Recent activity by Ravi_1511 / GATE Overflow for GATE CSE

5 answers

1

GATE CSE 2008 | Question: 69
Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no) with the following functional dependencies: $\text{Title Author }\rightarrow\text{ Catalog_no}$ ... $\text{2NF}$ and Collection in $\text{3NF}$ Both Book and Collection are in $\text{2NF}$ only

Consider the following relational schemes for a library database:Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no)with the fo...

28.2k views

commented Apr 8, 2017

1 answer

2

set theory
Which of the following statements about the POSET diagram given below is TRUE ? For a lattice with 8 elements to be called as boolean algebra A) It is a necessary and a sufficient condition that it should be isomorphic to above POSET diagram. B) It is necessary condition ... It is sufficient condition but not a necessary condition. Which among A),B),C) is true ..? why ? please explain ?

Which of the following statements about the POSET diagram given below is TRUE ?For a lattice with 8 elements to be called as boolean algebra A) It is a necessary and a su...

376 views

answered Mar 26, 2017

1 answer

3

group theory
"The necessary and sufficient condition for a subset of a group to be called as sub-group is it should satisfy the algebraic structure property". can somebody tell why this should be TRUE. We are concluding it as sub-group just by seeing only algebraic structure property satisfying and not checking for identity element,inverse ....why ?

"The necessary and sufficient condition for a subset of a group to be called as sub-group is it should satisfy the algebraic structure property".can somebody tell why thi...

510 views

answered Mar 26, 2017

1 answer

4

ISRO2012-ECE Number system
If $(146)_x + (313) _{x-2} = (246)_ 8$ then the value of $x$ will be $5$ $6$ $7$ $9$

If $(146)_x + (313) _{x-2} = (246)_ 8$ then the value of $x$ will be$5$$6$$7$$9$

1.0k views

answered Feb 27, 2017

4 answers

5

GATE CSE 2017 Set 2 | Question: 40
Consider the following languages. $L_1 = \{a^p \mid p \text{ is a prime number} \}$ $L_2 = \{ a^nb^mc^{2m} \mid n \geq 0, m \geq 0 \}$ $L_3 = \{a^n b^n c^{2n} \mid n \geq 0 \}$ ... not context free $L_3$ is not context free but recursive $L_4$ is deterministic context free I, II and IV only II and III only I and IV only III and IV only

Consider the following languages.$L_1 = \{a^p \mid p \text{ is a prime number} \}$$L_2 = \{ a^nb^mc^{2m} \mid n \geq 0, m \geq 0 \}$$L_3 = \{a^n b^n c^{2n} \mid n \geq 0 ...

9.0k views

answered Feb 27, 2017

4 answers

6

How many tuples are returned by SQL Query
Consider the following relation instance myTable num1 num2 100 100 100 NULL NULL 100 NULL NULL Query 1: SELECT * FROM myTable WHERE num1 = 100; Query 2: SELECT * FROM myTable WHERE num1 <> 100; If Query 1 returns p tuples and Query 2 returns q tuples, then 10p+q will be _____________

Consider the following relation instance myTablenum1num2100100100NULLNULL100NULLNULL Query 1:SELECT *FROM myTableWHERE num1 = 100;Query 2:SELECT *FROM myTableWHERE num1 <...

1.8k views

answered Feb 8, 2017

2 answers

7

Maximum File Size
I am getting 282. Answer given is 256..??

I am getting 282. Answer given is 256..??

1.7k views

answered Feb 7, 2017

3 answers

8

GATE CSE 2008 | Question: 28
How many of the following matrices have an eigenvalue 1? $\left[\begin{array}{cc}1 & 0 \\0 & 0 \end{array} \right]\left[\begin{array}{cc}0 & 1 \\0 & 0 \end{array} \right] \left[\begin{array}{cc}1 & -1 \\1 & 1 \end{array} \right]$ and $\left[\begin{array}{cc}-1 & 0 \\1 & -1 \end{array} \right]$ one two three four

How many of the following matrices have an eigenvalue 1?$\left[\begin{array}{cc}1 & 0 \\0 & 0 \end{array} \right]\left[\begin{array}{cc}0 & 1 \\0 & 0 \end{array} \right] ...

8.7k views

commented Feb 6, 2017

2 answers

9

GATE CSE 2016 Set 1 | Question: 12
Consider the following "C" program. void f(int, short); void main() { int i = 100; short s = 12; short *p = &s; ____________; // call to f() } Which one of the following expressions , when placed in the blank above, will NOT result in a type checking error? $f(s, *s)$ $i = f(i,s)$ $f(i, *s)$ $f(i, *p)$

Consider the following "C" program.void f(int, short); void main() { int i = 100; short s = 12; short *p = &s; ____________; // call to f() } Which one of the following e...

12.7k views

commented Feb 6, 2017

5 answers

10

GATE CSE 2016 Set 1 | Question: 23
A database of research articles in a journal uses the following schema. $\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)}$ The primary key is '$\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE)}$ and the following functional dependencies exist in the ... database satisfies, but the old one does not? $\text{1NF}$ $\text{2NF}$ $\text{3NF}$ $\text{BCNF}$

A database of research articles in a journal uses the following schema.$\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)}$The primary key is '$\text{(VOLUME...

16.6k views

commented Feb 6, 2017

9 answers

11

GATE CSE 2016 Set 1 | Question: 28
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)$ if $n$ is even $f(n)=f(n+5)$ if $n$ is odd Let $R=\{ i \mid \exists{j} : f(j)=i \}$ be the set of distinct values that $f$ takes. The maximum possible size of $R$ is ___________.

A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)...

21.7k views

commented Feb 6, 2017

8 answers

12

GATE CSE 2016 Set 1 | Question: 14
Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? $P$: Minimum spanning tree of $G$ does not change. $Q$: Shortest path between any pair of vertices does not change. $P$ only $Q$ only Neither $P$ nor $Q$ Both $P$ and $Q$

Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following sta...

22.7k views

commented Feb 6, 2017

9 answers

13

GATE CSE 2016 Set 1 | Question: 33
Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is $\Theta (1)$ $\Theta (\log(n))$ $\Theta (\sqrt{n})$ $\Theta (n)$)

Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is$\Theta (1)$$\...

31.1k views

commented Feb 6, 2017

1 answer

14

Gate Practice Question
A binary min-heap contains keys 1,2,3,4.....2047,2048 What is smallest key that can be at leaf node.??

A binary min-heap contains keys 1,2,3,4.....2047,2048What is smallest key that can be at leaf node.??

855 views

commented Feb 4, 2017

1 answer

15

Gate Practice Question
A relational schema R with attributes (ABCDEFG).It is known that D never appears on RHS of any FD.How many different possibilities are there for what a Candidate key of R can be.?

A relational schema R with attributes (ABCDEFG).It is known that D never appears on RHS of any FD.How many different possibilities are there for what a Candidate key of R...

615 views

commented Feb 3, 2017

2 answers

16

Gate Practice
Q.1 VAS = 46 bit , Page size = 4KB , Page table entry = 4B ,3 level paging used ,1st level =12bits, 2nd level = 12bits,3rd level=10 bits(from right to left) Page table size for 4MB process.?? Q.2 Program size = 32MB , Page size = 1KB, VAS=46 bit ,Page table entry = 4B 3 level paging 1st = 12 bit ,2nd = 12 bit , 3rd = 10 bit Page table size.??

Q.1 VAS = 46 bit , Page size = 4KB , Page table entry = 4B ,3 level paging used ,1st level =12bits, 2nd level = 12bits,3rd level=10 bits(from right to left)Page table siz...

621 views

asked Feb 3, 2017

6 answers

17

GATE CSE 2009 | Question: 16, ISRO2017-12
Which one of the following is FALSE? There is a unique minimal DFA for every regular language Every NFA can be converted to an equivalent PDA. Complement of every context-free language is recursive. Every nondeterministic PDA can be converted to an equivalent deterministic PDA.

Which one of the following is FALSE?There is a unique minimal DFA for every regular languageEvery NFA can be converted to an equivalent PDA.Complement of every context-fr...

15.8k views

commented Feb 3, 2017

7 answers

18

GATE CSE 2009 | Question: 58
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let $I$ be ... before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$

Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maxi...

30.3k views

answered Feb 3, 2017

18 answers

19

GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$

Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into ...

48.8k views

answered Feb 3, 2017

5 answers

20

GATE CSE 2009 | Question: 52
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s \rangle$, where $c$ is the cylinder number, $h$ is the surface number and $s$ is the sector ... $\langle 0, 16, 30 \rangle$ $\langle 0, 16, 31 \rangle$ $\langle 0, 17, 31 \rangle$

A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s...

10.5k views

commented Feb 3, 2017

3 answers

21

Doubt about joins on keys
Consider the following relation: R (A B C) A primary key with 100 tuples. S (E F G) E primary key with 50 tuples. T (AE D) AE primary key with 80 tuples. U (D G H) H primary key with 10 tuples. The maximum number of possible records in the result of _______.

Consider the following relation:R (A B C) A primary key with 100 tuples.S (E F G) E primary key with 50 tuples.T (AE D) AE primary key with 80 tuples.U (D G H) H primary ...

2.3k views

commented Feb 2, 2017

12 answers

22

GATE CSE 2010 | Question: 10
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n-1)}{2}$ $n-1$

In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree ...

16.4k views

answered Feb 2, 2017

8 answers

23

GATE CSE 2010 | Question: 18
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node? $1$ $2$ $3$ $4$

Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node?$1$$2$$3$$4$

33.0k views

answered Feb 2, 2017

8 answers

24

GATE CSE 2010 | Question: 48
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ words. The memory access times are $2$ ... $L1$ cache. What is the time taken for this transfer? $2$ nanoseconds $20$ nanoseconds $22$ nanoseconds $88$ nanoseconds

A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cac...

42.7k views

answered Feb 2, 2017

4 answers

25

GATE CSE 2015 Set 3 | Question: 22
Consider the following statements. TCP connections are full duplex TCP has no option for selective acknowledgement TCP connections are message streams Only I is correct Only I and III are correct Only II and III are correct All of I, II and III are correct

Consider the following statements.TCP connections are full duplexTCP has no option for selective acknowledgementTCP connections are message streamsOnly I is correctOnly I...

12.4k views

commented Jan 31, 2017

5 answers

26

GATE CSE 2015 Set 3 | Question: 31
Consider the following grammar G $S \rightarrow F \mid H$ $F \rightarrow p \mid c$ $H \rightarrow d \mid c$ Where $S$, $F$, and $H$ are non-terminal symbols, $p, d$, and $c$ are terminal symbols. Which of the following statement(s) ... grammar G S2: LR(1) can parse all strings that are generated using grammar G Only S1 Only S2 Both S1 and S2 Neither S1 and S2

Consider the following grammar G$S \rightarrow F \mid H$$F \rightarrow p \mid c$$H \rightarrow d \mid c$ Where $S$, $F$, and $H$ are non-terminal symbols, $p, d$, and $c...

15.3k views

answered Jan 31, 2017

1 answer

27

Permutation and combinations
I am confused with Following formulaes of combination.. 1. n!/r! 2. n+k-1 C k 3. (P+1)*2^R where (P+R are total things and P are alike). 4. question such as number of ways of choosing 10 balls out of 15 balls in which 5 are red,8 are green,2 are black. Anybody please provide me some reference to understand these formulaes related to combination.

I am confused with Following formulaes of combination..1. n!/r!2. n+k-1 C k3. (P+1)*2^R where (P+R are total things and P are alike).4. question such as number of ways of...

362 views

commented Jan 31, 2017

6 answers

28

GATE CSE 2015 Set 3 | Question: 9
The value of $\displaystyle \lim_{x \rightarrow \infty} (1+x^2)^{e^{-x}}$ is $0$ $\frac{1}{2}$ $1$ $\infty$

The value of $\displaystyle \lim_{x \rightarrow \infty} (1+x^2)^{e^{-x}}$ is$0$$\frac{1}{2}$$1$$\infty$

13.3k views

commented Jan 31, 2017

6 answers

29

GATE CSE 2014 Set 2 | Question: 7
Let $k=2^n$. A circuit is built by giving the output of an $n$-bit binary counter as input to an $n\text{-to-}2^n$ bit decoder. This circuit is equivalent to a $k$-bit binary up counter. $k$-bit binary down counter. $k$--bit ring counter. $k$-bit Johnson counter.

Let $k=2^n$. A circuit is built by giving the output of an $n$-bit binary counter as input to an $n\text{-to-}2^n$ bit decoder. This circuit is equivalent to a $k$-bit bi...

19.8k views

commented Jan 31, 2017

3 answers

30

GATE CSE 2014 Set 2 | Question: 29
Consider the following schedule S of transactions $T1, T2, T3, T4:$ ... S is not conflict-serializable but is recoverable S is both conflict-serializable and recoverable S is neither conflict-serializable not is it recoverable

Consider the following schedule S of transactions $T1, T2, T3, T4:$$${\begin{array}{|l|l|l|l|}\hline\textbf{T1}& \textbf{T2}& \textbf{T3}& \textbf{T4} \\\hline& \...

28.5k views

commented Jan 31, 2017

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