# Recent questions tagged test-series

1
$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$ _____________
2
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
1 vote
3
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?$
1 vote
4
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
5
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 non-regular
1 vote
6
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 an edge cover of 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?
7
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?
8
#mocktest #suggestion Which of these strategies will be best for attempting mock test ? 1- FCFS (Attepmting each question as it's come ) 2- SJF (Solving easy then moderate & then difficult by finding their level ) 3- Round Robin + SRTF ( Giving quantam time of 0.5-2 minute then solving remaining problems ) 4- Any other strategy . If possible give reason to your answer
1 vote
9
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.
10
11
12
pls explain why C is correct not A? isn’t every schedule that is supported by 2PL conflict serializable?
1 vote
13
answer is 1.. but I’m getting more than 1
1 vote
14
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 ……...
15
What is the time complexity of T(n) = T(n/3) + T(n/9) +n?
16
'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 2-phase 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)
17
What is partial language?
18
19
20
A pair of dice rolled together till a sum of either 5 or 7 obtained. find probability that 5 comes before 7.
21
WHY?? CAN ANYONE EXPLAIN
–1 vote
22
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 EX-OR of L1 and L2, couldn't visualize as how it will be cfl. please help.
23
Consider the following What is the rank(index) of the node $50?$
1 vote
24
25
26
Im getting 1,8 is anyone getting 1,9????
27
Consider the following IEEE single precision format A fractional number X is stored as (80700000)16. The decimal equivalent of X is ______.