Вы находитесь на странице: 1из 14

Database B. Relational model.

C. Schema.
D. Sub schema.
Chapter 1: ER-model & Relational
Option: D
Model
1: In tuple relational calculus P1 P2 is equivalent
to 6: A report generator is used to

A. P1 P2 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. It is an integrated collection of logically related
A. Is the entire database. records.
B. describe data in terms of relational tables and B. It consolidates separate files into a common
columns, object-oriented classes, pool of data records.
and XML tags. C. Data stored in a database is independent of the
C. Describes how data is actually stored on disk. application programs using it
D. All of the above
D. Both (A) and (C)
Option: D
Option: A

8: A relational database developer refers to a record


3: Related fields in a database are grouped to form a
as

A. Data file
A. A criteria.
B. Data record.
B. A relation.
C. Menu
C. A tuple.
D. Bank.
D. An attribute.

Option: B Option: C

Explanation :
9: The relational model feature is that there
Related data fields in a database are grouped to
form a data record.
(A record is a collection of related fields) A. Is no need for primary key data

4: The database environment has all of the following B. Is much more data independence than some
components except: other database models
C. Are explicit relationships among records
A. Users. D. Are tables with many dimensions
B. Separate files
Option: D
C. Database.
Explanation :
D. Database administrator In relational model data is stored in tables and if
we talk about data independence it is one of the
Option: B
major feature of DBMS which holds in all
DBMS models.
5: The way a particular application views the data
from the database that the application uses is a

A. Module.
10: Conceptual design Option: B

A. Is a documentation technique. 14: An advantage of the database management


B. Needs data volume and processing approach is
frequencies to determine the size of the
database. A. Data is dependent on programs
C. Involves modelling independent of the DBMS
B. Data redundancy increases.
D. Is designing the relational model.
C. Data is integrated and can be accessed by
Option: C multiple programs.
D. None of the above

11: The method in which records are physically Option: C


stored in a specified order according to a
key field in each record is 15: A DBMS query language is designed to

A. Hash A. Support end users who use English-like


commands
B. Direct. B. Support in the development of complex
C. Sequential applications software
D. All of the above. C. Specify the structure of a database.
D. All of the above.
Option: A

Explanation :
A method in which records are physically stored Option: D
in a specified order according to a key field in
each record is hash. (In hash method, a hash 16: Data independence means
function is performed on the key value to
determine the unique physical address of the
record to store or retrieve) A. Data is defined separately and not included in
programs
B. Programs are not dependent on the physical
12: A subschema expresses attributes of data.
C. Programs are not dependent on the logical
A. The logical view attributes of data
D. Both (B) and (C).
B. The physical view.
C. The external view. Option: D
D. All of the above.
17: E-R model uses this symbol to represent weak
Option: C entity set ?
Explanation :
A subschema expresses the external view. A. Dotted rectangle
(External schemas are called also called as B. Diamond
subschemas) C. Doubly outlined rectangle
D. None of these
13: Which one of the following statements is false?
Option: C
A. The data dictionary is normally maintained by 18: SET concept is used in :
the database administrator.
A. Network Model
B. Data elements in the database can be modified
by changing the data dictionary. B. Hierarchical Model
C. Relational Model
C. The data dictionary contains the name and D. None of these
description of each data element.
Option: A
D. The data dictionary is a tool used exclusively
by the database administrator.
19: Relational Algebra is D. None of these
Option: C
A. Data Definition Language
B. Meta Language
25: It is better to use files than a DBMS when there
C. Procedural query Language 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 C. Complex relationships among data
called D. All of the above.
Option: B
A. Primary key
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 D. Independent of both hardware and software
of R1 and R2
Option: D
A. Cartesian product
B. Difference 27: What is a relationship called when it is
C. Intersection maintained between two entities?
D. Product
A. Unary
Option: A B. Binary
C. Ternary
22: DBMS helps achieve D. Quaternary
Option: B
A. Data independence
B. Centralized control of data
C. Neither (A) nor (B) 28: Which of the following operation is used if we
are interested in only certain columns of a table?
D. both (A) and (B)
Option: D A. PROJECTION
B. SELECTION
23: Which of the following are the properties of C. UNION
entities? D. JOIN
Option: A
A. Groups
B. Table
C. Attributes 29: The RDBMS terminology for a row is
D. Switchboards
A. Tuple.
Option: C B. Relation.
C. Attribute.
24: In a relation D. Degree.
Option: A
A. Ordering of rows is immaterial
B. No two rows are identical
C. (A) and (B) both are true
30: Which of the following is an advantage of view?
Option: D
A. Data security
B. Derived columns
36: Which of the operations constitute a basic set of
C. Hiding of complex queries operations for manipulating relational data?
D. All of the above
A. Predicate calculus
B. Relational calculus
Option: D
C. Relational algebra
D. None of the above
31: The users who use easy-to-use menu are called
Option: C
A. Sophisticated end users 37: Which of the following is another name for weak
B. Nave users. entity?
C. Stand-alone users.
D. Casual end user A. Child
B. Owner
Option: B
C. Dominant
D. All of the above
32: Which database level is closest to the users?
Option: A
A. External 38: Which of the following database object does not
B. Internal physically exist?
C. Physical
D. Conceptual A. Base table
B. Index
Option: A
C. View
33: Which are the two ways in which entities can D. None of the above
participate in a relationship?
Option: C
A. Passive and active
B. Total and partial 39: NULL is
C. Simple and Complex
D. All of the above A. The same as 0 for integer
B. The same as blank for character
Option: B
C. The same as 0 for integer and blank for
34: The result of the UNION operation between R1 character
and R2 is a relation that includes D. Not a value
Option: D
A. All the tuples of R1
B. All the tuples of R2
40: Which of the following is record based logical
C. All the tuples of R1 and R2 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
C. E-R Model
A. Attribute
D. None of these
B. Degree.
C. Tuple. Option: A
D. Domain.
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
Option: B
D. All of the above
47: Consider the join of a relation R with relation S.
Option: D If R has m tuples and S has n tuples, then the
maximum size of join is:
42: A file manipulation command that extracts some
of the records from a file is called
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 48: The natural join is equal to :

