Search results for virtual-gate / GATE Overflow for GATE CSE

2 votes

2 answers

1

Gate cse Ace test series

dheerajgudipati

333 views

dheerajgudipati asked Jan 3

1 votes

0 answers

2

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 them Questions for Mathematics and questions for AI? A bit of help on that would be much appreciated

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...

rajveer43

206 views

rajveer43 asked Dec 10, 2023

1 votes

1 answer

3

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 number of NOR gates required. What is the value of (a +b) - c,

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...

Rohit Chakraborty

635 views

Rohit Chakraborty asked Apr 4, 2023

0 votes

1 answer

4

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))\Leftrightarrow (\exists xA(x)\vee\exists xB(x))$ A. only S1 B. only S2 C. Both D. None

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...

Jay Patel 009

371 views

Jay Patel 009 asked Mar 31, 2023

0 votes

1 answer

5

Aptitude | Gate Test Series

abhinowKatore

489 views

abhinowKatore asked Jan 17, 2023

2 votes

0 answers

6

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 which will be absent in case of n=0. But solutions say S1 is true.

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...

h4kr

328 views

h4kr asked Nov 20, 2022

1 votes

8 answers

7

Virtual Gate Test Series: Digital Logic - NAND Gates
The minimum number of $2$-input $NAND$ gates required to implement the function $F = (x' + y')(z + w)$ is ______

The minimum number of $2$-input $NAND$ gates required to implement the function $F = (x' + y')(z + w)$ is ______

Hradesh patel

15.4k views

Hradesh patel asked Oct 5, 2016

2 votes

3 answers

8

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

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 subnetworkii. Cl...

Utsav09

940 views

Utsav09 asked Jan 31, 2018

2 votes

2 answers

9

Virtual Gate Test Series: Digital Logic - Multiplexer

Manoja Rajalakshmi A

430 views

Manoja Rajalakshmi A asked Nov 12, 2017

2 votes

2 answers

10

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 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?

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...

aditi19

3.9k views

aditi19 asked Jun 12, 2019

0 votes

2 answers

11

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 someone help me in this.

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...

ramakrushna

476 views

ramakrushna asked Dec 22, 2021

0 votes

1 answer

12

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

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 satis...

Utsav09

331 views

Utsav09 asked Jan 31, 2018

0 votes

1 answer

13

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 candidate key should determine non prime key. Consider the example here, for ... candidate key, so why above Relation is consider as in 2NF. Thankyou very much in advance for clearing my doubt. #DBMS #Gate

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...

Agent24

281 views

Agent24 asked Oct 1, 2021

1 votes

1 answer

14

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

Consider the following instance R.A1234BNull122The number of tuples returned by the following SQL query is _____________. select * from R as R1 where not exists (select...

Naveen K Verma

715 views

Naveen K Verma asked Jan 10, 2018

2 votes

1 answer

15

Virtual Gate Test Series: Digital Logic - Carry Look Ahead Adder
In a $4-$bit carry look ahead adder, the propagation delay of EX-OR gate is $20ns,$ AND and OR gates is $10ns.$ The sum and carry output of full adder takes $20ns$ and $10ns$ respectively. The total propagation delay of the above adder in $ns$ is

In a $4-$bit carry look ahead adder, the propagation delay of EX-OR gate is $20ns,$ AND and OR gates is $10ns.$ The sum and carry output of full adder takes $20ns$ and $1...

Hradesh patel

846 views

Hradesh patel asked Oct 5, 2016

0 votes

1 answer

16

Virtual Gate Test Series: Calculus
i have solved it by putting the values

i have solved it by putting the values

Prince Sindhiya

428 views

Prince Sindhiya asked Oct 15, 2018

1 votes

3 answers

17

Algorithm :- Hashing
Consider a hash table consisting of M=11 slots, and suppose integer key value are hashed into the table using hash function h1: int h1(int key) { x = (key + 5)*(key + 5); x = x/6; x = x + key; x = x%11; return x; } Suppose that collisions are resolved ... have been inserted in the given order: 43, 23, 1, 0, 15, 31, 4, 7, 11, 3 Source:- http://www.techtud.com/example/hashing

Consider a hash table consisting of M=11 slots, and suppose integer key value are hashed into the table using hash function h1:int h1(int key) { x = (key + 5)*(key + ...

rahul sharma 5

2.9k views

rahul sharma 5 asked Sep 27, 2017

1 votes

1 answer

18

Virtual Gate Test Series: Discrete Mathematics - Set Theory & Algebra - Groups

Prince Sindhiya

587 views

Prince Sindhiya asked Oct 15, 2018

4 votes

3 answers

19

Virtual Gate Test Series: Computer Networks - Distance Vector Routing Algorithm
Consider a router is working based on the Distance Vector Routing Algorithm. Consider the five-node network of the following figure. Assume all nodes building distance from that node to $A$ (number of hops) and after initial set up, suddenly either $A$ goes down ... $(C) B - 4, C - 5, D - 4, E - 5$ $(D)$ None

Consider a router is working based on the Distance Vector Routing Algorithm. Consider the five-node network of the following figure.Assume all nodes building distance fro...

Na462

1.5k views

Na462 asked Nov 11, 2017

3 votes

2 answers

20

Virtual Gate Test Series: Computer Networks - Subnet Mask(Host Id)
In a class $C$ address, $3$ bits are borrowed for subnetting of host id part. Total possible number of subnet masks are _________________.

In a class $C$ address, $3$ bits are borrowed for subnetting of host id part. Total possible number of subnet masks are _________________.

Na462

618 views

Na462 asked Nov 11, 2017

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