MindStudy - MindStudy

Question:

Published on: 23 January, 2022

Consider the following relations and write down expressions for the following queries:

EMP (eid, ename, age, address, salary)

Works (eid, did, hours)

Dept (did, dname, managerid)

List the names of employees who work for the ‘Research’ department for 8 hours using Relational Algebra.
List the name and address of all employees with department number 5 using Relational Calculas.
Find the managerid of managers who manage only departments with budgets greater than 1 lac using SQL.
Find the employee who has highest salary using SQL.

Answer:

Insufficient information. We are just assuming the Relation Works as Works (eid, did, hours, budget).

Hence the answer will be as follows:

Subjects

Compiler Design Database Management System Data Structures & Algorithm C Programming and Practices Design and Analysis of Algorithm Mobile computing

Trending

Write the rules of DBA.

3 December, 2024

Write short notes: B tree

3 December, 2024

Let R (ABCDE) be a relation schema and consider the following functional dependencies F = { AB→ E, AD→B, B→ C, C →D}. Find out the candidate key.

3 December, 2024

Let T1, T2, T3 be transactions that operate on the same data items A, B, C. Let r1(A) means that T1 reads A, w1(A) means that T1 writes A and so on for T2 and T3. Consider the following schedule: S1: r2(C), r2(B), w2(B), r3(C), r1(A), w1(A), w3(B), w3(C), r2(A), r1(B), w1(B), w2(A). Is the schedule serializable and why?

3 December, 2024

Describe the wait-die and wound-wait protocols for deadlock prevention. Define three concurrency problems: dirty read, non-repeatable read, phantoms.

3 December, 2024

Mid-Point Circle Drawing Algorithm