43: A primary key is combined with a foreign key A. Cartesian Product


creates B. Combination of Union and Cartesian product
C. Combination of selection and Cartesian
A. Parent-Child relationship between the tables product
that connect them D. Combination of projection and Cartesian
B. Many to many relationship between the tables product
that connect them.
Option: C
C. Network model between the tables that
connect them. 49: Which one of the following is not true for a
D. None of the above view:

Option: A A. View is derived from other tables.


B. View is a virtual table.
44: In E-R Diagram derived attribute are represented C. A view definition is permanently stored as
by part of the database.
D. View never contains derived columns.
A. Ellipse
B. Dashed ellipse
Option: C
C. Rectangle
D. Triangle 50: A primary key if combined with a foreign key
creates
Option: B
A. Parent-Child relationship between the tables
that connect them.
45: Cross Product is a:
B. Many to many relationship between the tables
that connect them.
A. Unary Operator
B. Ternary Operator C. Network model between the tables that
C. Binary Operator connect them.
D. Not an operator
D. None of the above.
Option: C
Option: A

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?
51: In E-R Diagram relationship type is represented national level for each citizen.
by 3. Name: Name of the student.
4. BanIcAccount Num: Unique account number
A. Ellipse at the bank. A student can have multiple account
or joint accounts. This attribute stores
B. Dashed ellipse the primary account number.
C. Rectangle 5. Hostel_Room: Room number ofhe hostel.
D. Diamond Which ofthe following option is
INCORRECT?
Option: D
A. BankAccount Num is a candidate key.
52: Hierarchical model is also called
B. Registration Num can be a primary key
C. UID is candidate key if all students are from
A. Tree structure
same country.
B. Plex Structure D. If S is a superkey such that S UID is NULL
C. Normalize Structure then S UID is also a superkey.
D. Table Structure Option: A

Option: A

53: In E-R diagram generalization is represented by 57: The following functional dependencies hold for
relation R(A, B, C) and S(B, D, E) B > A, A
A. Ellipse > C , the relation R contains 200 tuples and
B. Dashed ellipse relation S contains 100 tuples. What is maximum
number of tuples possibles in natural join R and
C. Rectangle 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 Option: A

A. Direct 58: Which structure is the hierarchical model based


B. Hash
C. Random A. Tree
D. Sequential B. Graph
C. Linked List
Option: B
D. None of the above

55: A table joined with itself is called Option: A

A. Join 59: In the relational model, the number of attributes


