Dark Mode

Answers by target2017

7 votes

1

GATE 2017 EC
Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?

answered in Quantitative Aptitude Feb 6, 2017

6.3k views

6 votes

2

Combinations
How many number of 5 letter words that use letters from the 3 letter set {a,b,c} in which each letter occur atleast once?

answered in Mathematical Logic Feb 4, 2017

1.8k views

1 vote

3

answered in Probability Jan 17, 2017

1.2k views

2 votes

4

COMPLEMENT OF CSL

answered in Theory of Computation Jan 17, 2017

1.1k views

3 votes

5

2's Comlement
Find the 2's complement pattern for – 113? (1) 0001111 (2) 00001111 (3) 10001111 (4) 1110001 Correct Answer: 3 Status: unattempted

answered in Digital Logic Jan 17, 2017

1.1k views

4 votes

6

Huffman Coding
What is the time complexity of Huffman coding using heap tree data structure ? a) O(n) b) O(n log n) c) O(log n) d) O(n2)

answered in Algorithms Jan 16, 2017

4.5k views

5 votes

7

test book test
46 bit Virtual addressing system uses 3 level paging. The page table entry is 32 bits. Size of Page Table is equal to 1 page. The processor uses 1 MB, 16 way set associative cache with 64 block. What is the size of Page Table? a) 2KB b) 4KB c) 8KB d) 16KB

answered in Operating System Jan 15, 2017

1.2k views

1 vote

8

answered in Programming in C Jan 15, 2017

263 views

0 votes

9

answered in Theory of Computation Jan 15, 2017

270 views

0 votes

10

answered in Digital Logic Jan 11, 2017

266 views

4 votes

11

Virtual Gate Test Series: Programming & DS - Output Of The Program
What will be the output$?$ int main() { int varl = 35,*var2,*var3; var2 = &var1; //suppose the address of var1 is 1006 var3 = var2; *var2++ = *var3++; var1++; printf("var1 = %d var2 = %d var3 = %d ",var1,var2,var3); return 0; } 36 1010 1010 38 1006 1006 37 1006 1010 38 1010 1006

answered in Programming in C Jan 10, 2017

879 views

3 votes

12

Minimum states in DFA
Number of final states in minimal DFA where $\sum = \{ a,b \}$ $L = \{ w| n_a(w)mod\ 3 \geq n_b(w)mod\ 2\}$

answered in Theory of Computation Jan 10, 2017

1.6k views

0 votes

13

How Q1 and Q2 are Equal ?
Please Explain How Q1 and Q2 are equal using state Minimization Technique State Equivalance Algorithm Table Filling Algorithm a b Q1 Q2 Q1 Q2 Q1 Q2

answered in Theory of Computation Jan 9, 2017

971 views

4 votes

14

Thomas Write Rule
Consider the following schedule: The possible values of P & Q for which the above schedule is allowed under Thomas write rule but not under basic timestamp ordering protocol if timestamp(T2 )>timestamp(T1 ) W(B),W(C) W(A),W(A) Both (a)&(b) None of these

answered in Databases Jan 9, 2017

3.6k views

0 votes

15

answered in Computer Networks Jan 8, 2017

367 views

1 vote

16

answered in Digital Logic Jan 8, 2017

328 views

0 votes

17

doubt
Define init (L) = {set of all prefixes of L} Let L = {w | w has equal number of 0’s and 1’s}, Ʃ = {0,1} init (L) is: (a) all binary strings with unequal number of 0’s and 1’s (b) all binary strings with ԑ-string (c) all binary strings with exactly 1 more 0’s than the number of 1’s or one more than number of 0’s (d) None of above

answered in Theory of Computation Jan 8, 2017

381 views

1 vote

18

BCNF Decomposition

answered in Databases Jan 8, 2017

2.7k views

3 votes

19

doubt
If L is Turing-recognizable. Then (a) L and ̅L must be decidable. (b) L must be decidable but ̅ L need not be. (c) Either L is decidable or ̅ L is not Turing recognizable. (d) None of above.

answered in Theory of Computation Jan 8, 2017

2.6k views

0 votes

20

de tough ques
How many flip‐flop will be complemented in a 10‐bit binary ripple counter to reach the next count after the following counts? (a) *1001100111

answered in Digital Logic Jan 5, 2017

2.6k views

1 vote

21

critical section
getting A) given D)

answered in Operating System Jan 5, 2017

588 views

2 votes

22

complexity of function

answered in Algorithms Dec 31, 2016

601 views

3 votes

23

GateForum Test Series.
$L_{1}=\{a^nb^mc^md^n | m,n \geq 1\} \\ L_{2}=\{0^p1^q\ |p > q\geq 0\} \cup \{0^p1^q\ |q > p\geq 0\} \\ L_{3} = L_1 \cup L_2 \\ L_{4} = L_1L_2 $ Then which of the following is necessarily CFL? $ A. L_{3} \cap L_{4} \\ B. \overline{L_{3} \cap L_{4}} \\ C.\overline L_3 \cap L_4 \\ D. L_3.L_4$

answered in Theory of Computation Dec 17, 2016

795 views

1 vote

24

Acknowledgement Number
The answer is given as 1060 since they have multiplied '5' by the scaling factor 4. Why to do it in this case? Its given 5B!!

answered in Computer Networks Dec 17, 2016

470 views

6 votes

25

Number of IPs
For Subnet Mask 255.255.255.192 & IP 200.1.2.3, the number of IP addresses wasted are __________.

answered in Computer Networks Dec 17, 2016

558 views

1 vote

26

ACE Test Series

answered in Computer Networks Dec 10, 2016

416 views

0 votes

27

ip address
A network with a subnet mask_____,_____ subnets and in each subnet there are 32766 valid host address? A)255.255.128.0,2 B)255.255.128.0,512 C)255.255.0.0,1 D)A or B I am getting B but ans is A how plz explain?

answered in Computer Networks Dec 10, 2016

418 views

Page:

1
2
3
next »