Consider the following two commands C1 and C2 on the relation R from an SQL database: 

C1: drop table R;

C2: delete from R;

Which of the following statements is TRUE?

I. Both C1 and C2 delete the schema for R.

II. C2 retains relation R, but deletes all tuples in R.

III. C1 deletes not only all tuples of R, but also the schema for R.

(A) I only (B) I and II only

(C) II and III only (D) I, II and III

1 Answer

Answer :

(C) II and III only

Related questions

Description : Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Last Answer : (D) 4 and 2 respectively

Description : Relational database schema normalization is NOT for: (A) reducing the number of joins required to satisfy a query. (B) eliminating uncontrolled redundancy of data stored in the database. (C) ... could otherwise occur with inserts and deletes. (D) ensuring that functional dependencies are enforced. 

Last Answer : reducing the number of joins required to satisfy a query.

Description : Consider the two class classification task that consists of the following points: Class C1: [1 1.5] [1 -1.5] Class C2: [-2 2.5] [-2 -2.5] The decision boundary between the two classes using single perceptron is given by: (A) x1+x2+1.5=0 (B) x1+x2-1.5=0 (C) x1+1.5=0 (D) x1-1.5=0

Last Answer : (C) x1+1.5=0 

Description : Consider the following database table : Create table test( one integer, two integer, primary key(one), unique(two), check(one≥1 and ≤10), check(two≥1 and ≤5) ); How many data records/tuples atmost can this table contain ?  (A) 5 (B) 10 (C) 15 (D) 50

Last Answer : (A) 5 

Description : Consider a database table R with attributes A and B. Which of the following SQL queries is illegal ? (A) SELECT A FROM R; (B) SELECT A, COUNT(*) FROM R; (C) SELECT A, COUNT(*) FROM R GROUP BY A; (D) SELECT A, B, COUNT(*) FROM R GROUP BY A, B;

Last Answer : (B) SELECT A, COUNT(*) FROM R;

Description : In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To ... D) To fill a column in a tuple when that column does not really exist for that particular tuple.

Last Answer : (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.

Description : A Network Schema (A) restricts to one to many relationship (B) permits many to many relationship (C) stores Data in a Database (D) stores Data in a Relation

Last Answer : (B) permits many to many relationship

Description : Consider a CUSTOMERS database table having a column CITY filled with all the names of Indian cities (in capital letters). The SQL statement that finds all cities that have GAR somewhere in its name, ... *from customers where city like %GAR%'; (D) Select *from customers where city as '%GAR';

Last Answer : Answer: C

Description : Which of the following statements is TRUE? D1: The decomposition of the schema R(A,B,C) into R1(A,B) and R2(A,C) is always lossless. D2: The decomposition of the schema R(A,B,C,D,E) having AD→B, C→DE, B→AE, AE→C ... ,D,E) is lossless. (A) Both D1 and D2 (B) Neither D1 and D2 (C) Only D1 (D) Only D2

Last Answer : (D) Only D2

Description : Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: I: {B} II: {B, C} III: {A, D} IV: {C, D} If ... the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Last Answer : (C) II only

Description : Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are ... (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Last Answer : (D) Only I is correct.

Description : Consider the following table Furniture. Write SQL commands for the statements (i) to (viii) and write output for SQL queries (ix) and (x). -Technology

Last Answer : SQL commands for the given statements (i) to (viii) ;1. SELECT FCODE, NAME. PRICE FROM Furniture WHERE PRICE < 5000;2. SELECT NAME. PRICE FROM Furniture3.4. WHERE NAME LIKE %table% ;5. SELECT DISTINCT WCODE ... ;15.16. Output for SQL queries (ix) and (x)(ix)SUM(PRICE)6500(x)COUNT(DISTINCT PRICE)5

Description : Which of the following statements regarding the alternative complement pathway are true? a. C1, C4 and C2 are involved b. NH3 apparently activates complement via this pathway c. Factors B and D are involved d. Endotoxin activates complement via the alternative pathway

Last Answer : Answer: b, c, d The alternative pathway differs from the classic pathway in that the first steps involving C1, C4 and C2 are bypassed. (See Figure 6-3 previously reproduced.) ... been correlated with impaired renal function and the presence of complement components at the sites of renal injury

Description : Assertion (A) : The value of k for which the system of linear equations kx+2y+1=0 and 6x+4y-5=0 has a unique solution is 3. Reason (R):The system of linear equations a1x + b1y + c1= 0 and a2x + ... not the correct explanation of A. (c) A is correct; R is incorrect. (d) R is correct; A is incorrect.

Last Answer : (d) R is correct; A is incorrect.

Description : Consider a schema R(MNPQ) and functional dependencies M→N, P→Q. Then the decomposition of R into R1(MN) and R2(PQ) is ............. (1) Dependency preserving but not lossless ... and lossless join (3) Lossless join but not dependency preserving (4) Neither dependency preserving nor lossless join. 

Last Answer : Answer: 1

Description : An instance of a relation is a time varying set of …………………. A) Tuples B) Rows C) Both of them D) None of them

Last Answer : C) Both of them

Description : In SQL, which commandis used to remove a stored function from the database? . REMOVE FUNCTION B. DELETE FUNCTION C. DROP FUNCTION D. ERASE FUNCTION E. None of the above

Last Answer : DROP FUNCTION

Description : For a database relation R(A,B,C,D) where the domains of A,B,C and D include only atomic values, only the following functional dependencies and those that can be inferred from them are: A→C B→D The ... form but not in third normal form (4) Both in second normal form as well as in third normal form

Last Answer : First normal form but not in second normal form

Description : To delete a database ................... command is used A) delete database database_name B) Delete database_name C) drop database database_name D) drop database_name

