Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Highest voted questions in Unknown Category
1
votes
1
answer
221
ACE test series
chaser
659
views
chaser
asked
Nov 26, 2016
Unknown Category
digital-logic
number-representation
+
–
1
votes
1
answer
222
IITM november 2016
What is the maximum possible value of (x%3)+((x+1)%3) here x be any positive integer
What is the maximum possible value of (x%3)+((x+1)%3) here x be any positive integer
Aboveallplayer
488
views
Aboveallplayer
asked
Nov 23, 2016
Unknown Category
engineering-mathematics
+
–
1
votes
0
answers
223
#dout
check for which is regular?? (B). where i+j+k>100 & k>50 (C). where i+j+k>100 & j+k>50
check for which is regular??(B). where i+j+k>100 & k>50(C). where i+j+k>100 & j+k>50
Hradesh patel
267
views
Hradesh patel
asked
Nov 23, 2016
1
votes
1
answer
224
Find regular exp. for the grammar?
I think it should be (a*+b*)ab*
I think it should be (a*+b*)ab*
thor
323
views
thor
asked
Nov 16, 2016
1
votes
1
answer
225
Array Heap
Rohan Mundhey
400
views
Rohan Mundhey
asked
Nov 10, 2016
1
votes
2
answers
226
c programming
#include <stdio.h> char *fun() { static char arr[1024]; return arr; } int main() { char *str = "geeksforgeeks"; strcpy(fun(), str); str = fun(); strcpy(str, "geeksquiz"); printf("%s", fun()); return 0; } What would be the output?
#include <stdio.h>char *fun(){ static char arr[1024]; return arr;} int main(){ char *str = "geeksforgeeks"; strcpy(fun(), str); str = fun(); strcpy(str,...
vaishali jhalani
1.3k
views
vaishali jhalani
asked
Nov 9, 2016
Unknown Category
programming-in-c
output
+
–
1
votes
1
answer
227
P and NP problem
Imarati Gupta
569
views
Imarati Gupta
asked
Oct 26, 2016
1
votes
1
answer
228
Os+ deadlock
Rahul Jain25
651
views
Rahul Jain25
asked
Oct 24, 2016
Unknown Category
deadlock-prevention-avoidance-detection
memory-management
+
–
1
votes
0
answers
229
computer organization
A pipeline system can overlap all instructions except branch instructions introduce 4 stall cycles. If their exists 60% branch instruction what will be the throughput of pipeline system assuming that there is no overhead and clock duration is 10ns?
A pipeline system can overlap all instructions except branch instructions introduce 4 stall cycles. If their exists 60% branch instruction what will be the throughput of...
anup9544
216
views
anup9544
asked
Oct 19, 2016
1
votes
1
answer
230
gate question alogorithm
Maximum and Minimum no. of comparison required to find the max and min element from the given 100 elements are???
Maximum and Minimum no. of comparison required to find the max and min element from the given 100 elements are???
cse23
409
views
cse23
asked
Oct 14, 2016
1
votes
1
answer
231
Compiler Design
Is Syntax directed definition and translation is part of Syntax analysis or Semantic analysis?
Is Syntax directed definition and translation is part of Syntax analysis or Semantic analysis?
.
556
views
.
asked
Oct 11, 2016
Unknown Category
compiler-design
+
–
1
votes
3
answers
232
CFl
How to find that the given language is cfl??? For example a^nb^nc^n
How to find that the given language is cfl???For example a^nb^nc^n
Madhu kumar Tandon
378
views
Madhu kumar Tandon
asked
Oct 9, 2016
1
votes
1
answer
233
self_doubt
How to know no. of back edges in directed as well in undirected graph using DFS..can some1 tell some good source.??
How to know no. of back edges in directed as well in undirected graph using DFS..can some1 tell some good source.??
cse23
483
views
cse23
asked
Oct 7, 2016
1
votes
1
answer
234
What is exactly access time in cache memory access?
Rock
483
views
Rock
asked
Oct 3, 2016
1
votes
1
answer
235
RACE AROUND CONDITION
If 'To' is the clock ON time and 'Tp' is delay time for a JK Flip Flop fed with HIGH for both the inputs.Then the race around condition occurs if- a )To = Tp b)To > To C)To = 2Tp d) To > 2Tp
If 'To' is the clock ON time and 'Tp' is delay time for a JK Flip Flop fed with HIGH for both the inputs.Then the race around condition occurs if-a )To = Tpb)To ToC)To =...
Moses_94
1.1k
views
Moses_94
asked
Oct 2, 2016
1
votes
0
answers
236
ROM
What are the main points needed to keep in my mind while determine the size of ROM according to given situation.?
What are the main points needed to keep in my mind while determine the size of ROM according to given situation.?
gate-17
177
views
gate-17
asked
Oct 1, 2016
1
votes
0
answers
237
OS
What is the difference in cobegin/coend and fork/join statement?
What is the difference in cobegin/coend and fork/join statement?
Shivangi Verma
215
views
Shivangi Verma
asked
Sep 30, 2016
1
votes
2
answers
238
OS
Suppose you have a 47 bit virtual address space with a page size of 16KB and that page tbale entry takes 8 bytes .How many levels of page tables would be required to map the virtual adress space if every page table is required to fit into a single page table? Can anyone explain this question so that i get a clear image in my mind of how to solve this type of question
Suppose you have a 47 bit virtual address space with a page size of 16KB and that page tbale entry takes 8 bytes .How many levels of page tables would be required to map ...
Shivangi Verma
1.6k
views
Shivangi Verma
asked
Sep 25, 2016
1
votes
2
answers
239
programming
how to calcuate the address
how to calcuate the address
Amit puri
383
views
Amit puri
asked
Sep 20, 2016
1
votes
1
answer
240
Theory of computation
Set of all strings over {0,1} containing at most one pair of consecutive 1's. Give regular expression and equivalent minimized DFA.
Set of all strings over {0,1} containing at most one pair of consecutive 1's.Give regular expression and equivalent minimized DFA.
Geet
625
views
Geet
asked
Sep 17, 2016
Unknown Category
finite-automata
theory-of-computation
regular-expression
+
–
Page:
« prev
1
...
7
8
9
10
11
12
13
14
15
16
17
...
44
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register