Answers by rawan / GATE Overflow for GATE CSE

0 votes

1

GATE CSE 1998 | Question: 27
Consider the following relational database schemes: COURSES (Cno, Name) PRE_REQ(Cno, Pre_Cno) COMPLETED (Student_no, Cno) COURSES gives the number and name of all the available courses. PRE_REQ gives the information about which courses are pre- ... relational algebra: List all the courses for which a student with Student_no 2310 has completed all the pre-requisites.

Consider the following relational database schemes:COURSES (Cno, Name)PRE_REQ(Cno, Pre_Cno)COMPLETED (Student_no, Cno)COURSES gives the number and name of all the availab...

8.1k views

answered Jul 15, 2019

0 votes

2

Context Free Grammar
Is 0^n 1^n 0^n 1^n where n>=0 a CFG ? Its given that its not CFG , please explain how ?

Is 0^n 1^n 0^n 1^n where n>=0 a CFG ? Its given that its not CFG , please explain how ?

284 views

answered Dec 23, 2018

1 votes

3

[Personal Doubt] View Serializability
Is every serializable schedule view serializable?, or like conflict serializable, there could be a serializable schedule which isn’t view serializable?

Is every serializable schedule view serializable?, or like conflict serializable, there could be a serializable schedule which isn’t view serializable?

306 views

answered Dec 23, 2018

2 votes

4

GATE CSE 2012 | Question: 27
Consider the following transactions with data items $P$ and $Q$ initialized to zero: ${\begin{array}{|c|l|r|c|}\hline \textbf{$ ... leads to a serializable schedule a schedule that is not conflict serializable a conflict serializable schedule a schedule for which a precedence graph cannot be drawn

Consider the following transactions with data items $P$ and $Q$ initialized to zero:$${\begin{array}{|c|l|r|c|}\hline \textbf{$T_1$}& \text{read (P);}\\ & \text{read...

22.8k views

answered Dec 23, 2018

1 votes

5

GATE CSE 1997 | Question: 15
Consider the following function. Function F(n, m:integer):integer; begin if (n<=0) or (m<=0) then F:=1 else F:F(n-1, m) + F(n, m-1); end; Use the recurrence relation ... value of $F(n, m)$? How many recursive calls are made to the function $F$, including the original call, when evaluating $F(n, m)$.

Consider the following function.Function F(n, m:integer):integer; begin if (n<=0) or (m<=0) then F:=1 else F:F(n-1, m) + F(n, m-1); end;Use the recurrence relation $\beg...

4.6k views

answered Aug 31, 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