1.Find the marks in increasing order of all students a) SELECT reg#, marks FROM student ORDER BY marks; b) SELECT reg# FROM student ORDER BY marks; c) SELECT reg#, marks FROM student; d) SELECT reg#, marks FROM student ORDER BY reg#; 2.Find the EmpIds of employees with name and city whose city is neither RYK nor LHR a )SELECT empid, name,city FROM emp WHERE city NOT IN ('RYK', 'LHR'); b) SELECT empid, name,city FROM emp WHERE city NOT BETWEEN ('RYK', 'LHR'); c) SELECT empid, name,city FROM emp WHERE city BETWEEN ('RYK', 'LHR'); d) SELECT empid, name,city FROM emp WHERE city IN ('RYK', 'LHR'); 3.Keeps specified tuples and discards the others: a) Join b) None c) Select d) Project 4.If  A,B-> C,D,E   and  B -> E  are functional dependencies of the relation R(A,B,C,D,E) Then identify the best normal form of the given relation R. a) 2NF b) BCN c)3NF d)1NF 5.If  a3-> a1,a2,a4 is a functional dependency of the relation A(a1,a2,a3,a4) Then identify the best highest normal form of the given relation A. a) 2NF b)1NF c)3NF d)BCNF

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

DATABASE SYSTEMS 

1.Find the marks in increasing order of all students

a) SELECT reg#, marks FROM student ORDER BY marks;

b) SELECT reg# FROM student ORDER BY marks;

c) SELECT reg#, marks FROM student;

d) SELECT reg#, marks FROM student ORDER BY reg#;

2.Find the EmpIds of employees with name and city whose city is neither RYK nor LHR

a )SELECT empid, name,city FROM emp WHERE city NOT IN ('RYK', 'LHR');

b) SELECT empid, name,city FROM emp WHERE city NOT BETWEEN ('RYK', 'LHR');

c) SELECT empid, name,city FROM emp WHERE city BETWEEN ('RYK', 'LHR');

d) SELECT empid, name,city FROM emp WHERE city IN ('RYK', 'LHR');

3.Keeps specified tuples and discards the others:

a) Join

b) None

c) Select

d) Project

4.If  A,B-> C,D,E   and  B -> E  are functional dependencies of the relation R(A,B,C,D,E)

Then identify the best normal form of the given relation R.

a) 2NF

b) BCN

c)3NF

d)1NF

5.If  a3-> a1,a2,a4 is a functional dependency of the relation A(a1,a2,a3,a4)

Then identify the best highest normal form of the given relation A.

a) 2NF

b)1NF

c)3NF

d)BCNF

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Similar questions
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY