The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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 virtualgatetestseries
0
votes
0
answers
1
Virtual GATE Test Series forkjoin concurrency structure
Consider the code fragment: count = 3; S1; Fork L1; L1: S3; S2; goto L3; S4; Fork L2; L2: S6; goto L3; S5; L3: join count S7 Which one of the following represents correct precedence graph of the above code fragment? the answer is given but I’m getting where am I wrong?
asked
3 days
ago
in
Operating System
by
aditi19
Active
(
3.7k
points)

22
views
virtualgatetestseries
operatingsystem
precedencegraph
fork
concurrency
0
votes
1
answer
2
Virtual GATE Test Series ER to Relational Model
how many tables are required?
asked
May 28
in
Databases
by
aditi19
Active
(
3.7k
points)

119
views
erdiagram
ertorelational
databases
virtualgatetestseries
virtualgate
0
votes
0
answers
3
Virtual Gate Test Series Database
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? $P\subseteq C$ $S\subset P$ $S\subseteq P$ $P\subset C$
asked
May 28
in
Databases
by
aditi19
Active
(
3.7k
points)

93
views
virtualgatetestseries
serializability
conflictserializable
2phaselocking
twophaselockingprotocol
+2
votes
1
answer
4
Virtual Gate Test Series: Theory Of Computation  Finite Automata
How many possible finite automata ( DFA ) are there with two states X and Y, where X is always initial state with alphabet a and b, that accepts everything? answer is 20 or 64?
asked
Mar 24
in
Theory of Computation
by
aditi19
Active
(
3.7k
points)

234
views
theoryofcomputation
finiteautomata
virtualgatetestseries
0
votes
2
answers
5
Virtual Gate Test Series: Theory Of Computation  Languages
If $L = \Bigl \{ x \mid x \in \{ a, b, c \}^*, \text{The length of $x$ is a square } \Bigr \}$ then $L$ is Regular Recursive but not context free Context Free but not regular None of the above
asked
Mar 24
in
Theory of Computation
by
aditi19
Active
(
3.7k
points)

95
views
theoryofcomputation
identifyclasslanguage
virtualgatetestseries
0
votes
2
answers
6
Virtual Gate Test Series: Databases  Schedule
Which of the following is/are true? I. Every strict schedule is cascade less schedule and recoverable schedule II. Every cascade less schedule is recoverable schedule III. Every cascading rollback schedule is recoverable schedule IV. Every cascading rollback schedule is a ... of the above I, II, and IV only II, III, IV, and V only I, II, and III only
asked
Jan 26
in
Databases
by
jatin khachane 1
Loyal
(
6.7k
points)

156
views
databases
schedule
virtualgatetestseries
0
votes
1
answer
7
Virtual Gate Test Series: Theory Of Computation  Languages
Let Σ = {a, b}. For a word w ∈ Σ* , let na(x) denote the number of a’s in w and let nb(x) denote the number of b’s in w. Consider the following language: L := {xy  x, y ∈ Σ* , na(x) = nb(y)} What can we say about L? L is regular, but not contextfree. L is contextfree, but not regular. L is Σ*. None of these.
asked
Jan 26
in
Theory of Computation
by
jatin khachane 1
Loyal
(
6.7k
points)

81
views
theoryofcomputation
identifyclasslanguage
virtualgatetestseries
0
votes
0
answers
8
Virtual Gate Test Series: CO & Architecture  Pipelining
Consider the unpipelined machine with $10$ ... overhead to the clock. _____________ times speed up in the instruction execution rate is gained from a pipeline.
asked
Jan 26
in
CO & Architecture
by
jatin khachane 1
Loyal
(
6.7k
points)

45
views
coandarchitecture
pipeliningspeedup
virtualgatetestseries
0
votes
0
answers
9
Virtual Gate Test Series: Discrete Mathematics  Graph Theory
Let $G$ be a graph on $n$ vertices with $4n16$ edges.Consider the following: 1. There is a vertex of degree smaller than $8$ in $G.$ 2. There is a vertex such that there are less than $16$ vertices at a distance exactly $2$ from it. Which of the following is TRUE: 1 only 2 only Both 1 and 2 Neither 1 nor 2
asked
Jan 9
in
Graph Theory
by
pps121
Active
(
1.5k
points)

