Dark Mode

Recent activity by ghostman23111

5 answers

1

GATE CSE 2007 | Question: 81
Consider a machine with a byte addressable main memory of $2^{16}$ bytes. Assume that a direct mapped data cache consisting of $32$ lines of $64$ bytes each is used in the system. A $50$ x $50$ two-dimensional array of bytes is stored in the main memory starting from memory ... time? line $4$ to line $11$ line $4$ to line $12$ line $0$ to line $7$ line $0$ to line $8$

commented in CO and Architecture Aug 2, 2021

10.0k views

10 answers

2

GATE CSE 2017 Set 1 | Question: 29
Let $p$, $q$ and $r$ be propositions and the expression $\left ( p\rightarrow q \right )\rightarrow r$ be a contradiction. Then, the expression $\left ( r\rightarrow p \right )\rightarrow q$ is a tautology a contradiction always TRUE when $p$ is FALSE always TRUE when $q$ is TRUE

commented in Mathematical Logic Feb 1, 2021

10.5k views

1 answer

3

The number of different insertion sequences on the numbers
The number of different insertion sequences on numbers {1, 14, 26, 44, 60, 71} on an initially empty hash table H of size 6 and a hash function x%6 with linear probing scheme for collision resolution such that the end hash table should look like 60, 1, 14, 26, 44, 71 (The indices of numbers from left to right are 0 to 5) are ________

commented in DS Dec 26, 2020

2.0k views

1 answer

4

Cormen Edition 3 Exercise 7.1 Question 1 (Page No. 173)
PARTITION(A,p,r) 1 x = A[r] 2 i = p – 1 3 for j = p to r – 1 4 if A[j] <= x 5 i = i + 1 6 exchange A[i] with A[j] 7 exchange A[i+1] with A[r] 8 return i + 1 illustrate the operation of PARTITION on the array $A=\langle 13,19,9,5,12,8,7,4,21,2,6,11\rangle$

answered in Algorithms Dec 16, 2020

1.5k views

7 answers

5

GATE CSE 2009 | Question: 41
The above DFA accepts the set of all strings over $\{0,1\}$ that begin either with $0$ or $1$. end with $0$. end with $00$. contain the substring $00$.

commented in Theory of Computation Dec 15, 2020

21.0k views

5 answers

6

GATE CSE 2003 | Question: 10, ISRO-DEC2017-41
For a pipelined CPU with a single ALU, consider the following situations The ${j+1}^{st}$ instruction uses the result of the $j^{th}$ instruction as an operand The execution of a conditional jump instruction The $j^{th}$ and ${j+1}^{st}$ ... ALU at the same time. Which of the above can cause a hazard I and II only II and III only III only All the three

comment edited in CO and Architecture Nov 4, 2020

9.4k views

1 answer

7

Madeesay Test Series
Consider TCP implements an extension that allows window size much larger than 64KB. Suppose you are using this extended TCP over a 1Gbps link with a latency of 50ms to transfer a 10 MB file and TCP receive window is 1MB. If TCP sends 1KB packet ... multiplied by link latency, then effective throughput of transfer is x Mbps. Find x. (Assuming no congestion and no lost packets)

commented in Computer Networks Oct 25, 2020

3.4k views

1 answer

8

Andrew S. Tanenbaum Edition 5th Exercise 4 Question 17 (Page No. 352)
An IP packet to be transmitted by Ethernet is 60 bytes long, including all its headers. If LLC is not in use, is padding needed in the Ethernet frame, and if so, how many bytes?

answered in Computer Networks Oct 24, 2020

2.5k views

2 answers

9

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 32
The maximum data rate of a channel of $3000$-Hz bandwidth and SNR of $30$ db is $60000$ $15000$ $30000$ $3000$

answered in Computer Networks Oct 19, 2020

1.1k views

7 answers

10

GATE CSE 2014 Set 1 | Question: 55
Consider two processors $P_1$ and $P_2$ executing the same instruction set. Assume that under identical conditions, for the same input, a program running on $P_2$ takes $\text{25%}$ less time but incurs $\text{20%}$ more CPI (clock cycles per instruction) ... If the clock frequency of $P_1$ is $\text{1GHZ}$, then the clock frequency of $P_2$ (in GHz) is ______.

commented in CO and Architecture Oct 7, 2020

18.0k views

3 answers

11

GATE CSE 1989 | Question: 4-iii
Show that {NOR} is a functionally complete set of Boolean operations.

comment edited in Digital Logic Jul 7, 2020

1.6k views

2 answers

12

Finding Kth Smallest Element
Which one of the following is the recurrence equation for the worst case time complexity of finding Kth smallest element in an array of size n' using partition function? Assume c' is constant. A. T(n) = 2T(n/2) + c . n B. T(n) = 2T(n - 1) + c C. (n ... ) + c . n D. T(n) = T(n/2) + c . n Explanation Please and please tell me the different ways we can solve this problem

