The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exam Category
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent activity by thor
User thor
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User thor
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
Question
Find minimal states in DFA accepting {w1aw2, w1 = 2, w2 >=3, w1,w2 $\in$ $(a+b)^*$}? Is it $7$ or $8$?
asked
Feb 12
in
Theory of Computation

263
views
1
answer
2
NPTELDesign and Analysis of AlgorithmsWeek1Quiz1Q3
commented
Jan 24
in
Algorithms

702
views
nptelquiz
1
answer
3
Graph MST
For a simple, undirected, weighted graph each edge havind distinct weight, How is it possible that there can be more than $1$ second best minimum spanning tree?
commented
Jan 24
in
Algorithms

72
views
1
answer
4
Mock Test
Is statement 1 true for all safe expressions ?
commented
Jan 24
in
Databases

205
views
databases
relationalalgebra
relationalcalculus
0
answers
5
set theory
asked
Jan 24
in
Set Theory & Algebra

25
views
2
answers
6
Data Hazards [GateBook]
commented
Jan 24
in
CO & Architecture

172
views
pipelining
datahazards
coandarchitecture
0
answers
7
Threading in OS [GateBook]
commented
Jan 24
in
Operating System

143
views
operatingsystem
threads
3
answers
8
bst
What would be the worst case time complexity to build binary search tree with given arbitrary n elements? A) O(nlogn) B) O(n) C) O() D) O(log n)
commented
Jan 24
in
Programming

734
views
1
answer
9
Are the following regular expressions are correct?
commented
Jan 24
in
Theory of Computation

95
views
1
answer
10
Made EasyCBT2017Q9
The traffic lights at three different road crossing change after 24 sec , 56sec , 36sec respectively If they all change simultaneously at 10:00 AM. At what time will they again change simultaneously 10:16:54 AM 10:18:00 AM 10:17:02 AM 10:22:12 AM
commented
Jan 23
in
Numerical Ability

114
views
madeeasytestseries
cbt2017
1
answer
11
Regular and CFL (TestBook Test Series 2)
commented
Jan 23
in
Theory of Computation

102
views
theoryofcomputation
regularlanguages
contextfreelanguages
2
answers
12
Made EasyCBT2017Q22
No of topological sortings
commented
Jan 23
in
Algorithms

318
views
madeeasytestseries
cbt2017
1
answer
13
Imp question
How does answer change when it is in SSA form? does answer remains 4 or 5
commented
Jan 23
in
Compiler Design

133
views
0
answers
14
find output
commented
Jan 23
in
Programming

51
views
0
answers
15
find output
asked
Jan 22
in
Programming

42
views
2
answers
16
please answer
asked
Jan 22
in
Databases

42
views
0
answers
17
PDautomata
What is language accepted by above PDA, where 0 is final state and 1 denotes nonfinal state ?
edited
Jan 16
in
Theory of Computation

35
views
0
answers
18
Number of possible TCP connections
commented
Jan 15
in
Computer Networks

95
views
0
answers
19
L={<M>  M is a turing machine and it takes less than 481 steps on some input>
commented
Jan 15
in
Theory of Computation

177
views
theoryofcomputation
turingmachine
2
answers
20
L={<M> : M is a TM that accepts all even numbers }
commented
Jan 15
in
Theory of Computation

238
views
theoryofcomputation
decidability
0
answers
21
logic
Which of above three are valid. I know A3 is valid.
asked
Jan 15
in
Mathematical Logic

25
views
1
answer
22
algo + bfs
asked
Jan 15
in
Algorithms

40
views
bfs
1
answer
23
maths
When the curves, y = log10x and y = x–1 are drawn in x – y plane. The number of times they intersect for values x ≥ 1 is ________.
commented
Jan 15
in
Mathematical Logic

45
views
discretemathematics
engineeringmathematics
1
answer
24
Compare
Which of the following two is correct? If f(n) = Ο(g(n)) then h(f(n)) = Ο(h(g(n))) If f(n) ≠ Ο(g(n)) then g(n) = Ο(f(n))
commented
Jan 10
in
Algorithms

65
views
1
answer
25
Maths: Limit
commented
Jan 10
in
Calculus

213
views
limits
engineeringmathematics
calculus
1
answer
26
Mathss
Let f : A → B and g : B → C denote two functions. Consider the following two statements: S1 : If both f and g are injections then the composition function : A → C is an injection. S2 : If the function : A → C is surjection and g is an injection then the ... = g(f(a)) and h(a) is onto then g must be onto, where ∀a, a ∈ A. Which of the above statements are valid?
commented
Jan 10
in
Mathematical Logic

73
views
0
answers
27
Digital Problem  Why we take 8 flip flops . Why not 9?
commented
Jan 10
in
Digital Logic

55
views
2
answers
28
Subtraction from Hex to Binary
(012.25)16  (101110.101)2 = (__)2 = (__)10
commented
Jan 10
in
Digital Logic

106
views
digitallogic
numberrepresentation
1
answer
29
operating System
Assume that a process has CPU burst time for last four runs as 3 sec, 4 sec, 5 sec and 3 sec (last). Given that last predict burst time was 4 sec and α = 0.6. The next predict of CPU burst time for process when CPU scheduler is shortest process next with exponential averaging is _________. in sec (upto 1 to decimal places).
asked
Jan 10
in
Operating System

91
views
1
answer
30
Cache Memory
A byte addressable computer has a small data cache capable of holding 16 32bit words. Each cache block consist of four 32 bits words. For the following sequence of addresses (in hexadecimal). The miss ratio if 4way set associative LRU cache is used is ______. 100, 104, 108, 104, 107, 108, 105, 102, 108, 103
asked
Jan 10
in
Operating System

89
views
0
answers
31
What should be answer 51 or 52?
commented
Jan 10
in
Databases

80
views
0
answers
32
Algo rec
What is the tightest upper bound to $T(n) = T(n1) + 2^n$? $O(n2^n)$ $O(2^n)$ $O(2^{2n})$ None
asked
Jan 10
in
Algorithms

26
views
1
answer
33
MEFLT
Consider the following statements. 1. A thread running in critical section never get context switched. 2. Hardware access to devices is usually available in user mode. 3. Modifications to the page tables are only possible in Kernel mode. Which of the above statements are incorrect?
commented
Jan 10
in
Operating System

121
views
madeeasytestseries
1
answer
34
Programming
answer selected
Jan 10
in
Programming

77
views
1
answer
35
MECN
Assume a CSMA/CD network that transmit data at a rate of 20 Mbps over a 20 km cable with no repeater. If minimum frame size require for network is 5,000 KB then speed of the signal inside cable is __________ (in Km/sec). What should be correct ans : 19.53 or 20
asked
Jan 10
in
Computer Networks

303
views
1
answer
36
Testbook Test series
How much memory is needed to store addition table of two 8 bit numbers 64Kx9 64Kx8 64Kx16 64Kx18
answered
Jan 10
in
CO & Architecture

52
views
coandarchitecture
1
answer
37
ACEcalculus
commented
Jan 10
in
Calculus

75
views
0
answers
38
REL epsilon
A Turing Machine goes on to an infinite loop on string $\epsilon$. Is it correct? And thus Any language containing $\epsilon$ is not REL. Is it correct?
commented
Jan 9
in
Theory of Computation

77
views
0
answers
39
DBMS12
commented
Jan 9
in
Databases

52
views
0
answers
40
dbms ace
asked
Jan 9
in
Databases

19
views
29,138
questions
36,959
answers
92,023
comments
34,803
users