Dark Mode

Questions by Nithish

3 votes

2 answers

1

Deadlocks
Consider a system with processes P0, P1,P2, . . . . P99, P100, each process requires maximum of 4 resources. System has allocated 2 resources to each process. The minimum number of resources should release such that above system is deadlock free is _____

asked in Operating System Jan 11, 2017

2.9k views

3 votes

2 answers

2

Binary Search tree
Consider an array with ‘n’ numbers, let “T” be time complexity for finding a number appeared maximum number of times in an array. Using Binary Search Tree data structure the T will be A. O(log n) B. O(n) C. O(n logn) D. O(n2)

asked in Programming Jan 11, 2017

1.9k views

4 votes

2 answers

3

Regular Expression
L = {w|(|#0(w) – #1(w)|mod3) = 1} is L regular?

asked in Theory of Computation Dec 31, 2016

1.1k views

2 votes

1 answer

4

Deadlock
Consider a system with 200 resources, if each process requires 3 resources. Maximum number of processes present in the system, such that system is in safe state is ?

asked in Operating System Dec 31, 2016

809 views

0 votes

1 answer

5

Pumping Lemma for CFG
Consider the language, L = {1k 0i 1i 0j 1j 0k | i,j,k>0}. Is this language context free? I tried to find this using pumping lemma, By intution, If we consider , by the definition of pumping lemma for CFG, u and y to be 1k and 0k ... in 0j and if the pump up the variables, surely string generated after pumping up wont be in the given language right? Am I missing something?

asked in Theory of Computation Dec 14, 2016

604 views

0 votes

1 answer

6

Non deterministic PDA
Can the NPDA constructed to accept L, such that L = L1 U L2 , L1 = {1n 0n | n > 0} and L2 = {0n 12n | n > 0} be drawn like this? This is an informal representation of NPDA. Is this correct? Or should the NPDA accepting language L should have 2 final states?

asked in Theory of Computation Dec 14, 2016

1.4k views

0 votes

3 answers

7

GATE 2007 EE
A, B, C and D are input bits, and Y is the output bit in the XOR gate circuit of the figure below. Which of the following statements about the sum S of A, B, C, D and Y is correct? (A) S is always either zero or odd (B) S is always either zero or even (C) S = 1 only if the sum of A, B, C and D is even (D) S = 1 only if the sum of A, B, C and D is odd

asked in Digital Logic Dec 9, 2016

1.9k views

0 votes

2 answers

8

Digital Logic , IES 2005
What is the minimized logic expression corresponding to the fiven K-map?

asked in Digital Logic Nov 22, 2016

1.4k views

1 vote

2 answers

9

Broadcast Address.
Consider a subnet mask 255.255.255.42 for a network 192.198.191. A data packet has arrived with destination IP as 192.198.191.121. The Broadcasting address of the subnet to which the packet belongs to is _____

asked in Computer Networks Nov 18, 2016

559 views