commented in Algorithms Jun 8, 2020

2.6k views

6 answers

13

GATE CSE 2015 Set 1 | Question: 35
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x [4] [3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}}; printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3); } $2036, 2036, 2036$ $2012, 4, 2204$ $2036, 10, 10$ $2012, 4, 6$

commented in Programming in C Apr 11, 2020

27.9k views

1 answer

14

Test by Bikram | Programming | Test 2 | Question: 26
What is the output of the below mentioned code snippet? #include <stdio.h> int main() { int i=10; static int x=i; if(x==i) printf("Equal"); else if(x>i) printf("Greater"); else printf("Lesser"); return 0; } Equal Greater Lesser Compilation Error

commented in Programming in C Apr 10, 2020

753 views

2 answers

15

Test by Bikram | Programming | Test 2 | Question: 4
State the output in below code snippet : #include <stdio.h> int main(void) { char x[5] = { 1, 2, 3, 4, 5 }; char *ptr = (char*)(&x + 1); printf("%d %d\n", *(x + 1), *(ptr - 1)); return 0; } Compile Error $2 \ 1$ $2 \ 5$ $3 \ 4$

commented in Programming in C Apr 9, 2020

824 views

1 answer

16

Test by Bikram | Programming | Test 2 | Question: 3
What is the output of this program? #include <stdio.h> #include <string.h> int main() { char string[] = "Hello"; printf("%lu %lu", sizeof(string), strlen(string)); return 0; } $5 \ 6$ $5 \ 5$ $6 \ 5$ $6 \ 6$

commented in Programming in C Apr 9, 2020

335 views

8 answers

17

GATE CSE 2013 | Question: 27
What is the logical translation of the following statement? "None of my friends are perfect." $∃x(F (x)∧ ¬P(x))$ $∃ x(¬ F (x)∧ P(x))$ $ ∃x(¬F (x)∧¬P(x))$ $ ¬∃ x(F (x)∧ P(x))$

commented in Mathematical Logic Aug 25, 2019

14.0k views

0 answers

18

asked in Computer Networks Jan 23, 2019

169 views

1 answer

19

probability
A treasure has 6 similar gold coins and 9 silver coins. If 4 coins are to be randomly selected without replacement, the probability that the first 2 selected are gold and the last 2 silver

recategorized in Probability Jan 19, 2019

524 views

1 answer

20

Probability
Suppose that a bag contains 8 blue cubes and 4 green cubes. We draw 2 cubes from the bag without replacement. It is given that blue balls are of weight 1Kg and green balls are of weight 0.5 Kg. Suppose that the probability that a given cube in the bag ... is its weight divided by the sum of the weights of all cubes currently in the bag. What is the probability that both cubes are blue.

asked in Probability Jan 19, 2019

529 views

1 answer

21

Probability
Prabha is working in a software company. Her manager is running a dinner for those employees having atleast one son. If Prabha is invited to the dinner and everyone knows she has two children. What is the probability that they are both boys?

asked in Mathematical Logic Jan 19, 2019

820 views

0 answers

22

Made easy CBT-01
How to solve it?

commented in Digital Logic Jan 16, 2019

319 views

0 answers

23

Logic Gate
Is X-NOR is Distributive ? Can you Please Explain with proof?

asked in Digital Logic Jan 11, 2019

163 views

0 answers

24

Verbal ability doubt
I have a query Regarding Verbal Ability, Till Now i didn’t touch this part should i study it or leave it ?

asked in Others Jan 10, 2019

353 views

3 answers

25

GATE CSE 2003 | Question: 49
Consider the following assembly language program for a hypothetical processor $A, B,$ and $C$ are $8$ bit registers. The meanings of various instructions are shown as comments. MOV B, #0 ; $B \leftarrow 0$ MOV C, #8 ; $C \leftarrow 8$ Z: CMP C, #0 ; compare C ... $\text{LRC A,} \#1; $ left rotate $A$ through carry flag by one bit $\text{ADD A,} \#1$

commented in CO and Architecture Jan 9, 2019

9.8k views

1 answer

26

Integration
How to solve it?

commented in Calculus Jan 8, 2019

461 views

0 answers

27

Synchronization
How Bounded waiting is Satisfied in Option B?

asked in Operating System Dec 30, 2018

176 views

1 answer

28

Compiler Design #Made_Easy_Test_Series
Let G be any grammar with the following productions: X → X + Y | Y Y → Y * Z | Z Z → (X) Z → id If LR(!) parser is used to parse the above grammar, then total how many look-a-heads are present for the item X → >Y and Z → .id in the initial state _____________. Please explain your answer.

answer selected in Compiler Design Dec 24, 2018

2.2k views

0 answers

29

Viable prefix & Handle
What is viable prefix and handle can you please explain with the example?

asked in Compiler Design Dec 24, 2018

637 views

18 answers

30

GATE CSE 2017 Set 2 | Question: 44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______

commented in Databases Dec 4, 2018

70.7k views