Recent activity by shub2204 / GATE Overflow for GATE CSE

8 answers

1

GATE CSE 2012 | Question: 32
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X$. It is used in the pseudocode shown below to implement ... take on a non-zero value when the lock is actually available works correctly but may starve some processes works correctly without starvation

Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X...

30.1k views

answered Mar 22

2 answers

2

Graph theory
Stmt 1: A simple graph is necessarily connected if |E| > (n-1)*(n-2)/2. Stmt2: A simple graph with n vertices and k components has at least n-k edges. Can you please explain how are these results derived?

Stmt 1: A simple graph is necessarily connected if |E| (n-1)*(n-2)/2.Stmt2: A simple graph with n vertices and k components has at least n-k edges.Can you please explain...

2.4k views

answered Oct 4, 2023

7 answers

3

GATE CSE 2019 | Question: 30
Consider three $4$-variable functions $f_1, f_2$, and $f_3$, which are expressed in sum-of-minterms as $f_1=\Sigma(0,2,5,8,14),$ $f_2=\Sigma(2,3,6,8,14,15),$ $f_3=\Sigma (2,7,11,14)$ For the following circuit with one AND gate and one XOR gate the output function $f$ can be ... as: $\Sigma(7,8,11)$ $\Sigma (2,7,8,11,14)$ $\Sigma (2,14)$ $\Sigma (0,2,3,5,6,7,8,11,14,15)$

Consider three $4$-variable functions $f_1, f_2$, and $f_3$, which are expressed in sum-of-minterms as$f_1=\Sigma(0,2,5,8,14),$$f_2=\Sigma(2,3,6,8,14,15),$$f_3=\Sigma (2,...

14.5k views

commented Jul 17, 2023

1 answer

4

#Combinatorics #Self doubt
How many 3 digits number are there which are divisible by 3 and repetition of digits NOT allowed.?

How many 3 digits number are there which are divisible by 3 and repetition of digits NOT allowed.?

508 views

commented Feb 21, 2023

2 answers

5

Set Theory
We have a set of cardinality 7. Suppose P is the power set of S. We have a subset of Power set, Ps such that every pair of elements (a, b) in subset is such that, either a is a subset of b or b is a subset of a. What could be the max cardinality of Ps?

We have a set of cardinality 7. Suppose P is the power set of S. We have a subset of Power set, Ps such that every pair of elements (a, b) in subset is such that, either ...

398 views

answered Dec 15, 2022

1 answer

6

DSA
Given two max heap, one of size n and other m. Calculate the time complexity of merging them to get a max heap.

Given two max heap, one of size n and other m. Calculate the time complexity of merging them to get a max heap.

910 views

commented Dec 7, 2022

1 answer

7

Random
Consider a 15 element min-heap which follows these conditions. right child of root is7 and one child of node 3 is 9. Calculate how many min heap possible?

Consider a 15 element min-heap which follows these conditions.right child of root is7 and one child of node 3 is 9. Calculate how many min heap possible?

680 views

commented Dec 1, 2022

2 answers

8

Made Easy test series DS
Consider a binary tree where for every node ⏐P – Q⏐ ≤ 2. P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for h > 0. The minimum number of nodes present in such binary tree of height h = 4 _________. (Assume root is at height 0)

Consider a binary tree where for every node ⏐P – Q⏐ ≤ 2. P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right su...

2.5k views

commented Nov 15, 2022

1 answer

9

Cormen Edition 3 Exercise 11.4 Question 3 (Page No. 277)
Consider an open-address hash table with uniform hashing. Give upper bounds on the expected number of probes in an unsuccessful search and on the expected number of probes in a successful search when the load factor is $3/4$ and when it is $7/8$.

Consider an open-address hash table with uniform hashing. Give upper bounds on the expected number of probes in an unsuccessful search and on the expected number of probe...

466 views

answered Sep 15, 2022

1 answer

10

Data structure: hashing
A hash table has spaces for 50 records. Then the probability of collision before the table is 10% full is_______. 10% of 50 = 5, so we need to find the probability of collision before we insert 5 slots. *When hash table empty, prob. of ... no. of slots = 200 then probability = 0.95 Why probability of collision is increasing very rapidly? Please give a detailed explanation.

A hash table has spaces for 50 records. Then the probability of collision before the table is 10% full is_______.10% of 50 = 5, so we need to find the probability of coll...

906 views

commented Sep 15, 2022

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