90
views
discretemathematics
graphtheory
virtualgatetestseries
0
votes
0
answers
10
Virtual Gate Test Series: Theory Of Computation  Finite Automata
For a binary string, $x = a_0,a_1, · · · ,a_n−1$ define $val(x)$ to be the value of x interpreted as a binary number, where $a_0$ is the most significant bit. More formally, $val(x)$ ... a finite automaton that accepts exactly the set of binary strings x such that val(x) is divisible by either $4$ or $ 5?$
asked
Dec 26, 2018
in
Theory of Computation
by
Gupta731
Active
(
4.5k
points)

62
views
theoryofcomputation
finiteautomata
virtualgatetestseries
0
votes
0
answers
11
Virtual Gate Test Series: Discrete Mathematics  Set Theory & Algebra
asked
Oct 16, 2018
in
Set Theory & Algebra
by
Prince Sindhiya
Loyal
(
5.4k
points)

63
views
discretemathematics
settheory&algebra
sets
virtualgatetestseries
0
votes
0
answers
12
Virtual Gate Test Series: Linear Algebra  Eigen Value
asked
Oct 16, 2018
in
Linear Algebra
by
Prince Sindhiya
Loyal
(
5.4k
points)

48
views
engineeringmathematics
linearalgebra
matrices
eigenvalue
virtualgatetestseries
0
votes
0
answers
13
Virtual Gate Test Series: Discrete Mathematics  Combinatorics
asked
Oct 15, 2018
in
Combinatory
by
Prince Sindhiya
Loyal
(
5.4k
points)

50
views
discretemathematics
permutationsandcombinations
virtualgatetestseries
0
votes
0
answers
14
Virtual Gate Test Series: Discrete Mathematics  Set Theory & Algebra  Groups
asked
Oct 15, 2018
in
Set Theory & Algebra
by
Prince Sindhiya
Loyal
(
5.4k
points)

38
views
discretemathematics
settheory&algebra
groups
virtualgatetestseries
+2
votes
1
answer
15
Virtual Gate Test Series: Discrete Mathematics  Graph Theory
Consider the following two statements$:$ The two graphs $G_{1}$ and $G_{2}$ are isomorphic Each of $G_{1}$ and $G_{2}$ are selfdual. Both $(i)$ and $(ii)$ are true Only $(i)$ is true Only $(ii)$ is true Both $(i)$ and $(ii)$ are false
asked
Oct 15, 2018
in
Graph Theory
by
Prince Sindhiya
Loyal
(
5.4k
points)

69
views
discretemathematics
graphtheory
virtualgatetestseries
0
votes
0
answers
16
Virtual Gate Test Series: Calculus
i have solved it by putting the values
asked
Oct 15, 2018
in
Calculus
by
Prince Sindhiya
Loyal
(
5.4k
points)

42
views
engineeringmathematics
calculus
virtualgatetestseries
+1
vote
2
answers
17
Virtual Gate Test Series: Linear Algebra  Rank Of The Matrix
asked
Oct 15, 2018
in
Linear Algebra
by
Prince Sindhiya
Loyal
(
5.4k
points)

58
views
engineeringmathematics
linearalgebra
matrix
rankofmatrix
virtualgatetestseries
0
votes
0
answers
18
Virtual Gate Test Series: Linear Algebra  Eigen Values of a Unity Matrix
asked
Oct 15, 2018
in
Linear Algebra
by
Prince Sindhiya
Loyal
(
5.4k
points)

67
views
engineeringmathematics
linearalgebra
matrices
eigenvalue
virtualgatetestseries
0
votes
0
answers
19
Virtual Gate Test Series:Digital LogicAsynchronous Counter
asked
Oct 9, 2018
in
Digital Logic
by
Dharmendra Lodhi
Active
(
3.3k
points)

72
views
digitallogic
sequentialcircuit
synchronousasynchronouscircuits
virtualgatetestseries
0
votes
0
answers
20
Virtual Gate Test Series: Discrete Mathematics  Set Theory & Algebra  Functions
asked
Sep 28, 2018
in
Set Theory & Algebra
by
jatinkumar
(
307
points)

