Dark Mode

Recent activity by bhavnakumrawat5

0 answers

1

Barc exam
Can any one tell me....IT branch student can apply for barc in CS branch...

commented in GATE Feb 3, 2019

511 views

1 answer

2

GATE2019
Answer for Minimum no of nor gates question

commented in Digital Logic Feb 3, 2019

1.6k views

4 answers

3

Self Doubt regarding C-SCAN
Consider a disk has 200 cylinders, numbered from 0 to 199. At some time the disk arm is at cylinder 100, and moving towards right direction. There is a queue of disk access requests for cylinders 30, 85, 110, 100, 105, 126, 135, 55 and ... the R/W head when the LOOK algorithm is used compared to the CSCAN algorithm is ________. Please also mention the method of C-SCAN.

commented in Operating System Oct 27, 2018

3.4k views

1 answer

4

Pipeline
The following sequence of instruction is executed in a basic 5 stage pipelined processor (S1, S2, S3, S4, S5). Assume that data dependency present in the program is resolved by operand forwarding techniques. Load instruction output present in 4th stage ALU instruction output ... What is the number of instructions must be inserted to achieve CPI = 1 by using operand forwarding.

commented in CO and Architecture Oct 12, 2018

982 views

1 answer

5

doubt
What is semi and Partially decidable...and how we know

commented in Theory of Computation Oct 1, 2018

366 views

3 answers

6

doubt
How to check any set is countable or not

commented in Theory of Computation Oct 1, 2018

263 views

0 answers

7

doubt
L1 = { a^n b^n c^m | n,m>=0} L2 = { a^m b^n c^n | m,n>=0} L1 intersection L2 = { { a^n b^n c^n | n>=0} how we do intersection plz explain using grammer....

asked in Theory of Computation Oct 1, 2018

132 views

2 answers

8

B+ Tree insertion
I think it would be 7..please check

commented in Databases Sep 21, 2018

1.2k views

0 answers

9

doubt - synchronization
what is difference between in both question...? it is totally look same just difference in variable. https://gateoverflow.in/1256/gate2007-58 https://gateoverflow.in/8405/gate2015-3-10

commented in Operating System Sep 17, 2018

436 views

0 answers

10

doubt
How we find the given calculus is safe or not

reshown in Databases Sep 8, 2018

181 views

3 answers

11

Cn: Optimal windows size
The round trip delay between x and y is given as 60 ms and bandwidth of link between X and Y is 512 KBps. What is the optimal window size (in packets) if the packet size is 64 bytes and channel is full duplex

commented in Computer Networks Jul 31, 2018

2.4k views

10 answers

12

GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.

commented in Computer Networks Jul 31, 2018

25.3k views

2 answers

13

MadeEasy Test Series: Computer Networks - Stop And Wait
Consider a wireless link, where the probability of packet error is 0.6. To transfer data across the links, Stop and Wait protocol is used. The channel condition is assumed to be independent from transmission to transmission. The average number of transmission attempts required to transfer x packets is 500. The value of x is _______.

commented in Computer Networks Jul 31, 2018

1.0k views

3 answers

14

self-doubt
Consider a binary tree T that has 50 leaf nodes. Then the number of nodes in T that have exactly ONE children are ______.

reshown in DS Jul 26, 2018

619 views

2 answers

15

DFS , how to slove it?

commented in DS Jul 26, 2018

923 views

2 answers

16

Test-series algorithms
What is the time complexity of following function fun()? Assume that log(x) returns log value in base 2. void fun() { int i, j; for (i=1; i<=n; i++) for (j=1; j<=log(i); j++) printf("GeeksforGeeks"); }

answered in Algorithms Jul 26, 2018

2.6k views

1 answer

17

Complete binary tree
If I have a complete binary tree and I need to find the average number of comparison to find any random key. Can I use this strategy like :- We can keep track of number of nodes per level and apply:- Summation (Level * number of nodes at that level) / total ... . Here summation is Sigma. And here I will consider level of root = 0 or 1 ? Well defaUlt we tAke as 0 but still...

commented in Programming Jul 25, 2018

292 views

1 answer

18

worst case possible height of an AVL tree .
What is the worst case possible height of an AVL tree?? a. 2logn (Assume base of log is 2) b. 1.44log n (Assume base of log is 2) c. Depends upon implementation d. Theta(n)

commented in DS Jul 25, 2018

6.6k views

1 answer

19

Testbook Test Series: Programming & DS - Stack
A queue is implemented using two stacks S1 and S2. Initially the queue contains 1, 2, 3, 4 from front to rear. The following operations are performed in the queue: delete, insert (5), delete, Then how many total no. of push and pop operations are needed to perform ... ? a) Push: 12 Pop: 13 b) Push: 15 Pop: 16 c) Push: 11 Pop: 10 d) Push: 12 Pop: 11

commented in DS Jul 24, 2018

888 views

1 answer

20

T(n) = T(n/4) + T(3n/4) +n
How to solve above recurrence relation (With substitution method)??

commented in Algorithms Jul 24, 2018

10.5k views

1 answer

21

Introduction To Algorithms
T(N) = 3T(N/4) + NlogN T(N) = 2T(N/2)+ NlogN Master theorem applicable to this ??

commented in Algorithms Jul 23, 2018

983 views

1 answer

22

self - doubt
how the get 3n/2 -2 comparision

asked in DS Jul 23, 2018

223 views

0 answers

23

Doubt
Given a binary string , in which direction should we place the parity bits , starting from left to right or right to left? Does both give same result Ex : Data is 1001 1. P1 P2 1 P4 0 0 1 https://www.youtube.com/watch?v=tBacTPPNIrk 2. 1 0 0 P4 1 P2 P1 https://www.youtube.com/watch?v=1A_NcXxdoCc&t=109s Which is correct?

asked in Digital Logic Jul 21, 2018

233 views

2 answers

24

commented in Digital Logic Jul 21, 2018

2.9k views

0 answers

25

doubt-tree
If each node of the B-tree is 80 percent full, then what is the average number of keys per node of the above B tree?

asked in DS Jul 20, 2018

232 views

0 answers

26

Doubt
Can we solve it by master Theorem T(n)=T(n/3)+T(n/4)+6n

asked in Algorithms Jul 19, 2018

283 views

1 answer

27

doubt
A 4bit carry lookahead adder which add two 4bit number is designed using AND,OR,NOT,NAND,NOR gates only.Assuming that all the inputs are available in both complemented and uncomplemented form and the delay of each gate is one time unit ,what is over all propagation delay of the adder?assume that carry network has been implemented using two level AND-Or logic .

commented in Digital Logic Jul 19, 2018

376 views

1 answer

28

gate 2004
A $4 \hspace{0.1cm} bit$ carry lookahead adder which add two $4$ $bit$ number is designed using $AND ,OR,NOT,NAND,NOR$ gates only.Assuming that all the inputs are available in both complemented and uncomplemented form and the delay of each gate is one time ... is if we take same $4$ $bit$ number instead of lookahead adder if we take parallel adder what will be overall propagation delay??

commented in Digital Logic Jul 18, 2018

569 views

0 answers

29

doubt
How to Calculate Propagation Delay In Carry Look Ahead Adder.

asked in Digital Logic Jul 18, 2018

194 views