Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Year
Exams
Recent questions tagged #testseries
+1
vote
0
answers
Theory of computation No of state in dfa
How many three state DFA can be constructed with a designated initial state that accept empty language over the alphabet {a,b}?
asked
May 16
in
Theory of Computation
by
Shreya2002
(
7
points)

41
views
#toc
theoryofcomputation
#testseries
#dfa
0
votes
0
answers
l1 = (ab m>0), l2=lamda. then l is which type of language  regular or context?
asked
May 13
in
Theory of Computation
by
gunjanmimo
(
6
points)

2
views
#testseries
#gatebook
0
votes
1
answer
Consider L = {a^n b^n c^n n ≥ 0}. Is L'(L Complement) a CFL? Prove it.
asked
Jan 16
in
Theory of Computation
by
bankeshk
(
12
points)

25
views
#toc
contextfreelanguage
#testseries
0
votes
0
answers
madeeasy compier design
Consider the following grammar which is not LL(1) because LL(1) table contain multiple entry for same production. S>aAbB/ bAaB/epsilon A>S B>S The number of entries have multiple productions in LL(1) table are ________.
asked
Jan 15
in
Compiler Design
by
suchithreddy
(
7
points)

7
views
#testseries
compilerdesign
0
votes
0
answers
ACE TestSeries Question2
Anyone please clarify..
asked
Jan 5
in
Calculus
by
Shivateja MST
(
124
points)

21
views
#gatepreparation
aceacademytestseries
#testseries
0
votes
0
answers
ACE Practice Mock 2 Q22
can someone please explain to me how to find the no of independent eigenvectors?
asked
Dec 29, 2019
in
Linear Algebra
by
Khushboosahuu
(
6
points)

21
views
#gatepreparation
aceacademytestseries
#testseries
0
votes
0
answers
Testbook Mock
asked
Dec 20, 2019
in
Algorithms
by
srikrishna123g
(
84
points)

15
views
#testseries
#algorithms#hashing
0
votes
0
answers
Testbook Mock Test
asked
Dec 13, 2019
in
Algorithms
by
srikrishna123g
(
84
points)

52
views
#algorithms#timecomplexity
#testseries
0
votes
0
answers
Testbook Compiler Design test doubt
Will it give a lexical error or a syntactic error?
asked
Dec 12, 2019
in
Compiler Design
by
Abhipsa
(
26
points)

43
views
compilerdesign
#testseries
lexical_analysis
0
votes
1
answer
SuccessGateway Test Series
State true or false with explanation. The answer to this is given as True and explanation as follows: L is universal language over alphabet a,b. As far as I know this should be non regular and I don’t understand the logic that L is universal language. Please confirm what should be the correct answer.
asked
Nov 1, 2019
in
Theory of Computation
by
SpringPearl
(
6
points)

27
views
#toc
#testseries
0
votes
0
answers
programming test series question made easy
asked
Oct 11, 2019
in
Programming
by
Priyansh Singh
(
257
points)

32
views
testseries
array
#testseries
cprogrammingforgate
0
votes
0
answers
Made easy Test Series question....
Consider th following cases for quick sort to sort an array of n element $a[0...n1]$ i) Choosing the pivot element randomly from the given array ii) choosing median element as pivot. Iii) Choosing middle element as pivot For which of the above cases quick sort always gives $O(nlogn)$ time complexity?
asked
Sep 11, 2019
in
Algorithms
by
`JEET
(
179
points)

17
views
algorithms
timecomplexity
testseries
#testseries
sorting
0
votes
2
answers
Made easy test series question.
For the below message number of bits required in Huffman Coding is: abbaabccdabcd
asked
Sep 11, 2019
in
Algorithms
by
`JEET
(
179
points)

40
views
algorithms
timecomplexity
testseries
#testseries
0
votes
0
answers
[GATEBOOK TS] what is value of yx?
what will be value of y?
asked
Sep 8, 2019
in
Algorithms
by
ummokkate
(
51
points)

