ISTE-608 Test Out Written Exam and Practical Exam Study Guide

Size: px

Start display at page:

Download "ISTE-608 Test Out Written Exam and Practical Exam Study Guide"

Annice Blankenship
6 years ago
Views:

PAGE 1 OF 9 ISTE-608 Test Out Written Exam and Practical Exam Study Guide Written Exam: The written exam will be in the frmat f multiple chice, true/false, matching, shrt answer, and applied questins

1 PAGE 1 OF 9 ISTE-608 Test Out Written Exam and Practical Exam Study Guide Written Exam: The written exam will be in the frmat f multiple chice, true/false, matching, shrt answer, and applied questins (ex. transpsing muti-entity E-R diagrams int relatins). In rder t be fully prepared fr the written exam yu shuld be able t: identify three key differences between databases and file systems. identify three disadvantages f file systems. (Applicatin prgram dependency, data duplicatin, data separatin/islatin, lng develpment times, higher maintenance requirements/csts) describe the meaning f the term Database, including at least fur f the fllwing keywrds: Shared, Self-describing, Organized, Lgically Related, Persistent, Cllectin f Data. identify three types f data that can be stred in a database. (text, numbers, date/time, graphics/images, sund/vide, prgrams, ther bjects) define and cntrast the terms User Data, Metadata, Index, and Applicatin Metadata. identify the crrect definitin f a database management system. describe the purpse f each DBMS subsystem (Design Tls, Run-time, and Engine). prvide tw disadvantages f a database as discussed in class. (DBAs/Specialized persnnel, Installatin/Management csts, Cnversin csts, backup/recver, plitical issues/rganizatinal cnflict) recall the summary f steps t the database develpment lifecycle. identify DBMS independent steps frm DBMS dependent steps. state what data mdeling is any why it is imprtant. define and cntrast the terms Relatin, Attribute, and Tuples, as they pertain t the relatinal mdel. describe and identify the difference between an Entity Class and an Entity Instance. recgnize the fllwing, when given an E-R diagram, and state what the meaning is: Entity, Attribute (simple vs cmpsite; single-valued versus multi-valued; stred vs derived, and identifier) cmpare and cntrast the Chen ntatin and the Crw s ft ntatin.

2 PAGE 2 OF 9 describe what an identifier is and its usage. apprpriately represent simple identifiers and cmpsite identifiers, using either Chen r Crw s feet ntatin. describe a cmpsite identifier. list the steps invlved in creating a database. transpse an E-R diagram, with Chen r Crw s Feet ntatin, f a single entity int a relatin. describe what a relatin is and what rws and clumns f a relatin represent. describe at least five characteristics f a relatin. determine whether r nt a given relatin cnfrms t all f the characteristics f a relatin. describe a primary key in terms f its purpse and characteristics. list the steps invlved in creating a database. list and describe the tw types f SQL statements. classify SQL statements (CREATE, DROP, INSERT, and SELECT) as apprpriate type f SQL statement (DDL/DML). knw the required clauses f a SELECT statement. describe what a NULL value is. classify SQL statements (ALTER, UPDATE, and DELETE) as apprpriate type f SQL statement (DDL/DML). state that nrmalizatin is part f the representatinal level f the develpment prcess. determine functinal dependencies between attributes fr a given relatin. use prper ntatin fr functinal dependencies. describe a candidate key. describe a primary key. determine what candidate keys exist when given a relatin and a list f functinal dependencies. select an apprpriate primary key based n any candidate keys present, when given a relatin and a list f functinal dependencies. describe what an anmaly is. identify the different types f anmalies: Insertin, Mdificatin, and Deletin.

