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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
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. For hardcopy of previous year questions please see
here
Recent questions tagged testseries
0
votes
1
answer
1
Made Easy Test Series:TOCTuring Machine
$P_{1}:$ {$<M>M $ is a TM that accepts atleast $2$ strings of different length} $P_{2}:$ {$<M>M $ is a TM and there exists an input whose length less than $100,$ on which $M$ halts } The number of problem which is $RE$ but not $REC$ _____________
asked
Apr 30
in
Theory of Computation
by
srestha
Veteran
(
114k
points)

47
views
theoryofcomputation
turingmachine
testseries
0
votes
0
answers
2
IS THERE ANY other SITE FOR TEST SERIES SUBJECT WISE for NTA NET CS
hii guys there are lot of sites providing Q/A for ugcnet cs but not test series, some sites provide but not good quality they provide BANK,GATE,RAILWAYS IN TEST SERIES. I saw only one site Career Endeavour is good. IS THERE ANY other SITE FOR TEST SERIES SUBJECT WISE for NTA NET CS
asked
Apr 27
in
CBSE/UGC NET
by
Adnan Ashraf
(
267
points)

34
views
testseries
ugcnet
ntanet
0
votes
1
answer
3
Made Easy Test Series:TOCDFA
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________ Answer will be $3$ or $6?$
asked
Apr 23
in
Theory of Computation
by
srestha
Veteran
(
114k
points)

55
views
theoryofcomputation
testseries
madeeasytestseries
0
votes
1
answer
4
Made Easy Test Series : TOC Turing Machine
Consider $\left \langle M \right \rangle$ be the encoding of a turing machine as a string over alphabet $\Sigma =\left \{ 0,1 \right \}$. Consider $D=${$\left \langle M \right \rangle$ $M$ is TM that halt on all ... NonRecursive $(C)$ Recursively enumerable $(D)$ Not Recursively enumerable My question is Is it not a Halting Problem they are asking for?
asked
Apr 13
in
Theory of Computation
by
srestha
Veteran
(
114k
points)

185
views
theoryofcomputation
turingmachine
testseries
+1
vote
0
answers
5
mock test
with deep regards team memmber of GATE Overflow there are only two mock tests available for NTA NET, there should be test series subject wise and full length also like of GATE MOCK EXAMS here. plz,that will be your Great Contribution @Arjun sir,@Bikram THANKS
asked
Apr 1
in
CBSE/UGC NET
by
Adnan Ashraf
(
267
points)

17
views
ugcnet2019
testseries
net
ntanet
exam
0
votes
0
answers
6
Virtual GATE
Let A be a regular set. Consider the two sets below L1={x  $\exists n\geq 0, \exists y\epsilon A :$ y=$x^n$} L2={x  $\exists n\geq 0, \exists y\epsilon A :$ x=$y^n$} which of the following statements is true? L1 and L2 both are regular L1 is regular but L2 is not L1 is not regular but L2 is L1 and L2 both are nonregular
asked
Mar 17
in
Theory of Computation
by
aditi19
Active
(
3.5k
points)

38
views
virtualgate
testseries
theoryofcomputation
regularlanguages
regularexpressions
0
votes
0
answers
7
GeeksforGeeks
Let G be a graph with no isolated vertices, and let M be a maximum matching of G. For each vertex v not saturated by M, choose an edge incident to v. Let T be the set of all the chosen edges, and let L = M ∪ T. Which of the following option is TRUE? A L is always ... G. B L is always a minimum edge cover of G. C Both (A) and (B) D Neither (A) nor (B) Can anyone pls help solving this?
asked
Jan 30
in
Graph Theory
by
Ashish Goyal
(
423
points)

112
views
graphmatching
discretemathematics
graphtheory
testseries
0
votes
1
answer
8
Virtual Gate
A complete graph on n vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let G be a complete graph on 10 vertices. Let u, v, w be three distinct vertices in G. How many simple paths are there from u to v going through w?
asked
Jan 24
in
Graph Theory
by
sudharshan
(
289
points)

70
views
discretemathematics
graphtheory
testseries
0
votes
1
answer
9
TOCTuring Machine
Consider the given below Turing Machine and identify the correct language accepted: (a+b)*aa(a+b)* b*a(bb*a)*a b*ab*a None of these The answer is given as (1). But I think (3) is correct as well. Can anyone tell me why only (1) is correct.
asked
Jan 20
in
Theory of Computation
by
Anurag Aizen Mukherj
(
41
points)

56
views
theoryofcomputation
turingmachine
testseries
0
votes
1
answer
10
MadeEasy Test Series: Operating System  Resource Allocation
asked
Jan 9
in
Operating System
by
Shankar Kakde
(
373
points)

35
views
testseries
madeeasytestseries
deadlock
resourceallocation
0
votes
1
answer
11
Ace academy test series
Ans:C. Please explain
asked
Dec 28, 2018
in
Combinatory
by
amitqy
Active
(
1.9k
points)

119
views
settheory&algebra
permutationsandcombinations
testseries
0
votes
0
answers
12
GA Test series
pls explain why C is correct not A? isn’t every schedule that is supported by 2PL conflict serializable?
asked
Dec 8, 2018
in
Databases
by
aditi19
Active
(
3.5k
points)

47
views
testseries
2phaselocking
transactions
transactionandconcurrency
concurrency
0
votes
1
answer
13
GA Test Series
answer is 1.. but I’m getting more than 1
asked
Dec 6, 2018
in
CO & Architecture
by
aditi19
Active
(
3.5k
points)

55
views
testseries
cachememory
directmapping
0
votes
1
answer
14
Relation algebra Query
Consider the following relation and instance of relation: Supply(sid,Sname) #sid is key Parts(pid,Pname,Pcolor) #pid is the key Catalog(sid,pid) #sid,pid is the key Number of tuples returned by the above Query is ……...
asked
Dec 2, 2018
in
Databases
by
Na462
Loyal
(
8.7k
points)

58
views
relations
databases
relationalalgebra
testseries
0
votes
2
answers
15
Ace Test Series: Algorithms  Time Complexity
What is the time complexity of T(n) = T(n/3) + T(n/9) +n?
asked
Nov 29, 2018
in
Algorithms
by
Nidhi Budhraja
(
263
points)

109
views
algorithms
testseries
timecomplexity
acetestseries
0
votes
0
answers
16
Transaction
'A' is set of all possible schedules 'C' is set of all possible schedules that are guaranteed to produce a correct final result 'S' is the set of all serializable schedules 'P' is the set of all schedules possible under 2phase locking protocol Which is FALSE? (A) P⊆C (B) S⊂P (C) S⊆P (D) P⊂C Please provide reason for the answer. (Given answer is A)
asked
Nov 27, 2018
in
Databases
by
!KARAN
Active
(
1.8k
points)

64
views
databases
transactions
testseries
0
votes
0
answers
17
ace academy test series
What is partial language?
asked
Nov 21, 2018
in
Theory of Computation
by
amitqy
Active
(
1.9k
points)

58
views
testseries
0
votes
0
answers
18
digital
asked
Nov 16, 2018
in
Digital Logic
by
nag.swarna
(
235
points)

42
views
test
testseries
0
votes
1
answer
19
Shortest Job First
asked
Nov 15, 2018
in
Digital Logic
by
Na462
Loyal
(
8.7k
points)

51
views
operatingsystem
testseries
0
votes
1
answer
20
#made easy test
A pair of dice rolled together till a sum of either 5 or 7 obtained. find probability that 5 comes before 7.
asked
Nov 15, 2018
in
Probability
by
amit166
Junior
(
761
points)

62
views
testseries
0
votes
0
answers
21
The Gate Academy
asked
Nov 11, 2018
in
Theory of Computation
by
BHAVESH d shah
(
405
points)

30
views
testseries
0
votes
0
answers
22
DATA STRUCTURES
WHY?? CAN ANYONE EXPLAIN
asked
Nov 11, 2018
in
DS
by
nag.swarna
(
235
points)

70
views
testseries
–1
vote
1
answer
23
test series
Consider the given below languages L1 and L2. L1= {pnqmrmsn  m,n ≥ 0} L2= {pnqnrmsm  m,n ≥ 0} Select the correct statement about, L such that L= (L1 U L2 ) – (L1 ꓵ L2 ) 1. L is CFL but not DCFL 2. L is regular 3. L is CSL but not CFL 4. L is DCFL but not regular i know that L is representing the EXOR of L1 and L2, couldn't visualize as how it will be cfl. please help.
asked
Nov 9, 2018
in
Theory of Computation
by
aambazinga
Active
(
3.3k
points)

96
views
testseries
theoryofcomputation
0
votes
0
answers
24
Rank of the index
Consider the following What is the rank(index) of the node $50?$
asked
Nov 6, 2018
in
DS
by
Lakshman Patel RJIT
Boss
(
36.3k
points)

70
views
datastructure
testseries
+1
vote
0
answers
25
Testseries
Correct answer is A
asked
Nov 6, 2018
in
Algorithms
by
nag.swarna
(
235
points)

86
views
testseries
0
votes
0
answers
26
Test Series
Can anyone please explain
asked
Nov 6, 2018
in
Algorithms
by
nag.swarna
(
235
points)

56
views
testseries
0
votes
1
answer
27
Gate Forum
Im getting 1,8 is anyone getting 1,9????
asked
Nov 6, 2018
in
Algorithms
by
nag.swarna
(
235
points)

74
views
testseries
0
votes
1
answer
28
test series
Consider the following IEEE single precision format A fractional number X is stored as (80700000)16. The decimal equivalent of X is ______.
asked
Nov 6, 2018
in
CO & Architecture
by
mitesh kumar
(
337
points)

76
views
testseries
digital
0
votes
1
answer
29
GATE 19 Test Series
What are some reliable and good testseries for GATE CSE 19'? Also, how many of them should I join considering that I spend the last two months of my preparation on them?
asked
Nov 5, 2018
in
GATE
by
CJ147
(
193
points)

393
views
usergate2019
usermod
testseries
preparation
0
votes
1
answer
30
Test Series
according to me S2 should be correct. But answer given as none of them is correct. Please clear the doubt.
asked
Nov 1, 2018
in
Theory of Computation
by
Ananya Jaiswal 1
Active
(
2.2k
points)

63
views
testseries
theoryofcomputation
Page:
1
2
3
4
5
6
...
10
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IIT Kanpur MS Interview experience
My GATE preparation and what you can learn from it
IIT Bombay RA (2019) Programming Questions
COAP Round 1 has started
MTECH (COUURSE WORK) AI INTERVIEW EXPERIENCE 2019
Follow @csegate
Recent questions tagged testseries
Recent Blog Comments
It was free when I gave them, maybe they made it...
The tests are there but it ain't free. Cost is...
They removed their tests recently, I think it'll...
how did you get Success gateway test series for...
49,722
questions
53,593
answers
185,825
comments
70,877
users