Dark Mode

Recent activity by A_i_$_h

0 answers

1

Isro exam admit card
When will isro 2018 admit card be released? Is it out? Exam date -22nd april

edited in ISRO Apr 3, 2018

293 views

0 answers

2

Gate mtech admission
Regarding mtech placements Which is a better choice among these 1.NIT calicut 2.PSG college of technology , coimbatore 3.anna university, guindy ARJUN SIR please give your views too would be helpful :)

asked in Written Exam Mar 10, 2018

130 views

0 answers

3

Gate general
Gate 2018 answer keys when will it be out??? If its out at anytime please do share the link

asked in GATE Feb 4, 2018

737 views

1 answer

4

manchester
For a fixed baud rate , manchester communication bits twice as fast as NRZ true or false with explanation please :)

answer selected in Computer Networks Jan 30, 2018

411 views

1 answer

5

non abelian
Let G be a non abelian group, order of G can be 24 44 54 34

commented in Set Theory & Algebra Jan 30, 2018

432 views

0 answers

6

sum is odd
A six faced dice is biased , there is twice as likely to show an even number than an odd number . If it is thrown thrice , then probability of sum of 2 numbers thrown is odd is _____________________________

commented in Probability Jan 28, 2018

366 views

0 answers

7

regular language
only option C is regular right ?

commented in Theory of Computation Jan 27, 2018

292 views

1 answer

8

max file size
when question asks about maximum file size sometimes only the size of the biggest pointer ( eg. triple indirect pointer) is considered and some solutions take the sum of single , double , triple and direct pointers as well can someone clear the ambiguity

commented in Operating System Jan 27, 2018

194 views

0 answers

9

MUltiplexer
s1 = C' and enable is again negated therefore E = (C')' = C now for minterm 1 = binary representation = 0 0 0 1 here C=0 therefore E=0 so how can this be the option it should be none of the above right ?

edited in Digital Logic Jan 27, 2018

136 views

7 answers

10

GATE IT 2005 | Question: 32
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is $3$ $4$ $5$ $6$

commented in Probability Jan 25, 2018

18.1k views

4 answers

11

MadeEasy Test Series: Combinatory - Permutations And Combinations
MY SOLUTION : Fix the root then next level 2 elements ( 2! possibilities) next level 4 elements( 4! possibilities) last level 2 elements ( 2! possibilities) total possibility = 2! * 4! * 2! = 2 * 24 * 2 = 96 what ... that if node of above graph is filled with these elements it satisfies max heap property a)96 b)896 c)2688 d) none

commented in Combinatory Jan 24, 2018

3.1k views

0 answers

12

range of normalised mantissa
sign bit ( 1 bit) biased exponent ( 6 bits) mantissa( 20 bits) what is the range of normalised mantissa? answer : 1 to 2 - 2-20 minumum is 1 but max how is 2-2-20.....they havent considered exponent to be all 1's shouldnt it be 2-2-20 * 231 where 231 is obtained by all 1's in exponent part

commented in Digital Logic Jan 24, 2018

309 views

1 answer

13

GATE CSE Digital Logic
The function f(A,B,C,D) = Σm(0,1,4,6,7,8,10,14,15). The number of prime implicants and essential prime implicants are a). 6,1 b). 6,2 c). 7,1 d). 7,2

commented in Digital Logic Jan 24, 2018

512 views

1 answer

14

subnet ID
IP address is 129.57.104.143 subnet mask is 255.255.255.0 what is number of 1's in subnet id ?

asked in Theory of Computation Jan 16, 2018

319 views

0 answers

15

context free
is L= { (an bn)*cm | n,m>=1 } CFL ? with reason please

asked in Theory of Computation Jan 16, 2018

92 views

0 answers

16

madeeasy
Consider the following statements with respect to digital signatures: S1 : Digital signature ensures authenticity of the sender and integrity of the message. S2 : Using a public-key system, the signer signs using his private key and the verifier verifies using his public key. ... and private key. Which of the following is true? Ans is given S1 and S2 but how S2 is true please explain

commented in Computer Networks Jan 13, 2018

741 views

5 answers

17

GATE CSE 2003 | Question: 31
Let $(S, \leq)$ be a partial order with two minimal elements a and b, and a maximum element c. Let P: S \(\to\) {True, False} be a predicate defined on S. Suppose that P(a) = True, P(b) = False and P(x) \(\implies\) P(y) for all $x, y \in S$ satisfying $x \leq y$ ... for all x \(\in\) S such that b ≤ x and x ≠ c P(x) = False for all x \(\in\) S such that a ≤ x and b ≤ x

commented in Set Theory & Algebra Jan 12, 2018

8.8k views

15 answers

18

