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
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
0
answers
1
test series
Can someone give a detailed solution of this problem
asked
Jul 1
in
Computer Networks
by
Kalpataru Bose
(
339
points)

44
views
computernetworks
testseries
acetestseries
madeeasytestseries
0
votes
1
answer
2
The minimum no of comparisons required to find minimum and maximum of 100 numbers is __
asked
Jun 29
in
Combinatory
by
Rishav Kumar Singh
(
173
points)

27
views
testseries
0
votes
0
answers
3
testbook testseries
Maximum number of nodes in the derivation tree when a word of length 2k is derived from a grammar in CNF $2^{k+1}1$ $3.2^{k}1$ $2^{k+1}+1$ $3.2^{k}+1$
asked
Jun 10
in
Theory of Computation
by
Prateek Raghuvanshi
Active
(
4.6k
points)

17
views
testseries
+2
votes
0
answers
4
Regarding When to take test series
Which approach should be followed: Finishing subtopics and giving test series simultaneously or finishing the full syllabus first and then taking the test series, in DecemberJanuary? Also, I have heard that Made Easy test series have a lot of errors. Then which one to take?
asked
May 29
in
Study Resources
by
mohitjarvissharma
(
157
points)

48
views
testseries
preparation
studyresources
0
votes
0
answers
5
Test Series
Maximun number of nodes in the derivation tree when a word of lenght $2^k$ is derived from a gramar in CNF? My answer was ($2^{k+1}$)1. But the answer given is 3* $2^k$ 1. Please someone explain
asked
May 28
in
Theory of Computation
by
Ananya Jaiswal 1
Active
(
1.6k
points)

27
views
testseries
acetestseries
theoryofcomputation
0
votes
2
answers
6
Transaction 1
How many concurrent schedules are conflict serializable of given transactions T1 and T2:
asked
May 12
in
Databases
by
Na462
Active
(
3.9k
points)

82
views
databases
transactions
testseries
0
votes
1
answer
7
Test Series
If there are Q states in NFA, DFA should have at max $2^{Q}$ states. Keeping this thing in mind I answered the question but it went wrong. Please if anyone can give the correct solution.
asked
May 6
in
Theory of Computation
by
Subham Nagar
Junior
(
587
points)

83
views
testseries
finiteautomata
theoryofcomputation
0
votes
1
answer
8
TheGateAcademy Test Series
In DFA, does each state need to have transition on "EACH" input alphabet? The answer was given "False" but I dont think so. Can anyone explain? Because if this statement is False, then there is no use of "Dead State"
asked
May 6
in
Theory of Computation
by
Subham Nagar
Junior
(
587
points)

61
views
testseries
theoryofcomputation
+1
vote
1
answer
9
MADE EASY TEST SERIES 2017
Consider the sliding window protocol used at transport layer to transfer the segments, the receiver sends ACK K + 1 when it receives a packet with sequence number K and window size is denoted by W . Assume the sender's packets start with sequence ... sequence number greater than W is sent by sender iff a new (previously unseen) ACK arrives. (D) None of the above
asked
Apr 30
in
Computer Networks
by
Kartavya Kothari
(
81
points)

79
views
madeeasytestseries
computernetworks
testseries
0
votes
1
answer
10
MADE EASY 2017 TEST SERIES
Consider the following statements, when a distance vector routing protocol finding minimum cost paths suffers from count to infinity problem: S1 : The counttoinfinity problem may arise in distance vector routing protocol, when network gets disconnected. S2 : The count to infinity problem ... is correct? (A) Only S1 AND S3 (B) Only S2 AND S3 (C) Only S2 (D) All of them
asked
Apr 30
in
Computer Networks
by
Kartavya Kothari
(
81
points)

