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 answers
0
votes
0
answers
15331
viable prefix
Sanket_
477
views
Sanket_
asked
Jan 8, 2017
0
votes
0
answers
15332
what is meant by MultiDequeue ? Its complexity ? ::Upcoming gate ques
Wanted
150
views
Wanted
asked
Jan 8, 2017
0
votes
0
answers
15333
Compiler full test
How will I find SLR(1) for such a big CFG? I could find error in LL(1) and conflict in LR(0)? But finding SLR(1) is time-consuming if using item generation approach?
How will I find SLR(1) for such a big CFG?I could find error in LL(1) and conflict in LR(0)?But finding SLR(1) is time-consuming if using item generation approach?
Adiaspirant
379
views
Adiaspirant
asked
Jan 8, 2017
Compiler Design
test-series
compiler-design
+
–
1
votes
0
answers
15334
MadeEasy Subject Test: Programming & DS - Binary Tree
Lucky sunda
224
views
Lucky sunda
asked
Jan 8, 2017
DS
made-easy-test-series
data-structures
binary-tree
+
–
0
votes
0
answers
15335
MadeEasy Subject Test: Programming & DS - Programming in C
Here i+2 means skipping 2 elements na??
Here i+2 means skipping 2 elements na??
Lucky sunda
362
views
Lucky sunda
asked
Jan 8, 2017
Programming in C
made-easy-test-series
programming-in-c
programming
+
–
0
votes
0
answers
15336
Test Series
What is the correct answer?? is option a is correct?
What is the correct answer?? is option a is correct?
harkirat31
249
views
harkirat31
asked
Jan 8, 2017
1
votes
0
answers
15337
Algo problem
An element in an array X is called leader if it is middle element in the sorted array. The best algorithm to find leader in an array. Takes linear time using median of median of array Takes (n logn) time using merge sort. Takes Ο(n2) time using n time linear search Takes Ο(logn) time using binary search tree.
An element in an array X is called leader if it is middle element in the sorted array. The best algorithm to find leader in an array.Takes linear time using median of med...
Anirban Biswas
451
views
Anirban Biswas
asked
Jan 8, 2017
2
votes
0
answers
15338
Compilers_BottomUpParsing
Consider the grammar: S → aSa | bSb | aa | bb A shift-reduce parser works by identifying the handle of each right-sentential form and replacing it by the head of the corresponding production. In this question, we indicate the handle of a right-sentential ... above grammar with the handle properly marked? a) abab[aababa] b) ababaS[ababa] c) ababbS[bbaba] d) abab[bSb]baba
Consider the grammar:S → aSa | bSb | aa | bbA shift-reduce parser works by identifying the handle of each right-sentential form and replacing it by the head of the corr...
Sachin Mittal 1
841
views
Sachin Mittal 1
asked
Jan 7, 2017
Compiler Design
compiler-design
grammar
parsing
+
–
0
votes
0
answers
15339
doubt
Arnabi
199
views
Arnabi
asked
Jan 7, 2017
0
votes
0
answers
15340
doubt
Which of the following R.E. over Ʃ = {0, 1} denotes set of all strings not containing as sub-string. (a) 0* (0 + 1)* (b) 0* 1 0 1 0* (c) 0* 1* 0 1 (d) 0* (1 0 + 1)*
Which of the following R.E. over Ʃ = {0, 1} denotes set of all strings not containing as sub-string.(a) 0* (0 + 1)* (b) 0* 1 0 1 0*(c) 0* 1* 0 1 (d) 0* (1 0 + 1)*
Prateek kumar
788
views
Prateek kumar
asked
Jan 7, 2017
Theory of Computation
theory-of-computation
+
–
1
votes
0
answers
15341
improve the sentence
Sanjay Sharma
516
views
Sanjay Sharma
asked
Jan 7, 2017
0
votes
0
answers
15342
improve the sentence
Sanjay Sharma
370
views
Sanjay Sharma
asked
Jan 7, 2017
3
votes
0
answers
15343
can dfs be used for verifying graph is bipartite or not??
i have read from made easy coaching that DFS cant be used to verify given graph is bipartite or not...but there are some refernces i have found on some site where DFS can be used...
i have read from made easy coaching that DFS cant be used to verify given graph is bipartite or not...but there are some refernces i have found on some site where DFS ca...
firki lama
244
views
firki lama
asked
Jan 7, 2017
0
votes
0
answers
15344
Disk Problem
Consider a disk drive with the following specifications: 16 surfaces, 512 tracks/surface, 512 sectors/track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in cycle stealing mode whereby whenever one 4 byte word is ready it is sent to memory; ... each DMA cycle. Memory cycle time is 40 nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is:
Consider a disk drive with the following specifications:16 surfaces, 512 tracks/surface, 512 sectors/track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in ...
Wanted
630
views
Wanted
asked
Jan 7, 2017
0
votes
0
answers
15345
doubt
Prateek kumar
456
views
Prateek kumar
asked
Jan 7, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
15346
Ripple carry
32-bit [ripple carry] adder, there are 32 full adders, so the critical path (worst case) delay is 31 * 2(for carry propagation) + 3(for sum) = 65 gate delays. how ? note :I know in full adder there are two XOR two AND and 1 OR gate well know about diagram
32-bit [ripple carry] adder, there are 32 full adders, so the critical path (worst case) delay is 31 * 2(for carry propagation) + 3(for sum) = 65 gate delays. how ? note ...
Wanted
539
views
Wanted
asked
Jan 7, 2017
0
votes
0
answers
15347
DBMS-12
thor
274
views
thor
asked
Jan 7, 2017
0
votes
0
answers
15348
DBMS-11
thor
203
views
thor
asked
Jan 7, 2017
0
votes
0
answers
15349
DBMS-9
thor
154
views
thor
asked
Jan 7, 2017
0
votes
0
answers
15350
Digital logic : previous year question
https://gateoverflow.in/29098/gate2003-47 why z goes down ,, it is k to up but why it goes down?
https://gateoverflow.in/29098/gate2003-47why z goes down ,, it is k to up but why it goes down?
Wanted
265
views
Wanted
asked
Jan 7, 2017
3
votes
0
answers
15351
TCP-URG
given a statement: "In TCP sender can never send data which is greater than capacity of receiver window" given answer: true but i think this is false. Eg:Assume receiver says that it has the capacity to hold only 3 packets(adv window=3packets) ... case sent data>adv window but i do agree that when such senario doesnt happen, then the statement becomes true please validate this!
given a statement: "In TCP sender can never send data which is greater than capacity of receiver window"given answer: truebut i think this is false.Eg:Assume receiver say...
Anusha Motamarri
478
views
Anusha Motamarri
asked
Jan 7, 2017
Computer Networks
computer-networks
tcp
+
–
1
votes
0
answers
15352
B tree problem
How many new nodes will be formed if we insert a key “i” into below B tree of order “3”? 1 2 3 4
How many new nodes will be formed if we insert a key “i” into below B tree of order “3”? 1 2 3 4
Anirban Biswas
727
views
Anirban Biswas
asked
Jan 7, 2017
0
votes
0
answers
15353
DBMS-3
thor
288
views
thor
asked
Jan 7, 2017
0
votes
0
answers
15354
MadeEasy Subject Test: Theory of Computation - Identify Class Language
L3 is regular or not?
L3 is regular or not?
Lucky sunda
304
views
Lucky sunda
asked
Jan 7, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
identify-class-language
+
–
0
votes
0
answers
15355
Not getting Question : CO previous year question
Consider the following program segment. Here R1, R2 and R3 are the general purpose registers. Instruction Operation Instruction size (no. of words) MOV R1, (3000) R1 ← m[3000] 2 LOOP: MOV R2, (R3) R2 ← M[R3] ... . Assume that the memory is word addressable. The number of memory references for accessing the data in executing the program completely is
Consider the following program segment. Here R1, R2 and R3 are the general purpose registers. InstructionOperationInstruction size (no. of words) MOV R1, (3000)R1 ←m[30...
Wanted
279
views
Wanted
asked
Jan 7, 2017
0
votes
0
answers
15356
Data LINK layer
Can someone clear doubt regarding 2D parity as written in NPTEL slides that 2D parity can detect a burst error of n bits and >n+1 bits is detected but probabilty is less compared to n bits? According to me, 1bit errors can be corrected and detected 2 bit errors can't be corrected and detected.
Can someone clear doubt regarding 2D parity as written in NPTEL slides that 2D parity can detect a burst error of n bits and >n+1 bits is detected but probabilty is less ...
Adiaspirant
239
views
Adiaspirant
asked
Jan 7, 2017
0
votes
0
answers
15357
Suggest me
Suggest me some good book for problem solving in COA like Memory management and virtual memory, pipelining, etc....other than hamacher
Suggest me some good book for problem solving in COA like Memory management and virtual memory, pipelining, etc....other than hamacher
Anmol Verma
188
views
Anmol Verma
asked
Jan 7, 2017
CO and Architecture
co-and-architecture
+
–
1
votes
0
answers
15358
zeal coaching sheet
Shivam Shukla 1
198
views
Shivam Shukla 1
asked
Jan 7, 2017
0
votes
0
answers
15359
digital
thor
137
views
thor
asked
Jan 7, 2017
Digital Logic
digital-logic
+
–
0
votes
0
answers
15360
Relational DBMS
thor
108
views
thor
asked
Jan 7, 2017
Page:
« prev
1
...
507
508
509
510
511
512
513
514
515
516
517
...
590
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register