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
0
answers
20131
#test series
Shubham Aggarwal
255
views
Shubham Aggarwal
asked
Aug 20, 2018
Digital Logic
test-book
+
–
0
votes
0
answers
20132
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
313
views
Vanshika_bhardwaj
asked
Aug 20, 2018
0
votes
0
answers
20133
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
125
views
prajabobde
asked
Aug 20, 2018
0
votes
1
answer
20134
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
496
views
Dhananjay15
asked
Aug 19, 2018
0
votes
2
answers
20135
Regular Expression Identities
${(a+aa+b)}^{+}={(a+b)}^{+}$
${(a+aa+b)}^{+}={(a+b)}^{+}$
Dhananjay15
632
views
Dhananjay15
asked
Aug 19, 2018
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
0
answers
20136
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
253
views
Papasthopolus
asked
Aug 19, 2018
0
votes
1
answer
20137
Sir i am first year ug student plese help me what to concentrate for gate from 1st year
Manikantashetty.4321
276
views
Manikantashetty.4321
asked
Aug 19, 2018
0
votes
0
answers
20138
Corman
chandra
147
views
chandra
asked
Aug 19, 2018
0
votes
0
answers
20139
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
429
views
Deepanshu
asked
Aug 19, 2018
0
votes
2
answers
20140
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
243
views
Devshree Dubey
asked
Aug 19, 2018
Operating System
operating-system
process
+
–
1
votes
1
answer
20141
Convert FA to RE
What is the RE for the above FA?
What is the RE for the above FA?
Dhananjay15
1.7k
views
Dhananjay15
asked
Aug 19, 2018
0
votes
1
answer
20142
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
20143
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
861
views
Devshree Dubey
asked
Aug 19, 2018
Operating System
operating-system
process
+
–
1
votes
2
answers
20144
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
20145
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
20146
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
822
views
pradeepchaudhary
asked
Aug 19, 2018
Programming in C
asymptotic-notation
data-structures
+
–
1
votes
1
answer
20147
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
20148
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
3
votes
4
answers
20149
MADE EASY TEST SERIES
Consider the following schedules involving two transactions. $S_1 : R_1(x), W_2(y),R_2(x),W_1(y), \ commit_1, \ commit_2$ $S_2 : R_1(x), R_2(y),W_1(z), \ commit_1,R_3(y), R_3(z), W_2(y), W_3(x), commit_2, commit_3$ Which of the following ... S2 are allowed under 2PL B) only S1 is allowed under 2PL C) only S2 is allowed under 2PL D) neither S1 nor S2 is allowed under 2PL
Consider the following schedules involving two transactions.$S_1 : R_1(x), W_2(y),R_2(x),W_1(y), \ commit_1, \ commit_2$$S_2 : R_1(x), R_2(y),W_1(z), \ commit_1,R_3(y), R...
syncronizing
3.6k
views
syncronizing
asked
Aug 19, 2018
Databases
transaction-and-concurrency
+
–
0
votes
0
answers
20150
forouzan
Which signal has a wider bandwidth, a sine wave with a frequency of 100 Hz or a sine wave with a frequency of 200 Hz?
Which signal has a wider bandwidth, a sine wave with a frequency of 100 Hzor a sine wave with a frequency of 200 Hz?
arch
537
views
arch
asked
Aug 19, 2018
1
votes
1
answer
20151
Adder delay
A full adder circuit takes 20 ns to generate the carry-out bit and 40 ns for the sum bit. When 4, 1 bit full adders are cascaded, the maximum rate of additions per second will be $\text{____} \times 10^6 $sec. Usual Solution given The ... calculate the total time taken to perform one round of four bit addition. Right? (Similar old question: https://gateoverflow.in/83500/digitals)
A full adder circuit takes 20 ns to generate the carry-out bit and 40 ns for the sum bit. When 4, 1 bit full adders are cascaded, the maximum rate of additions per second...
GateAspirant999
4.5k
views
GateAspirant999
asked
Aug 19, 2018
Digital Logic
digital-logic
adder
combinational-circuit
digital-circuits
+
–
0
votes
0
answers
20152
gate 2007
GATE 2007 QUESTION(DOUBT) https://gateoverflow.in/3465/gate2007-it-32 Guys in this question %c is there in printf.......and ans is 25.....but why the ASCII value of 25 is not printed????? As %c is used here. Kindly help where I am getting wrong??
GATE 2007 QUESTION(DOUBT)https://gateoverflow.in/3465/gate2007-it-32Guys in this question %c is there in printf.......and ans is 25.....but why the ASCII value of 25 is n...
himanshu19
381
views
himanshu19
asked
Aug 19, 2018
0
votes
1
answer
20153
draw dfa on w such that number of a in w mod 3 less than number of b in w mod 3
draw dfa on w number of a in w mod 3 less than number of b in w mod 3
draw dfa on w number of a in w mod 3 less than number of b in w mod 3
Rather.jamsheed
464
views
Rather.jamsheed
asked
Aug 19, 2018
0
votes
0
answers
20154
self doubt inherently ambiguity
https://gateoverflow.in/7428/grammar-generates-inherently-ambiguous-context-language how can we check that for ambiguous grammar no unambiguous grammar exist??
https://gateoverflow.in/7428/grammar-generates-inherently-ambiguous-context-languagehow can we check that for ambiguous grammar no unambiguous grammar exist??
eyeamgj
156
views
eyeamgj
asked
Aug 19, 2018
0
votes
1
answer
20155
STUDY
I am starting mathametics from today, So what should be my approach while doing maths questions ? Just previous year questions and then concepts clearance from there Or from some standard book or resources.IF from any standard resource then please share the link......... @Arjun sir @srestha mam. ALL SUGGESTIONS ARE WELCOME .
I am starting mathametics from today, So what should be my approach while doing maths questions ?Just previous year questions and then concepts clearance from there Or fr...
Deepanshu
618
views
Deepanshu
asked
Aug 19, 2018
Study Resources
study-resources
books
+
–
1
votes
2
answers
20156
Test Series
Consider a block of a size such that it can hold: • either 5 records of a relation R, or • be used as a B+ tree internal node with degree 11, or • B+ tree leaf node with degree 10. If R has 1000 records, then the smallest number of blocks that could be used to store R and a sparse B+ tree index on key of R is ________.
Consider a block of a size such that it can hold:• either 5 records of a relation R, or• be used as a B+ tree internal node with degree 11, or• B+ tree leaf node wi...
syncronizing
718
views
syncronizing
asked
Aug 19, 2018
Databases
bplustrees
+
–
0
votes
1
answer
20157
DOUBT TOC
LET L1={anbmcn |m,n>=0} L2={ancn}|n>=0} both are cfl ,what is L2-L1?? i am getting { }............please verify??
LET L1={anbmcn |m,n>=0}L2={ancn}|n>=0}both are cfl ,what is L2-L1??i am getting { }............please verify??
eyeamgj
203
views
eyeamgj
asked
Aug 19, 2018
0
votes
1
answer
20158
Madeeasy_OperatingSystem_subjectTest
Shaik Masthan please explain me ..thank you
Shaik Masthanplease explain me ..thank you
Magma
135
views
Magma
asked
Aug 19, 2018
0
votes
1
answer
20159
ACE_subjectTest_OperatingSystem
Shaik Masthan
Shaik Masthan
Magma
334
views
Magma
asked
Aug 19, 2018
0
votes
1
answer
20160
An Introduction to formal languages and automata
find grammar that generates L={a^nb^m:n>=0,m<n}
find grammar that generates L={a^nb^m:n>=0,m<n}
pratyusha619129161
514
views
pratyusha619129161
asked
Aug 19, 2018
Page:
« prev
1
...
667
668
669
670
671
672
673
674
675
676
677
...
1537
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register