Register

Recent questions tagged virtual-gate-test-series

2 2 votes
2 answers 2 answers
1.2k
1.2k views
Gate cse Ace test series
User Avatar
1 1 vote
0 0 answers
521
521 views
From where to practice questions for Data Science and AI paper of GATE 2024?
Which resources to follow to practice questions for DS and AI paper of GATE 2024?Which resources to follow?where to find themQuestions for Mathematics and questions for A...
User Avatar
1 1 vote
1 1 answer
1.4k
1.4k views
MadeEasy Question
Consider the function f(x,y, z) = (x + y) + (yz+ y’z’ +y’z)If a is minimum number of AND gates required.If b is minimum number of OR gates required.And c is minimum numbe...
User Avatar
0 0 votes
1 answers 1 answer
625
625 views
Discrete-mathematics | Mathematical-logic
Which of the following predicate is/are valid? S1: $\forall x(A(x)\Leftrightarrow B(x))\Rightarrow \exists x(A(x)\Rightarrow B(x))$ S2: $\exists x(A(x)\vee B(x))\Le...
User Avatar
0 0 votes
1 1 answer
892
892 views
Aptitude | Gate Test Series
User Avatar
0 0 votes
0 0 answers
743
743 views
gate academy
I think S1 is false because, for n=0, no 0’s will be added in stack, but in the transition to the next state (q2->q3) there is one mandatory 1 canceling out 0 in stack w...
User Avatar
0 0 votes
3 3 answers
1.1k
1.1k views
Applied Test Series: Mock
Consider the following schedule S:S: R3(A), W2(A), R1(A), W3(A), W1(A);The possible number of view serializable schedules of the schedule S (other than S) are _____Can so...
User Avatar
0 0 votes
1 1 answer
578
578 views
Practice Problems in DBMS
I have a small doubt regarding, determining the highest normal form category, for 2NF as per the rule we know, that, for the given candidate key, no proper subset of cand...
User Avatar
2 2 votes
2 2 answers
5.4k
5.4k views
Virtual Gate Test Series: Operating System - Fork-Join 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 countS7...
User Avatar
1 1 vote
1 1 answer
3.4k
3.4k views
Virtual Gate Test Series: Databases - ER to Relational Model
how many tables are required?
User Avatar
0 0 votes
0 0 answers
2.6k
2.6k views
Virtual Gate Test Series: Databases - Schedules
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'...
User Avatar
2 2 votes
1 answers 1 answer
5.7k
5.7k views
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 o...
User Avatar
1 1 vote
2 2 answers
1.3k
1.3k views
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$ isRegularRecursive but not context freeContext Free but not regula...
User Avatar
0 0 votes
0 0 answers
775
775 views
Virtual GATE
Let A be a regular set. Consider the two sets belowL1={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...
User Avatar
0 0 votes
2 2 answers
2.8k
2.8k views
Virtual Gate Test Series: Databases - Schedule
Which of the following is/are true?I. Every strict schedule is cascade less schedule and recoverable scheduleII. Every cascade less schedule is recoverable scheduleIII. E...
User Avatar
1 1 vote
1 answers 1 answer
655
655 views
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 ∈...
User Avatar
1 1 vote
1 1 answer
695
695 views
Virtual Gate Test Series: CO & Architecture - Pipelining
Consider the unpipelined machine with $10$ nanoseconds clock cycles. It uses four cycles for ALU operations and branch whereas 5 cycles for memory operation. Assume that ...
User Avatar
0 0 votes
1 1 answer
1.1k
1.1k views
Virtual Gate Test Series: Algorithms - Graphs
User Avatar
1 1 vote
1 1 answer
1.3k
1.3k views
Virtual Gate Test Series: Discrete Mathematics - Graph Theory
Let $G$ be a graph on $n$ vertices with $4n-16$ edges.Consider the following:1. There is a vertex of degree smaller than $8$ in $G.$2. There is a vertex such that there a...
User Avatar
1 1 vote
0 0 answers
1.3k
1.3k views
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 formal...
User Avatar
0 0 votes
1 1 answer
705
705 views
Virtual Gate
User Avatar
1 1 vote
1 1 answer
934
934 views
Virtual Gate Test Series: Linear Algebra - Eigen Value
User Avatar
1 1 vote
1 1 answer
887
887 views
Virtual Gate Test Series: Discrete Mathematics - Set Theory & Algebra - Groups
User Avatar
2 2 votes
1 answers 1 answer
1.7k
1.7k views
Virtual Gate Test Series: Discrete Mathematics - Graph Theory
Consider the following two statements$:$The two graphs $G_{1}$ and $G_{2}$ are isomorphicEach of $G_{1}$ and $G_{2}$ are self-dual. Both $(i)$ and $(ii)$ are trueOnly $(i...
User Avatar
0 0 votes
1 1 answer
821
821 views
Virtual Gate Test Series: Calculus
i have solved it by putting the values
User Avatar
4 4 votes
3 3 answers
1.9k
1.9k views
Virtual Gate Test Series: Linear Algebra - Rank Of The Matrix
User Avatar
Page: