Recent activity by adityaaswal / GATE Overflow for GATE CSE

7 answers

1

GATE CSE 2003 | Question: 84
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5$ packets each. Data packets (sent only from $A$ to $B$) are all $1000$ bytes long and the ... ? $7.69 \times 10^6$ Bps $11.11 \times 10^6$ Bps $12.33 \times 10^6$ Bps $15.00 \times 10^6$ Bps

Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5...

28.2k views

commented Nov 1, 2019

0 answers

2

DBMS SUBJECT TEST
Let Depositor and Lender be relational schemas such that Depositor = {a/c number, cname , balance, branch} and Lender ={loan_number ,cname, amount , branch}. Now consider the following queries on the database : Query 1 : ( t | ∃D ∈Depositor ( t ... cname where D.cname = L.cname(Containing duplicates) PS: I'll merge this with the original question when my doubts are cleared

Let Depositor and Lender be relational schemas such that Depositor = {a/c number, cname , balance, branch} and Lender ={loan_number ,cname, amount , branch}. Now consider...

614 views

asked Mar 12, 2019

1 answer

3

Test by Bikram | Databases | Test 2 | Question: 29
Let Depositor and Lender be relational schemas such that Depositor = {a/c number, cname , balance, branch} & Lender ={loan_number ,cname, amount , branch}. Now, consider the following queries on the database: Query $1$ ... 3 give same result. Query 1 and Query 3 give same result. Query 1, Query 2 and Query 3 give different results.

Let Depositor and Lender be relational schemas such thatDepositor = {a/c number, cname , balance, branch} & Lender ={loan_number ,cname, amount , branch}. Now, consider...

735 views

commented Mar 12, 2019

1 answer

4

nptel pdf
Q Consider a relation R(a, b, c) ordered on a non-key attribute b, and an index is maintained on attribute c. To evaluate the following expression, which is a better order of operation? σ(b= abc'∧c=12)(R) A. First filter tuples using index on c and ... search tuples for the given value of b and then use index on c C. The order of operation does not matter D. Insufficient data to answer

Q Consider a relation R(a, b, c) ordered on a non-key attribute b, and an index is maintained on attribute c. To evaluate the following expression, which is a better orde...

681 views

commented Mar 12, 2019

2 answers

5

made easy test series
In a RSA cryptosystem , a participant uses two prime numbers p and Q is 17 and 11 respectively to generate his/her public key and private keys. if the public key of participant is 7 and cipher text(C) is 11, then the original message (M) is______?

In a RSA cryptosystem , a participant uses two prime numbers p and Q is 17 and 11 respectively to generate his/her public key and private keys. if the public key of part...

3.0k views

answer edited Jan 27, 2019

3 answers

6

MadeEasy Test Series: Databases - Database Normalization
Consider a database with the following relation: Shipping (ShipName, ShipType, TripId, Cargo, Port. Date) With the following functional dependencies: sorry for not typing ,i will type it later my doubt is-isn’t partial dependency $ShipName\rightarrow ShipType$ present in new database??

Consider a database with the following relation:Shipping (ShipName, ShipType, TripId, Cargo, Port. Date)With the following functional dependencies:sorry for not typing ,i...

2.6k views

commented Jan 24, 2019

6 answers

7

GATE IT 2004 | Question: 67
In a particular Unix OS, each data block is of size $1024$ bytes, each node has $10$ direct data block addresses and three additional addresses: one for single indirect block, one for double indirect block and one for triple indirect block. Also, each block can ... following is approximately the maximum size of a file in the file system? $512$ MB $2$ GB $8$ GB $16$ GB

In a particular Unix OS, each data block is of size $1024$ bytes, each node has $10$ direct data block addresses and three additional addresses: one for single indirect b...

9.3k views

commented Jan 11, 2019

0 answers

8

MadeEasy Subject Test 2019: Algorithms - Dynamic Programming
Let G = (V,E) be a directed graph.Each edge of G is represented as (i,j) with length l[i,j].If there is no edge from i to j then l[i,j] = (IMAGE ATTACHED)

Let G = (V,E) be a directed graph.Each edge of G is represented as (i,j) with length l[i,j].If there is no edge from i to j then l[i,j] = (IMAGE ATTACHED)

537 views

commented Dec 1, 2018

5 answers

9

GATE CSE 2008 | Question: 13, ISRO2016-36
If $L$ and $\overline{L}$ are recursively enumerable then $L$ is regular context-free context-sensitive recursive

If $L$ and $\overline{L}$ are recursively enumerable then $L$ isregularcontext-freecontext-sensitiverecursive

11.6k views

commented Oct 28, 2018

0 answers

10

Gateforum Test Series
If L1=anbn and L2 =cndn then L1L2 is (most suitable language) Why the answer should be B and not D.

If L1=anbn and L2 =cndn then L1L2 is (most suitable language) Why the answer should be B and not D.

398 views

commented Oct 27, 2018

1 answer

11

made easy test series

459 views

commented Oct 24, 2018

7 answers

12

GATE CSE 2013 | Question: 37
In an IPv4 datagram, the $M$ bit is $0$, the value of $HLEN$ is $10$, the value of total length is $400$ and the fragment offset value is $300$. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, ... , $2400$ and $2789$ First fragment, $2400$ and $2759$ Last fragment, $2400$ and $2759$ Middle fragment, $300$ and $689$

In an IPv4 datagram, the $M$ bit is $0$, the value of $HLEN$ is $10$, the value of total length is $400$ and the fragment offset value is $300$. The position of the datag...

31.9k views

commented Oct 1, 2018

6 answers

13

GATE CSE 2009 | Question: 7, ISRO2015-3
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes? $8$ $32$ $64$ $128$

How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes?$8$$32$$64$$128$

17.6k views

commented Aug 13, 2018

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