Database
B. Relational model. C. Schema.
Chapter 1: ER-model & Relational Model 1: In tuple relational calculus P1 → P2 is equivalent to A. ¬ P1
∨ P2
D. Sub schema. Option: D 6: A report generator generator is used to A. Update files.
B. P1 ∨ P2
B. Print files on paper
C. P1
∧ P2
C. Data entry.
D. P1
∧ ¬P2
D. Delete files.
Option: A
Option: B 7: The property / properties of a database is / are :
2: A logical schema A. Is the entire database. B. describe data in terms of relational tables and columns, object-oriented classes, and XML tags. C. Describes how data is actually stored on disk. D. Both (A) and (C) Option: A 3: Related fields in a database are grouped grouped to form a A. Data file B. Data record. C. Menu D. Bank. Option: B Explanation : Related data fields in a database are grouped to form a data record. (A record is a collection of related fields) 4: The database environment environment has all of the following components except: A. Users. B. Separate files C. Database. D. Database administrator Option: B 5: The way a particular application views the data from the database that the application uses is a A. Module.
A. It is an integrated collection of logically related records. B. It consolidates separate files into a common pool of data records. C. Data stored in a database i s independent of the application programs using it D. All of the above Option: D 8: A relational database developer refers to a record as A. A criteria. B. A relation. C. A tuple. D. An attribute. Option: C 9: The relational model feature is that there A. Is no need for primary key data
B. Is much more data independence than some other database models C. Are explicit relationships among records D. Are tables with many dimensions Option: D Explanation : In relational model data is stored in tables and if we talk about data independence it is one of the major feature feature of DBMS which holds in all DBMS models.
10: Conceptual design A. Is a documentation technique. B. Needs data volume and processing frequencies to determine the size of the database. C. Involves modelling independent of the DBMS D. Is designing the relational model. Option: C 11: The method in which records are physically stored in a specified order according to a key field in each record is A. Hash B. Direct. C. Sequential D. All of the above. Option: A Explanation : A method in which records are physically stored in a specified order according to a key field in each record is hash. (In hash method, a hash function is performed on the key value to determine the unique physical address of the record to store or retrieve) 12: A subschema expresses A. The logical view B. The physical view. C. The external view.
Option: B 14: An advantage of the database management approach is A. Data is dependent on programs B. Data redundancy increases. C. Data is integrated and can be accessed by multiple programs. D. None of the above Option: C 15: A DBMS query language is designed to A. Support end users who use English-like commands B. Support in the development of complex applications software C. Specify the structure of a database. D. All of the above.
Option: D 16: Data independence means A. Data is defined separately and not included in programs B. Programs are not dependent on the physical attributes of data. C. Programs are not dependent on the logical attributes of data D. Both (B) and (C). Option: D
D. All of the above. Option: C Explanation : A subschema expresses the external view. (External schemas are called also called as subschemas)
17: E-R model uses this symbol to represent weak entity set ? A. Dotted rectangle B. Diamond C. Doubly outlined rectangle D. None of these
13: Which one of the following statements is false? A. The data dictionary is normally maintained by the database administrator. B. Data elements in the database can be modified by changing the data dictionary.
Option: C 18: SET concept is used in : A. Network Model B. Hierarchical Model C. Relational Model
C. The data dictionary contains the name and description of each data element.
D. None of these Option: A
D. The data dictionary is a tool used exclusively by the database administrator.
19: Relational Algebra is A. Data Definition Language B. Meta Language C. Procedural query Language
D. None of these Option: C 25: It is better to use files than a DBMS when there are
D. None of the above Option: C
A. Stringent real-time requirement B. Multiple users wish to access the data
20: Key to represent relationship between tables is called A. Primary key
C. Complex relationships among data D. All of the above. Option: B
B. Secondary Key C. Foreign Key
26: The conceptual model is
D. None of these A. Dependent on hardware Option: C
B. Dependent on software. C. Dependent on both hardware and software
21: _______ produces the relation that has attributes of R1 and R2
D. Independent of both hardware and software Option: D
A. Cartesian product B. Difference C. Intersection D. Product Option: A
27: What is a relationship called when it is maintained between two entities? A. Unary B. Binary C. Ternary
22: DBMS helps achieve A. Data independence
D. Quaternary Option: B
B. Centralized control of data C. Neither (A) nor (B) D. both (A) and (B) Option: D
28: Which of the following operation is used if we are interested in only certain columns of a table? A. PROJECTION B. SELECTION
23: Which of the following are the properties of entities? A. Groups
C. UNION D. JOIN Option: A
B. Table C. Attributes D. Switchboards Option: C
29: The RDBMS terminology for a row is A. Tuple. B. Relation. C. Attribute.
24: In a relation A. Ordering of rows is immaterial B. No two rows are identical C. (A) and (B) both are true
D. Degree. Option: A
30: Which of the following is an advantage of view? A. Data security B. Derived columns C. Hiding of complex queries
Option: D 36: Which of the operations constitute a basic set of operations for manipulating relational data?
D. All of the above A. Predicate calculus Option: D 31: The users who use easy-to-use menu are called
B. Relational calculus C. Relational algebra D. None of the above Option: C
A. Sophisticated end users B. Naïve users.
37: Which of the following is another name for weak entity?
C. Stand-alone users. D. Casual end user Option: B 32: Which database level is closest to the users?
A. Child B. Owner C. Dominant D. All of the above Option: A
A. External B. Internal
38: Which of the following database object does not physically exist?
C. Physical D. Conceptual Option: A 33: Which are the two ways in which entities can participate in a relationship?
A. Base table B. Index C. View D. None of the above Option: C
A. Passive and active B. Total and partial
39: NULL is
C. Simple and Complex D. All of the above Option: B 34: The result of the UNION operation between R1 and R2 is a relation that includes A. All the tuples of R1 B. All the tuples of R2 C. All the tuples of R1 and R2
A. The same as 0 for integer B. The same as blank for character C. The same as 0 for integer and blank for character D. Not a value Option: D 40: Which of the following is record based logical model?
D. All the tuples of R1 and R2 which have common columns
A. Network Model
Option: C
B. Object oriented model
35: A set of possible data values is called A. Attribute B. Degree. C. Tuple. D. Domain.
C. E-R Model D. None of these Option: A
41: A data dictionary is a special file that contains:
A. A is a candidate key B. A is not a candidate key
A. The name of all fields in all files.
C. A is a primary Key
B. The width of all fields in all files.
D. Both (A) and (C)
C. The data type of all fields in all file D. All of the above Option: D 42: A file manipulation command that extracts some of the records from a file is called
Option: B 47: Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the maximum size of join is: A. mn
A. SELECT
B. m+n
B. PROJECT
C. (m+n)/2
C. JOIN
D. 2(m+n)
D. PRODUCT
Option: A
Option: A 43: A primary key is combined with a foreign key creates A. Parent-Child relationship between the tables that connect them B. Many to many relationship between the tables that connect them. C. Network model between the tables that connect them. D. None of the above Option: A
48: The natural join is equal to : A. Cartesian Product B. Combination of Union and Cartesian product C. Combination of selection and Cartesian product D. Combination of projection and Cartesian product Option: C 49: Which one of the following is not true for a view: A. View is derived from other tables. B. View is a virtual table.
44: In E-R Diagram derived attribute are represented by
C. A view definition is permanently stored as part of the database. D. View never contains derived columns.
A. Ellipse B. Dashed ellipse C. Rectangle D. Triangle Option: B
Option: C 50: A primary key if combined with a foreign key creates A. Parent-Child relationship between the tables that connect them.
45: Cross Product is a: A. Unary Operator B. Ternary Operator C. Binary Operator D. Not an operator Option: C 46: An instance of relational schema R (A, B, C) has distinct values of A including NULL values. Which one of the following is true?
B. Many to many relationship between the tables that connect them. C. Network model between the tables that connect them. D. None of the above. Option: A
51: In E-R Diagram relationship type is represented by A. Ellipse B. Dashed ellipse C. Rectangle D. Diamond
national level for each citizen. 3. Name: Name of the student. 4. BanIcAccount Num: Unique account number at the bank. A student can have multiple account or joint accounts. This attribute stores the primary account number. 5. Hostel_Room: Room number ofhe hostel. Which ofthe following option is INCORRECT?
Option: D 52: Hierarchical model is also called
A. BankAccount Num is a candidate key. B. Registration Num can be a primary key
C. Normalize Structure
C. UID is candidate key if all students are from same country. D. If S is a superkey such that S ∩ UID is NULL then S ∪ UID is also a superkey.
D. Table Structure
Option: A
A. Tree structure B. Plex Structure
Option: A 53: In E-R diagram generalization is represented by A. Ellipse B. Dashed ellipse C. Rectangle
57: The following functional dependencies hold for relation R(A, B, C) and S(B, D, E) B — > A, A — > C , the relation R contains 200 tuples and relation S contains 100 tuples. What is maximum number of tuples possibles in natural join R and S?
D. Triangle Option: D
A. 100 B. 200 C. 300 D. 400
54: The method of access which uses key transformation is known as A. Direct
Option: A 58: Which structure is the hierarchical model based
B. Hash C. Random
A. Tree
D. Sequential
B. Graph
Option: B 55: A table joined with itself is called A. Join B. Self Join C. Outer Join
C. Linked List D. None of the above Option: A 59: In the relational model, the number of attributes and number of tuples iri a relation are termed as __________and ______________respectively
D. Equi Join
A. Cardinality, domain
Option: B
B. Degree, cardinality C. Domain degree
56: Consider a relational table with a single record for each registered student with the following attributes. 1. Registration Num: Unique registration of each registered student. 2. UID Unique identity number, unique at the
D. Cardinality, degree Option: B
60: In domain relational calculus we create a variable for every A. Row B. Column C. Table D. None of the above Option: B
LHS They don't determine anything so they can not be part of key. If field is not in ANY FD, it must be part of the key Now considering these 5 points we get D as Key. 64: Which of the following statement is correct? A. F |= x ---> x iff y ⊆ x+ B. F |= y ---->x iff y ⊆ x+ C. F |=x --->y iff x+ ⊆ y D. F |= y --->x iff x+⊆ y
61: Why do we have to create a primary index on a primary key A. Ease of searching
Option: A 65: Given the basic ER and relational model which of the following is incorrect?
B. Sequential ordering of a file C. Both (a) and (b)
A. An entity can have more than one attribute
D. None of these
B. An attribute of an entity can be composite.
Option: C 62: In context with relational Algebra. Which of the following are unary operatiors. 1.Select 2. Project 3. Union 4. Product A. 1 and 3 only B. 2 and 4 only C. 1 and 2 only D. All are binary Option: C 63: Let R is a relation schema, R(A, B, C, D) and F = {A — > B, B --> C, C — > A) is the set of functional dependency. Determine the key of relation ? A. A B. B C. C D. D Option: D Explanation : Rule to find out the key in relation :Key ---> Rest of Attributes As Key determies rest of the attributes Key must include all attributes but can not be on RHS of any functional dependency i.e Only fields on RHS are determined. An undetermined field must be in the key. REST must include all attributes but NOT on
C. In row of a relational table, an attribute have more than one value. D. In row of a relational table, an attribute can have exactly one vlaue or a NULL value. Option: C
66 It is desired to design an object-oriented : employee record system for a company. Each employee has a name, unique id and salary. Employees belong to diferent categories and their salary is determined by their category. The functions geName, getld and compute Salary are required. Given the class hierachy below, possible locations for these functions are: (i) getld is implemented in the superclass (ii) getld is implemented in the subclass (iii) getName is an abstract funciton in the superclass (iv) getName is implemented in the superclass. (v) getName is implemented in the subclass (vi) getSalary is an abstract function in the superclas (vii) getSalary is implemented in the superclass (viii) getSalary is implemented in the subclass. Choose the best design
A. (i), (iv), (vi), (viii) B. (i), (iv), (vii) C. (i), (iii), (v), (vi), (viii) D. (ii) , (v) , (viii) Option: A 67: Let r be a relation instance with schema R = (A, B, C, D). We define r 1 =∏ A,B,C (r) and r 2 = ∏A, D (r) Let S = r1* r2 where * denotes natural join. Given that the decomposition of r into r1 and r2 is lossy, which one of the following is TRUE?
Given functional dependency pincode -> (city) (state) (street) (city) (state) -->pincode This is in I NF and 2NF but not in 3NF because it contain transitive dependency. Hence correct answer is (b). 2: A table has fields F1, F2 , F3 , F4, F5 with the following functional dependencies Fi — > F3, F2 — > F4 (FI,F2) — > F5 In terms of normalization, this table is in
A. S ⊂ r B. r ∪ s = r
A. 1 NF
C. r ⊂ s
B. 2 NF
D. r*s = s
C. 3 NF
Option: C 68: Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-many and R2 is many-to-many. RI and R2 do not have any attributes of their own. What is the minimum number of tables required to represent this situation in the relational model?
D. None of these Option: A Explanation : Primary key (candidates key) for this relation is [F1] [F2] because [F1, F2] column contains [F1, F2, F3, F4, F5] So, there is, functional dependency F1 -> F3 , F2 It also have partial depedency so it is not in 2nd, 3rd NF.
A. 2 B. 3 C. 4 D. 5
3: Amongst the ACID properties of a transaction, the 'Durability' property requires. that the changes made to the database by a successful tra nsaction persist
Option: B A. Except in case of an operating system crash B. Except in case of a disk crash C. Except in case of a power failure
Chapter 2: Database design
D. Always, even if there is a failure of any kind Option: D
1: A relation empdt1 is defined with attributes empdt1(empcode, name, street, city, state,pincode). For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode. In normalization terms, empdt1 is a relation in A. 1 NF only B. 2 NF and hence also in 1 NF
4: In a schema with attributes A, B, C, D and E following set of functional dependencies are given A --> B A -->C CD — >E B --> D E — > A Which of the following functional dependencies is the implied by the above set.
C. 3NF and hence also in 2NF and 1NF D. BCNF and hence also in 3NF, 2NF and 1NF Option: B Explanation : empdt1 {empcode, name, street, city, state, pincode)
A. CD — > AC B. BD --> CD C. BC — > CD D. AC — > BC Option: B
Option: A Explanation : CD — >A {CD — >E;E — > A; E — >C} CD — > C BC — > CD B — >D; CD — >E; E — >A; A — >C AC — >BC: A — >B: A — >C 5: Let R(A, B, C, D) be a relational schema with the following functional dependencies A — > B, B --> C, A. Gives a lossless join, and i s dependency preserving. B. Gives a lossless join, but is not dependency preserving
8: A table T1 in a relation database has following rows and columns. Roll number Marks. 1 10 2 20 3 30 4 NULL The following sequence of SQL statements was successfully executed in table T1. Update T1 set marks =marks + 5 ; select avg(marks) from T1 ; What is the output of the select statement?
A. 18.75 B. 20
C. Does not give a loss less j oin, but is depency preserving D. Does not give a lossless join and is not depency preserving Option: A 6: Let R(A, B, C, D, E, P, G) be a relational schema in which the following functional dependencies are known to hold: AB — > CD, DE — > P, C --> E, P --> C and B — > G . The relational schema R is A. In BCNF
C. 25 D. NULL Option: A Explanation : Average = (15+25+35+null)/4 = 18.75 9: Which normal form is considered adequate for relational database design? A. 2NF B. 3NF C. 4 NF D. BCNF Option: B
B. in 3NF, but not in BCNF C. In 2NF, but not in 3NF D. Not in 2NF Option: D 7: Consider the following set of functional dependencies on the schema (A, B, C) A --> BC, B — > C, A — > B, AB — > C The cannonical cover for this set is
10: A functional dependency of the form x — > y is trival if A. y ⊆ x B. y ⊂ x C. x ⊂ y D. x ⊂y and y⊂ x Option: A 11: If every non-key attribute is functionally depedent primary key, then the relation will be in A. First normal form
A. A — > BC and B ---->C
B. Second normal form
B. A ----> BC and AB — > C
C. Third form
C. A — > BC and A — > B
D. Fourth normal form
D. A — > B and B — > C
Option: B
12: If a relation is in BCNF, then it is also in
A. in second normal form but not in third normal form B. in third normal form but not in BCNF C. in BCNF
A. 1 NF
D. in none of the above
B. 2 NF C. 3 NF D. All of the above
Option: D
Option: D 13: Consider the relation given below and ind the maximum normal form applicable to them 1. R(A, B) with productions { A --> B } 2. R(A, B) with productions { B --> A } 3 R(A, B) with productions {A — > B, B --> A } 4 R(A, B, C) with productions {A -->B, B --> A, AB --> C }
16: The relation scheme student performance (name, courseNo, rollNo, grade) has the following functional dependencies: name, curseNo --> grade Rol INo, courseNo — > grade name — > rollNo rollNo — > name The highest normal form ofthis relation scheme is:
A. 1, 2 and 3 are in 3NF and 4 is in BCNF B. 1 and 2 are in BCNF and 3 and 4 are in 3NF
A. 2 NF
C. All are in 3NF
B. 3 NF
D. All are in BCNF
C. BCNF
Option: D
D. 4 NF Option: B
14: Consider the following S1: Foreign key allows null values. S2: Every binary tables is in BCNF
Which of the following is true
B. S1 is true C. S2 is true
Option: C
D. None of these Option: B 15: Consider the following functional dependencies in a database:
Name — > Roll_number Name
A. BCNF is stricter than 3 NF B. Lossless, dependency -preserving decomposition into 3 NF is always possible C. Loss less, dependency - preserving decomposition into BCNF is always possible D. Any relation with two attributes is BCNF
A. Both S1 and S2 are true
Date_of_Birth — > Age
17: Which-one ofthe following statements about normal forms is FALSE?
Age — > Eligibility
18: Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional dependencies hold: {A — > B, BC ---> D, E, — > C, D — > Al . What are the candidate keys of R? A. AE, BE B. AE, BE, DE
Roll_number ->
Course_number ---> Course — > name Course_number — > Instructor (Roll number; Course_number) — > Grade The relation (Roll_number; Name; Date_of birth, Age) is
C. AEH, BEH, BCH D. AEH, BEH, DEH Option: D 19: The following functional dependcies are given: AB -> CD, AF — > D, DE --> F, C — > G, F —› E, G --> A Which one of the following options is false?
A. {CF}+ = {ACDEFG} B. {BG}± = {ABCDG} C. {AE }+ = {ACDEFG} D. {AC = {ACDFG} Option: C
Option: A 24: Which of the following contains a complete record of all activity that affected the contents of a database during a certain period offtime A. Report writer B. Query language
20: Which one ofthe following statements is FALSE? A. Any relation with two attributes is in BCNF B. A relation in which every key has only one attributes is in 2NF C. A prime attribute can be transitively dependent on a key in 3 NF relation D. A prime attribute can be transitively dependent on a key in a BCNF relation Option: D
C. Data manipulation language D. Transaction log Option: D 25: Updating a data base means A. revising the file structure B. reorganizing the database C. modifying or adding record occurrences D. All of these
21: Consider the following relational schemes for a library for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection (Title, Author, Catalog_no) Which ofthe following functional dependecies: I. Title Author —› Catalog no. II. Catalog_no ---> Title Author Publisher Year III. Publisher Title Year --> Price. Assume {Author, Title) is the key for both schemes: which ofthe following statements is true? A. Both Book and collection are in BCNF
Option: A 26: Which of the following contains complete record of all activity that affected the contents of a database during a certain period of time A. 4-GL B. d-BASE C. Oracle D. SQL Option: B
B. Both Book and collection are in 3NF only C. Book is in 2NF and Collection is in 3NF D. Both Book and Collection are in 2NF only Option: C 22: Manager's salary details are hidden from the employee. This is
Chapter 3: File Structures 1: The method of access which uses key transformation is known as A. Direct.
A. conceptual level data hiding
B. Hash.
B. physical level data hiding
C. Random.
C. external level data hiding
D. Sequential
D. none of these
Option: B
Option: A 23: The employee salary should not be greater than Rs. 2000. This is
2: The file organization that provides very fast access to any arbitrary record of a file is A. Ordered file
A. integrity constraint
B. Unordered file
B. referential constraint
C. Hashed file
C. over-defined constraint
D. B-tree
D. feasible constraint
Option: C
Option: C 3: The physical location of a record is determined by a mathematical formula that transforms a file key into a record location is : A. B-Tree File B. Hashed File
7: The order of an internal node in a B* tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?
C. Indexed File D. Sequential file.
A. 24
Option: B
B. 25 C. 26 D. 27
4: A B-tree of order m has maximum of _____________ children
Option: C
A. m
8: A clustering index is defined on the fileds which are of type
B. m+1 C. m-1 D. m/2
A. Non-key and ordering
Option: A
B. Non-key and non-ordering C. Key and ordering
5: Which two files are used during operation of the DBMS A. Query languages and utilities
D. Key and non-ordering
Option: A
B. DML and query language C. Data dictionary and transaction log
D. Data dictionary and query language
Chapter 4: Query languages SQL
Option: C 1: The language used in application programs to request data from the DBMS is referred to as the 6: Match List-I with List-II and select the correct answer using the codes given below the lists:
A. DML B. DDL
ListI
List-II
A. Primary index Dense B. Clustered index C. Secondary key index D. Secondary non key index.
A
B
C
D
1.
2. sparse
C. VDL D. SDL Option: A 2: The language which has recently become the defacto standard for interfacing application programs with relational database system is A. Oracle. B. SQL.
A. 2 1 1 2
C. DBase
B. I 1 2 1
D. 4GL.
C. 1 2 2 1 D. 2 2 1 1
Option: B
3: The DBMS language component which can be embedded in a program is
8: Which of the following is a valid SQL type? A. CHARACTER
A. The data definition language (DDL).
B. NUMERIC
B. The data manipulation language (DML).
C. FLOAT
C. The database administrator (DBA).
D. All of the above
D. A query language.
Option: D
Option: B 4: Count function in SQL returns the number of
9: Which of the following operations need the participating relations to be union compatible?
A. Values.
A. UNION
B. Distinct values
B. INTERSECTION
C. Groups.
C. DIFFERENCE
D. Columns.
D. All of the these
Option: A Explanation : Count function in SQL returns the number of values. (Count function counts all the not null values in the specific column. If we want to count only distinct values than the DISTINCT keyword is also to be used)
Option: D 10: The full form of DDL is A. Dynamic Data Language B. Detailed Data Language
5: It is possible to define a schema completely using
C. Data Definition Language D. Data Derivation Language
A. VDL and DDL.
Option: C
B. DDL and DML. C. SDL and DDL. D. VDL and DML. Option: B
11: Which of the following is a legal expression in SQL? A. SELECT NULL FROM EMPLOYEE; B. SELECT NAME FROM EMPLOYEE;
6: The statement in SQL which allows to change the definition of a table is A. Alter. B. Update. C. Create.
C. SELECT NAME FROM EMPLOYEE WHEN SALARY = NULL; D. None of the above Option: B 12: Which of the following is a comparison operator in SQL?
D. Select. Option: A 7: Which of the following is correct: A. a SQL query automatically eliminates duplicates. B. SQL permits attribute names to be repeated in the same relation. C. a SQL query will not work if there are no indexes on the relations D. None of these Option: D
A. = B. LIKE C. BETWEEN D. All of the above Option: A Explanation : References :- MSDN Link
13: To delete a particular column in a relation the command used is: A. UPDATE TABLE
C. NUMERIC D. VARCHAR Option: A
B. TRUNCATE COLUMN C. ALTER , DROP D. DELETE COLUMN Option: C 14: The ______ operator is used to compare a value to a list of literals values that have been specified. A. BETWEEN B. ANY
19: A relational database contains two tables student and department in which student table has columns (roll_no, name and dept_id )and department table has columns (dept-id and dept-name). The following insert statements were executed successfully to populate the empty tables: Insert into department values (1, 'Mathematics'); Insert into department values(1, 'Physics'); Insert into department values(1, 'Navin', 1); Insert into student values (2, 'Ravi', 2); Insert into student values (3, `Gitu', 1);
C. IN D. ALL
How many rows and columns will be retrived by the following SQL, statement?
Option: C 15: _____________ function divides one numeric expression by another and returns the remainder A. POWER B. MOD C. ROUND D. REMAINDER
Select * from student, department; A. 0 row and 4 columns B. 3 rows and 4 columns C. 3 rows and 5 columns D. 6 rows and 5 columns Option: D
Option: B 16: A data manipulation command the combines the records from one or more tables is called
1: Transaction processing is associated with everything below except
A. SELECT
A. Producing detail, summary, or exception reports B. Recording a business activity
B. PROJECT
C. Confirming an action or triggering a response
C. JOIN
D. Maintaining data.
D. PRODUCT Option: C 17: _________ is a virtual table that draws its data from the result of an SQL SELECT statement. A. View B. Synonym C. Sequence D. Transaction Option: A 18: _________ data type can store unstructured data A. RAW B. CHAR
Option: C
