A. select.
B. project.
C. rename.
D. union.
Union is the binary operation and others are unary operations.
A. two.
B. three.
C. four.
D. five.
There are three data models available : Relational, Hierarchical and Network data model.
A. data dependency.
B. machine performance.
C. complexity.
D. flexibility.
The main disadvantage of this model is data dependency. If we delete the parent node, child node automatically gets deleted.
A. reduction of data dependency.
B. machine performance.
C. complexity.
D. flexibility.
The main disadvantage of relational model is machine performance. If the number of tables increases, the response time gets increased.
A. entity
B. attributes
C. entity set.
D. relationship.
A set of entities of same type, i.e., which share common properties constitutes an entity set.
A. entity.
B. attributes.
C. entity set.
D. relationship.
A relationship is an association among several entities. For example, a teacher teaches a student. Here, teacher and student are entities and 'teaches' is the relationship between them.
A. primary key.
B. composie key.
C. alternate key.
D. foreign key.
A foreign key is a field (or fields) that points to the primary key of another table. The purpose of the foreign key is to ensure referential integrity of the data.
A. Candidate Key.
B. Composite key.
C. Foreign key.
D. Secondary Key.
A foreign key is used to represent the relationship between two tables. The table in which this non-key attribute i.e., the foreign key attribute exists, is called a Foreign table or Detail table and the table that defines the Primary-key, which the foreign-key of detail-table refers to, is called Primary table or Master table.
A. degree.
B. cardinality.
C. attributes.
D. entity.
Number of rows (tuples) in a relation is called cardinality of the relation.
A. attribute.
B. tuple.
C. cardinality.
D. entity.
In the context of databases, a tuple is one record (one row). A tuple consists of different fields which relate to a single unit of information.
A. schema.
B. preschema.
C. post-schema.
D. subschema.
A subschema lets the user have access to different areas of applications in which the user designed. The areas that are included in an application are set, types, record types, data items and data aggregates.
A. tuple.
B. attribute.
C. field.
D. degree.
In computer science, data that has several parts can be divided into different fields. For example : to represent today's date we can use three distinct fields, i.e., the day, the month and the year.
A. reduced redundancy.
B. no data sharing.
C. secured data.
D. standardized data.
In file management system, it is not possible to share the data. Due to it, redundancy of data is possible.
A. a queue.
B. a linked list.
C. a tree.
D. a stack.
In tree, one node (parent node) is connected to many other nodes (child nodes). It forms one-to-many relationship i.e. one parent node may have more than one child nodes.
A. relational.
B. network.
C. hierarchical.
D. conceptual.
Hierarchical data model is in the form of a tree. In tree, one node (parent node) is connected to many other nodes (child nodes), thus forming one-to-many relationship.
A. a relation.
B. a record.
C. a degree.
D. an operator.
The row of a table is called as tuple, which is equivalent to a record.
A. relational data model.
B. network data model.
C. hierarchical data model.
D. tree data model.
The relational model for database management is a database model based on first-order predicate logic, first formulated and proposed in 1969 by E.F. Codd.The relational data model uses the concept of tables.
A. table.
B. relation.
C. record.
D. tree.
An ordered set of fields that represents a complete set of information is known as record.
A. Π PRODCODE, PRICE ( s SUPPLIER = “QWIK” && PRICE > 100 (Product) ).
B.
PRODCODE, PRICE (Π SUPPLIER = “QWIK” ^ PRICE > 100 (Product) ).
C. Π SUPPLIER = “QWIK” ^ PRICE > 100
PRODCODE, PRICE (Product).
D. Π PRODCODE, PRICE (
SUPPLIER = “QWIK” ^ PRICE > 100 (Product) ).
We have to display the columns PRODCODE and PRICE so project operation is used for this. The condition is that supplier should be QWIK and Price should be greater than 100.
A.
PRODCODE, NAME (Π SUPPLIER = “VXL Suppliers” (Product) .
B. Π PRODCODE, NAME (
SUPPLIER = “VXL Suppliers” (Product) ) .
C. Π PRODCODE, NAME (Product)
SUPPLIER = “VXL Suppliers” (Product).
D. (
SUPPLIER = “VXL Suppliers” (Product) Π PRODCODE, NAME ).
The columns to be displayed are product name(NAME) and product code(PRODCODE) where suppliers are VXL.
A. Π PRODCODE, NAME (Product).
B. (Product) Π PRODCODE, NAME.
C.
PRODCODE, NAME (Product).
D. (Product)
PRODCODE, NAME.
It is a simple select statement to display product name(NAME) and code(PRODCODE) of all the rows.
A. ( Product )
PRICE > 100.
B. ( Product ) Π PRICE > 100.
C.
PRICE > 100 ( Product).
D. Π PRICE > 100 ( Product).
All the columns from the table are to be selected where price is greater than 100.
A. records are organized as trees.
B. records are connected by links.
C. data is organized into tables.
D. data security cannot be ensured.
In hierarchical data model, the data is organised in the form of trees from top to bottom.
A. records are organized as trees.
B. records are connected by links.
C. data is organized into tables.
D. data modification cannot be performed.
In network data model, the records are connected by links to form a network.
A. records are organized as trees.
B. records are connected by links.
C. data is organized into tables.
D. data security cannot be ensured.
In relational algebra, the data is organised in the form of tables where columns are attributes and rows contain the data for these attributes.
A. degree of the relations must be the same.
B. cardinality of the relations must be the same.
C. corresponding domains must be the same.
D. a new resultant relation is created.
In relational algebra,while performing union operation between two relations their cardinality should be same.
A. extracts columns from a relation.
B. extracts tuples from a relation depending upon a condition.
C. organizes data into tables.
D. extracts rows from a relation.
The project operation helps to remove data redundancy by removing the duplicate columns.
A. equal to zero (0).
B. same as blank spaces.
C. an unknown value.
D. same as special characters.
When the value for any column is not defined by the user or it is unknown, then in that case, NULL values are used.
A.
AUTHOR = “
A.ROY” (Π NAME, PRICE (Booklist) ).
B. Π NAME, PRICE (
AUTHOR = “
A.ROY” (Booklist) .
C.
AUTHOR = “
A.ROY” (Π NAME, PRICE) (Booklist).
D. Π NAME, PRICE (Booklist) (
AUTHOR = “
A.ROY”.
The query is to select the columns name and price from the relation Books where author=A.Roy.
A. (Booklist)
AUTHOR = “
A.ROY”.
B. (Booklist) AUTHOR = “
A.ROY”
.
C.
AUTHOR = “
A.ROY” (Booklist) .
D.
(Booklist) AUTHOR = “
A.ROY”.
Select operation is signified by
. The table name is booklist and the predicate or condition is author =A.ROY.
A. Cartesian product of two relations r1 and r2 is written as r1 x r2.
B. The number of attributes in the resulting table is the sum of the number of attributes in both the tables.
C. The number of tuples in the resulting table is the sum of the number of tuples in both the tables.
D. The resulting relation has columns from both the tables and rows that give all possible combinations of rows between the two tables.
When cartesian product of two tables is found then the number of tuples in the resultant relation is the product of the number of tuples in both the relations.
A. the number of columns in the 2 tables is different.
B. the domains of the corresponding columns are the same.
C. the number of rows in the 2 tables is different.
D. the number of rows in the 2 tables is the same.
Union operation between two tables is only possible when they are having similar number of attributes.
A. is denoted by the Greek letter ‘Π’ .
B. is denoted by the Greek letter ‘S’ .
C. is denoted by the Greek letter ‘d’ .
D. is denoted by the Greek letter
.
The select operation of relational database is represented by the greek letter i.e.
(sigma) in relational algebra.
A. Relational Algebra involves operations on one or more relations.
B. The select operation gives a horizontal subset of the relation.
C. The project operation gives a vertical subset of a relation.
D. For select operation to work, the relation must be select compatible.
When the select operation is being performed then the conditions being applied should be applicable to the relation.
A. A relation can have only one Primary Key.
B. Every Primary Key value must exist as a Foreign Key.
C. A Primary Key can have NULL or unique values.
D. A Primary Key can be an Alternate Key.
A primary key is used to uniquely identify an entity so its values must be unique. No two entities can have the same value of primary key.
A. produces a relation with double the number of tuples.
B. produces a relation with tuples existing in any one relation.
C. produces a relation with tuples of both the relations.
D. produces a relation with tuples common to both relations.
The union operation combines two relations and projects the tuples of both the relations.
A. is a product of two relations.
B. has as many rows as the sum of the 2 relations.
C. has as many columns as the larger table.
D. has rows that are common in participating tables.
Cartesian product of two relations is the total number of elements in a given relation.
It is given as M X N.
A. selects conditions to be satisfied.
B. selects columns that satisfy a condition.
C. selects rows that satisfy a condition.
D. selects relation that satisfy a condition.
The projection operation in database selects the columns that fulfill a given condition.
A. selects conditions to be satisfied.
B. selects columns that satisfy a condition.
C. selects rows that satisfy a condition.
D. selects relation that satisfy a condition.
The select statement in database helps to find out the rows that fulfill a given condition.
A. cannot be part of the primary key.
B. are the foreign key and primary key attributes.
C. uniquely identifies rows in a table.
D. uniquely identifies columns in a table.
Candidate keys are a set of keys that taken together can distinguish one row from other.
A. are Candidate Keys that are not part of the Primary Key.
B. are Candidate Keys that can be used as Foreign Keys.
C. are Foreign Keys that can also be used as Primary Keys.
D. are Candidate Keys, including Primary Key.
Alternate keys are the candidate keys which can be used in place of primary key in case it is not available.
A. is a column of another relation in the database.
B. verifies values against the Primary Key in another relation.
C. can have only unique and non-null values.
D. specifies the possible values a column can have.
A foreign key is an attribute in one table which acts as a primary key in other relation. So, its values in both the tables should match.
A. is the first column of a relation.
B. stores NULL for unknown values.
C. can have only unique values.
D. can hold only numeric values.
A primary key is an attribute through which an object can be distinguished from other objects. Therefore, it should always have unique values and can never be NULL.
A. number of columns in a table.
B. number of rows in a table.
C. an unknown quantity for a table.
D. the same for every table.
Cardinality is the number of rows or instances of a given data item.
A. number of columns in a table.
B. number of rows in a table.
C. product of number of rows and columns.
D. same for every table.
Degree is the number of attributes of an entity. The attributes in a relational database are represented in the form of columns.
A. set of values existing in a column.
B. the set of names of the relations.
C. set of possible values in a column.
D. product of number of rows and columns.
Domain is defined as the set of values which an attribute can take.
A. tuple.
B. column.
C. relation.
D. attribute.
In relational database, the columns denote the attributes or properties of a given data.
A. tuple.
B. column.
C. relation.
D. attribute.
In relational database, a table is known as a Relation because it expresses the relation between the different data items in the form of rows and columns.
A. tuples.
B. columns.
C. relations.
D. attributes.
In relational database, the data is expressed in the form of rows and columns. The rows contain the different values of the attributes. The rows are called tuples.
A. Object-Oriented, Network and Hierarchical.
B. Relational, Network and Hierarchical.
C. Relational, Object-based and Hierarchical.
D. Object-based, Relational and Network.
To represent data and the relationship between data, three data models that have been specified are :- 1. Relational Model. 2. Network Model. 3. Hierarchial Model.
A. refers to storage of data separately from information.
B. refers to updation of all tables independently.
C. keeps the data accurate and consistent.
D. allows changes in structure without affecting access of data.
Data independance means that changes at one level can be made without affecting the other levels of data.
A. provides views according to user’s requirements.
B. describes how data are actually stored.
C. describes the relationships among the data .
D. is closest to the user.
At external level, the data is managed according to the need of the user. Only the essential features are available to the user.
A. provides views according to user’s requirements.
B. describes how data are actually stored.
C. describes the relationships among the data.
D. is closest to the user.
At the conceptual or logical level, the relationship among the different data entities is defined.
A. a stored query accessible as a virtual table.
B. a stored query accessible as a real table.
C. a stored query accessible as a standard table.
D. a stored query accessible as a transparent table.
Unlike ordinary tables (base tables) in a relational database, a view does not form part of the physical schema, it is a dynamic virtual table computed or collated from data in the database.
A. LOWER, UPPER and REPLICATE.
B. ALTER AND DROP.
C. SELECT, CREATE.
D. UPDATE.
SQL provides several types of built in functions that return different kinds of information from the database. These are lower, upper, replicate, substr, getdate()etc. SELECT, UPDATE, ALTER, DROP are commands in SQl.
A. INSERT.
B. UPDATE.
C. DELETE.
D. ORDER BY.
A view is a virtual table with no data, but can be operated like any other table.
A. ORDER BY.
B. HAVING.
C. GROUP BY.
D. SORT.
ORDER BY is used for sorting the result set. By default it will sort in ascending order but if we want the result set in descending order, then we use ORDER BY DESC.
A. DROP.
B. DELETE.
C. CASCADE.
D. TRUNCATE.
The truncate command does not write data to the user segment.
A. column.
B. 1966_invoice.
C. Catch_#22.
D. #invoices.
A column name cannot start with a digit or hash. A column is a reserved word, it is possible only if it would have been inside quotes like “column”.
A. primary key access.
B. access through unique index.
C. table access by ROWID.
D. full table scan.
Table access by Rowid is the fastest access method.
A. indexes are only used in special cases.
B. indexes are used to make table storage more efficient.
C. indexes rarely make a difference in SQL performance.
D. indexes exist solely to improve query speed.
The sole purpose of indexes in any relational database management system is to reduce the access time for SQL statements. If, indexes did not exist in a relational database, then the Oracle database SQL optimizer would have no choice except to read every single row.
A. removal of data redundancy.
B. the introduction of data redundancy.
C. the introduction of non-first normal form relations.
D. the introduction of SQL*Plus.
The degree of normalization in the database design is critical to SQL performance. The ideal candidates for the introduction of redundancy are small data items that are updated very infrequently.
A. the number of CPUs on the server.
B. the degree of parallelism on the tables.
C. the use of bitmap indexes.
D. the quality of the SQL optimization.
SQL coder need not be concerned with the proper work of joining the tables together.
A. independence of table relationship.
B. high speed of SQL.
C. powerful GUI front-end.
D. easy to install and use.
Prior to the invention of relational databases, it was very difficult to establish relationships with other database objects and systems relied on pointers in order to establish data relationships. With the advent of relational database management, it became possible to establish ad-hoc relationships using SQL joins.
A. Avg, min, max, sum and count.
B. Select, update, delete.
C. Avg, sum, create and update.
D. Min, Max, Order By, Group By.
Aggregate functions operate on a aggregate of tuples. These are max, min, avg, sum, stddev, count, variance etc. The result of aggregate functions is a single value.
A. SELECT * FROM CLASS.
B. SELECT (ALL) FROM CLASS.
C. SELECT CLASS.
D. SELECT *. FROM CLASS.
Data is selected from the table using SELECT command.
A. the primary key can have null value.
B. same as unique constraint.
C. declares column as the primary key and cannot have null value.
D. declare column as the primary key and can have null value.
Primary key constraints declare the column as the primary key of the table and cannot have null values. It can be applied to one or more columns.
A. two rows can have same value in the specified column.
B. no two rows can have same value in the specified column.
C. data delicacy can be there.
D. data inconsistency may /may not be there.
It ensures that the value in a column is unique. It can be applied to one or more columns.
A. a column can never have empty values.
B. a column cannot have value 0.
C. a column can have empty value.
D. a column can have value 0.
NOT NULL constraint ensures that we cannot leave the column blank or empty and must provide a value to it, whether zero or greater than it.
A. a command in the SQL *plus.
B. the condition or check on table only .
C. the condition or check on columns of a table only.
D. the condition or check on one or more columns of a table.
A constraint is a condition or check applicable on a field or set of fields. Two basic types of constraints are column constraints and table constraints.
A. SAVE AS.
B. UPDATE.
C. SAVE.
D. MODIFY.
UPDATE is used to change some values in an existing row command. It specifies the rows to be changed using the where clause.
A. DELETE.
B. DROP.
C. TRUNCATE.
D. REMOVE.
The SQL TRUNCATE TABLE clause deletes all rows from a database table. We use truncate command only when we want to delete all rows in a table.
A. ADD RECORD.
B. ADD NEW.
C. INSERT.
D. INSERT NEW.
INSERT command is used to insert values in the database.
A candidate key that is not a primary key is called an Alternate Key.
For Example - In Suppliers table if there are two candidate keys - SuppID and Supp_Name. Here SuppID is the Primary Key then Supp_Name is the Alternate Key.
Primary Key – A column (or columns) in a table that uniquely identifies each row. A primary key value is unique and cannot be null. There is only one primary key for a table.
Foreign key - A column (or a set of columns) that refers to the primary key in another table i.e. it is used as a link to a matching column in another table.
The advantages provided by a DBMS are –
1. Reduction of Redundancy.
2. Sharing of Data.
3. Integrity of data is maintained.
4. Inconsistency of data is controlled.
5. Security of Data Maintained.
6. Data Independence.
The cartesian product is a binary operation denoted by a cross(x) sign. The cartesian product of two relations r1 and r2 is written as r1 x r2. The resulting relation has a degree(number of attributes) equal to the sum of the degrees of the two relations operated upon. The number of tuples(cardinality) of the new relation is the product of the number of tuples of the two relations operated on.
Table ITEM below has 3 attributes and 5 tuples.
|
ICode |
IName |
Price |
|
F505 |
Fruit Cake |
100 |
|
F675 |
Banana Bread |
150 |
|
F203 |
Walnut Pie |
250 |
|
T145 |
Shampoo |
120 |
|
T156 |
Jasmine Soap |
35 |
Table SUPPLIER below has 2 attributes and 3 tuples.
|
SCode |
SName |
|
S101 |
Aman Suppliers |
|
S223 |
Quality products |
|
S145 |
Suman & Co. |
If we write,
ITEM x SUPPLIER in the resulting table, then it will have 5 attributes (3 + 2) and 15 tuples (5 * 3)
|
ICode |
IName |
Price |
SCode |
SName |
|
F505 |
Fruit Cake |
100 |
S101 |
Aman Suppliers |
|
F505 |
Fruit Cake |
100 |
S223 |
Quality products |
|
F505 |
Fruit Cake |
100 |
S145 |
Suman & Co. |
|
F675 |
Banana Bread |
150 |
S101 |
Aman Suppliers |
|
F675 |
Banana Bread |
150 |
S223 |
Quality products |
|
F675 |
Banana Bread |
150 |
S145 |
Suman & Co. |
|
F203 |
Walnut Pie |
250 |
S101 |
Aman Suppliers |
|
F203 |
Walnut Pie |
250 |
S223 |
Quality products |
|
F203 |
Walnut Pie |
250 |
S145 |
Suman & Co. |
|
T145 |
Shampoo |
120 |
S101 |
Aman Suppliers |
|
T145 |
Shampoo |
120 |
S223 |
Quality products |
|
T145 |
Shampoo |
120 |
S145 |
Suman & Co. |
|
T156 |
Jasmine Soap |
35 |
S101 |
Aman Suppliers |
|
T156 |
Jasmine Soap |
35 |
S223 |
Quality products |
|
T156 |
Jasmine Soap |
35 |
S145 |
Suman & Co. |
In the Hierarchical Data Model, data is represented by collections of records and the relationships among data are represented by links. Somehow it is similar to Network Data Model.
In Hierarchical Model records are organized as trees. It represents relationship among it records through parent-child relationships that can be easily represented through tree like structures.
The figure below shows hierarchical representation of a database.

In the Relational Data Model, data is organized into tables with rows and columns. Each column has a unique name and is called an attribute. A row of the table represents a relationship among a set of values. As the table is a collection of such rows, it has a close relationship with the mathematical concept of relation, from where this model takes its name.
The example below shows 2 tables of a database.
Student and Academic :–
Student(Adm_no, Name, Phone, Sex)
Academic(Class, Roll_No, Term1, Term2, Final)
|
Adm_no
|
Name
|
Phone
|
Sex
|
|
97012
|
Rajat Malik
|
2234567
|
M
|
|
97120
|
Rajat Malik
|
2067895
|
F
|
|
98078
|
Karan Kaushik
|
3456234
|
M
|
|
98100
|
Prayatn Kumar
|
2678789
|
M
|
Academic
|
Class
|
Roll_no
|
Term1
|
Term2
|
Final
|
|
8A
|
12
|
89
|
90
|
92
|
|
8B
|
12
|
78
|
88
|
86
|
|
7A
|
3
|
66
|
76
|
75
|
|
9A
|
14
|
88
|
89
|
89
|
A. SELECT count (ALL city) FROM employee;
B. SELECT count (DISTINCT) FROM employee;
C. SELECT count (ALL) FROM employee;
D. SELECT count (DISTINCT city) FROM employee;
As we want to count the entries including repeating entries for the city, we have to use keyword ALL. The * is the only argument that includes null when it is used only with COUNT.
A. INSERT INTO employee SELECT * FROM student WHERE salary >2000;
B. INSERT INTO employee SELECT * FROM students WHERE salary >2000;
C. INSERT INTO students SELECT * FROM employee WHERE salary >2000;
D. INSERT INTO employee SELECT * FROM student HAVING salary >2000;
We will simply replace the VALUES clause with the sql query selecting the rows from the employee table.
A. will have 0 value.
B. will have null value always.
C. will have default value always.
D. will have default value if it is defined otherwise Null value.
In an INSERT statement, only those columns can be omitted that have either default value defined or they allow null values.
A. INSERT INTO students VALUES (2,’aditi’, ‘f’,’e1’, 10,000);
B. INSERT INTO students VALUES (2,’aditi’, ‘e1,’f’, 10,000);
C. INSERT INTO students VALUES (‘aditi’, 20,‘f’,’e1’, 10,000);
D. INSERT INTO (name, roll no, sex, grade, salary) VALUES (‘aditi’, ‘20’,‘f’,’e1’, 10,000);
To insert values either of these commands can be used. INSERT INTO students VALUES (‘aditi’, ‘20’,‘f’,’e1’, 10,000); or INSERT INTO students (name, roll no, sex, grade, salary) VALUES (‘aditi’, ‘20’,‘f’,’e1’, 10,000);. The data values order should match with the table columns when we create table.
A. it will insert values.
B. the last two statements can not be mapped on to base table employee.
C. insert command cannot be used.
D. instead of Insert, Update command to be used.
The last two statements can not be mapped on to base table employee as the value of the primary code ecode is missing and also the sex column does not have any default value and it cannot have null at the same time. Thus, this view is not updatable.
A. a table where we can see information.
B. a table which exists.
C. a table which does not exists physically but it is like a window where we can view or change information in a table.
D. a virtual table which contains copy of the data.
A view only stores its definition. Its data is derived from base table.
A. CREATE VIEW taxpayee AS SELECT * FROM EMPLOYEE WHERE gross > 8000;
B. SELECT VIEW taxpayee AS SELECT * FROM EMPLOYEE WHERE gross > 8000;
C. CREATE VIEW taxpayee AND SELECT * FROM EMPLOYEE WHERE gross > 8000;
D. SELECT VIEW taxpayee FROM EMPLOYEE WHERE gross > 8000;
We can create view using CREATE VIEW, the name of the view to be created, the word AS, and then the query.
A. UPDATE items SET roll no=400; Marks = 100 Where icode < I040;
B. UPDATE items SET roll no=400, marks = 100 Where icode < I040;
C. UPDATE items SET roll no=400 And SET marks = 100 Where icode < I040
D. UPDATE items SET roll no=400, marks = 100 Where icode > I040
To update multiple columns, multiple column assignments can be specified with SET clause, separated by commas.
A. MODIFY items SET Roll No=400 Where Roll No = 300;
B. UPDATE items SET Roll No=400 Where Roll No = 300;
C. UPDATE items Roll No=400 in place of Roll No = 300;
D. UPDATE items Roll No=400 HAVING Roll No = 300;
UPDATE command is used when we want to change the values of some specified columns and it is used with WHERE clause.
A. SELECT DIFFERENT.
B. SELECT UNIQUE.
C. SELECT NOT NULL.
D. SELECT DISTINCT.
DISTINCT removes duplicate values.
A. SQL cannot support object-orientation.
B. the same query can be written in many ways, each with vastly different execution plans.
C. SQL syntax is too difficult for non-computer professionals to use.
D. SQL creates excessive locks within the Oracle database.
The declarative nature of SQL makes it possible to write an individual query in many different forms, each with identical results. For example, a query can be written with a standard join, a non-correlated sub-query or a correlated sub-query, each producing identical results but with widely varying internal execution plans.
A. the user had to have knowledge of the table and index structures.
B. navigational data access was far slower than declarative access.
C. navigational access languages required the coder to embed their queries inside a procedural language shell.
D. navigational languages were far slower then SQL.
A navigational data language requires knowledge of the internal tables and index structures.
A. SELECT * FROM STUDENTS WHERE First Name >'Aditi' AND First Name < ’Mukta’.
B. SELECT * FROM STUDENTS WHERE First Name BETWEEN 'Aditi' AND ‘Mukta’.
C. SELECT First Name > 'Aditi AND First Name < ‘Mukta’ FROM STUDENTS.
D. SELECT (all) FROM STUDENTS WHERE First Name IS 'Aditi' AND ‘Mukta’.
BETWEEN operator includes the name “Aditi” and “Mukta” also. The > and < operators do not include these two names. The BETWEEN operator defines a range of values that the column values must fall in to make the condition true. This range includes both lower value and the upper value.
A. SELECT First Name ='Aditi', Last Name='Suneja'.
B. SELECT * From STUDENT where First Name ='Aditi' OR Last Name='Suneja'.
C. SELECT * From STUDENT where First Name ='Aditi' AND Last Name='Suneja'.
D. SELECT * From STUDENT where First Name LIKE 'Aditi' AND Last Name LIKE 'Suneja'.
The AND operator displays a record when all the conditions are met where as OR operator displays the record if any of the condition is met.
A. provides views according to user’s requirements.
B. describes how data are actually stored.
C. describes the relationships among the data.
D. is closest to the user.
The physical level is the lowest level which stores how the data is stored and how it is organised.
A. Internal, Physical and External.
B. Internal, Conceptual and Logical.
C. Internal, Conceptual and External.
D. Internal, Conceptual and Physical.
The data abstraction is a three level process. The lowest level is the internal level which includes the details of data and is hidden from the user. The second level is the conceptual or the logical level which deals with the organisation of data, even this one is hidden from the end user. The last level is the external level with essential features of data and is visible to the end user.
A. collection of relevant data.
B. duplication of data.
C. storage of data in a database.
D. security of data.
Data redudancy refers to the existence of multiple copies of the same data. When change in one is made, then it has to be made in others also, to avoid errors.
A. may exist because of data redundancy.
B. can be eliminated by data redundancy.
C. helps maintain the database.
D. is a requirement of a good database.
Data inconsistency is a consequence of data redudancy. When change in any one copy of data is made then the other copies of data become inconsistent.
A. the detailed database structure.
B. a vague database structure.
C. hiding of complicated details from the user.
D. laid down by Mr. E.F.Codd.
Data abstraction means making the user aware of just the essential features of any object and hiding the details about that object.
DBMS stands for Data Base Management System. A database is an organized collection of related data. A DBMS is a software that allows access to data contained in databases.It provides an effective and convenient method of storing, retrieving and updating information.