Register
Filter

Recent questions without a selected answer

2.3k
views
2 answers
1 votes
Self doubt
Identify the incorrect statement :1. If there are no cycles in resource allocation graph then there is no deadlock.2. If there is only one instance per resource type and ... has a cycle , there may or may not be a deadlock.4. All of these
User Avatar
532
views
0 answers
0 votes
Twin Pointer
Anyone, please explain briefly!Applying BFS on the undirected graph gives you twin pointer.
User Avatar
420
views
0 answers
0 votes
Self Doubt : Referential Integrity
sOURCE : https://gateoverflow.in/743/gate2001-2-25How Option C is corrrect ?if w < x, how its going to get deleted ?if w = x, then it will get deleted
User Avatar
433
views
1 answers
0 votes
Time complexity
T(n)=T(n-1)+O(n)Can we apply master's theorem here ??
User Avatar
1.7k
views
2 answers
2 votes
SELF DOUBT TOC MOORE TO MEALY CONVERSION
GIVEN A MOOORE MACHINE WITH N STATES THE CORRESPONDING EQUIVALENT MEALY MACHINE HAS MAXIMUM OF N STATES ............I THINK IT SHOULD BE FALSE BECZ SAYING ... WHILE CONVERTING MOORE TO MEALY.?? BUT IS GIVEN AS TRUE ...PLEASE CHECK??
User Avatar
512
views
0 answers
0 votes
MadeEasy Workbook: Databases - Er Diagram
User Avatar
239
views
1 answers
0 votes
Doubt in P->Q->R
Which one is equivalent to p->q->r ?A) (p->q)->rB) p->(q->r)Plz give answer with proper explaination.
User Avatar
377
views
1 answers
0 votes
Operating System
What is the difference between a job,a process and a thread?
User Avatar
671
views
3 answers
0 votes
random...
User Avatar
799
views
1 answers
1 votes
Madeeasy_SubjectTest_OperatingSystem
User Avatar
968
views
1 answers
1 votes
How does below property hold for cross edge in a DFS Tree ?
If (u,v) is a cross edge thenstart[u] > start[v]end[u] > end[v]
User Avatar
327
views
1 answers
0 votes
#Matrix
What do you suggest to do about big matrix multiplications questions in dynamic programming,because they take long time to get solved.Should we solve those questions in gate or we should leave them?I need advice on this.Please help me ou
User Avatar
445
views
1 answers
0 votes
Time complexity
T(n)=2T(n/2)+n ; n>1 =1 ; . n=1What is the time complexity and how??
User Avatar
448
views
1 answers
0 votes
Assignments
Which of the following will print the value 2 for the above code?#include<stdio.h>int main(){int a[10][20][30] = {0};a[5][2][1] = 2;return 0;}(a) printf("%d",*(((a+5)+2)+1 ... ((a+5)+2)+1);(c) printf("%d",*(*(*(a+5)+2)+1));(d) None of these
User Avatar
240
views
0 answers
0 votes
UGC-NET 2017
User Avatar
2.9k
views
4 answers
2 votes
Binary Search
for binary search in an array of n elements the average number of searches is $\left \lfloor \log_{2}n \right \rfloor$ or $\left \lceil \log_{2}n \right \rceil$ ?
User Avatar
405
views
1 answers
0 votes
Group theory
How to solve it?Better solution
User Avatar
943
views
0 answers
0 votes
Master's Theorem Recurrence Relation
T (n) = T (n/2) + 2nUsing Master's Method What is the Complexity Of This Recurrence Relation?Or Using AnyOther Method?
User Avatar
679
views
1 answers
0 votes
countability
set of all binary sequences are uncountable it is true,then why set of all string over {0,1} is countable is'nt it also set of all binary sequence ??
User Avatar
718
views
1 answers
0 votes
Group theory
In theorem 1: It is said that group is abelian if and only if order of group is prime numberIn theorem 2 : It is said that the group having order as square of ... Theorem 2: 4 = (2)^2 square of prime number hence abelian.Please clarify ..
User Avatar
302
views
0 answers
0 votes
gate 2006 question doubt
https://gateoverflow.in/1843/gate2006-65in the above question process is directly being given to I/O device. is this possible?i have this doubt because i ... have taken I/O burst directly when the process starts.please clear this doubt.
User Avatar
682
views
2 answers
0 votes
Madeeasy_testSeries_OperatingSystem
I know that C is the option but i think that b) S0 = 0 , S1 = 1 , S2 = 0 is also true ....means (b and c ) also hold true conditionsbut in the MCQ ... that's why Only C is the correct answer...please tell me that I right or wrong ??
User Avatar
298
views
1 answers
0 votes
Madeeasy_subjectTest_OperatingSystem
I think...answer should be p1,p2 ..if you think that given answer is correct then please explain me , thank you ;)
User Avatar
1.9k
views
0 answers
0 votes
ambiguity test
S -> SS|AB A -> Aa|a B -> Bb|b Is this grammar is ambigious or Not?
User Avatar
553
views
1 answers
0 votes
Seriazability
User Avatar
720
views
0 answers
0 votes
Heap Data Structure
How traversal in a heap takes place? Consider a min heap , I think we cannot traverse it like a binary tree ......For Example if we have to print all elements ... overall takes O(N) time ? Whether same is for search as well Plz explain...
User Avatar
266
views
1 answers
0 votes
#test series
User Avatar
155
views
0 answers
2 votes
Subject_mock_test_Operating_System
Ans ) 1/6
User Avatar
272
views
0 answers
0 votes
#test series
User Avatar
328
views
0 answers
0 votes
IP addressing (ipv4)
What would be the broadcast address if a host in subnet 'a' wants to broadcast a packet in network 'X'? X is a network which is divided in various subnets namely 'a', 'b', ... 'z'.
User Avatar
Page: