Midterm Examination CS 265 Spring 2015 Name: I will not use notes, other exams, or any source other than my own brain on this exam: (please sign)
|
|
- Alan Bishop
- 6 years ago
- Views:
Transcription
1 Midterm Examination CS 265 Spring 2015 Name: I will not use notes, other exams, or any source other than my own brain on this exam: (please sign 1. (5 pts You have two relations R = [C, F, G] and P = [B, C, D, F, H]. Using only relational algebra operators of selection (σ and cross product (X, express the natural join of R and P. 2. (5 pts Consider the relational schema, R = [C S J D P Q V K ] with FDs J,P à C S,D à P J à S C à S,J,D,P,Q,V Key(s: Give all keys for this relational schema. 3. (5 pts Consider the relation P with 5 attributes, P = [ C D E F G ]. You are given the following functional dependencies: C,D! E and F,G! C,D. Give a dependency-preserving decomposition of P where each relation of the decomposition is in BCNF. Your decomposition should have as few relations as possible, while still satisfying the specifications of the problem. 1
2 4. (5 points Consider the following four table definitions, together with all entries in each of the four tables. CREATE TABLE Customer ( SSN Integer,... PRIMARY KEY (SSN; CREATE TABLE Product ( ProdID Integer,... PRIMARY KEY (ProdId; Customer SSN... Ssn1... Ssn2... Ssn3... CREATE TABLE Account ( SSN Integer NOT NULL, AccntNo Integer,... PRIMARY KEY (AccntNo, FOREIGN KEY (SSN REFERENCES Customer ON DELETE CASCADE; Product ProdID... Pid1... Pid2... Pid3... CREATE TABLE Transaction ( TransID Integer, AccntNo Integer, ProdId Integer,... PRIMARY KEY (TransID, FOREIGN KEY (AccntNo REFERENCES Account ON DELETE NO ACTION, FOREIGN KEY (ProdId REFERENCES Product ON DELETE NO ACTION; Account SSN AccntNo... Ssn1 Acct1... Ssn2 Acct4... Ssn1 Acct2... Transaction TransID AcctNo ProdID... Tid1 Acct6 Pid3... Tid2 Acct3 Pid2... Tid3 Acct3 Pid3... Ssn2 Acct3... Ssn2 Acct5... Cross out all rows of each table that are deleted as a result of performing these delete operations in order (if you are using a pen, go slow: Ssn3 Acct6... DELETE FROM Transaction WHERE ProdID = Pid3; DELETE FROM Customer WHERE SSN = Ssn1; DELETE FROM Customer WHERE SSN = Ssn2; DELETE FROM Customer WHERE SSN = Ssn3; DELETE FROM Product WHERE ProdID = Pid1; DELETE FROM Product WHERE ProdID = Pid2; DELETE FROM Product WHERE ProdID = Pid3; 2
3 5. (5 pts Consider the UML fragment to the right and identify (circle all equivalent table translations (i.e., those translations that faithfully enforce the constraints implied by the UML without regard to elegance from those given below. You might receive partial credit for a brief explanation of your choices. X 0..* UNIQUE(y implies that y NOT NULL, but not vice versa. PK stands for PRIMARY KEY. FK stands for FOREIGN KEY. x1 PK R r Z z1 PK (A (B (C (D (E CREATE TABLE X ( x1, PK (x1, FK (x1 refs R CREATE TABLE R ( x1, r1, z1 NOT NULL, PK(x1, FK (z1 refs Z, FK (x1 refs X z1, PK (z1 CREATE TABLE X ( x1, PK (x1 CREATE TABLE R ( x1, r1, z1 NOT NULL, PK(x1, FK (z1 refs Z, FK (x1 refs X z1 PK (z1 CREATE TABLE XR ( x1, r1, z1, PK(x1, FK (z1 refs Z z1, PK(z1 CREATE TABLE XR ( x1, r1, z1 NOT NULL, PK(x1, FK (z1 refs Z z1, PK(z1 CREATE TABLE XR ( x1, r1, z1, PK(x1, UNIQUE(z1, FK (z1 refs Z z1, PK(z1 (F None of the above 3
4 6. (5 pts Consider the following table definitions: CREATE TABLE RelA (Aid integer, a1 integer, a2 integer, PRIMARY KEY (Aid CREATE TABLE RelB (Aid integer, Cid integer, b1 integer, PRIMARY KEY (Aid, Cid, b1, FOREIGN KEY (Aid REFERENCES RelA, FOREIGN KEY (Cid REFERENCES RelC CREATE TABLE RelC (Cid integer, c1 integer, c2 integer, c3 integer, PRIMARY KEY (Cid Circle all queries below that are equivalent to: π c1 (( Temp1 Temp2 where Temp1 = π Cid (( σ a2=q RelA Temp2 = π Cid (( σ a2=r RelA RelC RelB and RelB By equivalent, we mean produces the same output given the same input (and we are not referring to efficiency or elegance (a SELECT DISTINCT C.c1, RelB B1, RelA A1, RelB B2, RelA A2 WHERE C.Cid = B1.Cid AND B1.Aid = A1.Aid AND C.Cid = B2.Cid AND B2.Aid = A2.Aid AND A1.a2 = q AND A2.a2 = r (b SELECT DISTINCT C.c1, RelB B, RelA A WHERE C.Cid = B.Cid AND B.Aid = A.Aid AND A.a2 = q INTERSECT SELECT DISTINCT C2.c1 2, RelB B2, RelA A2 WHERE C2.Cid = B2.Cid AND B2.Aid = A2.Aid AND A2.a2 = r (c SELECT DISTINCT C.c1 FROM RelA A, RelB B, RelC C WHERE C.Cid = B.Cid AND B.Aid = A.Aid AND A.a2 = q AND C.Cid IN (SELECT C2.Cid 2, RelA A2, RelB B2 WHERE C2.Cid = B2.Cid AND B2.Aid = A2.Aid AND A2.a2 = r (d SELECT DISTINCT C.c1 WHERE C.Cid IN (( SELECT B.Cid FROM RelA A, RelB B WHERE B.Aid = A.Aid AND A.a2 = q INTERSECT (( SELECT B2.Cid FROM RelA A2, RelB B2 WHERE B2.Aid = A2.Aid AND A2.a2 = r (e π c1 (Temp1 RelB RelC where Temp1 = (σ a2=q RelA (σ a2=r RelA (f None of the above 4
5 7. (5 points Consider the two relational schema, SV and VMo, with specific instances, SV i and Vmo i. SV i S V Và S S1 V4 S1 V5 S2 V6 S V Mo Và S V Mo Và Mo V1 Mo1 V2 Mo2 V3 Mo1 V4 Mo3 V5 Mo4 V6 Mo2 V7 Mo3 VMo i S V Mo NULL V1 Mo1 NULL V2 Mo2 NULL V3 Mo1 S1 V4 Mo3 S1 V5 Mo4 S2 V6 Mo2 NULL V7 Mo3 SVMo i For the example above, circle all variations on the outer join in the FROM clause of an SQL query that would produce SVMo i instance of SVMo from the given instances of SV and VMo. (a SV NATURAL RIGHT OUTER JOIN Vmo (b VMo NATURAL LEFT OUTER JOIN SV (c VMo NATURAL RIGHT OUTER JOIN SV (d SV NATURAL LEFT OUTER JOIN Vmo (e SV NATURAL FULL OUTER JOIN Vmo i.e., SELECT S, V, Mo FROM SV NATURAL RIGHT OUTER JOIN VMo (f None of the above 5
6 8. (5 pts Consider the following table definition: CREATE TABLE RelC (Cid integer, c1 integer, c2 integer, c3 integer, PRIMARY KEY (Cid Circle all queries below that are equivalent to the query: SELECT C.c2, AVG (C.c3 AS avc3 WHERE C.c3 > 5 GROUP BY C.c2 HAVING COUNT (* > 1 By equivalent, we mean would return the same result, without concern for efficiency or elogance. (a SELECT C.c2, AVG (C.c3 AS avc3 WHERE C.c3 > 5 AND COUNT(* > 1 GROUP BY C.c2 (b SELECT C.c2, AVG (C.c3 AS avc3 WHERE C.c3 > 5 GROUP BY C.c2 HAVING 1 < (SELECT COUNT (* 2 WHERE C.c2 = C2.c2 AND C2.c3 > 5 (c SELECT C.c2, AVG (C.c3 AS avc3 GROUP BY C.c2 HAVING COUNT(* > 1 AND C.c3 > 5 (d SELECT Temp.c2, Temp.avc3 FROM (SELECT C.c2, AVG (C.c3 AS avc3, COUNT (* AS c2cnt WHERE C.c3 > 5 GROUP BY C.c2 AS Temp WHERE Temp.c2cnt > 1 (e None of the above 6
7 9. (5 pts Circle all options that would correctly enforce a Complete Coverage constraint of Tab (in Tab1 and Tab2 in an SQL translation of the following UML fragment. Tab Tkey PK Tattr Tab1 Tab2 a CREATE ASSERTION CompleteCoverageOfTab1AndTab2 CHECK (SELECT COUNT (DISTINCT Tab.Tkey FROM Tab = (SELECT COUNT (DISTINCT Tab1.Tkey FROM Tab1 + (SELECT COUNT(DISTINCT Tab2.Tkey FROM Tab2 b CREATE ASSERTION CompleteCoverageOfTab1AndTab2 CHECK (NOT EXISTS (SELECT Tab.Tkey FROM Tab EXCEPT SELECT Tab1.Tkey FROM Tab1 EXCEPT SELECT Tab2.Tkey FROM Tab2 c CREATE ASSERTION CompleteCoverageOfTab1AndTab2 CHECK (NOT EXISTS (SELECT Tab.Tkey FROM Tab EXCEPT (SELECT Tab1.Tkey FROM Tab1 UNION SELECT Tab2.Tkey FROM Tab2 d CREATE ASSERTION CompleteCoverageOfTab1AndTab2 CHECK (NOT EXISTS (SELECT Tab.Tkey FROM Tab WHERE Tab.Tkey NOT IN (SELECT Tab1.Tkey FROM Tab1 AND Tab.Tkey NOT IN (SELECT Tab2.Tkey FROM Tab2 e None of the above the primary keys for Tab1 and Tab2 are not specified. 7
8 10. (5 pts Given tables corresponding to these relations of a wholesale business that sells products and collects payments (bills for those products: Account (SSN: integer, AccntNo: integer, balance: real Transaction (AccntNo: integer, ProductId: integer, date: string, bill: real Write a row-level trigger that increments the appropriate balance, as defined by matching AccntNo, in the Account table by the billed value of a newly inserted transaction to the Transaction table. Use as close to SQLite syntax as you can. CREATE TRIGGER UpdateAccountBalance AFTER INSERT ON Transaction FOR EACH ROW /* Complete the Trigger definition */ 8
Midterm Examination CS 265 Spring 2015 Name: KEY Total on any question cannot exceed 5 and cannot be less than 0 JPK, CK, JDK
Midterm Examination CS 265 Spring 2015 Name: KEY Total on any question cannot exceed 5 and cannot be less than 0 I will not use notes, other exams, or any source other than my own brain on this exam: (please
More informationCS x265 Exam 3 Spring ALL questions 5 points, except question 11 I will not use a source other than my brain on this exam: (please sign)
CS x265 Exam 3 Spring 2017 Name: KEY ALL questions 5 points, except question 11 I will not use a source other than my brain on this exam: (please sign) 1. (5 points) Consider the following definitions,
More informationMidterm Examination CS 265 Spring 2016 Name: I will not use notes, other exams, or any source other than my own brain on this exam: (please sign)
Midterm Examination CS 265 Spring 2016 Name: I will not use notes, other exams, or any source other than my own brain on this exam: (please sign 1. (5 pts Consider the relational schema, R = [A B C D E
More informationI will not use a source other than my brain on this exam: (please sign)
Final Exam (CS 265 47 points Name: KEY I will not use a source other than my brain on this exam: (please sign 1. (2 pts Consider CAREFULLY the following table definitions. Remember that these definitions
More informationExam 2 CS 265 Spring 2018 Name: KEY. I will not use notes, other exams, or any source other than my own brain on this exam: (please sign)
Exam CS 65 Spring 018 Name: KEY I will not use notes, other exams, or any source other than my own brain on this exam: (please sign 1. (5 pts Consider the relational schema, R = [C, S, J, D, P, Q, V, K
More informationExam 1 CS x265 Spring 2018 Name: KEY. I will not use notes, other exams, or any source other than my own brain on this exam:
Exam 1 CS x265 Spring 2018 Name: KEY I will not use notes, other exams, or any source other than my own brain on this exam: To students: To request a regrade or to otherwise appeal your score, submit a
More informationDatabase Management Systems Paper Solution
Database Management Systems Paper Solution Following questions have been asked in GATE CS exam. 1. Given the relations employee (name, salary, deptno) and department (deptno, deptname, address) Which of
More informationMidterm Exam #2 (Version B) CS 122A Spring 2018
NAME: SEAT NO.: STUDENT ID: Midterm Exam #2 (Version B) CS 122A Spring 2018 Max. Points: 100 (Please read the instructions carefully) Instructions: - The total time for the exam is 50 minutes; be sure
More informationThink about these queries for exam
Think about these queries for exam Write SQL queries specified below in a manner that is consistent with the table definitions. a) Write a SQL query that lists all of the individual water readings recorded
More informationEECS-3421a: Test #2 Queries
2016 November 9 EECS-3421a: Test #2 w/ answers 1 of 16 EECS-3421a: Test #2 Queries Electrical Engineering & Computer Science Lassonde School of Engineering York University Family Name: Given Name: Student#:
More informationMidterm Exam #2 (Version B) CS 122A Spring 2018
NAME: SEAT NO.: STUDENT ID: Midterm Exam #2 (Version B) CS 122A Spring 2018 Max. Points: 100 (Please read the instructions carefully) Instructions: - The total time for the exam is 50 minutes; be sure
More informationHomework 3: Relational Database Design Theory (100 points)
CS 122A: Introduction to Data Management Spring 2018 Homework 3: Relational Database Design Theory (100 points) Due Date: Wed, Apr 25 (5:00 PM) Submission All HW assignments should be turned in with a
More informationCSEN 501 CSEN501 - Databases I
CSEN501 - Databases I Lecture 5: Structured Query Language (SQL) Prof. Dr. Slim slim.abdennadher@guc.edu.eg German University Cairo, Faculty of Media Engineering and Technology Structured Query Language:
More informationCSE 344 Midterm. Wednesday, February 19, 2014, 14:30-15:20. Question Points Score Total: 100
CSE 344 Midterm Wednesday, February 19, 2014, 14:30-15:20 Name: Question Points Score 1 30 2 50 3 12 4 8 Total: 100 This exam is open book and open notes but NO laptops or other portable devices. You have
More informationExample Examination. Allocated Time: 100 minutes Maximum Points: 250
CS542 EXAMPLE EXAM Elke A. Rundensteiner Example Examination Allocated Time: 100 minutes Maximum Points: 250 STUDENT NAME: General Instructions: This test is a closed book exam (besides one cheat sheet).
More informationReview. S V T Ma Mo N A S. Mo Ma T
N: Name A: Address S: SSN V: VRN T: Type Ma: Manufacturer (or Make) Mo: Model (Probably) Preferred decomposition N A S S à N, A Review Mega or universal rela/on N A S V T Ma Mo S à N, A S V T Ma Mo Mo
More informationCSE 444, Winter 2011, Midterm Examination 9 February 2011
Name: CSE 444, Winter 2011, Midterm Examination 9 February 2011 Rules: Open books and open notes. No laptops or other mobile devices. Please write clearly. Relax! You are here to learn. An extra page is
More informationEECS 647: Introduction to Database Systems
EECS 647: Introduction to Database Systems Instructor: Luke Huan Spring 2009 Stating Points A database A database management system A miniworld A data model Conceptual model Relational model 2/24/2009
More informationRelational Model, Relational Algebra, and SQL
Relational Model, Relational Algebra, and SQL August 29, 2007 1 Relational Model Data model. constraints. Set of conceptual tools for describing of data, data semantics, data relationships, and data integrity
More informationCSE344 Final Exam Winter 2017
CSE344 Final Exam Winter 2017 March 16, 2017 Please read all instructions (including these) carefully. This is a closed book exam. You are allowed two pages of note sheets that you can write on both sides.
More informationName: Database Systems ( 資料庫系統 ) Midterm exam, November 15, 2006
1 of 8 pages Database Systems ( 資料庫系統 ) Midterm exam, November 15, 2006 Time: 10:00 ~ 12:20 Name: Student ID: I herewith state that I understand and will adhere to the following academic integrity: I will
More informationDatabase Design and Tuning
Database Design and Tuning Chapter 20 Comp 521 Files and Databases Spring 2010 1 Overview After ER design, schema refinement, and the definition of views, we have the conceptual and external schemas for
More informationFor the Dorm Energy Monitoring DB design, some constraints are given and some are absent. You are asked to fill in some of these absent constraints.
Assignment A-w4 Spring 2018 Name: For the Dorm Energy Monitoring DB design, some constraints are given and some are absent. You are asked to fill in some of these absent constraints. 1. Fill Foreign Key
More informationDatabase Management Systems
Sample Questions 1 Write SQL query to create a table for describing a book. The table should have Book Title, Author, Publisher, Year published, and ISBN fields. Your table should have a primary key. For
More informationCSE 414 Midterm. Friday, April 29, 2016, 1:30-2:20. Question Points Score Total: 100
CSE 414 Midterm Friday, April 29, 2016, 1:30-2:20 Name: Question Points Score 1 50 2 20 3 30 Total: 100 This exam is CLOSED book and CLOSED devices. You are allowed ONE letter-size page with notes (both
More informationRelational Algebra and SQL
Relational Algebra and SQL Relational Algebra. This algebra is an important form of query language for the relational model. The operators of the relational algebra: divided into the following classes:
More informationMIDTERM EXAMINATION Spring 2010 CS403- Database Management Systems (Session - 4) Ref No: Time: 60 min Marks: 38
Student Info StudentID: Center: ExamDate: MIDTERM EXAMINATION Spring 2010 CS403- Database Management Systems (Session - 4) Ref No: 1356458 Time: 60 min Marks: 38 BC080402322 OPKST 5/28/2010 12:00:00 AM
More informationSolutions to Final Examination
Prof. Li-Yan Yuan CMPUT 391: Database Management Systems Solutions to Final Examination April 23, 2007 It is a close-book examination and the time for the test is 120 minutes. There are ten (10) questions
More information(At most 8 combina7ons of B,C,D composite values) AND (BCDà E) means (At most 8 values for E)
Study group exercises In a3endance: KEY 1. Suppose you have a rela=on P ( A, B, C, D, E, F ), with func=onal dependencies (FDs) A à B, BCD à E, E à F Suppose there are at most 2 different possible values
More informationFundamentals of Database Systems
Fundamentals of Database Systems Assignment: 2 Due Date: 18th August, 2017 Instructions This question paper contains 10 questions in 6 pages. Q1: Consider the following schema for an office payroll system,
More informationMTA Database Administrator Fundamentals Course
MTA Database Administrator Fundamentals Course Session 1 Section A: Database Tables Tables Representing Data with Tables SQL Server Management Studio Section B: Database Relationships Flat File Databases
More informationRelational Model and Relational Algebra A Short Review Class Notes - CS582-01
Relational Model and Relational Algebra A Short Review Class Notes - CS582-01 Tran Cao Son January 12, 2002 0.1 Basics The following definitions are from the book [1] Relational Model. Relations are tables
More information1 (10) 2 (8) 3 (12) 4 (14) 5 (6) Total (50)
Student number: Signature: UNIVERSITY OF VICTORIA Faculty of Engineering Department of Computer Science CSC 370 (Database Systems) Instructor: Daniel M. German Midterm Oct 21, 2004 Duration: 60 minutes
More information1- a> [5pts] Create the new table by writing and executing a full SQL DDL statement based on the following schema:
1. [20pts] To track the history of financial information changes such as a driver s bank account, you are going to create a table to store the history of all bank account numbers. Once created, this table
More information[18 marks] Consider the following schema for tracking customers ratings of books for a bookstore website.
Question 1. [18 marks] Consider the following schema for tracking customers ratings of books for a bookstore website. Books(ISBN, title, author, year, length). ISBN is a string used internationally for
More informationData about data is database Select correct option: True False Partially True None of the Above
Within a table, each primary key value. is a minimal super key is always the first field in each table must be numeric must be unique Foreign Key is A field in a table that matches a key field in another
More informationCSE414 Midterm Exam Spring 2018
CSE414 Midterm Exam Spring 2018 May 4, 2018 Please read all instructions (including these) carefully. This is a closed-book exam. You are allowed one page of note sheets that you can write on both sides.
More informationThe University of Nottingham
The University of Nottingham SCHOOL OF COMPUTER SCIENCE AND INFORMATION TECHNOLOGY A LEVEL 1 MODULE, SPRING SEMESTER 2006-2007 DATABASE SYSTEMS Time allowed TWO hours Candidates must NOT start writing
More informationPresentation on Functional Dependencies CS x265
Presentation on Functional Dependencies CS x265 This presentation assumes that you have previously viewed Watch videos (90 min) and answer questions from DB8 Relational Design Theory (https://class.stanford.edu/courses/db/rd/selfpaced/courseware/ch-relational_design_theory/)
More informationDATABASE MANAGEMENT SYSTEMS
www..com Code No: N0321/R07 Set No. 1 1. a) What is a Superkey? With an example, describe the difference between a candidate key and the primary key for a given relation? b) With an example, briefly describe
More informationCSE 344 Midterm Exam
CSE 344 Midterm Exam February 9, 2015 Question 1 / 10 Question 2 / 39 Question 3 / 16 Question 4 / 28 Question 5 / 12 Total / 105 The exam is closed everything except for 1 letter-size sheet of notes.
More informationMidterm Exam #1 Version B CS 122A Winter 2017
NAME: SEAT NO.: STUDENT ID: Midterm Exam #1 Version B CS 122A Winter 2017 Max. Points: 100 (Please read the instructions carefully) Instructions: - The total time for the exam is 50 minutes; be sure to
More informationCS6302 DBMS 2MARK & 16 MARK UNIT II SQL & QUERY ORTIMIZATION 1. Define Aggregate Functions in SQL? Aggregate function are functions that take a collection of values as input and return a single value.
More informationCSE 344 Midterm. Wednesday, February 19, 2014, 14:30-15:20. Question Points Score Total: 100
CSE 344 Midterm Wednesday, February 19, 2014, 14:30-15:20 Name: Question Points Score 1 30 2 50 3 12 4 8 Total: 100 This exam is open book and open notes but NO laptops or other portable devices. You have
More informationDatabase Systems. Basics of the Relational Data Model
Database Systems Relational Design Theory Jens Otten University of Oslo Jens Otten (UiO) Database Systems Relational Design Theory INF3100 Spring 18 1 / 30 Basics of the Relational Data Model title year
More informationPLEASE HAND IN UNIVERSITY OF TORONTO Faculty of Arts and Science
PLEASE HAND IN UNIVERSITY OF TORONTO Faculty of Arts and Science APRIL 2015 EXAMINATIONS CSC 343 H1S Instructor: Horton and Liu Duration 3 hours PLEASE HAND IN Examination Aids: None Student Number: Family
More informationMahathma Gandhi University
Mahathma Gandhi University BSc Computer science III Semester BCS 303 OBJECTIVE TYPE QUESTIONS Choose the correct or best alternative in the following: Q.1 In the relational modes, cardinality is termed
More informationE-R diagrams and database schemas. Functional dependencies. Definition (tuple, attribute, value). A tuple has the form
E-R diagrams and database schemas Functional dependencies Definition (tuple, attribute, value). A tuple has the form {A 1 = v 1,..., A n = v n } where A 1,..., A n are attributes and v 1,..., v n are their
More informationEXAMINATION PAPER. Exam in: INF-2700 Database Systems Date: Thursday Time: Kl 15:00-19:00 Place: Åsgårdveien 9. Approved aids: None
EXAMINATION PAPER Exam in: INF-2700 Database Systems Date: Thursday 03.12.2015 Time: Kl 15:00-19:00 Place: Åsgårdveien 9 Approved aids: None The exam contains 5 pages, including this cover page. Contact
More informationBasant Group of Institution
Basant Group of Institution Visual Basic 6.0 Objective Question Q.1 In the relational modes, cardinality is termed as: (A) Number of tuples. (B) Number of attributes. (C) Number of tables. (D) Number of
More informationOverview of Query Processing and Optimization
Overview of Query Processing and Optimization Source: Database System Concepts Korth and Silberschatz Lisa Ball, 2010 (spelling error corrections Dec 07, 2011) Purpose of DBMS Optimization Each relational
More informationQUIZ 1 REVIEW SESSION DATABASE MANAGEMENT SYSTEMS
QUIZ 1 REVIEW SESSION DATABASE MANAGEMENT SYSTEMS SCHEMA DESIGN & RELATIONAL ALGEBRA A database schema is the skeleton structure that represents the logical view of the entire database Logical design of
More informationCMPS182 Midterm Examination. Name: Question 1: Question 2: Question 3: Question 4: Question 5: Question 6:
CMPS182MidtermExamination Name: Question1: Question2: Question3: Question4: Question5: Question6: Name: 2/10 WarmUp ShortQuestions(10points) What is the difference between a view and a normal table? The
More informationMidterm Exam #2 (Version A) CS 122A Winter 2017
NAME: SEAT NO.: STUDENT ID: Midterm Exam #2 (Version A) CS 122A Winter 2017 Max. Points: 100 (Please read the instructions carefully) Instructions: - The total time for the exam is 50 minutes; be sure
More informationMidterm Review. Winter Lecture 13
Midterm Review Winter 2006-2007 Lecture 13 Midterm Overview 3 hours, single sitting Topics: Relational model relations, keys, relational algebra expressions SQL DDL commands CREATE TABLE, CREATE VIEW Specifying
More informationIntroduction to Query Processing and Query Optimization Techniques. Copyright 2011 Ramez Elmasri and Shamkant Navathe
Introduction to Query Processing and Query Optimization Techniques Outline Translating SQL Queries into Relational Algebra Algorithms for External Sorting Algorithms for SELECT and JOIN Operations Algorithms
More informationDraw an ER diagram that encodes the following business rules. Clearly mark all key and participation constraints.
CS 500, Fundamentals of Databases Midterm Exam Completed between February 16 th (9am) and February 18 th (11pm), 2018 SOLUTIONS Problem 1 (20 points): ER modeling Draw an ER diagram that encodes the following
More informationIntroduction to Data Management. Lecture #17 (Physical DB Design!)
Introduction to Data Management Lecture #17 (Physical DB Design!) Instructor: Mike Carey mjcarey@ics.uci.edu Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Announcements v Homework info:
More informationCSE-3421M Test #2. Queries
14 March 2013 CSE-3421M Test #2 w/ answers p. 1 of 16 CSE-3421M Test #2 Queries Family Name: Given Name: Student#: CS&E Account: Instructor: Parke Godfrey Exam Duration: 75 minutes Term: Winter 2013 Answer
More informationAdministrivia. Physical Database Design. Review: Optimization Strategies. Review: Query Optimization. Review: Database Design
Administrivia Physical Database Design R&G Chapter 16 Lecture 26 Homework 5 available Due Monday, December 8 Assignment has more details since first release Large data files now available No class Thursday,
More informationCMPT 354: Database System I. Lecture 2. Relational Model
CMPT 354: Database System I Lecture 2. Relational Model 1 Outline An overview of data models Basics of the Relational Model Define a relational schema in SQL 2 Outline An overview of data models Basics
More informationCSE 344 Midterm. Monday, Nov 4, 2013, 9:30-10:20. Question Points Score Total: 100
CSE 344 Midterm Monday, Nov 4, 2013, 9:30-10:20 Name: Question Points Score 1 30 2 10 3 50 4 10 Total: 100 This exam is open book and open notes but NO laptops or other portable devices. You have 50 minutes;
More informationDatabase Management Systems,
Database Management Systems SQL Query Language (3) 1 Topics Aggregate Functions in Queries count sum max min avg Group by queries Set Operations in SQL Queries Views 2 Aggregate Functions Tables are collections
More informationMidterm Exam #2 (Version C) CS 122A Spring 2018
NAME: SEAT NO.: STUDENT ID: Midterm Exam #2 (Version C) CS 122A Spring 2018 Max. Points: 100 (Please read the instructions carefully) Instructions: - The total time for the exam is 50 minutes; be sure
More informationBirkbeck. (University of London) BSc/FD EXAMINATION. Department of Computer Science and Information Systems. Database Management (COIY028H6)
Birkbeck (University of London) BSc/FD EXAMINATION Department of Computer Science and Information Systems Database Management (COIY028H6) CREDIT VALUE: 15 credits Date of examination: 9 June 2016 Duration
More informationCPS 216 Spring 2003 Homework #1 Assigned: Wednesday, January 22 Due: Monday, February 10
CPS 216 Spring 2003 Homework #1 Assigned: Wednesday, January 22 Due: Monday, February 10 Note: This is a long homework. Start early! If you have already taken CPS 196.3 or an equivalent undergraduate course
More informationIMPORTANT: Circle the last two letters of your class account:
Fall 2002 University of California, Berkeley College of Engineering Computer Science Division EECS Prof. Michael J. Franklin MIDTERM AND SOLUTIONS CS 186 Introduction to Database Systems NAME: Norm L.
More informationCSE344 Midterm Exam Fall 2016
CSE344 Midterm Exam Fall 2016 November 7, 2016 Please read all instructions (including these) carefully. This is a closed book exam. You are allowed a one page handwritten cheat sheet. Write your name
More informationInformationslogistik Unit 4: The Relational Algebra
Informationslogistik Unit 4: The Relational Algebra 26. III. 2012 Outline 1 SQL 2 Summary What happened so far? 3 The Relational Algebra Summary 4 The Relational Calculus Outline 1 SQL 2 Summary What happened
More informationRelational Algebra. Procedural language Six basic operators
Relational algebra Relational Algebra Procedural language Six basic operators select: σ project: union: set difference: Cartesian product: x rename: ρ The operators take one or two relations as inputs
More informationUNIT- II (Relational Data Model & Introduction to SQL)
Database Management System 1 (NCS-502) UNIT- II (Relational Data Model & Introduction to SQL) 2.1 INTRODUCTION: 2.1.1 Database Concept: 2.1.2 Database Schema 2.2 INTEGRITY CONSTRAINTS: 2.2.1 Domain Integrity:
More informationUniversity of California, Berkeley. (2 points for each row; 1 point given if part of the change in the row was correct)
University of California, Berkeley CS 186 Intro to Database Systems, Fall 2012, Prof. Michael J. Franklin MIDTERM II - Questions This is a closed book examination but you are allowed one 8.5 x 11 sheet
More informationCS 461: Database Systems. Final Review. Julia Stoyanovich
CS 461: Database Systems Final Review (stoyanovich@drexel.edu) Final exam logistics When: June 6, in class The same format as the midterm: open book, open notes 2 hours in length The exam is cumulative,
More informationInformationslogistik Unit 5: Data Integrity & Functional Dependency
Informationslogistik Unit 5: Data Integrity & Functional Dependency 27. III. 2012 Outline 1 Reminder: The Relational Algebra 2 The Relational Calculus 3 Data Integrity Keeping data consistent 4 Functional
More informationCIS 330: Applied Database Systems
1 CIS 330: Applied Database Systems Lecture 7: SQL Johannes Gehrke johannes@cs.cornell.edu http://www.cs.cornell.edu/johannes Logistics Office hours role call: Mondays, 3-4pm Tuesdays, 4:30-5:30 Wednesdays,
More informationCSC 261/461 Database Systems Lecture 13. Fall 2017
CSC 261/461 Database Systems Lecture 13 Fall 2017 Announcement Start learning HTML, CSS, JavaScript, PHP + SQL We will cover the basics next week https://www.w3schools.com/php/php_mysql_intro.asp Project
More informationMidterm 2: CS186, Spring 2015
Midterm 2: CS186, Spring 2015 Prof. J. Hellerstein You should receive a double-sided answer sheet and an 8-page exam. Mark your name and login on both sides of the answer sheet, and in the blanks above.
More informationEECS 647: Introduction to Database Systems
EECS 647: Introduction to Database Systems π Instructor: Luke Huan Spring 2009 dministrative You should already have your PgSQL password. Login cycle2.eecs.ku.edu using your EECS ID and password. Type
More informationFundamentals of Database Systems
Fundamentals of Database Systems Assignment: 1 Due Date: 8th August, 2017 Instructions This question paper contains 15 questions in 5 pages. Q1: The users are allowed to access different parts of data
More informationLecture 16. The Relational Model
Lecture 16 The Relational Model Lecture 16 Today s Lecture 1. The Relational Model & Relational Algebra 2. Relational Algebra Pt. II [Optional: may skip] 2 Lecture 16 > Section 1 1. The Relational Model
More informationThe appendix contains information about the Classic Models database. Place your answers on the examination paper and any additional paper used.
Name: Student Number: Instructions: Do all 9 questions. There is a total of 87 marks. The appendix contains information about the Classic Models database. Place your answers on the examination paper and
More informationAn Introduction to Structured Query Language
An Introduction to Structured Query Language Grant Weddell Cheriton School of Computer Science University of Waterloo CS 348 Introduction to Database Management Spring 2016 CS 348 (Intro to DB Mgmt) SQL
More informationWeb Science & Technologies University of Koblenz Landau, Germany. Relational Data Model
Web Science & Technologies University of Koblenz Landau, Germany Relational Data Model Overview Relational data model; Tuples and relations; Schemas and instances; Named vs. unnamed perspective; Relational
More informationCSE 344 Midterm. Monday, November 9th, 2015, 9:30-10:20. Question Points Score Total: 70
CSE 344 Midterm Monday, November 9th, 2015, 9:30-10:20 Name: Question Points Score 1 30 2 30 3 10 Total: 70 This exam is CLOSED book and CLOSED devices. You are allowed ONE letter-size page with notes
More informationCS 377 Database Systems
CS 377 Database Systems Relational Algebra and Calculus Li Xiong Department of Mathematics and Computer Science Emory University 1 ER Diagram of Company Database 2 3 4 5 Relational Algebra and Relational
More information1Z0-071 Exam Questions Demo Oracle. Exam Questions 1Z Oracle Database 12c SQL.
Oracle Exam Questions 1Z0-071 Oracle Database 12c SQL Version:Demo 1. the Exhibit and examine the structure of the CUSTOMERS and CUST_HISTORY tables. The CUSTOMERS table contains the current location of
More informationThe SQL data-definition language (DDL) allows defining :
Introduction to SQL Introduction to SQL Overview of the SQL Query Language Data Definition Basic Query Structure Additional Basic Operations Set Operations Null Values Aggregate Functions Nested Subqueries
More informationT-SQL Training: T-SQL for SQL Server for Developers
Duration: 3 days T-SQL Training Overview T-SQL for SQL Server for Developers training teaches developers all the Transact-SQL skills they need to develop queries and views, and manipulate data in a SQL
More informationCS 4604: Introduc0on to Database Management Systems. B. Aditya Prakash Lecture #4: SQL---Part 2
CS 4604: Introduc0on to Database Management Systems B. Aditya Prakash Lecture #4: SQL---Part 2 Overview - detailed - SQL DML other parts: views modifications joins DDL constraints Prakash 2016 VT CS 4604
More information1Z0-071 Exam Questions Demo Oracle. Exam Questions 1Z Oracle Database 12c SQL.
Oracle Exam Questions 1Z0-071 Oracle Database 12c SQL Version:Demo 1. the Exhibit and examine the structure of the CUSTOMERS and CUST_HISTORY tables. The CUSTOMERS table contains the current location of
More informationImplementing Table Operations Using Structured Query Language (SQL) Using Multiple Operations. SQL: Structured Query Language
Implementing Table Operations Using Structured Query Language (SQL) Using Multiple Operations Show Only certain columns and rows from the join of Table A with Table B The implementation of table operations
More informationExam. Question: Total Points: Score:
FS 2016 Data Modelling and Databases Date: June 9, 2016 ETH Zurich Systems Group Prof. Gustavo Alonso Exam Name: Question: 1 2 3 4 5 6 7 8 9 10 11 Total Points: 15 20 15 10 10 15 10 15 10 10 20 150 Score:
More informationStudents Guide. Requirements of your homework
Students Guide Requirements of your homework During the SQL labs you should create SQL scripts, which correspond to the SQL script skeleton provided. In the case of the SQL1 lab, you should also hand in
More informationLAB 3 Part 1 ADBC - Interactive SQL Queries-Advanced
LAB 3 Part 1 ADBC - Interactive SQL Queries-Advanced ***For each question Create the SQL query that solves the problem Write all SQL statements in the same script file and save into a text file called
More informationCS317 File and Database Systems
CS317 File and Database Systems Lecture 3 Relational Model & Languages Part-1 September 7, 2018 Sam Siewert More Embedded Systems Summer - Analog, Digital, Firmware, Software Reasons to Consider Catch
More informationMidterm Exam (Version B) CS 122A Spring 2017
NAME: SOLUTION SEAT NO.: STUDENT ID: Midterm Exam (Version B) CS 122A Spring 2017 Max. Points: 100 (Please read the instructions carefully) Instructions: - The total time for the exam is 80 minutes; be
More informationDatabase Usage (and Construction)
Lecture 7 Database Usage (and Construction) More SQL Queries and Relational Algebra Previously Capacity per campus? name capacity campus HB2 186 Johanneberg HC1 105 Johanneberg HC2 115 Johanneberg Jupiter44
More informationMobile MOUSe MTA DATABASE ADMINISTRATOR FUNDAMENTALS ONLINE COURSE OUTLINE
Mobile MOUSe MTA DATABASE ADMINISTRATOR FUNDAMENTALS ONLINE COURSE OUTLINE COURSE TITLE MTA DATABASE ADMINISTRATOR FUNDAMENTALS COURSE DURATION 10 Hour(s) of Self-Paced Interactive Training COURSE OVERVIEW
More informationAlgorithms for Query Processing and Optimization. 0. Introduction to Query Processing (1)
Chapter 19 Algorithms for Query Processing and Optimization 0. Introduction to Query Processing (1) Query optimization: The process of choosing a suitable execution strategy for processing a query. Two
More informationActual4Test. Actual4test - actual test exam dumps-pass for IT exams
Actual4Test http://www.actual4test.com Actual4test - actual test exam dumps-pass for IT exams Exam : 1z1-071 Title : Oracle Database 12c SQL Vendor : Oracle Version : DEMO Get Latest & Valid 1z1-071 Exam's
More information