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
140
views
0
answers
0
votes
What should be in Superclass and subclass ,,,
Regarding below questionhttps://gateoverflow.in/1031/gate2004-34
hem chandra joshi
140
views
hem chandra joshi
asked
Dec 25, 2017
Databases
databases
+
–
758
views
0
answers
4
votes
Conditional probability
A student $Y$ lives in a place $X$. In $X$ a day can be cloudy with probability $\bf0.02$ uniformly each day. $Y$ ... on a particular day ?
dd
758
views
dd
asked
Dec 25, 2017
Probability
conditional-probability
+
–
229
views
0
answers
0
votes
#toc epilson-nfa
my answer is coming 3but answer was given 2
Abhijeet_Kumar
229
views
Abhijeet_Kumar
asked
Dec 25, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
306
views
0
answers
0
votes
SELF DOUBT
IN THE QUESTIO OF IP FRAGMETATION IF QUESTIO IN NAT TYPE THEN HOW TO DECIDE WHEATHER THE LAST PAYLOAD BE MULTIPLE OF 8 OR NOT BECZ SOMEWHERE IT IS TAKE AS MULTIUPL OF 8 AND SOMEWHERE NOT.......
eyeamgj
306
views
eyeamgj
asked
Dec 25, 2017
232
views
0
answers
0
votes
If we perform any row change or column change thn the rank of matrix change?
hem chandra joshi
232
views
hem chandra joshi
asked
Dec 25, 2017
Mathematical Logic
rank-of-matrix
+
–
266
views
0
answers
1
votes
pre-emptive scheduling
22. Given the jobs with the following characteristics:job A: 5ms CPU , 25 ms IO , 5 ms CPUjob B: 20ms CPU, 15 ms IOjob C: 40 ms cpuDetermine the ... the CPU runs these jobs. Assume theschedule is preemptive and the CPU quantum is 5 ms
SeemaTanwar
266
views
SeemaTanwar
asked
Dec 24, 2017
241
views
0
answers
0
votes
graph theory
if graph have articulation point then will it be hamiltonian graph?
arch
241
views
arch
asked
Dec 24, 2017
593
views
0
answers
0
votes
did P and NP is still in the syllabus? @ COMPUTABILITY AND COMPLEXITY{TOC}
did P and NP is still in the syllabus? @ COMPUTABILITY AND COMPLEXITY{TOC}
hacker16
593
views
hacker16
asked
Dec 24, 2017
Theory of Computation
syllabus
p-np-npc-nph
theory-of-computation
+
–
261
views
0
answers
0
votes
Round Robin scheduling policy
The I/O wait percentage p of a process is the percentage of time theprocess wait for an IO to completion when executed in amonoprogramming environment . on a system using ... IO . what percentage of time cpu will be idlein term of (p) ?
SeemaTanwar
261
views
SeemaTanwar
asked
Dec 24, 2017
520
views
0
answers
0
votes
Ace Test Series: Digital Logic - Multiplexer
dm4006
520
views
dm4006
asked
Dec 24, 2017
Digital Logic
ace-test-series
digital-logic
multiplexer
+
–
230
views
0
answers
0
votes
is this strict schedule
sumit goyal 1
230
views
sumit goyal 1
asked
Dec 24, 2017
961
views
0
answers
0
votes
Misses in cache
Consider a cache as follows:Direct mapped8 words total cache data size2 words block sizeA sequence of memory read is performed in the order shown from the ... , 11.Find No of compulsory misses and conflict misses and capacity misses.
Anjan
961
views
Anjan
asked
Dec 24, 2017
CO and Architecture
co-and-architecture
misses
+
–
112
views
0
answers
0
votes
#SplitPhaseInPipelining
What is Split Phase in Pipelining? How to use it?
Vishnu Domkondwar
112
views
Vishnu Domkondwar
asked
Dec 24, 2017
658
views
0
answers
0
votes
gate notebook
In a sorted array find a&b such that a+b>1000Given array is 100 200 300 400 500 600 700 800
jerryberry
658
views
jerryberry
asked
Dec 24, 2017
Algorithms
algorithms
+
–
3.6k
views
0
answers
1
votes
Segmentation Fault
#include<stdio.h>int main(){ char *go = "yolo"; printf("%s",go+2); printf("%s",++go); printf("%c",++go[1]); return 0;}Why ... fault? Doesn't it point to 'l' in "yolo"Is it because of the conversion specifier "%c"??
Tuhin Dutta
3.6k
views
Tuhin Dutta
asked
Dec 24, 2017
Programming in C
programming-in-c
+
–
347
views
0
answers
1
votes
graph theory
Pawan Kumar 2
347
views
Pawan Kumar 2
asked
Dec 24, 2017
Graph Theory
graph-theory
+
–
393
views
0
answers
0
votes
Graph_theory
Doubt in 2nd and 3rd ....
Pawan Kumar 2
393
views
Pawan Kumar 2
asked
Dec 24, 2017
Graph Theory
graph-theory
+
–
461
views
0
answers
0
votes
Time Calculation in counters
Describe the steps with plausible assertions.
dragonball
461
views
dragonball
asked
Dec 24, 2017
Digital Logic
digital-counter
+
–
327
views
0
answers
0
votes
computer networks
Kaluti
327
views
Kaluti
asked
Dec 24, 2017
187
views
0
answers
0
votes
Switching
What should be the increasing order of channel Utilization among Circuit Switching , Packet Switching & message Switching (Explain.)
yogi_p
187
views
yogi_p
asked
Dec 24, 2017
Computer Networks
computer-networks
+
–
204
views
0
answers
0
votes
MATHS
WHAT ARE THE CONDITIONS ONE SHOULD KNOW TO IDENTIFY A CHOCLATE PROBLEM?
raviyogi
204
views
raviyogi
asked
Dec 24, 2017
1.5k
views
0
answers
0
votes
NIELITDEC 2017 set -c 115
In boolean algebra 1+1+1+1+..........800 times onesA) 0B)1C)11D)800
mohitbawankar
1.5k
views
mohitbawankar
asked
Dec 24, 2017
1.0k
views
0
answers
0
votes
Non-Deterministic PDA
I'm getting its equaltion {anbn | n > 0} U {a} U {b}But given is {anbn | n >= 0} U {a} U {b}Whether epsilon is accepted or not??
Ashwin Kulkarni
1.0k
views
Ashwin Kulkarni
asked
Dec 24, 2017
Theory of Computation
pushdown-automata
npda
theory-of-computation
+
–
267
views
0
answers
0
votes
ALGORITHM
Abhishek Barman
267
views
Abhishek Barman
asked
Dec 24, 2017
166
views
0
answers
0
votes
probability
Abhishek Kumar Singh
166
views
Abhishek Kumar Singh
asked
Dec 24, 2017
Probability
probability
+
–
194
views
0
answers
0
votes
Enquiry
Where can I find previous year subject wise test on Go?The tests created by Bikram sir in the test by mentors.Are those GATE questions subject wise?Actually, that ... tab with page not found.So where can I find good subjectwise test ON GO?
Kuldeep Pal
194
views
Kuldeep Pal
asked
Dec 24, 2017
GATE
gatecse-2018
+
–
279
views
0
answers
0
votes
Which of given languages is/are DCFL / CLF?
DCFL or CFL?$L_1=\{0^n1^{2n} | n>=1\}$L_2=\{1^{2n}0^n | n>=1\}$
GateAspirant999
279
views
GateAspirant999
asked
Dec 24, 2017
290
views
0
answers
0
votes
ace test series
Token bucket mechanism is used for congestion control at router . Bucket capacity is 700 bytes (initially full), token arrival rate is 200 bytes/sec and ... of data. The minimum time required to transmit the data is _____________ seconds
eyeamgj
290
views
eyeamgj
asked
Dec 24, 2017
424
views
0
answers
1
votes
Automata P problems
Which of the following problems is/are P-problems?I. Equivalence of DFA'sII. Equivalence of NFAIII. Equivalence of RE(a) Only I(b) Only I and II(c) Only II and III(d) All
GateAspirant999
424
views
GateAspirant999
asked
Dec 24, 2017
370
views
0
answers
0
votes
test series
What is the approach to solve this question @TOC??
himanshu19
370
views
himanshu19
asked
Dec 24, 2017
Page:
« prev
1
...
410
411
412
413
414
415
416
417
418
419
420
...
595
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register