Last Answer : C) drop database database_name

Description : The number of attributes in relation is called as its ..................... A) Cardinality B) Degree C) Tuples D) Entity

Last Answer : B) Degree

Description : The number of tuples in a relation is called its …………. While the number of attributes in a relation is called it’s ……………….. A) Degree, Cardinality B) Cardinality, Degree C) Rows, Columns

Last Answer : B) Cardinality, Degree

Description : …………… table store information about database or about the system. A) SQL B) Nested C) System D) None of these

Last Answer : C) System

Description : Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S: I. πA,B(R⋈S) II. R⋈πB(S) III. R∩(πA(R) Χ πB(S)) IV. πA,R.B(R Χ S) where R.B refers to ... IV are the same query. (C) I, II and IV are the same query. (D) I, III and III are the same query.

Last Answer : (D) I, III and III are the same query.

Description : ………..defines the structure of a relation which consists of a fixed set of attribute-domain pairs. A) Instance B) Schema c) Program D) Super Key

Last Answer : B) Schema

Description : Anything that affects the database schema is a part of A) DML B) DCL C) DDL D) All of the above

Last Answer : D) All of the above

Description : A logical schema A) is the entire database B) is a standard way of organizing information into accessible parts. C) Describes how data is actually stored on disk. D) All of the above

Last Answer : B) is a standard way of organizing information into accessible parts.

Description : A top-to-bottom relationship among the items in a database is established by a A) Hierarchical schema B) Network schema C) Relational Schema D) All of the above

Last Answer : A) Hierarchical schema

Description : The database schema is written in (A) HLL (B) DML (C) DDL (D) DCL

Last Answer : (C) DDL

Description : DBMS provides the facility of accessing data from a database through (A) DDL (B) DML (C) DBA (D) Schema 

Last Answer : (B) DML

Description : For a database relation R(a, b, c, d) where the domains of a, b, c, d include only the atomic values. The functional dependency a → c, b → d holds in the following relation (A) In 1NF not in 2NF (B) In 2NF not in 3NF (C) In 3NF (D) In 1NF

Last Answer : (A) In 1NF not in 2NF 

Description : With reference to the above given tables, write commands in SQL for (i) and (ii) and output for (iii) below: -Technology

Last Answer : (i) select TName, Passenger from Train T, Reservation R where T.TrainId=R.TrainId;(ii) select T.* from Train T, Reservation R where T.TrainId!=R.TrainId;(iii)TrainIdTNameSourceDestination3424Lucknow MailLucknowNew Delhi5400Century ExpressNew DelhiKanpur

Description : Consider the following three SQL queries (Assume the data in the people table) : (a) Select Name from people where Age>21; (b) Select Name from people where Height>180; (c) Select Name from people where (Age>21) or (Height ... number of rows returned by the SQL query (c) ? (A) 3 (B) 7 (C) 10 (D) 21

Last Answer : (C) 10

Description : Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data ... weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Last Answer : (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Description : There are six cars numbered as C1, C2, C3, C4, C5 and C6 participating in a race. The results are as follows: C2 does not win. Two cars are in between C4 and C5. C1 is behind C4 and C5. C2 is ahead of C5 ... C4. If C4 is disqualified, then C2 finishes the race at which position? a) 2 b) 3 c) 1 d) 4

Last Answer : Ans: option (a)

Description : There are six cars numbered as C1, C2, C3, C4, C5 and C6 participating in a race. The results are as follows: C2 does not win. Two cars are in between C4 and C5. C1 is behind C4 and C5. C2 is ahead of C5 ... intervening. C6 is ahead of C4. Which car comes in the first place? a) C1 b) C2 c) C3 d) C6

Last Answer : Ans: option (d)

Description : For execution of DELETE SQL query in JDBC, ............. method must be used. A) executeQuery() B) executeDeleteQuery() C) executeUpdate() D) executeDelete()

Last Answer : C) executeUpdate()

Description : Glycine contributes to the following C and N of purine nucleus: (A) C1, C2 and N7 (B) C8, C8 and N9 (C) C4, C5 and N7 (D) C4, C5 and N9

Last Answer : Answer : C

Description : Find the equivalent damping constant of the system shown in Fig. for c1=22N.s/m and c2= 11N.s/m a) 40 N/m 2 b)38 N/m 2 c)44 N/m 2 d)8.8 N/m 2

Last Answer : c)44 N/m 2

Description : Anomers of D-glucopyranose differ in their stereochemistry at __________. (a) C1 (b) C2 (c) C3 (d) C4

Last Answer : C1

Description : What do the dotted lines connecting C1, C2, C5, and C6 indicate?

Last Answer : The dotted lines indicate that these capacitors are "ganged" and are tuned together with a single control.

Description : Photorespiration is a. C1 photosynthesis b. C2 photosynthesis c. C3 photosynthesis d. C4photosynthesis

Last Answer : b. C2 photosynthesis

Description : In a transistor Colpitts oscillator, C1 = 0.001 µF, C2 = 0.01 µF and L = 5 µH. The frequency of oscillation in MHz will be (a) 2.37 MHz (b) 10.00 MHz (c) 11.54 MHz (d) 9.09 MHz 

Last Answer : c

Description : Equivalent capacitance ‘C’ of a system of capacitors C1,C2,C3 connected in parallel is

Last Answer : Equivalent capacitance ‘C’ of a system of capacitors C1,C2,C3 connected in parallel is C = C1+C2+C3

Description : Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram: If different symbols stand for different values (e.g., t1 is definitely not equal to t2 ... diagram ? (A) I only (B) I and II only (C) II only (D) I, II and III

Last Answer : (A) I only