B. Self Join and number of tuples iri a relation are termed as
__________and ______________respectively
C. Outer Join
D. Equi Join A. Cardinality, domain
Option: B B. Degree, cardinality
C. Domain degree
56: Consider a relational table with a single record D. Cardinality, degree
for each registered student with the following
attributes. Option: B
1. Registration Num: Unique registration of each
registered student.
2. UID Unique identity number, unique at the
60: In domain relational calculus we create a LHS They don't determine anything so they can
variable for every not be part of key.
If field is not in ANY FD, it must be part of the
key
A. Row
Now considering these 5 points we get D as Key.
B. Column
C. Table
64: Which of the following statement is correct?
D. None of the above
Option: B 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 Option: A


primary key
65: Given the basic ER and relational model which
A. Ease of searching 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 C. In row of a relational table, an attribute have
more than one value.
62: In context with relational Algebra. Which of the D. In row of a relational table, an attribute can
following are unary operatiors. have exactly one vlaue or a NULL value.
1.Select Option: C
2. Project
3. Union
4. Product

A. 1 and 3 only 66 It is desired to design an object-oriented


: employee record system for a company. Each
B. 2 and 4 only employee has a name, unique id and salary.
C. 1 and 2 only Employees belong to diferent categories and their
D. All are binary salary is determined by their category. The
functions geName, getld and compute Salary are
Option: C required. Given the class hierachy below,
possible locations for these functions are:
(i) getld is implemented in the superclass
63: Let R is a relation schema, R(A, B, C, D) and F = (ii) getld is implemented in the subclass
{A > B, B --> C, C > A) is the set of (iii) getName is an abstract funciton in the
functional dependency. Determine the key of superclass
relation ? (iv) getName is implemented in the superclass.
(v) getName is implemented in the subclass
A. A (vi) getSalary is an abstract function in the
B. B superclas
(vii) getSalary is implemented in the superclass
C. C (viii) getSalary is implemented in the subclass.
D. D Choose the best design
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
A. (i), (iv), (vi), (viii) Given functional dependency
B. (i), (iv), (vii) pincode -> (city) (state)
(street) (city) (state) -->pincode
C. (i), (iii), (v), (vi), (viii)
D. (ii) , (v) , (viii) This is in I NF and 2NF but not in 3NF because it
contain transitive dependency.
Option: A Hence correct answer is (b).
67: Let r be a relation instance with schema R = (A,
B, C, D). We define r1 = A,B,C (r) and r2 = A, 2: A table has fields F1, F2 , F3 , F4, F5 with the
D (r) following functional dependencies
Let S = r1* r2 where * denotes natural join. Fi > F3,
Given that the decomposition of r into r1 and r2 F2 > F4
is lossy, which one of the following is TRUE? (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
D. None of these
Option: C
Option: A
68: Let E1 and E2 be two entities in an E/R diagram
with simple single-valued attributes. R1 and R2
Explanation :
are two relationships between E1 and E2, where
Primary key (candidates key) for this relation is
R1 is one-to-many and R2 is many-to-many. RI
[F1] [F2] because [F1, F2] column contains [F1,
and R2 do not have any attributes of their own.
F2, F3, F4, F5]
What is the minimum number of tables required
So, there is, functional dependency F1 -> F3 , F2
to represent this situation in the relational model?
It also have partial depedency so it is not in 2nd,
3rd NF.
A. 2
B. 3 3: Amongst the ACID properties of a transaction, the
C. 4 'Durability' property requires. that the changes
D. 5 made to the database by a successful transaction
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
D. Always, even if there is a failure of any kind
Chapter 2: Database design
Option: D
1: A relation empdt1 is defined with attributes
empdt1(empcode, name, street, city,
4: In a schema with attributes A, B, C, D and E
state,pincode).
following set of functional dependencies are given
For any pincode, there is only one city and state.
A --> B
Also, for given street, city and state, there is just
A -->C
one pincode.
CD >E
In normalization terms, empdt1 is a relation in
B --> D
E > A
A. 1 NF only Which of the following functional
B. 2 NF and hence also in 1 NF 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 A. CD > AC
B. BD --> CD
Option: B
C. BC > CD
Explanation : D. AC > BC
empdt1 {empcode, name, street, city, state,
Option: B
pincode)
Option: A
Explanation :
CD>A {CD >E;E > A; E >C}
CD > C 8: A table T1 in a relation database has following
BC > CD rows and columns.
B>D; Roll number Marks.
CD>E; 1 10
E>A; 2 20
A>C 3 30
AC>BC: 4 NULL
A>B:
A>C The following sequence of SQL statements was
successfully executed in table T1.

5: Let R(A, B, C, D) be a relational schema with the Update T1 set marks =marks + 5 ;
following functional dependencies A > B, B -->
C, select avg(marks) from T1 ;

A. Gives a lossless join, and is dependency What is the output of the select statement?
preserving.
B. Gives a lossless join, but is not dependency
preserving A. 18.75
B. 20
C. Does not give a loss less join, but is depency C. 25
preserving D. NULL
D. Does not give a lossless join and is not depency
preserving Option: A

Option: A Explanation :
Average = (15+25+35+null)/4 = 18.75
6: Let R(A, B, C, D, E, P, G) be a relational schema
in which the following functional dependencies 9: Which normal form is considered adequate for
are known to hold: relational database design?
AB > CD,
DE > P, A. 2NF
C --> E, B. 3NF
P --> C and B > G . C. 4 NF
The relational schema R is
D. BCNF

A. In BCNF Option: B
B. in 3NF, but not in BCNF
C. In 2NF, but not in 3NF 10: A functional dependency of the form x > y is
trival if
D. Not in 2NF
A. y x
Option: D
B. y x
C. x y
7: Consider the following set of functional
D. x y and y x
dependencies on the schema (A, B, C)
A --> BC, Option: A
B > C,
A > B,
AB > C 11: If every non-key attribute is functionally
The cannonical cover for this set is 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
A. in second normal form but not in third normal
form
12: If a relation is in BCNF, then it is also in 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 16: The relation scheme student performance (name,
maximum normal form applicable to them courseNo, rollNo, grade) has the following
functional dependencies:
1. R(A, B) with productions { A --> B } name, curseNo --> grade
2. R(A, B) with productions { B --> A } Rol INo, courseNo > grade
3 R(A, B) with productions {A > B, B --> A } name > rollNo
4 R(A, B, C) with productions {A -->B, B --> A, rollNo > name
AB --> C } 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
17: Which-one ofthe following statements about
S1: Foreign key allows null values. normal forms is FALSE?
S2: Every binary tables is in BCNF
A. BCNF is stricter than 3 NF
Which of the following is true B. Lossless, dependency -preserving
decomposition into 3 NF is always possible
A. Both S1 and S2 are true C. Loss less, dependency - preserving
decomposition into BCNF is always possible
B. S1 is true D. Any relation with two attributes is BCNF
C. S2 is true
Option: C
D. None of these
Option: B 18: Consider a relation scheme R = (A, B, C, D, E,
15: Consider the following functional dependencies H) on which the following functional
in a database: dependencies hold: {A > B, BC ---> D, E, >
C, D > Al . What are the candidate keys of R?
Date_of_Birth >
Age Age > Eligibility A. AE, BE
B. AE, BE, DE
Name >
Roll_number Roll_number -> C. AEH, BEH, BCH
Name D. AEH, BEH, DEH

Course_number ---> Course> Option: D


name Course_number > Instructor 19: The following functional dependcies are given:
AB -> CD, AF > D, DE --> F, C > G, F
(Roll number; Course_number) > Grade E, G --> A
Which one of the following options is false?
The relation (Roll_number; Name; Date_of birth,
Age) is
A. {CF}+ = {ACDEFG} Option: A
B. {BG} = {ABCDG} 24: Which of the following contains a complete
C. {AE }+ = {ACDEFG} record of all activity that affected the contents of
D. {AC = {ACDFG} a database during a certain period offtime

Option: C
A. Report writer
B. Query language
20: Which one ofthe following statements is C. Data manipulation language
FALSE?
D. Transaction log
A. Any relation with two attributes is in BCNF Option: D
B. A relation in which every key has only one
attributes is in 2NF 25: Updating a data base means
C. A prime attribute can be transitively
dependent on a key in 3 NF relation
D. A prime attribute can be transitively A. revising the file structure
dependent on a key in a BCNF relation B. reorganizing the database
Option: D C. modifying or adding record occurrences
D. All of these
21: Consider the following relational schemes for a Option: A
library for a library database:
Book (Title, Author, Catalog_no, Publisher,
Year, Price) 26: Which of the following contains complete record
Collection (Title, Author, Catalog_no) of all activity that affected the contents of a
Which ofthe following functional dependecies: database during a certain period of time
I. Title Author Catalog no.
II. Catalog_no ---> Title Author Publisher Year A. 4-GL
III. Publisher Title Year --> Price.
Assume {Author, Title) is the key for both B. d-BASE
schemes: which ofthe following statements is C. Oracle
true? D. SQL

A. Both Book and collection are in BCNF 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
Chapter 3: File Structures
Option: C 1: The method of access which uses key
transformation is known as
22: Manager's salary details are hidden from the
employee. This is
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 2: The file organization that provides very fast access


23: The employee salary should not be greater than to any arbitrary record of a file is
Rs. 2000. This 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 7: The order of an internal node in a B* tree index is
into a record location is : the maximum number of children it can have.
Suppose that a child pointer takes 6 bytes, the
A. B-Tree File search field value takes 14 bytes, and the block
size is 512 bytes. What is the order of the internal
B. Hashed File node?
C. Indexed File
D. Sequential file. A. 24
Option: B B. 25
C. 26
4: A B-tree of order m has maximum of D. 27
_____________ children Option: C

A. m
8: A clustering index is defined on the fileds which
B. m+1 are of type
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 D. Key and non-ordering
DBMS

A. Query languages and utilities


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
List- C. VDL
I List-II
D. SDL
A. Primary index 1. Option: A
Dense
B. Clustered 2: The language which has recently become the
index 2. sparse defacto standard for interfacing
C. Secondary key index application programs with relational database
D. Secondary non key index. system is

A B C D A. Oracle.
B. SQL.
A. 2 1 1 2 C. DBase
B. I 1 2 1 D. 4GL.
C. 1 2 2 1
Option: B
D. 2 2 1 1
3: The DBMS language component which can be 8: Which of the following is a valid SQL type?
embedded in a program is
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
9: Which of the following operations need the
4: Count function in SQL returns the number of 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 Option: D
values. (Count function counts all the not null 10: The full form of DDL is
values in the specific column. If we want to count
only distinct values than the DISTINCT keyword
is also to be used) 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. 11: Which of the following is a legal expression in
D. VDL and DML. SQL?
Option: B
A. SELECT NULL FROM EMPLOYEE;
B. SELECT NAME FROM EMPLOYEE;
6: The statement in SQL which allows to change the C. SELECT NAME FROM EMPLOYEE
definition of a table is WHEN SALARY = NULL;
D. None of the above
A. Alter. Option: B
B. Update. 12: Which of the following is a comparison operator
C. Create. in SQL?
D. Select.
A. =
Option: A
B. LIKE
C. BETWEEN
7: Which of the following is correct:
D. All of the above
A. a SQL query automatically eliminates Option: A
duplicates.
B. SQL permits attribute names to be repeated in Explanation :
the same relation. References :- MSDN Link
C. a SQL query will not work if there are no
indexes on the relations
D. None of these
Option: D
13: To delete a particular column in a relation the C. NUMERIC
command used is: D. VARCHAR
Option: A
A. UPDATE TABLE
B. TRUNCATE COLUMN
C. ALTER , DROP 19: A relational database contains two tables student
and department in which student table has
D. DELETE COLUMN columns (roll_no, name and dept_id )and
Option: C department table has columns (dept-id and
dept-name). The following insert statements
were executed successfully to populate the empty
14: The ______ operator is used to compare a value tables:
to a list of literals values that have
been specified. Insert into department values (1, 'Mathematics');
Insert into department values(1, 'Physics');
Insert into department values(1, 'Navin', 1);
A. BETWEEN
Insert into student values (2, 'Ravi', 2);
B. ANY 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
Select * from student, department;
15: _____________ function divides one numeric
expression by another and returns the remainder
A. 0 row and 4 columns
A. POWER B. 3 rows and 4 columns
B. MOD C. 3 rows and 5 columns
C. ROUND D. 6 rows and 5 columns
D. REMAINDER Option: D
Option: B
1: Transaction processing is associated with
everything below except
16: A data manipulation command the combines the
records from one or more tables is called
A. Producing detail, summary, or exception
reports
A. SELECT B. Recording a business activity
B. PROJECT C. Confirming an action or triggering a response
C. JOIN D. Maintaining data.
D. PRODUCT
Option: C
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

Вам также может понравиться