Dark Mode

Questions by Pranavpurkar

0 votes

1 answer

1

Unacademy AIMT - 1
What is the minimized expression for the following k-map? $AB + \bar{AB}C + \bar{A}CD + A\bar{C}D + AC\bar{D}$ $AB + \overline{AB}C + \bar{A}CD + A\bar{C}D + AC\bar{D} + \overline{BCD}$ $AB + \overline{AB}C + \bar{A}CD + A\bar{C}D + AC\bar{D} + \bar{B}\bar{C}\bar{D}$ None of these

asked in Digital Logic Dec 9, 2022

340 views

0 votes

1 answer

2

Unacademy AIMT - 1
In a shared Ethernet link, each user is active only 10% of the time. Suppose switching is used for 10 users and each user is equally likely to transmit at any point of time. The probability P that at any given time exactly 8 users are transmitting simultaneously. What is the value of $10^{10} * P$? Solve for both: 1)Packet switching. 2)Circuit switching.

asked in Computer Networks Dec 9, 2022

329 views

0 votes

0 answers

3

Test-Series
Consider the following language: $L$ $=$ { $<M>$ $|$ $L(M)$ has atleast $10$ strings } Which of the following is true about L? A)L is decidable B)L is Turing recognizable C)L is not recursive D)None of these

asked in Theory of Computation Nov 16, 2022

174 views

0 votes

0 answers

4

Test-Series
Consider the language given below: $L$ $=$ { $p$ $|$ $p$ $\neq$ $w$ $and$ $p$ $is$ $the$ $prefix$ $of$ $w$ $and$ $w$ $\epsilon$ {$0,1$}*} Which of following is true about L. A)L is CFL B)L is DCFL C)L is CSL D)L is regular

asked in Theory of Computation Nov 16, 2022

151 views

1 vote

1 answer

5

Test-Series
Consider the following language given below: I. L1= { $p^xq^y$ |; x,y >0 } II. L2 = {$p^xq^yp^z$ |$ x>y$ , $y\geq 0$ and $z>0$} Which of the following is true about L1 intersection L2 ? A)It is CSL B)It is CFL C)It is regular D)It is non regular

asked in Theory of Computation Nov 13, 2022

227 views

1 vote

1 answer

6

Test-Series
Consider the following language over $\sum$ = {0, 1} L = {w | w $\epsilon \sum$ * and |w| is divisible by 2 and not by 4} How many sates will min-DFA accepting L will have?

asked in Theory of Computation Nov 11, 2022

187 views

0 votes

0 answers

7

unacademy test series
Consider a string is stored in a word addressable memory where each word is of 4 Bytes. If the string starts at 100 and ends at 104 then which of the following can be the possible string(s) that can be stored. A)STRUCTURE B)UNION C)POINTER D)FUNCTION

asked in Programming Sep 27, 2022

290 views

0 votes

1 answer

8

DOUBT
DOUBT: suppose a memory space of 16B is given and it is asked that what is the maximum length of string it can store. then do we have to consider the space taken by the “\0” also? OR just the string length?

asked in Programming Sep 27, 2022

150 views

0 votes

0 answers

9

Doubt
DOUBT 1: if head = P → link. is performed then what will happen to the nodes containing values a and b? will they get removed as no link is pointing them? and we will left with only three nodes like DOUBT 2: what does head = (*P).link; equals to?

asked in Programming Sep 27, 2022

269 views

0 votes

0 answers

10

Unacademy test series
Which of the following is/are true regarding the following code snippet? 1:int *p; 2:p = &q; A)*p gives faster retrieval of information than q. B)The size of p is same as size of int. C)Only statement 2 gives an error. D)In statement 1, * is used as a dereferencing operator.

asked in Programming Sep 27, 2022

249 views