Dark Mode

Recent activity by Warlock lord

0 answers

1

Random
There are 6 pairs of black socks and 6 pairs of white socks.What is the probability to pick a pair of black or white socks when 2 socks are selected randomly in darkness. My thoughts: Since there have asked for probability to pick a "pair", we must consider those ... 6C1)/ 24C2 + (6C1 * 6C1)/ 24C2 = 6/23 Which is the correct approach and why? Why am I getting different results?

commented in Combinatory Jun 9, 2018

226 views

1 answer

2

kernal mode
When we talk about Process Synchronization, Inter-process communication, Virtual memory and other topics, do all of these occur in kernal mode?

asked in Operating System Jun 2, 2018

223 views

2 answers

3

Kenneth Rosen Edition 6th Exercise 1.2 Example 1 (Page No. 17)
"You can access the Internet from campus only if you are a computer science major or you are not a freshman" According to Rosen, its equivalent compound proposition is a $→ (c ∨¬f )$. Should it not be the other way round? $(c ∨¬f ) → a$

commented in Mathematical Logic May 28, 2018

2.6k views

0 answers

4

PGEE sample paper question on threads
I think options A, D and E are wrong; B is true. I'm not sure about C. I think it should be true because page table is created for a process and not for its threads so page table should be shared among threads of a same process.

commented in Operating System Apr 19, 2018

1.4k views

1 answer

5

PGEE sample paper
Choose the digital building blocks from the following list using which we can realize any boolean function. (A) 2-to-1 Multiplexer (B) 4-to-1 Multiplexer (C) 8-to-1 Multiplexer (D) 16-to-1 Multiplexer (E) None of the above

commented in Digital Logic Apr 19, 2018

2.7k views

0 answers

6

digital logic
Can a 4:1 MUX operate as 2:1? (I understand 4:1 can be realized using 2:1 Mux but is reverse possible, may be by grounding?)

commented in Digital Logic Apr 19, 2018

378 views

6 answers

7

GATE CSE 2011 | Question: 53
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ ... the NEXT ROUND of update, what will be the cost to $N1$ in the distance vector of $N3$ ? $3$ $9$ $10$ $\infty$

commented in Computer Networks Apr 12, 2018

20.0k views

9 answers

8

GATE CSE 2014 Set 2 | Question: 47
The product of the non-zero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$

commented in Linear Algebra Apr 11, 2018

31.0k views

3 answers

9

CMI2015-A-07
You arrive at a snack bar and you can't decide whether to order a lime juice or a lassi. You decide to throw a fair $6$-sided die to make the choice, as follows. If you throw $2$ or $6$ you order a lime juice. If you throw a $4$, you order a lassi. Otherwise, you throw ... is the probability that you end up ordering a lime juice? $\frac{1}{3}$ $\frac{1}{2}$ $\frac{2}{3}$ $\frac{3}{4}$

commented in Probability Apr 4, 2018

1.0k views

3 answers

10

CMI2014-A-02
The $12$ houses on one side of a street are numbered with even numbers starting at $2$ and going up to $24$. A free newspaper is delivered on Monday to $3$ different houses chosen at random from these $12$. Find the probability that at least $2$ of these newspapers are delivered to ... with numbers strictly greater than $14$. $\frac{7}{11}$ $\frac{5}{12}$ $\frac{4}{11}$ $\frac{5}{22}$

commented in Probability Apr 4, 2018

1.8k views

2 answers

11

pipelining
A CPU has five-stage pipeline where each stage takes $1\hspace{0.1cm}ns$, $2\hspace{0.1cm}ns$, $1.5\hspace{0.1cm} ns$, $3\hspace{0.1cm}ns$, $2.5\hspace{0.1cm} ns$. Instruction fetch happens in the first stage of the pipeline. ... one clock cycle. $30\%$ of the instructions are conditional branches. Find the average execution time of the program for $1200$ instructions is ________.

commented in CO and Architecture Mar 31, 2018

805 views

1 answer

12

My doubt
Can a process be preempted while it is in a critical section? If yes, then how does the critical section or synchronisation mechanism concept provide solution for 'Data inconsistency'? If no, then how the gate2013 problem on critical section is ... watch?v=jDUJsCFNI0E In video explanation instead of preemption sir has used context switch. How preemption is different from context switch?

commented in Operating System Mar 30, 2018

1.3k views

4 answers

13

GATE IT 2008 | Question: 76
A binary tree with $n > 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbours. $n_3$ can be expressed as $n_1 + n_2 - 1$ $n_1 -2$ $[((n_1 + n_2)/2)]$ $n_2 - 1$

commented in DS Mar 23, 2018

14.1k views

1 answer

14

IIITH-PGEE 2017
Let X be a length used to make three sides of a rectangle. Area of rectangle will be: A. $X^{2}/9$ B. $(X-a)^{2}/4$ C. $(X+a)^{2}/16$ D. None of the above

commented in Quantitative Aptitude Mar 22, 2018

1.6k views

14 answers

15

GATE CSE 2018 | Question: 46
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______

commented in DS Mar 7, 2018

31.2k views

1 answer

16

gateos
Suppose you have a computer system with a $48-bi$t logical address, page size of $16K$ and $4 bytes$ per page table entry. If we have a $48MB$ program such that the entire program and all necessary page tables are in memory. How much memory is used by program, including its page tables?

