Recent activity by IamRishabh / GATE Overflow for GATE CSE

2 answers

1

Discrete maths Predicate logic
( ∃x(P(x))→∃x(Q(x)) ) → ( ∃x(P(x)→Q(x)) ) ( ∃x(P(x)→Q(x)) ) → ( ∃x(P(x))→∃x(Q(x)) ) Which of the above is valid and for not valid please give me counter example where LHS is true but RHS is false?

( ∃x(P(x))→∃x(Q(x)) ) → ( ∃x(P(x)→Q(x)) )( ∃x(P(x)→Q(x)) ) → ( ∃x(P(x))→∃x(Q(x)) )Which of the above is valid and for not valid please give me cou...

883 views

commented Jul 29, 2017

4 answers

2

What is the output || Single linked list ?
struct node{ int num; struct node *next; } void print(struct node *ptr) { if(ptr) { printf("%d",ptr->data); do{ printf("%d",ptr->data); } while(ptr->next); } } What is the output, if a $SLL : 1\rightarrow 2\rightarrow 3\rightarrow 4\rightarrow 5$ is passed in the above $C$ code ? Assume Head pointer at Node $1$

struct node{ int num; struct node *next; } void print(struct node *ptr) { if(ptr) { printf("%d",ptr->data); do{ printf("%d",ptr->data); } while(ptr->next); } }What is the...

1.4k views

answered Jul 18, 2017

1 answer

3

sum of n terms
find sum of n terms 1^2 - 2^2 + 3^2 - 4^2 + 5^2 - 6^2 + ................... can anyone explain me this how to solve this

find sum of n terms 1^2 - 2^2 + 3^2 - 4^2 + 5^2 - 6^2 + ................... can anyone explain me this how to solve this

284 views

answered Jul 17, 2017

4 answers

4

CN stop and wait bandwidth is 1.5 Mbps
If the bandwidth f the line is 1.5 Mbps, RTT is 45ms and packet size is 1KB, then find link utilization stop and wait protocol.

If the bandwidth f the line is 1.5 Mbps, RTT is 45ms and packet size is 1KB, then find link utilization stop and wait protocol.

11.1k views

commented Apr 2, 2017

3 answers

5

