Objective Type - Civil Engineering - Indian Engineering service - Gate examFull description
Civil Engineering MCQFull description
PhysicsFull description
good
microwave engineering objective question bank
Database Objective type questions Q.1 In the relational modes, cardinality is termed as: (A !umber o" tuples. (# !umber o" attributes. ($ !umber o" tables. (D !umber o" constraints. Ans: A Q.% &elational calculus is a (A 'rocedural lanuae. (# !on) 'rocedural lanuae. ($ Data de*nition lanuae. (D +ih level lanuae. Ans: # Q. -he vie o" total database content is (A $onceptual vie. (# Internal vie. ($ /0ternal vie. (D 'hysical ie. Ans: A Q.2 $artesian product in relational alebra is (A a 3nary operator. (# a #inary operator. ($ a -ernary operator. (D not de*ned. Ans: # $artesian product in relational alebra is a binary operator. (It requires to operands. e.., ' 4 Q Q.5 D67 is provided "or (A Description o" loical structure o" database. (# Addition o" ne structures in the database system. ($ 6anipulation 8 processin o" database. (D De*nition o" physical structure o" database system. Ans: $ D67 is provided "or manipulation 8 processin o" database. (Data stored in the database is processed or manipulated usin data manipulation manipulation
lanuae commands as its name Q.9 A;< clause is used in ;Q7 "or (A ;election operation. (# &ename operation. ($ =oin operation. (D 'rojection operation. Ans: # A;< clause is used in ;Q7 "or rename operation. (e.., ;/7/$- /!O A; /6'7O>//?!O @&O6 /6' Q. OD#$ stands "or (A Object Database $onnectivity. (# Oral Database $onnectivity. ($ Oracle Database $onnectivity. (D Open Database $onnectivity. Ans: D Q.B Architecture o" the database can be vieed as (A to levels. (# "our levels. ($ three levels. (D one level. Ans: $ Q.C In a relational model, relations are termed as (A -uples. (# Attributes ($ -ables. (D &os. Ans:c Q.1 -he database schema is ritten in (A +77 (# D67 ($ DD7 (D D$7 Ans: $ Q.11 In the architecture o" a database system e0ternal level is the (A physical level. (# loical level.
($ conceptual level (D vie level. Ans: D Q.1% An entity set that does not have suEcient attributes to "orm a primary Fey is a (A stron entity set. (# eaF entity set. ($ simple entity set. (D primary entity set. Ans: # Q.1 In a +ierarchical model records are oraniGed as (A Hraph. (# 7ist. ($ 7inFs. (D -ree. Ans: D Q.12 In an /)& diaram attributes are represented by (A rectanle. (# square. ($ ellipse. (D trianle. Ans: $ Q.15 In case o" entity interity, the primary Fey may be (A not !ull (# !ull ($ both !ull 8 not !ull. (D any value. Ans: A Q.19 In tuple relational calculus '1 '% is equivalent to (A J'1 K '% (# '1 K '% ($ '1 L '% (D '1 LJ'% Ans: A In tuple relational calculus '1 '% is equivalent to J'1 K '%. (-he loical implication e0pression A #, meanin i" A then #,is equivalent to JA K # Q.1 -he lanuae used in application prorams to request data "rom the D#6; is re"erred to as the (A D67 (# DD7
($ D7 (D ;D7 Ans: A Q.1B A loical schema (A is the entire database. (# is a standard ay o" oraniGin in"ormation into accessible parts. ($ describes ho data is actually stored on disF. (D both (A and ($ Ans: A Q.1C &elated *elds in a database are rouped to "orm a (A data *le. (# data record. ($ menu. (D banF. Ans: # &elated data *elds in a database are rouped to "orm a data record. (A record is a collection o" related *elds Q.% -he database environment has all o" the "olloin components e0cept: (A users. (# separate *les. ($ database. (D database administrator. Ans: A Q.%1 -he lanuae hich has recently become the de"acto standard "or inter"acin application prorams ith relational database system is (A Oracle. (# ;Q7. ($ D#ase. (D 2H7. Ans: # Q.%% -he ay a particular application vies the data "rom the database that the application uses is a (A module. (# relational model.
($ schema. (D sub schema. Ans: D Q.% In an /)& diaram an entity set is represent by a (A rectanle. (# ellipse. ($ diamond bo0. (D circle. Ans: A Q.%2 A report enerator is used to (A update *les. (# print *les on paper. ($ data entry. (D delete *les. Ans: # Q.%5 -he property M properties o" a database is M are : (A It is an interated collection o" loically related records. (# It consolidates separate *les into a common pool o" data records. ($ Data stored in a database is independent o" the application prorams usin it. (D All o" the above. Ans: D Q.%9 -he D#6; lanuae component hich can be embedded in a proram is (A -he data de*nition lanuae (DD7. (# -he data manipulation lanuae (D67. ($ -he database administrator (D#A. (D A query lanuae. Ans: # Q.% A relational database developer re"ers to a record as (A a criteria. (# a relation. ($ a tuple. (D an attribute. Ans: $
Q.%B -he relational model "eature is that there (A is no need "or primary Fey data. (# is much more data independence than some other database models. ($ are e0plicit relationships amon records. (D are tables ith many dimensions. Ans: # Q.%C $onceptual desin (A is a documentation technique. (# needs data volume and processin "requencies to determine the siGe o" the database. ($ involves modellin independent o" the D#6;. (D is desinin the relational model. Ans:$ Q. -he method in hich records are physically stored in a speci*ed order accordin to a Fey *eld in each record is (A hash. (# direct. ($ sequential. (D all o" the above. Ans: A A method in hich records are physically stored in a speci*ed order accordin to a Fey *eld in each record is hash. (In hash method, a hash "unction is per"ormed on the Fey value to determine the unique physical address o" the record to store or retrieve Q.1 A subschema e0presses (A the loical vie. (# the physical vie. ($ the e0ternal vie. (D all o" the above. Ans: $ A subschema e0presses the e0ternal vie.
(/0ternal schemas are called also called as subschemas Q.% $ount "unction in ;Q7 returns the number o" (A values. (# distinct values. ($ roups. (D columns. Ans: A $ount "unction in ;Q7 returns the number o" values. ($ount "unction counts all the not null values in the speci*c column. I" e ant to count only distinct values than the DI;-I!$- Feyord is also to be used Q. Nhich one o" the "olloin statements is "alse (A -he data dictionary is normally maintained by the database administrator. (# Data elements in the database can be modi*ed by chanin the data dictionary. ($ -he data dictionary contains the name and description o" each data element. (D -he data dictionary is a tool used e0clusively by the database administrator. Ans: # Q.2 An advantae o" the database manaement approach is (A data is dependent on prorams. (# data redundancy increases. ($ data is interated and can be accessed by multiple prorams. (D none o" the above. Ans: $ Q.5 A D#6; query lanuae is desined to (A support end users ho use /nlish)liFe commands. (# support in the development o" comple0 applications so"tare. ($ speci"y the structure o" a database. (D all o" the above. Ans: D
Q.9 -rAnsaction processin is associated ith everythin belo e0cept (A producin detail, summary, or e0ception reports. (# recordin a business activity. ($ con*rmin an action or trierin a response. (D maintainin data. Ans: $ Q. It is possible to de*ne a schema completely usin (A D7 and DD7. (# DD7 and D67. ($ ;D7 and DD7. (D D7 and D67. Ans: # Q.B -he method o" access hich uses Fey trAns"ormation is Fnon as (A direct. (# hash. ($ random. (D sequential. Ans: # Q.C Data independence meAns (A data is de*ned separately and not included in prorams. (# prorams are not dependent on the physical attributes o" data. ($ prorams are not dependent on the loical attributes o" data. (D both (# and ($. Ans: D both (# and ($ Q.2 -he statement in ;Q7 hich allos to chane the de*nition o" a table is (A Alter. (# 3pdate. ($ $reate. (D select. Ans: A Q.21 /)& model uses this symbol to represent eaF entity set (A Dotted rectanle.
(# Diamond ($ Doubly outlined rectanle (D !one o" these Ans: $ Q.2% ;/- concept is used in : (A !etorF 6odel (# +ierarchical 6odel ($ &elational 6odel (D !one o" these Ans: A Q.2 &elational Alebra is (A Data De*nition 7anuae . (# 6eta 7anuae ($ 'rocedural query 7anuae (D !one o" the above Ans: $ Q.22 Pey to represent relationship beteen tables is called (A 'rimary Fey (# ;econdary Pey ($ @orein Pey (D !one o" these Ans: $ Q.25 ??????? produces the relation that has attributes o" &1 and &% (A $artesian product (# Dierence ($ Intersection D 'roduct Ans: A Q.29 -he *le oraniGation that provides very "ast access to any arbitrary record o" a *le is (A Ordered *le (# 3nordered *le
($ +ashed *le (D #)tree Ans: $ Q.2 D#6; helps achieve (A Data independence (# $entraliGed control o" data ($ !either (A nor (# (D both (A and (# Ans: D Q.2B Nhich o" the "olloin are the properties o" entities (A Hroups (# -able ($ Attributes (D ;itchboards Ans: $ Q.2C In a relation (A Orderin o" ros is immaterial (# !o to ros are identical ($ (A and (# both are true (D !one o" these. Ans: $ Q.5 Nhich o" the "olloin is correct: (A a ;Q7 query automatically eliminates duplicates. (# ;Q7 permits attribute names to be repeated in the same relation. ($ a ;Q7 query ill not orF i" there are no inde0es on the relations (D !one o" these Ans: D Q.51 It is better to use *les than a D#6; hen there are (A ;trinent real)time requirements. (# 6ultiple users ish to access the data. ($ $omple0 relationships amon data.
(D All o" the above. Ans: # Q.5% -he conceptual model is (A dependent on hardare. (# dependent on so"tare. ($ dependent on both hardare and so"tare . (D independent o" both hardare and so"tare. Ans: D Q.5 Nhat is a relationship called hen it is maintained beteen to entities (A 3nary (# #inary ($ -ernary (D Quaternary Ans: # Q.52 Nhich o" the "olloin operation is used i" e are interested in only certain columns o" a table (A '&O=/$-IO! (# ;/7/$-IO! ($ 3!IO! (D =OI! Ans: A Q.55 Nhich o" the "olloin is a valid ;Q7 type (A $+A&A$-/& (# !36/&I$ ($ @7OA- (D All o" the above Ans: D Q.59 -he &D#6; terminoloy "or a ro is (A tuple. (# relation. ($ attribute. D deree. Ans: A
Q.5 Nhich o" the "olloin operations need the participatin relations to be union compatible (A 3!IO! (# I!-/&;/$-IO! ($ DI@@/&/!$/qq (D All o" the above Ans: D Q.5B -he "ull "orm o" DD7 is (A Dynamic Data 7anuae (# Detailed Data 7anuae ($ Data De*nition 7anuae (D Data Derivation 7anuae Ans: $ Q.5C Nhich o" the "olloin is an advantae o" vie (A Data security (# Derived columns ($ +idin o" comple0 queries (D All o" the above Ans: D Q.9 Nhich o" the "olloin is a leal e0pression in ;Q7 (A ;/7/$- !377 @&O6 /6'7O>//R (# ;/7/$- !A6/ @&O6 /6'7O>//R ($ ;/7/$- !A6/ @&O6 /6'7O>// N+/&/ ;A7A&> S !377R (D !one o" the above Ans: # Q.91 -he users ho use easy)to)use menu are called (A ;ophisticated end users. (# !aTve users. ($ ;tand)alone users. (D $asual end users. Ans: # Q.9% Nhich database level is closest to the users (A /0ternal (# Internal ($ 'hysical (D $onceptual Ans: A
Q.9 Nhich are the to ays in hich entities can participate in a relationship (A 'assive and active (# -otal and partial ($ ;imple and $omple0 (D All o" the above Ans: # Q.92 -he result o" the 3!IO! operation beteen &1 and &% is a relation that includes (A all the tuples o" &1 (# all the tuples o" &% ($ all the tuples o" &1 and &% (D all the tuples o" &1 and &% hich have common columns Ans: D Q.95 Nhich o" the "olloin is a comparison operator in ;Q7 (A S (# 7IP/ ($ #/-N//! (D All o" the above Ans: D Q.99 A set o" possible data values is called (A attribute. (# deree. ($ tuple. (D domain. Ans: D Q.9 Nhich o" the operations constitute a basic set o" operations "or manipulatin relational data (A 'redicate calculus (# &elational calculus ($ &elational alebra (D !one o" the above Ans:$ Q.9B Nhich o" the "olloin is another name "or eaF entity (A $hild (# Oner
($ Dominant (D All o" the above Ans: A Q.9C Nhich o" the "olloin database object does not physically e0ist (A base table (# inde0 ($ vie (D none o" the above Ans: $ Q. !377 is (A the same as "or inteer (# the same as blanF "or character ($ the same as "or inteer and blanF "or character (D not a value Ans: D Q.1 Nhich o" the "olloin is record based loical model (A !etorF 6odel (# Object oriented model ($ /)& 6odel (D !one o" these Ans: A Q.% A data dictionary is a special *le that contains: (A -he name o" all *elds in all *les. (# -he idth o" all *elds in all *les. ($ -he data type o" all *elds in all *les. (D All o" the above. Ans: D Q. A *le manipulation command that e0tracts some o" the records "rom a *le is called (A ;/7/$- (# '&O=/$($ =OI! (D '&OD3$-
Ans: A Q.2 -he physical location o" a record is determined by a mathematical "ormula that trAns"orms a *le Fey into a record location is : (A #)-ree @ile (# +ashed @ile ($ Inde0ed @ile (D ;equential *le. Ans: # Q.5 3sin &elational Alebra the query that *nds customers, ho have a balance o" over 1 is (A '$ustomer?name(s balance U1(Deposit (# s $ustomer?name('balance U1(Deposit ($ '$ustomer?name(s balance U1(#orro (D s $ustomer?name('balance U1(#orro Ans: A Q.9 A primary Fey is combined ith a "orein Fey creates (A 'arent)$hild relation ship beteen the tables that connect them. (# 6any to many relationship beteen the tables that connect them. ($ !etorF model beteen the tables that connect them. (D !one o" the above. Ans: A Q. In /)& Diaram derived attribute are represented by (A /llipse (# Dashed ellipse ($ &ectanle (D -rianle Ans # Q.B $ross 'roduct is a: (A 3nary Operator (# -ernary Operator
($ #inary Operator (D !ot an operator Ans: $ Q.C An instance o" relational schema & (A, #, $ has distinct values o" A includin !377 values. Nhich one o" the "olloin is true (A A is a candidate Fey (# A is not a candidate Fey ($ A is a primary Pey (D #oth (A and ($ Ans: # Q.B $onsider the join o" a relation & ith relation ;. I" & has m tuples and ; has n tuples, then the ma0imum siGe o" join is: (A mn (# mVn ($ (mVnM% (D %(mVn Ans: A Q.B1 -he natural join is equal to : (A $artesian 'roduct (# $ombination o" 3nion and $artesian product ($ $ombination o" selection and $artesian product (D $ombination o" projection and $artesian product Ans: D Q.B% Nhich one o" the "olloin is not true "or a vie: (A ie is derived "rom other tables. (# ie is a virtual table. ($ A vie de*nition is permanently stored as part o" the database. (D ie never contains derived columns. Ans: $ Q.B A primary Fey i" combined ith a "orein Fey creates
(A 'arent)$hild relationship beteen the tables that connect them. (# 6any to many relationship beteen the tables that connect them. ($ !etorF model beteen the tables that connect them. (D !one o" the above. Ans: A Q.B2 In /)& Diaram relationship type is represented by (A /llipse (# Dashed ellipse ($ &ectanle (D Diamond Ans: D Q.B5 +ierarchical model is also called (A -ree structure (# 'le0 ;tructure ($ !ormaliGe ;tructure (D -able ;tructure Ans: A Q.B9 -o delete a particular column in a relation the command used is: (A 3'DA-/ (# D&O' ($ A7-/& (D D/7/-/ Ans: $ Q.B -he ?????? operator is used to compare a value to a list o" literals values that have been speci*ed. (A #/-N//! (# A!> ($ I! (D A77 Ans: A Q.BB A loical schema A is the entire database # is a standard ay o" oraniGin in"ormation into a accessible part $ describe ho data is actually stored on disF
D none o" these Ans: D Q.BC A #)tree o" order m has ma0imum o" ????????????? children (A m (# mV1 ($ m)1 (D mM% Ans: A Q.C ????????????? "unction divides one numeric e0pression by another and returns the remainder. (A 'ON/& (# 6OD ($ &O3!D (D &/6AI!D/& Ans: # Q.C1 A data manipulation command the combines the records "rom one or more tables is called (A ;/7/$- (# '&O=/$($ =OI! (D '&OD3$Ans: $ Q.C% In /)& diaram eneraliGation is represented by (A /llipse (# Dashed ellipse ($ &ectanle (D -rianle Ans: D Q.C ????????? is a virtual table that dras its data "rom the result o" an ;Q7 ;/7/$- statement. (A ie (# ;ynonym ($ ;equence (D -rAnsaction Ans: A Q.C2 -he method o" access hich uses Fey trAns"ormation is Fnon as
(A Direct (# +ash ($ &andom (D ;equential Ans: # Q.C5 A table joined ith itsel" is called (A =oin (# ;el" =oin ($ Outer =oin (D /qui =oin Ans: # Q.C9 ????????? data type can store unstructured data (A &AN (# $+A& ($ !36/&I$ (D A&$+A& Ans: A