70
views
madeeasytestseries
computernetworks
testseries
0
votes
1
answer
11
*** test series
We want to write a code snippet to find if a given sequence of parentheses containing only ( and )' is balanced one. The input character sequence is given in a character array arr[]. We have a stack which holds character value. The standard operations in stack are s.pop()  to pop an element ... push(arr[i]) D) S1: arr[i]==') && s.top()==')' S2: s.push(arr[i]) S3: s.pop()
asked
Apr 7
in
Programming
by
Shivani gaikawad
(
183
points)

70
views
testseries
+2
votes
2
answers
12
Gradeup Test series
Suppose prim’s algorithm is implemented using array as queue for a graph $G(V,E)$. Then what is the time complexity of Prim’s algorithm? $O (E \hspace{0.1cm}log\hspace{0.1cm} V)$ $O (V^2 \hspace{0.1cm}log\hspace{0.1cm} V)$ $O(V^2)$ $O(VE)$
asked
Mar 27
in
Algorithms
by
Aishwarya Gujrathi
(
495
points)

168
views
testseries
algorithms
0
votes
0
answers
13
BARC , General
Can anyone suggest a good platform for giving practice tests in order to prepare for BARC exam(100 questions in 120 minutes).
asked
Mar 25
in
BARC
by
Subham Nagar
Junior
(
587
points)

59
views
testseries
0
votes
1
answer
14
Gradeup Test Series
Consider the following information of a source code. $10$ operators are used which includes 4 unique operators. $6$ operands are used which include 4 unique operands. Estimate the program length. $8$ $12$ $32$ $16$
asked
Mar 24
in
IS&Software Engineering
by
Aishwarya Gujrathi
(
495
points)

75
views
testseries
+1
vote
0
answers
15
Gradeup mocktest
In a pipelined RISC computer, where arithmetic instructions and Load/store instructions are carried out, which of the following method will not definitely help in faster execution when only load/store instruction are performed? a. increasing clock speed b. ... in the program then again forwarding that to the load instruction will increase the speed of the computation. Please guide.
asked
Mar 23
in
CO & Architecture
by
V MIDHUN 2
(
19
points)

68
views
testseries
instructionexecution
0
votes
1
answer
16
Sorting
asked
Mar 19
in
Algorithms
by
pankaj_vir
Loyal
(
8.6k
points)

129
views
testseries
sorting
algorithms
heapsort
radixsort
+1
vote
1
answer
17
Language of left, right, top and down steps
asked
Mar 2
in
Theory of Computation
by
GateAspirant999
Active
(
2.6k
points)

35
views
testseries
regularlanguages
contextfreelanguages
theoryofcomputation
0
votes
1
answer
18
gatebook
asked
Feb 14
in
Linear Algebra
by
nish kim
(
443
points)

161
views
testseries
0
votes
1
answer
19
TOC *** test series FA
question seems to be easy. but could not understand the solution
asked
Feb 11
in
Theory of Computation
by
Moin Mukhtar
(
253
points)

118
views
theoryofcomputation
finiteautomata
testseries
0
votes
0
answers
20
virtual gate sorting algo
An array of n distinct elements is said to be unsorted if for every index i such that 2 ≤ i ≤ n − 1, either A[i] > max{A[i − 1], A[i + 1]}, or A[i] < min{A[i − 1], A[i + 1]}. What is the timecomplexity of the fastest algorithm that takes as input a sorted array ... (n log n) but not O(n) (B) O(n) but not O( √n) (C) O( √n) but not O(log n) (D) O(log n) but not O(1)
asked
Jan 31
in
Algorithms
by
Utsav09
Active
(
1.1k
points)

71
views
sorting
testseries
virtualgate
algorithms
0
votes
0
answers
21
Compilers question virtual gate
Consider the grammar given S>AA A>aA / b How many entries will be blank in the GOTO table for SR(0) items.
asked
Jan 31
in
Compiler Design
by
Utsav09
Active
(
1.1k
points)

