Recent activity by rishabhgupta12 / GATE Overflow for GATE CSE

6 answers

1

GATE CSE 2010 | Question: 45
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$ ... $P0$ print '$0$'? At least twice Exactly twice Exactly thrice Exactly once

The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$$$\begin{array}{|l|l|}\hli...

26.3k views

commented Aug 17, 2021

4 answers

2

GATE CSE 2020 | Question: 18
Let $G$ be a group of $35$ elements. Then the largest possible size of a subgroup of $G$ other than $G$ itself is _______.

Let $G$ be a group of $35$ elements. Then the largest possible size of a subgroup of $G$ other than $G$ itself is _______.

9.4k views

commented May 12, 2021

2 answers

3

GATE CSE 1990 | Question: 3-xi
A graph is planar if and only if, It does not contain a subgraph homeomorphic to $k_{5}$ and $k_{3, 3}$. It does not contain a subgraph isomorphic to $k_{5}$ and $k_{3, 3}$. It does not contain a subgraph isomorphic to $k_{5}$ or $k_{3, 3}$ It does not contain a subgraph homeomorphic to $k_{5}$ or $k_{3, 3}$.

A graph is planar if and only if,It does not contain a subgraph homeomorphic to $k_{5}$ and $k_{3, 3}$.It does not contain a subgraph isomorphic to $k_{5}$ and $k_{3, 3}$...

12.6k views

commented May 7, 2021

1 answer

4

GATE CSE 2021 Set 2 | Question: 21
A data file consisting of $1,50,000$ student-records is stored on a hard disk with block size of $4096$ bytes. The data file is sorted on the primary key $\textrm{RollNo}$. The size of a record pointer for this disk is $7$ bytes. ... that the records of data file and index file are not split across disk blocks. The number of blocks in the index file is ________

A data file consisting of $1,50,000$ student-records is stored on a hard disk with block size of $4096$ bytes. The data file is sorted on the primary key $\textrm{RollNo}...

9.2k views

comment edited May 3, 2021

2 answers

5

GATE CSE 2021 Set 1 | Question: 15
Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file metadata, such as the list of pointers to the data blocks. Consider a given directory ... $\textsf{foo}$ Renaming of an existing file in $\textsf{foo}$ Opening of an existing file in $\textsf{foo}$

Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file meta...

8.5k views

commented May 1, 2021

6 answers

6

GATE CSE 2001 | Question: 2.23
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition? $A \rightarrow B, B \rightarrow CD$ $A \rightarrow B, B \rightarrow C, C \rightarrow D$ $ AB \rightarrow C, C \rightarrow AD$ $A \rightarrow BCD$

$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition?$A \rightarrow B, B \rightarrow CD$$A \righta...

52.3k views

commented Apr 23, 2021

18 answers

7

GATE CSE 2017 Set 2 | Question: 44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______

Two transactions $T_1$ and $T_2$ are given as$T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$$T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$where $r_i(V)$ denotes a $\textit{read}$ operation by transaction...

72.8k views

commented Apr 16, 2021

5 answers

8

Number of conflict serializable schedules
Number of conflict serializable schedules in T1 : R(A) W(A) R(B) W(B) T2: R(A) W(A) R(B) W(B)

Number of conflict serializable schedules inT1 : R(A) W(A) R(B) W(B)T2: R(A) W(A) R(B) W(B)

4.1k views

commented Apr 16, 2021

5 answers

9

transaction cascadeless
is this is cascadeless? r1(X),w2(X),w1(X), abort2, commit1

is this is cascadeless?r1(X),w2(X),w1(X), abort2, commit1

1.5k views

answered Apr 15, 2021

3 answers

10

GATE CSE 1987 | Question: 1-xxiii
A square matrix is singular whenever The rows are linearly independent The columns are linearly independent The row are linearly dependent None of the above

A square matrix is singular whenever The rows are linearly independentThe columns are linearly independentThe row are linearly dependentNone of the above

5.6k views

commented Apr 14, 2021

0 answers

11

NPTEL
/* sizeof(int)=4; sizeof(float)=8; sizeof(unsigned char)=1 ; */ What is the output of the following program ? #include<iostream> #include<stdio.h> using namespace std; int main(){ union Data{ int i; float f; unsigned char str[20]; }data; printf("size =%d\n",sizeof(data)); data.i=10; data.f=220.5; printf("data.i: %d\n",data.i); return 0; }

/* sizeof(int)=4;sizeof(float)=8;sizeof(unsigned char)=1 ; */What is the output of the following program ?#include<iostream>#include<stdio.h>using namespace std;int m...

728 views

commented Sep 10, 2018

0 answers

12

Linked list
Function to reverse the circular doubly linked list. Why is this function showing an error? head is a global variable. void reverse() { struct node *z; struct node *t = head -> forw; while(t != head) { z=t->back; t->back=t->forw; t->forw=z; t = t -> back; } z=t->back; t->back=t->forw; t->forw=z; head=t->forw; }

Function to reverse the circular doubly linked list.Why is this function showing an error?head is a global variable.void reverse() { struct node *z; struct node *t = h...

816 views

commented Aug 6, 2018

2 answers

13

Linked list
How to trace the below program? p and q are the starting address of two different linked list struct node*Do(struct node*p,struct node*q){ struct node*ps,*qs; if(!p){ return(q); } else if(!q){ return(p); } else{ ps=p->link; qs=q->link; p->link=q; q->link=Do(ps,qs); return(p); } }

How to trace the below program?p and q are the starting address of two different linked list struct node*Do(struct node*p,struct node*q){ struct node*ps,*qs; if(!p...

910 views

commented Aug 3, 2018

3 answers

14

C programming
How many times will the loop execute? What is the general expression in terms of 'n'? for( i=1; i<=n; i=i*3) { for( j=i; j<=n; j++) { printf ( "ravi"); } }

How many times will the loop execute?What is the general expression in terms of 'n'?for( i=1; i<=n; i=i*3) { for( j=i; j<=n; j++) { printf ...

543 views

commented Jul 19, 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