36
views
discretemathematics
settheory&algebra
functions
virtualgatetestseries
0
votes
1
answer
21
Virtual Gate Test Series: Algorithms  Time Complexity
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 ... $O( \sqrt{n})$ $(C) O( \sqrt{n})$ but not $O(log n)$ $(D) O(log n)$ but not $O(1)$
asked
Jan 31, 2018
in
Algorithms
by
Utsav09
Active
(
1.2k
points)

117
views
algorithms
timecomplexity
virtualgatetestseries
0
votes
0
answers
22
Virtual Gate Test Series: Compiler Design  Parsers
Consider the grammar given $S\rightarrow AA$ $A\rightarrow aA / b$ How many entries will be blank in the GOTO table for SR(0) items?
asked
Jan 31, 2018
in
Compiler Design
by
Utsav09
Active
(
1.2k
points)

53
views
compilerdesign
parsing
srparser
virtualgatetestseries
0
votes
1
answer
23
Virtual Gate Test Series: Computer Networks  Subnet Mask
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 ... network subnet mask$: 1$ subnet and $ 256$ systems per subnetwork All are correct i, ii i, iii ii, iii
asked
Jan 31, 2018
in
Computer Networks
by
Utsav09
Active
(
1.2k
points)

107
views
computernetworks
subnetting
virtualgatetestseries
+1
vote
0
answers
24
Virtual Gate Test Series: Calculus  Definite Integration
$\int \limits_0^1 (1 + y^2)^{1.5} dy=?$
asked
Jan 31, 2018
in
Calculus
by
Utsav09
Active
(
1.2k
points)

104
views
engineeringmathematics
calculus
integration
definiteintegration
virtualgatetestseries
0
votes
0
answers
25
Virtual Gate Test Series: Discrete Mathematics  Propositional Logic
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, 2018
in
Mathematical Logic
by
Utsav09
Active
(
1.2k
points)

50
views
discretemathematics
mathematicallogic
virtualgatetestseries
+3
votes
2
answers
26
Virtual Gate Test Series: Theory Of Computation  Languages
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 ... $L1$ is regular and $L2$ is contextfree. $L1$ and $L2$ both may not be contextfree.
asked
Jan 27, 2018
in
Theory of Computation
by
Utsav09
Active
(
1.2k
points)

125
views
theoryofcomputation
identifyclasslanguage
virtualgatetestseries
+1
vote
0
answers
27
Virtual Gate Test Series: Theory Of Computation  Homomorphic Image
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$ ... 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, 2018
in
Theory of Computation
by
Rishabh Gupta 2
Boss
(
16.4k
points)

82
views
theoryofcomputation
homomorphism
virtualgatetestseries
+1
vote
0
answers
28
Virtual Gate Test Series: Databases  Sql query
Consider the following instance R. A 1 2 3 4 B Null 1 2 2 The number of tuples returned by the following SQL query is _____________. > select * from R as R1 where not exists (select * from R) where B = R1.A
asked
Jan 10, 2018
in
Databases
by
Naveen K Verma
(
205
points)

120
views
databases
sql
virtualgatetestseries
+1
vote
0
answers
29
Virtual Gate Test Series: Compiler Design  Directed Acyclic Graph
What would be SDT for this I want to verify the answer.
asked
Jan 10, 2018
in
Compiler Design
by
Sandeep Suri
Active
(
3.9k
points)

44
views
compilerdesign
syntaxdirectedtranslation
directedacyclicgraph
virtualgatetestseries
+4
votes
2
answers
30
Virtual Gate Test Series: Digital Logic  Flip Flops
asked
Nov 13, 2017
in
Digital Logic
by
Manoja Rajalakshmi A
Boss
(
11k
points)

243
views
digitallogic
sequentialcircuit
flipflop
circuitoutput
virtualgatetestseries
Page:
1
2
3
4
5
6
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 day that made me an IIScian :)
Unanswered Previous year GATE/TIFR questions
From being a Failure to getting into IISc  (Rank 888, Score 692)
My interview experience at IITs/IISc
IIT Delhi CSE Mtech interview 14 may
Follow @csegate
Recent questions tagged virtualgatetestseries
Recent Blog Comments
a heartiest congratulations mam :)
Congratulations
Thank you
Very Nice. Congratulations ))👍
Congratulations 👍 Very nice experience 😊
49,541
questions
54,080
answers
187,200
comments
70,990
users