36
views
virtualgate
testseries
compilerdesign
0
votes
0
answers
22
virtual gate
Which of the following statements are correct regarding subnet mask 255.255.240.0? i. Class A network subnet mask: 4096 subnets and 4096 systems per subnetwork ii. Class B network subnet mask: 16 subnets and 4096 systems per subnetwork iii. Class C network subnet mask: 1 subnet and 256 systems per subnetwork (A) All are correct (B) i, ii (C) i, iii (D) ii, iii
asked
Jan 31
in
Computer Networks
by
Utsav09
Active
(
1.1k
points)

52
views
virtualgate
testseries
computernetworks
+1
vote
0
answers
23
virtual gate
$\int \limits_0^1 (1 + y^2)^{1.5} dy$
asked
Jan 31
in
Calculus
by
Utsav09
Active
(
1.1k
points)

82
views
virtualgate
testseries
0
votes
0
answers
24
Virtual GATE
Which of the following statements is TRUE about the propositional logic formula S:(p→q)∧(¬q∨r)∧(r→s)→¬(p→s) (A) S is a contradiction (B) S is satisfiable but not valid (C) S is valid (D) None of the above
asked
Jan 31
in
Mathematical Logic
by
Utsav09
Active
(
1.1k
points)

22
views
testseries
virtualgate
discretemathematics
propositionallogic
0
votes
1
answer
25
Testbook live Test 2
asked
Jan 30
in
Digital Logic
by
Shailin Shah
(
109
points)

80
views
testseries
testbooktestseries
digitallogic
+4
votes
0
answers
26
Testbook Live Test 2
asked
Jan 30
in
Theory of Computation
by
Shailin Shah
(
109
points)

106
views
testbooktestseries
testseries
theoryofcomputation
cfg
+3
votes
2
answers
27
Virtual GATE Question
Let $L$ be a given contextfree language over the alphabet $\{a, b\}$. Construct $L1, L2$ as follows. Let $L1 = L − \{xyx \mid x, y \in \{a, b\}^*\}$, and $L2 = L·L$. Then, Both $L1$ and $L2$ are regular. Both $L1$ and $L2$ are context free but not necessarily regular. $L1$ is regular and $L2$ is context free. $L1$ and $L2$ both may not be context free.
asked
Jan 27
in
Theory of Computation
by
Utsav09
Active
(
1.1k
points)

81
views
virtualgate
testseries
theoryofcomputation
+1
vote
0
answers
28
VIRTUAL GATE  TOC
If $h$ represents the Homomorphic image of a string and $h^{1}$ represent the Inverse Homomorphic image of a string. We have a language $L$, $(A)\ h(h^{1}(L)) = L$ $(B)\ h(h^{1}(L)) \subset L$ $(C)\ h(h^{1}(L)) \subset L$ $(D)\ None$ Some reference given here, but I am not able to understand: https://courses.engr.illinois.edu/cs373/sp2013/Lectures/lec08.pdf (5th page)
asked
Jan 27
in
Theory of Computation
by
Rishabh Gupta 2
Boss
(
14k
points)

39
views
virtualgate
testseries
theoryofcomputation
homomorphism
+2
votes
0
answers
29
test series
asked
Jan 26
in
Computer Networks
by
gari
Active
(
3.2k
points)

35
views
testseries
computernetworks
+1
vote
0
answers
30
[ACE test series] Compiler
asked
Jan 20
in
Compiler Design
by
ashish pal
Active
(
1.1k
points)

35
views
acetestseries
compilerdesign
testseries
Page:
1
2
3
4
5
6
...
15
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
The 2018 APL Problem Solving Contest
GO Classroom for GATE 2019
Mtech CSE  IITH (TA) Interview Experience
MS Programme @ IIT
Research Advice
Follow @csegate
Gatecse
Recent questions tagged testseries
Recent Blog Comments
@Naveen You are welcome
@Mohit The full address was definitely on the ...
I have just received the go hardcopy. Thanks ...
Arjun Suresh Sir this is my consignment ...
i am using GO by my Gmail A/c, my email id is : ...
36,992
questions
44,564
answers
126,750
comments
43,627
users