22
views
#testseries
#algorithms
0
votes
0
answers
Made Easy Test Series  OS
Here is my approach: Initial all block are empty  {100,500,200,450,600} When 212 request come then blocks size after allocation  {100,288,200,450,600} When 417 request come then  {100,288,200,33,600} When 112 request come then  {100,176 ... so first fit fails here Thats my approach but in given solution first fits work well. Please tell the were i am doing wrong..
asked
Sep 7, 2019
in
Operating System
by
sagar2405
(
149
points)

11
views
operatingsystem
testseries
#testseries
0
votes
1
answer
[GATEBOOK TS] which is correct?
L is a language defined over alphabet . There is a one to one correspondence between L and Natural numbers N. P. is regular but not context free Q. is context free but not recursive R. is recursively enumerable but not recursive S. is finite Which ... can we say about language L given it has 11 correspondence with natural numbers? is it REC/REL or something else...
asked
Sep 7, 2019
in
Theory of Computation
by
ummokkate
(
51
points)

38
views
#testseries
#toc
0
votes
2
answers
Identify the class of the language
L = {PQ  P,Q $\in (a,b)^{*}$ and $n_{a}(P) = n_{b}(Q)$} The language is – DCFL but not Regular CSL but not CFL CFL but not DCFL Regular
asked
Sep 5, 2019
in
Theory of Computation
by
MRINMOY_HALDER
(
37
points)

58
views
theoryofcomputation
#toc
#testseries
contextfreelanguages
regularlanguages
0
votes
3
answers
[GATEBOOK TESTSERIES] WHICH IS CORRECT?
Suppose we are sorting an array of ten integers using some quadratic sorting algorithm. After four iterations of the algorithm's main loop, the array elements are ordered as shown here: 1 2 3 4 5 0 6 7 8 9 Which statement is ... algorithm might be insertion sort, but could not be selection sort. D. The algorithm is neither selection sort nor insertion sort.
asked
Aug 31, 2019
in
Algorithms
by
ummokkate
(
51
points)

40
views
#testseries
algorithms
0
votes
0
answers
[GATEBOOK TESTSERIES] what is the output of the following program?
asked
Aug 29, 2019
in
Programming
by
ummokkate
(
51
points)

24
views
#testseries
cprogrammingforgate
0
votes
1
answer
[GATEBOOK TESTSERIES] What is the expectation of the following event?
asked
Aug 29, 2019
in
Probability
by
ummokkate
(
51
points)

19
views
#testseries
engineeringmaths
probability
0
votes
1
answer
[GATEBOOK TESTSERIES] which of the following is true?
asked
Aug 27, 2019
in
Theory of Computation
by
ummokkate
(
51
points)

80
views
#toc
#testseries
#gate
0
votes
1
answer
If L1 is a decidable language and L2 is an undecidable language, then L1 U L2, is (GATEBOOK TESTSERIES)
asked
Aug 25, 2019
in
Theory of Computation
by
ummokkate
(
51
points)

78
views
#toc
#testseries
#gatebook
0
votes
2
answers
L is a language and M is a Turing machine which accepts L. M loops on epsilon for ever. Which one is true ?
asked
Aug 25, 2019
in
Theory of Computation
by
ummokkate
(
51
points)

88
views
#toc
#testseries
0
votes
2
answers
Which one of the following relations is true about above cardinalities ?
asked
Aug 25, 2019
in
Theory of Computation
by
ummokkate
(
51
points)

100
views
#toc
#testseries
0
votes
1
answer
Igate Bhilai:DIGITAL ELECTRONICS 2020
asked
Aug 25, 2019
in
Digital Logic
by
anonymous

51
views
#testseries
0
votes
0
answers
iGate Bhillai Test: DBMS
asked
Aug 23, 2019
in
Databases
by
Abhinav999
(
8
points)

14
views
#testseries
0
votes
1
answer
iGate Bhilai Test 2020:dbms
asked
Aug 23, 2019
in
Databases
by
Abhinav999
(
8
points)

51
views
#testseries
0
votes
0
answers
Gate overflow doubt made easy cache stalls
Suppose that in 500 memory references there are 50 misses in the first level cache and 20 misses in the second level cache.Assume miss penalty from the L2 cache to memory is 100 cycles.The hit time of L2 cache is 20 cycle.The ... cache is 10 cycles. If there are 2.5 memory references per instruction.How many average stall cycles per instructions are there?
asked
Aug 21, 2019
in
CO & Architecture
by
Ram Swaroop
(
309
points)

19
views
coandarchitecture
#testseries
cachememory
stall
instructioncycle
0
votes
1
answer
Made easy Algorithm
Which of the following procedure is suitable for finding the longest path from given vertex to any other vertex in a directed acyclic graph(weighted) with few negative weight edge. Divide and conquer Greedy algorithm Dynamic programming All of the above
asked
Aug 20, 2019
in
Algorithms
by
sagar2405
(
149
points)

22
views
programming
#testseries
#algorithms
algorithum
0
votes
0
answers
Made easy test series  Algorithm
How to do find 0/1 knapsack in minimum time?
asked
Aug 19, 2019
in
Algorithms
by
sagar2405
(
149
points)

24
views
programming
#testseries
#algorithms
0
votes
1
answer
regular language and few statements
$L$ is a regular language over $\Sigma^*$ $X = \{ x x\ belongs\ to\ \Sigma^*, x\ is\ between\ n\ to\ 2n1\ \}$ $\exists w \in x, w \in L\ then\ L\ is\ infinite.$ $\exists, w >= 2n,\ w \in L\ then\ \exists x \in X$ Which one of the following statements are true ? (A) Only I (B) Only II (C) Both I and II (D) Neither I or II
asked
Aug 19, 2019
in
Theory of Computation
by
KINGSLAYER
(
9
points)

46
views
#regularlanguage
theoryofcomputation
#testseries
gatebook
+1
vote
1
answer
checking if given languages are regular or not
Consider the following languages. Which one of the following statements is true ? (A) L1 is regular, L2 is non regular (B) L1 is non regular, L2 is regular (C) L1 is regular, L2 is regular (D) L1 is non regular, L2 is non regular My ... string and if it is, we can prove that L1 is regular, but how can L2 be regular as that order needs to be maintained!
asked
Aug 17, 2019
in
Theory of Computation
by
KINGSLAYER
(
9
points)

50
views
gatebook
regularlanguages
#testseries
#toc
0
votes
0
answers
made easy toc
In the below question if we get HTH then player 1 wins right ? But it is not going to final state . Can anyone please explain the solution
asked
Aug 15, 2019
in
Theory of Computation
by
Manasa.M
(
19
points)

30
views
#testseries
0
votes
0
answers
madeeasy TOC
Option a. language also generates aa when m=1 and n=0 but in the given transitions there is no transition for (q0,a) when it is first read when stack contains z0 as stack symbol then how it can accept all strings generated by language . Can anyone please explain the solution
asked
Aug 13, 2019
in
Theory of Computation
by
Manasa.M
(
19
points)

20
views
#testseries
0
votes
0
answers
Made Easy Test Series 2019
Consider a file system with block size 4kb and disk size is 28 mb, to keep track of free block in the disk a bitmap is used. Then how many disk block required for bit map? (Answer given is 7)
asked
Aug 10, 2019
in
Operating System
by
suparna kar
(
7
points)

40
views
operatingsystem
#testseries
bitmap
+2
votes
1
answer
Igate test series
Consider the following program fragments d= 0; for (i=1;i<31;++i) for (j=1;j<31;++j) for (k=1;k<31;++k) if(((i+j+k) %3)==0) d =d+1; printf("% d",d); The number of addition performed by the above program fragment is (A)27000 (B)27000 *3 (c)9000+3*27000 (D)9930 + 27000 * 3
asked
Aug 10, 2019
in
Programming
by
Shubhrasirmour
(
9
points)

32
views
#c
#igate
#testseries
#gatepreparation
0
votes
1
answer
Made easssy test series
The number of distinct BFS and DFS traversal possible on complete graph of n vertices is?
asked
Aug 6, 2019
in
Algorithms
by
dheerwani
(
7
points)

25
views
#testseries
#algorithms
#gatepreparation
#gate
+1
vote
1
answer
Test series Made easy
Minimum no. of NOR gates required to implement ===> (A+B+C)’ ?
asked
Jul 23, 2019
in
Digital Logic
by
Priyansh Singh
(
257
points)

17
views
#testseries
digitallogic
digitalcircuits
0
votes
1
answer
TEST SERIESQ.17
Consider an array A of length n, array containing number between(110), in any arbitary order, best sorting algo takes 650ns if n=50. The time required by algo if n=300 is _____
asked
Jul 21, 2019
in
Algorithms
by
Ritabrata Dey
(
119
points)

12
views
#testseries
0
votes
1
answer
Branching factor and maximum depth
If ‘b’ is branching factor & ‘m’ is maximum depth of search tree, then what is the space complexity of greedy search? O(b + m) O(b^m) O(bm) O(m^m)
asked
Jul 21, 2019
in
Algorithms
by
Ritabrata Dey
(
119
points)

26
views
#testseries
Page:
1
2
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Jun 2020
nehaPal13
7 Points
Radheram
6 Points
vps123
4 Points
ummokkate
1 Points
Musa
1 Points
AliH
1 Points
DukeThunders
1 Points
Doraemon
1 Points
kpc
1 Points
Kushagra गुप्ता
1 Points
7,393
questions
1,744
answers
10,711
comments
90,368
users