3 PAGE 3 OF 9 identify the determinant when given a functinal dependency. identify cmpsite keys: primary and candidate. describe secnd nrmal frm and its vilatin. identify any partial dependencies when given a relatin and functinal dependencies. crrectly fix secnd nrmal frm vilatins, including crrectly denting a freign key and cmpsing a reference statement, when given a relatin and functinal dependencies. describe a freign key. describe what referential integrity is and why it is imprtant. describe third nrmal frm and its vilatin. identify any transitive dependencies, when given a relatin and functinal dependencies. crrectly fix third nrmal frm vilatins, including crrectly denting a freign key and cmpsing a reference statement, when given a relatin and functinal dependencies that cause transitive dependencies. describe Byce-Cdd nrmal frm and its vilatin. crrectly fix BCNF vilatins, including crrectly denting a freign key and cmpsing a reference statement, when given a relatin and functinal dependencies that include a determinant that is nt a candidate key. mdify the riginal and all resulting relatins thrugh BCNF, including crrect freign keys and reference statements, when given a relatin and functinal dependencies. describe the crrelatin between the quality f a data mdel and impact n the nrmalizatin prcess. determine the highest nrmal frm that a relatin is in when given a relatin and a list f functinal dependencies. describe the cnnectin between the quality f an E-R diagram and the implicatins n the nrmalizatin prcess. describe the difference between a relatinship class and a relatinship instance. determine the degree f the relatinship, when given an E-R diagram. distinguish binary relatinships frm recursive relatinships, when given an E-R diagram. interpret the maximum cardinalities fr a relatinship and prvide the cardinality rati, when given an E-R diagram.

4 PAGE 4 OF 9 interpret the minimum cardinalities fr a relatinship t determine if an entity is required t participate in a relatinship r nt, when given an E-R diagram. fully explain a relatinship, using nn-technical terms, that include the implicatins f the minimum and maximum cardinalities frm bth perspectives, when given an E-R diagram. cmpare and cntrast HAS-A relatinships t IS-A relatinships. describe the difference between a supertype and a subtype. identify any supertypes and subtypes, when given an E-R diagram. distinguish a strng entity frm a weak entity, when given an E-R diagram. determine the tw main reasns supertype/subtype relatinships are necessary. describe the implicatins f having a relatinship at the supertype-level versus the subtypelevel. determine whether the cmpleteness cnstraint fr the relatinship is ttal r partial specializatin and the implicatins f bth n the supertype/subtype relatinship, when given an E-R diagram. determine the disjintedness cnstraint and whether the verlap r disjint rule is in effect and the implicatins n the supertype/subtype relatinship, when given an E-R diagram. determine an apprpriate discriminatr based n if the disjint r verlap rule is in effect fr a supertype/subtype relatinship, when given an E-R diagram. describe, in nn-technical terms, the full supertype/subtype relatinship including cmpleteness and disjintedness cnstraints, when given an E-R diagram. crrectly transpse the diagram int a set f relatins in relatinal schema ntatin, when given an E-R diagram that includes strng and weak entities, with binary, recursive, and supertype/subtype relatinships. describe freign key placement fr a 1:1, 1:N (N:1), M:N, r supertype/subtype relatinship. explain the difference between the participatin cnstraints (ttal participatin and partial participatin). determine whether the weak entity is ID-Dependent r Nn-ID Dependent, when given an E-R diagram that includes a HAS-A relatinship between a strng and a weak entity, alng with functinal dependencies. transpse an E-R diagram with prper placement f the freign key based n whether the relatinships are identifying r nt, when given an E-R diagram that distinguishes between identifying and nn-identifying relatinships.

