Recent activity by skywalker_19 / GATE Overflow for GATE CSE

3 answers

1

GATE CSE 2018 | Question: 28
Consider the first-order logic sentence $\varphi \equiv \exists \: s \: \exists \: t \: \exists \: u \: \forall \: v \: \forall \: w \forall \: x \: \forall \: y \: \psi(s, t, u, v, w, x, y)$ ... or equal to $3$ There exists no model of $\varphi$ with universe size of greater than $7$ Every model of $\varphi$ has a universe of size equal to $7$

Consider the first-order logic sentence$$\varphi \equiv \exists \: s \: \exists \: t \: \exists \: u \: \forall \: v \: \forall \: w \forall \: x \: \forall \: y \: \psi(...

22.4k views

commented Aug 5, 2019

1 answer

2

Indexing
How to prove that if same size blocks are allocated to B trees and B+ trees then:- No. of index nodes in B tree >= No. Of index nodes in B+ tree

How to prove that if same size blocks are allocated to B trees and B+ trees then:-No. of index nodes in B tree >= No. Of index nodes in B+ tree

673 views

answer selected Feb 23, 2019

0 answers

3

Operating Systems
To check that a mutual exclusion algorithm is not free from deadlock,is it necessary to check if the entire processes in the system are in deadlock- If there are 5 processes in the system- P0,P1,P2,P3,P4 and if we have to prove that the ... definitely in deadlock- This means it is not necessary for all processes in the system to be in deadlock to say deadlock has occurred?

To check that a mutual exclusion algorithm is not free from deadlock,is it necessary to check if the entire processes in the system are in deadlock-If there are 5 proces...

287 views

asked Oct 23, 2018

1 answer

4

Korth
In a self referential relationship many to many relationship set, how minimum many tables are required to store in case of partial participation. Example: If an employee can report to several managers and manager can supervise any number of employees- Shouldn't it be 1 table with compose candidate key as Eid,Supid

In a self referential relationship many to many relationship set, how minimum many tables are required to store in case of partial participation. Example: If an employee ...

973 views

commented Oct 3, 2018

3 answers

5

GATE CSE 2000 | Question: 15
Suppose you are given arrays $p [1......N]$ and $q [1......N]$ both uninitialized, that is, each location may contain an arbitrary value), and a variable count, initialized to $0$. Consider the following procedures $set$ and $is\_set$: set(i) { count ... $set(i)$ has not been called for some $i$, then regardless of what $p[i]$ contains, $is\_set(i)$ will return false.

Suppose you are given arrays $p [1......N]$ and $q [1......N]$ both uninitialized, that is, each location may contain an arbitrary value), and a variable count, initiali...

4.9k views

commented Apr 23, 2018

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