Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Nithish
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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
resource-allocation
operating-system
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
binary-search-tree
data-structures
time-complexity
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
theory-of-computation
regular-expression
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
deadlock-prevention-avoidance-detection
operating-system
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
theory-of-computation
pumping-lemma
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
pushdown-automata
theory-of-computation
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
digital-logic
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
k-map
digital-logic
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
computer-networks
subnetting
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IIITA M.TECH IT COMPLETE EXPLANATION FROM ADMISSION TO PLACEMENT
GO Classes NIELIT Test Series For 2023
Interview Experience : MTech Research(Machine Learning) at IIT Mandi
DRDO Scientist -B
ISRO Scientist-B 2023
Subjects
All categories
General Aptitude
(2.8k)
Engineering Mathematics
(9.8k)
Digital Logic
(3.4k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.4k)
Others
(2.5k)
Admissions
(667)
Exam Queries
(1.0k)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(867)
Recent Blog Comments
This story is same like my tier 3 college btech...
@Nikhil_dhamaHi , now i am in 2nd semester...
You can attempt now:...
where is the free test link ? how i can attempt...
Left with 10days, nothing heard back from them,...