CS101 532 CS201 225 CS301 232 CS302 174 CS304 192 CS401 224 CS402 258 CS403 228 CS408 113 CS411 121 CS502 249 CS504 268 CS601 679 CS604 381 CS605 261 CS607 184 CS609 230 CS610 300 CS614 100 CS703 65
Code Question Option A Option B Option C Option D Answer
CS403 __________ User Interface Is Preferred Over __________ User Interface With Respect To User Easy To Understand Efficient Hard To Understand Efficient Easy To Understand Effective Hard To Understand Effective A
CS403 A __________ Is Established When The Value Of One Attribute Is Dependent On The Value Of Another Attribute Primary Key Data Anomaly Dependency Transitive Relationship C
CS403 A Candidate Key That Does Not Have A Null Value And Is Selected To Uniquely Identify All Other Attribute Values In Any Given Row Is Called A Superkey Candidate Key Primary Key Secondary Key C
CS403 A Collection Of Concepts That Can Be Used To Describe The Structure Of A Database Database Dbms Data Model Data C
CS403 A Collection Of Concepts That Can Be Used To Describe The Structure Of A Database Database Dbms Data Model Data B
CS403 A Description On A Particular Collection Of Data Using The Given Data Model Database Relation Schema None C
CS403 A Entity Has A Primary Key That Is Partially Or Totally Derived From The Parent Entity In The Relationship Strong Weak Business Relationship B
CS403 A Foreign Key Is A Field In A Table That Matches A Key Field In Another Table A Field In A Table That Contains Data That Is Also Contained Elsewhere In Another Table A Field In A Table That Has The Same Name As A Key Field In Another Table A Field In A Table That Has The Same Name As A Key Field In Another Table A
CS403 A Primary Key Is An Attribute (Or Set Of Attributes) That Has Been Chosen For An Entity Whose Values Are Used To Uniquely Identify A Particular Instance Of An Entity True False Partially True None Of The Given A
CS403 A Record Set Is Exactly The Same As A Query A Data Access Page A Table A Macro C
CS403 A Relation (From The Relational Database Model) Consists Of A Set Of Tuples Which Implies That All Tuples In A Relation Must Be Distinct Relational Model Supports Multi-Valued Attributes Whose Values Can Be Represented In Sets For Any Two Tuples The Values Associated With All Of Their Attributes May Be The Same All Tuples In A Particular Relation May Have Different Attributes A
CS403 A Relational Database Is One That Consists Of Two Or More Tables A Database That Is Able To Process Tables Queries Forms Reports And Macros One That Consists Of Two Or More Tables That Are Joined In Some Way The Same As A Flat File Database C
CS403 A Relational Database System Is Based On The Concept(S) Of A Network Of Data Records Nested Tables Tables Rows And Columns A Tree-Like Structure Of Data A
CS403 A Relational Database System Is Based On The Concept(S) Of: A Network Of Data Records Nested Tables Tables Rows And Columns A Tree-Like Structure Of Data A
CS403 A Relationship Exists When An Association Is Maintained Within A Single Entity Unary Binary Ternary Weak A
CS403 A Second Normal Form (2 Nf) Relation Should Be In 1 Nf Not Have A Composite Key Not Have Attributes Dependent On Key Attribute Not Have Attributes Dependent On One Another A
CS403 A Software Package Designed To Store And Manage Databases Database Dbms Data Model Data B
CS403 A Superkey That Does Not Contain A Subset Of Attributes That Is Itself A Superkey Is Called A . Candidate Key Primary Key Superkey Secondary Key A
CS403 A Table Can Be Logically Connected To Another Table By Defining A __________ Hyperlink Common Attribute Primary Key Superkey B
CS403 A__________Is Used To Maintain A Connection Between The Users Of The Database System Mail Server File Server Client-Server None Of The Given B