#made easy
consider two hosts A and B . The speed of propagation delay between these two end systems is 20 milliseconds. hannel transmission rate is 1 Mbps. packet size is 500 bytes 1. If Stop N wait protocol is used then what will be throughput of the sender (ignore transmission time of ACK ... 14% c. 17% d. 21% 2. what is throughput of sender ? a. 110 kbps b. 166.67kbps c. 179.5kbps d.144.8kbps

consider two hosts A and B . The speed of propagation delay between these two end systems is 20 milliseconds. hannel transmission rate is 1 Mbps. packet size is 500 bytes...

350 views

answered Mar 31, 2017

1 answer

6

How large of a disk can this file system support

441 views

commented Feb 6, 2017

2 answers

7

Matching time complexities

723 views

answered Feb 3, 2017

1 answer

8

Time complexity to compute the sum of k smallest element in the binary search tree??
Time complexity to compute the sum of k smallest element in the binary search tree?? can we do it like this- Start doing the inorder traversal of the binary search tree, it will give the elements in increasing order. ... which we have got. Its time complexity will be O(h+k). Am i right?? plzz plzz explain someone

Time complexity to compute the sum of k smallest element in the binary search tree??can we do it like this-Start doing the inorder traversal of the binary search tree, it...

2.0k views

commented Feb 2, 2017

0 answers

9

Time Complexity
A program takes an input a binary tree with ‘n’ leaf nodes and computes the value of function g(x) for each node ‘I ’. If the cost of computing G(x) = (Maximum height in left subtree of I - Maximum height in right subtree of I), then the worst case time complexity of the program is Ο(n) Ο(n2 ) Ο(n logn) Ο(logn)

A program takes an input a binary tree with ‘n’ leaf nodes and computes the value of function g(x) for each node ‘I ’. If the cost of computing G(x) = (Maximum he...

319 views

commented Feb 2, 2017

0 answers

10

Solve the following Recurrence using any method
T(n) = 2T(n/4) - n2

T(n) = 2T(n/4) - n2

715 views

commented Feb 2, 2017

2 answers

11

madeasy
Consider the vertices V1 and V2 that are simultaneously on the function call stack at some point during the execution of depthfirst search from vertex s in a digraph. Which of the following must be true? I. There exist directed path from s to V1 and directed path from ... from V1 to V2 then there exist a directed path from V2 to V1 . The number of above statements is/are true ________ .

Consider the vertices V1 and V2 that are simultaneously on the function call stack at some point during the execution of depthfirst search from vertex s in a digraph. W...

456 views

commented Feb 2, 2017

0 answers

12

Test Series Question
Suppose host A is sending a large file to host B over a TCP connection. The two end hosts are 10msec apart connected by a 1Gbps link. Assume that they are using a packet size of 1000 bytes to transmit the file. Also assume for ... utilization to be greater than 80%? Why Does this formula doesn't work here N(efficiency) = Transmission/(Transmission + 2*Propagation)

Suppose host A is sending a large file to host B over a TCP connection. The two end hosts are 10msec apart connected by a 1Gbps link. Assume that they are using a packet ...

226 views

commented Jan 30, 2017

1 answer

13

Made easy material
Two peer processes A (sender) and B (receiver) use stop-and-wait ARQ to send packets over a single link with capacity C. All packets have the same length of 100 bits. The round-trip time (which is the time until A receives an acknowledgment for a ... average (transmission) rate (in bits per seconds) with which process A sends data to process B? (b) What is the link utilization?

Two peer processes A (sender) and B (receiver) use stop-and-wait ARQ to send packetsover a single link with capacity C. All packets have the same length of 100 bits. Ther...

572 views

commented Jan 30, 2017

1 answer

14

madeeasy

324 views

commented Jan 30, 2017

1 answer

15

ace mock 6 max size of packet

411 views

commented Jan 30, 2017

2 answers

16

TIFR-2015-Maths-A-1
Let $A$ be an invertible $10 \times 10$ matrix with real entries such that the sum of each row is $1$. Then The sum of the entries of each row of the inverse of $A$ is $1$ The sum of the entries of each column of the inverse of $A$ is $1$ The trace of the inverse of $A$ is non-zero None of the above

Let $A$ be an invertible $10 \times 10$ matrix with real entries such that the sum of each row is $1$. ThenThe sum of the entries of each row of the inverse of $A$ is $1$...

2.1k views

commented Jan 29, 2017

5 answers

17

linearalgebra
if $A = \begin{bmatrix} 2 &3 &4 \\ 3 & -1 &2 \\ -1& 4 & 5 \end{bmatrix}$ then rank of the matrix $(A-A^T)$ is _____ (A) $1$ (B) $2$ (C) $3$ (D) $0$

if $A = \begin{bmatrix} 2 &3 &4 \\ 3 & -1 &2 \\ -1& 4 & 5 \end{bmatrix}$ then rank of the matrix $(A-A^T)$ is _____(A) $1$ (B) $2$ (C...

864 views

answered Jan 29, 2017

2 answers

18

Virtual Gate Test Series: Computer Networks - Sliding Window
What is send as ack in sliding window? The next packet which the sender want to received or the packet right now sender received? I think the sender send the ack as the packet it has got right now. ? In sliding window protocol, sender's window size is ... $(B)$ Frame $n-1$ $(C)$ Frames $0$ to $n$ $(D)$ Frames $0$ to $n-1$

What is send as ack in sliding window? The next packet which the sender want to received or the packet right now sender received?I think the sender send the ack as the pa...

1.3k views

answered Jan 26, 2017

1 answer

19

toc - doubt
how (i) is true???

how (i) is true???

700 views

commented Jan 26, 2017

2 answers

20

Fragmentation Ipv4-Ipv6
True or false - 1. In Ipv4 fragmentation can be done both at Source and intermediate routers. 2. In Ipv6 fragmentation can be done only at Source and not intermediate routers. 3. In both IPv6/4 reassembly is done only at the destination. 4. ... fragmentation done at the Source in Ipv4? Should the 1) be false since segmentation is done and hence fragmentation can be avoided?

True or false -1. In Ipv4 fragmentation can be done both at Source and intermediate routers.2. In Ipv6 fragmentation can be done only at Source and not intermediate route...

2.9k views

answered Jan 24, 2017

2 answers

21

MadeEasy Subject Test: Operating System - Process Synchronization
Reader Writer's problem How is deadlock possible in this?

Reader Writer's problemHow is deadlock possible in this?

852 views

commented Jan 24, 2017

1 answer

22

MadeEasy Subject Test: Engineering Mathematics - First Order Logic
What is the correct translation of the following statement into mathematical logic? If everyone respect somebody then that person is honest Here respect (a, b) represent a respect b. ... None of these I feel it should be a but the answer is b.

What is the correct translation of the following statement into mathematical logic?“If everyone respect somebody then that person is honest”Here respect (a, b) repres...

622 views

commented Jan 23, 2017

2 answers

23

minimum expression

368 views

answered Jan 22, 2017

1 answer

24

combinational circuits

361 views

answered Jan 22, 2017

1 answer

25

ace mock logic

302 views

answer edited Jan 22, 2017

0 answers

26

number of OR gates

280 views

commented Jan 22, 2017

2 answers

27

binary heap
Consider a binary min heap containing n elements and every node is having degree 2 ( i.e. full binary min heap tree). What is the probability of finding the largest element at the last level ? According to my understanding the largest element has to be a leaf and since leafs can be on two levels last and second last therefore the probability should be 1/2

Consider a binary min heap containing n elements and every node is having degree 2 ( i.e. full binary min heap tree). What is the probability of finding the largest eleme...

2.2k views

commented Jan 19, 2017

2 answers

28

Using Horner method and Brutef force method what will be the Time Complexity of
Using Horner method and Brute force what will be the Time Complexity of 4x4+7x3-2x2+3x+6

Using Horner method and Brute force what will be the Time Complexity of 4x4+7x3-2x2+3x+6

1.3k views

answered Jan 17, 2017

12 answers

29

GATE CSE 2016 Set 1 | Question: 41
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing ... = Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.

Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Simi...

34.9k views

commented Jan 17, 2017

0 answers

30

algorithm
if dijkstra's shortest path algorithm takes 8 seconds for a graph of 1000 nodes then approx. how much time would it take for a graph of 1000000 nodes?

if dijkstra's shortest path algorithm takes 8 seconds for a graph of 1000 nodes then approx. how much time would it take for a graph of 1000000 nodes?

321 views

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