Questions by adityaaswal / GATE Overflow for GATE CSE

0 votes

0 answers

1

DBMS SUBJECT TEST
Let Depositor and Lender be relational schemas such that Depositor = {a/c number, cname , balance, branch} and Lender ={loan_number ,cname, amount , branch}. Now consider the following queries on the database : Query 1 : ( t | ∃D ∈Depositor ( t ... cname where D.cname = L.cname(Containing duplicates) PS: I'll merge this with the original question when my doubts are cleared

Let Depositor and Lender be relational schemas such that Depositor = {a/c number, cname , balance, branch} and Lender ={loan_number ,cname, amount , branch}. Now consider...

616 views

asked Mar 12, 2019

2 votes

1 answer

2

nptel pdf
Q Consider a relation R(a, b, c) ordered on a non-key attribute b, and an index is maintained on attribute c. To evaluate the following expression, which is a better order of operation? σ(b= abc'∧c=12)(R) A. First filter tuples using index on c and ... search tuples for the given value of b and then use index on c C. The order of operation does not matter D. Insufficient data to answer

Q Consider a relation R(a, b, c) ordered on a non-key attribute b, and an index is maintained on attribute c. To evaluate the following expression, which is a better orde...

681 views

asked Mar 12, 2019

0 votes

0 answers

3

MadeEasy Subject Test 2019: Algorithms - Dynamic Programming
Let G = (V,E) be a directed graph.Each edge of G is represented as (i,j) with length l[i,j].If there is no edge from i to j then l[i,j] = (IMAGE ATTACHED)

Let G = (V,E) be a directed graph.Each edge of G is represented as (i,j) with length l[i,j].If there is no edge from i to j then l[i,j] = (IMAGE ATTACHED)

538 views

asked Nov 30, 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