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 | |
---|---|---|---|---|---|---|---|
CS614 | The Need To Synchronize Data Upon Update Is Called | Data Manipulation | Data Replication | Data Coherency | Data Imitation | C | |
CS614 | The Performance In A Molap Cube Comes From The O(1) Look-Up Time For The Array Data Structure | True | False | Na | Na | A | |
CS614 | The Purpose Of The House Of Quality Technique Is To Reduce Types Of Risk | Two | Three | Four | All | A | |
CS614 | The Smaller The Portion Of The Program That Must Be Executed __________ The Greater The Scalability Of The Computation | In Parallel | Distributed | Sequentially | None Of These | C | |
CS614 | The Star Schema Used For Data Design Is A __________ Consisting Of Fact And Dimension Tables | Network Model | Relational Model | Hierarchical Data Model | None Of The Given | B | |
CS614 | The Technique That Is Used To Perform These Feats In Data Mining Modeling And This Act Of Model Building Is Something That People Have Been Doing For Long Time Certainly Before The Of Computers Or Data Mining Technology | Access Advent | Ascent Avowal | Both | None Of These | A | |
CS614 | The Users Of Data Warehouse Are Knowledge Workers In Other Words They Are___________ In The Organization | Decision Maker | Manager | Database Administrator | Dwh Analyst | A | |
CS614 | There Are Many Variants Of The Traditional Nested-Loop Join If There Is An Index Is Exploited Then It Is Called__________ | Navy Nested Loop Join Index | Nested Loop Join Temporary Index | Index Nested-Loop Joins | None Of These | B | |
CS614 | There Are Many Variants Of The Traditional Nested-Loop Join. If The Index Is Built As Part Of The Query Plan And Subsequently Dropped It Is Called | Naive Nested-Loop Join | Index Nested-Loop Join | Temporary Index Nested-Loop Join | None Of These | C | |
CS614 | To Identify The __________ Required We Need To Perform Data Profiling | Degree Of Transformation | Complexity | Cost | Time | A | |
CS614 | To Judge Effectiveness We Perform Data Profiling Twice | One Before Extraction And The Other After Extraction | One Before Transformation And The Other After Transformation | One Before Loading And The Other After Loading | All Of Above | B | |
CS614 | To Measure Or Quantify The Similarity Or Dissimilarity Different Techniques Are Available. Which Of The Following Option Represent The Name Of Available Techniques? | Pearson Correlation Is The Only Technique | Euclidean Distance Is The Only Technique | Both Pearson Correlation And Euclidean Distance | None Of These | C | |
CS614 | Transactional Fact Tables Do Not Have Records For Events That Do Not Occur. These Are Called | Not Recording Facts | Fact-Less Facts | Null Facts | None Of These | A | |
CS614 | Virtual Cube Is Used To Query Two Similar Cubes By Creating A Third “Virtual” Cube By A Join Between Two Cubes | True | False | Na | Na | A | |
CS614 | We Must Try To Find The One Access Tool That Will Handle All The Needs Of Their Users | True | False | Na | Na | B | |
CS614 | When Performing Objective Assessments Companies Follow A Set Of Principles To Develop Metrics Specific To Their Needs There Is Hard To Have One Size Fits All Approach. Which Of The Following Statement Represents The Pervasive Functional Forms? | Only Min Or Max Operation Weighted Average | Only Simple Ratio Min Or Max Operation | Only Complex Ratio Min Operation Max Operation | Simple Ratio Min Or Max Operation Weighted Average | D | |
CS614 | Which Is The Least Appropriate Join Operation For Pipeline Parallelism? | Hash Join | Outer Join | Inner Join | Sort-Merge Join | C | |
CS614 | Which Statement Is True For De-Normalization? | Redundant Data Is A Performance Liability At Query Time But Is A Performance Benefit At Update Time | Redundant Data Is A Performance Benefit At Both Query Time And Update Time | Redundant Data Is A Performance Liability At Both Query Time And Update Time | Redundant Data Is A Performance Benefit At Query Time But Is A Performance Liability At Update Time | D | |
CS614 | With Data Mining The Best Way To Accomplish This Is By Setting Aside Some Of Your Data In A __________ To Isolate It From The Mining Process; Once The Mining Is Complete The Results Can Be Tested Against The Isolated Data To Confirm The Model’S Validity | Cell | Disk | Folder | Vault | B | |
CS614 | With Data Mining The Best Way To Accomplish This Is By Setting Aside Some Of Your Data In A Vault To Isolate It From The Mining Process; Once The Mining Is Complete The Results Can Be Tested Against The Isolated Data To Confirm The Model’S | Validity | Security | Integrity | None Of These | A |