5 PAGE 5 OF 9 crrectly interpret and transpse a M:N relatinship with attributes f the relatinship, when given an E-R diagram. crrectly interpret and transpse an assciative entity, when given an E-R diagram. explain why a M:N relatinship with attributes fr the relatinship is equivalent t tw 1:N relatinships with an assciative entity. transpse the E-R diagram and nrmalize all relatins thrugh BCNF, when given an E-R diagram and functinal dependencies. state benefits f lkup tables. describe what referential integrity is, why it is imprtant, and hw it is implemented in a database. state that a transactin is a lgical unit f wrk. state that a transactin can be cmpsed f ne r mre statements. explain the purpse f COMMIT. classify COMMIT as a Transactin Cntrl Language (TCL) statement. explain the purpse f ROLLBACK. classify ROLLBACK as a Transactin Cntrl Language (TCL) statement. list the prperties f a tranactin cntained in the ACID acrnym. describe the Atmicity prperty f a transactin. describe the Cnsistency prperty f a transactin. describe the Islatin prperty f a transactin. describe the Durability prperty f a transactin. cmpse a theretical relatinal algebra statement that wuld satisfy a specified query, when given a set f relatins. Operatins include SELECTION, PROJECTION, UNION, DIFFERENCE, PRODUCT, INTERSECTION, and Jins (EQUIJOIN, NATURAL, LEFT OUTER, RIGHT OUTER, and FULL OUTER). derive the resulting relatin, when given a set f relatins and a theretical relatinal algebra statement. state the cnditins fr unin cmpatibility. determine if tw relatins are unin cmpatible. specify the relatinal algebra peratins that are cmmutative.

6 PAGE 6 OF 9 describe the peratins invlved in perfrming a relatinal algebra jin. describe hw a relatinal algebra peratin is accmplished in SQL. recgnize the difference in structure between a SQL 89 frmatted jin and a SQL 92 frmatted jin. describe the structure f a subquery, including hw results are passed frm a nested query t the uter query. explain the difference between the WHERE clause and the HAVING clause f a SELECT statement. state which clauses f an SELECT statement are required and which are ptinal. state the prper rder fr clauses in a SELECT statement, including FROM, GROUP BY, HAVING, SELECT, ORDER BY, and WHERE. describe the structure f a highly abstract table. state the advantages and disadvantages f highly abstract tables. Practical Exam: If yu receive an 80% r higher n the written exam, yu will be allwed t take the practical exam. The practical will invlve the use f MySQL in rder t accmplish tasks prvided fr yu t cmplete. Yu will nly have access t the MySQL help system during the practical exam. In rder t be fully prepared fr the final practical, yu shuld be able t accmplish the fllwing thrugh yur knwledge f MySQL and SQL: create a database. pen a database. write a CREATE TABLE statement with attributes f apprpriate datatypes (CHAR, VARCHAR, INT, and DATE) and a cnstraint fr the primary key. cmpse a DROP DATABASE statement. cmpse a DROP TABLE statement. execute cmmands t view metadata (SHOW DATABASES; SHOW TABLES; and DESCRIBE). create a script cntaining ne r mre DDL r DML statement. execute a script. write a SELECT statement that will view all attributes and all recrds frm a single table. write a SELECT statement that cntains nly a subset f available attributes.

