Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without a selected answer
0
votes
1
answer
19981
Group theory
How to solve it? Better solution
How to solve it?Better solution
jatin khachane 1
379
views
jatin khachane 1
asked
Aug 20, 2018
0
votes
0
answers
19982
Master's Theorem Recurrence Relation
T (n) = T (n/2) + 2n Using Master's Method What is the Complexity Of This Recurrence Relation? Or Using AnyOther Method?
T (n) = T (n/2) + 2nUsing Master's Method What is the Complexity Of This Recurrence Relation?Or Using AnyOther Method?
pradeepchaudhary
910
views
pradeepchaudhary
asked
Aug 20, 2018
Algorithms
algorithms
recurrence-relation
time-complexity
master-theorem
+
–
0
votes
1
answer
19983
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 ??
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 ??
Lone Wolf
656
views
Lone Wolf
asked
Aug 20, 2018
0
votes
1
answer
19984
Group theory
In theorem 1: It is said that group is abelian if and only if order of group is prime number In theorem 2 : It is said that the group having order as square of prime number is abelian Theorem 1: https://yutsumura.com/a-simple-abelian-group-if-and-only-if-the- ... The group is not abelian as order is not prime. Theorem 2: 4 = (2)^2 square of prime number hence abelian. Please clarify ..
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 prime numbe...
jatin khachane 1
680
views
jatin khachane 1
asked
Aug 20, 2018
0
votes
0
answers
19985
gate 2006 question doubt
https://gateoverflow.in/1843/gate2006-65 in the above question process is directly being given to I/O device. is this possible? i have this doubt because i have read that Process begins with a CPU burst and end with a CPU burst. During the life time ... I/O burst. But here in this question we have taken I/O burst directly when the process starts. please clear this 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 read that ...
Ananya Jaiswal 1
288
views
Ananya Jaiswal 1
asked
Aug 20, 2018
Operating System
operating-system
process-scheduling
+
–
0
votes
2
answers
19986
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 conditions but in the MCQ b and c is not in the options that's why Only C is the correct answer... please tell me that I right or wrong ??
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 b and c is not in the o...
Magma
639
views
Magma
asked
Aug 20, 2018
0
votes
1
answer
19987
Madeeasy_subjectTest_OperatingSystem
I think...answer should be p1,p2 ..if you think that given answer is correct then please explain me , thank you ;)
I think...answer should be p1,p2 ..if you think that given answer is correct then please explain me , thank you ;)
Magma
254
views
Magma
asked
Aug 20, 2018
0
votes
0
answers
19988
ambiguity test
S -> SS|AB A -> Aa|a B -> Bb|b Is this grammar is ambigious or Not?
S - SS|AB A - Aa|a B - Bb|b Is this grammar is ambigious or Not?
Rajeev Kumar 1
1.8k
views
Rajeev Kumar 1
asked
Aug 20, 2018
Compiler Design
compiler-design
+
–
0
votes
1
answer
19989
Seriazability
Deepalitrapti
522
views
Deepalitrapti
asked
Aug 20, 2018
0
votes
0
answers
19990
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 of heap Do we need to perform delete operation on root O(1) time then perform Heapify O(lgn) and again perform delete and so on which overall takes O(N) time ? Whether same is for search as well Plz explain...
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 of heap ...
Shiv Gaur
690
views
Shiv Gaur
asked
Aug 20, 2018
DS
binary-heap
algorithms
time-complexity
+
–
0
votes
1
answer
19991
#test series
Shubham Aggarwal
251
views
Shubham Aggarwal
asked
Aug 20, 2018
2
votes
0
answers
19992
Subject_mock_test_Operating_System
Ans ) 1/6
Ans ) 1/6
Magma
144
views
Magma
asked
Aug 20, 2018
0
votes
0
answers
19993
#test series
Shubham Aggarwal
255
views
Shubham Aggarwal
asked
Aug 20, 2018
Digital Logic
test-book
+
–
0
votes
0
answers
19994
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'.
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'...
Vanshika_bhardwaj
311
views
Vanshika_bhardwaj
asked
Aug 20, 2018
0
votes
0
answers
19995
Subroutine for adding array
Subroutine for adding column x to column y element by element , leaving the sum element in column y
Subroutine for adding column x to column y element by element , leaving the sum element in column y
prajabobde
124
views
prajabobde
asked
Aug 20, 2018
0
votes
1
answer
19996
Identity of TOC
$(a+b)^* =a^*(ba^*)^*$ As this identity already proved. But $a^*(ba^*)^*$ couldn't generate "bab" . But $(a+b)^*$ could generate all strings over {a,b}. Then the above identity seen to be proved false. Please discuss how this is possible.
$(a+b)^* =a^*(ba^*)^*$As this identity already proved. But $a^*(ba^*)^*$ couldn't generate "bab" . But $(a+b)^*$ could generate all strings over {a,b}. Then the above ide...
Dhananjay15
493
views
Dhananjay15
asked
Aug 19, 2018
0
votes
2
answers
19997
Regular Expression Identities
${(a+aa+b)}^{+}={(a+b)}^{+}$
${(a+aa+b)}^{+}={(a+b)}^{+}$
Dhananjay15
621
views
Dhananjay15
asked
Aug 19, 2018
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
0
answers
19998
Wise to give GATE CSE ?
Hi. I have been preparingfor UPSC for the past four years.Had prepared for other government jobs as well, didnt get through anywhere. I am 27 years old. I wish to do M. Tech in CSE. Will my four year gap be an issue in placements ? My B ... issue. Learning coding skills is also not an issue. I am worried that come placement season, I might be rejected because of my history.
Hi.I have been preparingfor UPSC for the past four years.Had prepared for other government jobs as well, didnt get through anywhere. I am 27 years old. I wish to do M. Te...
Papasthopolus
252
views
Papasthopolus
asked
Aug 19, 2018
0
votes
1
answer
19999
Sir i am first year ug student plese help me what to concentrate for gate from 1st year
Manikantashetty.4321
272
views
Manikantashetty.4321
asked
Aug 19, 2018
0
votes
0
answers
20000
Corman
chandra
144
views
chandra
asked
Aug 19, 2018
0
votes
0
answers
20001
syllabis
IS VECTOR SPACE OF LINEAR ALGEBRA IN SYLLABUS ? AS IT IS NOT WRITTEN IN OFFICAL WEBSITE BUT THERE ARE SOME QUESTION ASKED IN GATE 2017. MAY BE IT IS INCLUDED IN SOME TOPIC SO THEY DONT WRITE IT SEPERATELY. SO IS IT?????
IS VECTOR SPACE OF LINEAR ALGEBRA IN SYLLABUS ?AS IT IS NOT WRITTEN IN OFFICAL WEBSITE BUT THERE ARE SOME QUESTION ASKED IN GATE 2017. MAY BE IT IS INCLUDED IN SOME TOPIC...
Deepanshu
427
views
Deepanshu
asked
Aug 19, 2018
0
votes
2
answers
20002
Process Doubt
How to decide which job is I/O bound or CPU bound?
How to decide which job is I/O bound or CPU bound?
Devshree Dubey
242
views
Devshree Dubey
asked
Aug 19, 2018
Operating System
operating-system
process
+
–
1
votes
1
answer
20003
Convert FA to RE
What is the RE for the above FA?
What is the RE for the above FA?
Dhananjay15
1.6k
views
Dhananjay15
asked
Aug 19, 2018
0
votes
1
answer
20004
Binary Tree Height
What is the time complexity for finding the height of the binary tree? a) h = O(loglogn) b) h = O(nlogn) c) h = O(n) d) h = O(log n)
What is the time complexity for finding the height of the binary tree?a) h = O(loglogn)b) h = O(nlogn)c) h = O(n)d) h = O(log n)
pradeepchaudhary
14.4k
views
pradeepchaudhary
asked
Aug 19, 2018
Programming in C
binary-tree
+
–
0
votes
2
answers
20005
Operating System
Which data structure is used to implement the Process Control Block?
Which data structure is used to implement the Process Control Block?
Devshree Dubey
859
views
Devshree Dubey
asked
Aug 19, 2018
Operating System
operating-system
process
+
–
1
votes
2
answers
20006
Binary Tree Array Implementation
What must be the ideal size of array if the height of tree is ‘l’? a) 2l-1 b) l-1 c) l d) 2l
What must be the ideal size of array if the height of tree is ‘l’?a) 2l-1b) l-1c) ld) 2l
pradeepchaudhary
2.7k
views
pradeepchaudhary
asked
Aug 19, 2018
Programming in C
binary-search-tree
binary-tree
data-structures
+
–
1
votes
1
answer
20007
Linked List
What kind of linked list is best to answer question like “What is the item at position n?” a) Singly linked list b) Doubly linked list c) Circular linked list d) Array implementation of linked list
What kind of linked list is best to answer question like “What is the item at position n?”a) Singly linked listb) Doubly linked listc) Circular linked listd) Array im...
pradeepchaudhary
1.8k
views
pradeepchaudhary
asked
Aug 19, 2018
Programming in C
linked-list
data-structures
algorithms
+
–
0
votes
1
answer
20008
Time Complexity
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? a) O(1) b) O(n) c) θ(n) d) θ(1)
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?a) O(1)b) O(n)c)...
pradeepchaudhary
817
views
pradeepchaudhary
asked
Aug 19, 2018
Programming in C
asymptotic-notation
data-structures
+
–
1
votes
1
answer
20009
Binary Search Tree
8. What are the worst case and average case complexities of a binary search tree? a) O(n), O(n) b) O(logn), O(logn) c) O(logn), O(n) d) O(n), O(logn)
8. What are the worst case and average case complexities of a binary search tree?a) O(n), O(n)b) O(logn), O(logn)c) O(logn), O(n)d) O(n), O(logn)
pradeepchaudhary
19.2k
views
pradeepchaudhary
asked
Aug 19, 2018
Programming in C
data-structures
binary-search-tree
binary-tree
algorithms
+
–
0
votes
0
answers
20010
Control sequence to add the contents of memory location whose address is at memory location num to register r1
prajabobde
276
views
prajabobde
asked
Aug 19, 2018
Page:
« prev
1
...
662
663
664
665
666
667
668
669
670
671
672
...
1536
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register