commented in Operating System Mar 1, 2018

642 views

2 answers

17

mock test
Consider following pseudo code : main() { int t1,t2,t3; t1=t2=t3=0; t1=fork(); t2=fork(); if (t1!=0){ t3=fork(); printf("Hello"); } } How many Hello's are printed when above code get executed. $1$ $2$ $3$ $4$

comment edited in Operating System Mar 1, 2018

1.0k views

2 answers

18

Fragmentation
Even If one fragment of packet is lost....will sender send the whole packet again?

commented in Computer Networks Feb 12, 2018

726 views

7 answers

19

GATE CSE 2018 | Question: 30
Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements. No edge of $G$ is a cross edge with respect to $T_D$. (A cross edge in $G$ ... $\mid i-j \mid =1$. Which of the statements above must necessarily be true? I only II only Both I and II Neither I nor II

commented in Algorithms Feb 4, 2018

23.3k views

10 answers

20

GATE CSE 2018 | Question: GA-5
$\text{ What is the missing number in the following sequence?}$ $2,\,12,\,60,\,240,\,720,\,1440,\,\underline{\;\;\;\;\;\;\;\;},0$ $2880$ $1440$ $720$ $0$

commented in Quantitative Aptitude Feb 4, 2018

4.6k views

1 answer

21

safe query
Is the following query safe? Consider a database that has the relation schemas EMP(EmpId, EmpName, DeptId), and DEPT(DeptName, DeptId) 1. DEPT_ID in EMP can be null 2.DPET_ID in EMP cannot be null {t | ∃u ∈ EMP(t[EmpName] = u[EmpName] ∧ ∀v ∈ DEPT(t[DeptId] == v[DeptId]))}

commented in Databases Jan 19, 2018

861 views

0 answers

22

safe query
Is the query below safe? {t | ∃u ∈ EMP(t[EmpName] = u[EmpName] ∧ ∀v ∈ DEPT(t[DeptId] == v[DeptId]))} Please explain why.

asked in Databases Jan 19, 2018

763 views

2 answers

23

slow start
Suppose TCP's additive increase and multiplicative decrease algorithm is used as a congestion control algorithm. The slow start phase begins with 4 MSS and threshold at start of first transmission is 16 MSS. Assume that a time-out occurs during 6 th transmission, ... https://gateoverflow.in/2156/gate2012_45 I'm not satisfied with the answer here. Shouldn't it start with 1 MSS again?

asked in Computer Networks Jan 16, 2018

486 views

10 answers

24

GATE IT 2004 | Question: 88
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the connection is in slow-start phase with a current transmit window of $4000$ $\text{bytes}$. ... transmit window? $4000$ $\text{bytes}$ $8000$ $\text{bytes}$ $10000$ $\text{bytes}$ $12000$ $\text{bytes}$

commented in Computer Networks Jan 16, 2018

19.5k views

2 answers

25

MadeEasy Test Series: CO & Architecture - Pipelining
An instruction pipeline consists of following 5 stages: IF = Instruction Fetch, ID = Instruction Decode, EX = Execute, MA = Memory Access and WB = Register Write Back. Now consider the following code: 1. LOAD R8, 0(R5); ... instructions. How many cycles are required to execute the code, without operand forwarding over a bypass network? 9 10 11 14

commented in CO and Architecture Jan 13, 2018

4.5k views

1 answer

26

pipielining
In questions where we are asked to find number of cycles taken for a set of instructions, if an IF overlaps with MEM (which generally is a structural hazard) we still let it overlap in the solution. So does IF and MEM execute in split phase? If so I have read ... (a comment by someone) that it takes one whole cycle for MEM to function and cannot be in a split phase? Please help me out.

commented in CO and Architecture Jan 13, 2018

211 views

1 answer

27

conflict miss
Can someone tell me the text-book definition for conflict miss?

asked in CO and Architecture Jan 12, 2018

1.4k views

0 answers

28

hierarchical accessing of blocks
Consider a hierarchical access of blocks for a multilevel cache. As per my understanding, in an Hierarchical accessing there is no search time for the cache calculated. When there is a miss, the memory access time and the cache access time is ... 12-isro2016-77 The question above should be clearly hierarchical. If I'm mistaken, please feel free to prove me wrong.

asked in CO and Architecture Jan 10, 2018

107 views

1 answer

29

Write Back and Write Through
A 64 word cache and main memory are divided into 16 word blocks. The main memory access time is 50 ns/word and the cache access time is 10 ns/word. Hit ratio for read operation is 80% and for the write operation is 90%. Whenever a cache miss happens, associated ... are modified, What is Tavg in write back policy? Ans for : 1) is 6.5 Million words/sec 2) is 176.4 ns

commented in CO and Architecture Jan 10, 2018

5.7k views

1 answer

30

Natural Join
If a question asks anything about 'Join' without describing what sort of join it is, should I consider that as a cross product join or Natural Join? (PS: As far as my knowledge goes, Natural join is almost equivalent to Inner Join and not Cross product.) Refer this question : https://gateoverflow.in/1471/gate1999-1-18-isro2016-53

asked in Databases Jan 9, 2018

232 views