The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by Nithish
User Nithish
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Nithish
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+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
Jan 11, 2017
in
Operating System

819
views
resourceallocation
operatingsystem
+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
Jan 11, 2017
in
Algorithms

670
views
algorithms
binarysearchtree
datastructure
bst
+4
votes
2
answers
3
Regular Expression
L = {w(#0(w) – #1(w)mod3) = 1} is L regular?
asked
Dec 31, 2016
in
Theory of Computation

572
views
theoryofcomputation
regularexpressions
+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
Dec 31, 2016
in
Operating System

279
views
deadlock
operatingsystem
deadlockpreventionavoidancedetection
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
Dec 14, 2016
in
Theory of Computation

212
views
theoryofcomputation
lemma
pumping
pumpinglemma
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
Dec 14, 2016
in
Theory of Computation

216
views
pushdownautomata
theoryofcomputation
0
votes
2
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
Dec 9, 2016
in
Digital Logic

271
views
digitallogic
0
votes
2
answers
8
Digital Logic , IES 2005
What is the minimized logic expression corresponding to the fiven Kmap?
asked
Nov 22, 2016
in
Digital Logic

277
views
kmap
digitallogic
0
votes
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
Nov 18, 2016
in
Computer Networks

226
views
computernetworks
subnetting
50,645
questions
56,542
answers
195,693
comments
101,534
users