7 PAGE 7 OF 9 apply a clumn alias in the SELECT clause f a SELECT statement. frm an apprpriate WHERE clause, f a SELECT statement, that includes lgical peratrs (NOT, AND, and OR). find recrds where a specified attribute has ne r mre NULL values. insert a recrd that has ne r mre NULL values. recgnize data that shuld be stred as SMALLINT and DECIMAL, when given an attribute descriptin. use SIGNED and UNSIGNED apprpriately fr integer data types, when given an attribute descriptin. apply NOT NULL cnstraints apprpriately in a CREATE TABLE statement, when given attribute descriptins. set DEFAULT values apprpriately in a CREATE TABLE statement, when given attribute descriptins. apprpriately use the fllwing relatinal peratrs in SELECT statements, as needed: >, >=, <, <=, =, <>,!=, IN, LIKE. frm an apprpriate WHERE clause, f a SELECT statement, that includes lgical peratr, BETWEEN. apply LIKE using wildcards ('_' and '%') t frm a search pattern that meets specificatins. perfrm basic calculatins using an attribute in a SELECT statement. write a CREATE TABLE statement with attributes f apprpriate datatypes (CHAR, VARCHAR, INT, and DATE), when given attribute specificatins, and a cnstraint fr the primary key. cmpse an UPDATE statement that will meet prvided specificatins. cmpse a DELETE statement that will meet prvided specificatins. frm an ALTER TABLE statement that meets specificatins prvided. ALTER TABLE t DROP ADD a PRIMARY KEY. ALTER TABLE t DROP ADD a clumn meeting prvided specificatins. ALTER TABLE t SET DROP a DEFAULT value specified. ALTER TABLE t MODIFY a COLUMN t meet prvided specificatins. write CREATE TABLE statements that will implement a prvided schema (E-R diagram, transpsed relatins, and attribute specificatins) with attributes f apprpriate data types (CHAR, VARCHAR, INT (signed vs unsigned), SMALLINT (signed vs unsigned), TINYINT (signed vs

8 PAGE 8 OF 9 unsigned), DECIMAL, BOOLEAN, DATE, and ENUM), and crrect use f NOT NULL cnstraints. Each statement will als include a crrect primary key cnstraint and necessary freign key cnstraint(s). determine if a NOT NULL cnstraint is needed when implementing a specific freign key, when given an E-R diagram and transpsed relatins. rganize a series f CREATE TABLE and INSERT statements s that the executin rder desn t cause any errrs due t sequencing. define an attribute as AUTO_INCREMENT, when apprpriate. cmpse an INSERT statement that will result in AUTO_INCREMENT being used t determine an attribute's value, when AUTO_INCREMENT was used t define the respective attribute. implement apprpriate discriminating attribute(s) in a CREATE TABLE statement, when given an E-R diagram that includes a supertype/subtype relatinship. determine and implement an apprpriate ON UPDATE cnditin fr a freign key cnstraint, when given an E-R diagram and transpsed relatins. determine and implement an apprpriate ON DELETE cnditin fr a freign key cnstraint, when given an E-R diagram and transpsed relatins. INSERT a recrd int a table that includes results frm a SELECT statement, when given an E-R diagram and transpsed relatins. successfully implement a transactin that is cmpsed f mre than ne statement, given a list f tasks and MySQL. cmpse a crrect ALTER TABLE statement that will add an apprpriate freign key cnstraint. cmpse a crrect ALTER TABLE statement that will drp an existing freign key cnstraint. cmpse the SQL equivalent statement t prduce the resulting relatin, when given a relatinal schema implemented in SQL and a theretical relatinal algebra statement. Statement peratins can include SELECTION, PROJECTION, UNION, DIFFERENCE, PRODUCT, INTERSECTION, and Jins (EQUIJOIN, NATURAL, LEFT OUTER, RIGHT OUTER, and FULL OUTER). apprpriately utilize DISTINCT when cmpsing queries f relatinal algebra peratins in SQL. write a CREATE TABLE statement that includes UNIQUE cnstraints fr any candidate key(s) that weren't selected as the primary key. write a SELECT statement that includes table aliases. cmpse a SELECT statement that prperty jins multiple tables tgether, using either SQL 89 (inner jin) r SQL 92 (inner and uter jins) frmat.

9 PAGE 9 OF 9 cmpse a subquery (an uter query that includes ne r mre nested queries) that will accmplish a task that requires data t be passed frm ne r mre tables t anther. write a SELECT statement that apprpriately utilizes any f the fllwing single-rw, character functins: LOWER(), UPPER(), LENGTH(), INSTR(), SUBSTR(), and CONCAT(). write a SELECT statement that apprpriately utilizes any f the fllwing single-rw, numeric functins: ROUND(), TRUNCATE(), and MOD(). write a SELECT statement that apprpriately utilizes any f the fllwing multi-rw functins: COUNT(), AVG(), SUM(), MIN(), MAX(). crrectly incrprate a GROUP BY clause, when using multi-rw functin(s) and als displaying ther attributes as part f the SELECT clause f a SELECT statement. crrectly incrprate a HAVING clause within a SELECT statement, when needing t eliminate recrds frm a result set based n the results f an aggregate functin. crrectly incrprate an ORDER BY clause within a SELECT statement, when needing t srt a result set by specified criteria.

Querying Data with Transact SQL

Querying Data with Transact SQL Curse Cde: 20761 Certificatin Exam: 70-761 Duratin: 5 Days Certificatin Track: MCSA: SQL 2016 Database Develpment Frmat: Classrm Level: 200 Abut this curse: This curse is