GATE CSE 2012 | Question: 33
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of values that turn up is at least $6$ ? $\dfrac{10}{21}$ $\dfrac{5}{12}$ $\dfrac{2}{3}$ $\dfrac{1}{6}$

commented in Probability Jan 12, 2018

17.5k views

5 answers

19

TIFR CSE 2013 | Part B | Question: 4
A set $S$ together with partial order $\ll$ is called a well order if it has no infinite descending chains, i.e. there is no infinite sequence $x_1, x_2,\ldots$ of elements from $S$ such that $x_{i+1} \ll x_i$ and $x_{i+1} \neq x_i$ for all $i$. ... $2^{24}$ words. $W$ is not a partial order. $W$ is a partial order but not a well order. $W$ is a well order.

commented in Set Theory & Algebra Jan 11, 2018

2.0k views

9 answers

20

GATE CSE 2014 Set 1 | Question: 44
An access sequence of cache block addresses is of length $N$ and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by $k$. What is the miss ratio if the access sequence is passed ... $\left(\dfrac{1}{N}\right)$ $\left(\dfrac{1}{A}\right)$ $\left(\dfrac{k}{n}\right)$

commented in CO and Architecture Jan 11, 2018

18.5k views

11 answers

21

GATE CSE 2008 | Question: 52
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$ $\epsilon + 0\left(10^*1+00\right)^*0$ $\epsilon + 0\left(10^*1+10\right)^*1$ $\epsilon + 0\left(10^*1+10\right)^*10^*$ $P-2, Q-1, R-3, S-4$ $P-1, Q-3, R-2, S-4$ $P-1, Q-2, R-3, S-4$ $P-3, Q-2, R-1, S-4$

commented in Theory of Computation Jan 11, 2018

10.0k views

0 answers

22

CARRY adder
number of AND gates for a carry look ahead adder of n bits = 1 + 2 + 3 +................n i read it somewhere but not sure where is that statement correct if yes can i have a reason for it being correct

commented in Digital Logic Jan 11, 2018

150 views

3 answers

23

GATE CSE 2008 | Question: 37, ISRO2009-38
The use of multiple register windows with overlap causes a reduction in the number of memory accesses for: Function locals and parameters Register saves and restores Instruction fetches $\text{I}$ only $\text{II}$ only $\text{III}$ only $\text{I}, \text{II}$ and $\text{III}$

commented in CO and Architecture Jan 11, 2018

16.3k views

0 answers

24

abelian
How many different non-isomorphic Abelian groups of order 4 are there? 2 3 4 this is already discussed here https://gateoverflow.in/1219/gate2007-21 doubt 1 - here how do we ensure that the splits formed are abelian groups ? doubt 2 - if order of the group can be prime factorised then its sure to be abelian ? doubt 3 - how is non isomorphism proved in the solution?

asked in Set Theory & Algebra Jan 6, 2018

237 views

3 answers

25

GATE CSE 1998 | Question: 12
Let $(A, *)$ be a semigroup, Furthermore, for every $a$ and $b$ in $A$, if $a \neq b$, then $a*b \neq b*a$. Show that for every $a$ in $A$, $a*a=a$ Show that for every $a$, $b$ in $A$, $a*b*a=a$ Show that for every $a,b,c$ in $A$, $a*b*c=a*c$

commented in Set Theory & Algebra Jan 6, 2018

5.5k views

0 answers

26

identity element
Let A be the set of all non-singular matrices over real number and let ∗ be the matrix multiplication operation. Then answer - A is group but not abelian DOUBT - in order to be a group it should first first be a monoid ( have identity element) what will be the identity matrix here ?

asked in Set Theory & Algebra Jan 6, 2018

335 views

7 answers

27

GATE IT 2005 | Question: 85b
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the ... $(t + 100)$ is : $>100$ but finite $\infty$ $3$ $>3$ and $\leq 100$

commented in Computer Networks Jan 6, 2018

11.9k views

8 answers

28

GATE CSE 2005 | Question: 44
What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such that, $a \equiv c\mod 3$ and $b \equiv d \mod 5$ $4$ $6$ $16$ $24$

commented in Combinatory Jan 6, 2018

10.5k views

0 answers

29

functions
https://gateoverflow.in/27344/tifr2014-b-17 this says option C ( parity function is not possible ) but why ? if we take OR of the inputs it will give 0 for even no of 1's and 1 for odd no.of 1's right ? any counter ?

asked in Set Theory & Algebra Jan 5, 2018

337 views

4 answers

30

GATE CSE 2007 | Question: 25
Let A be a $4 \times 4$ matrix with eigen values -5,-2,1,4. Which of the following is an eigen value of the matrix$\begin{bmatrix} A & I \\ I & A \end{bmatrix}$, where $I$ is the $4 \times 4$ identity matrix? $-5$ $-7$ $2$ $1$

commented in Linear Algebra Jan 4, 2018

12.4k views