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 People That Design And Build The Data Warehouse Must Be Capable Of Working Across The Organization At All Levels True False Na Na A
CS614 Pipeline Parallelism Focuses On Increasing Throughput Of Task Execution Not On __________ Sub-Task Execution Time Increasing Decreasing Maintaining None Of These B
CS614 Pre-Computed Can Solve Performance Problems Aggregates Facts Dimensions Horizontal A
CS614 Pre-Join Technique Is Used To Avoid Run Time Join Compile Time Join Load Time Join None Of These A
CS614 Relational Databases Allow You To Navigate The Data In __________ That Is Appropriate Using The Primary Foreign Key Structure Within The Data Model Only One Direction Any Direction Two Direction None Of These B
CS614 Slice And Dice Is Changing The View Of The Data True False Na Na A
CS614 Taken Jointly The Extract Programs Or Naturally Evolving Systems Formed A Spider Web Also Known As Distributed Systems Architecture Legacy Systems Architecture Online Systems Architecture Intranet Systems Architecture B
CS614 The ___________ Is Only A Small Part In Realizing The True Business Value Buried Within The Mountain Of Data Collected And Stored Within Organizations Business Systems And Operational Databases Independence On Technology Dependence On Technology Both None Of These B
CS614 The Automated Prospective Analyses Offered By Data Mining Move Beyond The Analyses Of Past Events Provided By __________ Tools Typical Of Decision Support Systems Introspective Intuitive Reminiscent Retrospective D
CS614 The Automated Prospective Analyses Offered By Data Mining Move Beyond The Analysis Of Past Events Provided By Respective Tools Typical Of __________ Oltp Olap Decision Support Systems None Of These A
CS614 The Degree Of Similarity Between Two Records Often Measured By A Numerical Value Between Usually Depends On Application Characteristics 0 And 1 0 And 10 0 And 99 0 And 100 A
CS614 The Divide&Conquer Cube Partitioning Approach Helps Alleviate The __________ Limitations Of Molap Implementation Flexibility Maintainability Security Scalability D
CS614 The Goal Of __________ Is To Look At As Few Blocks As Possible To Find The Matching Records(S) Indexing Partitioning Joining None Of These A
CS614 The Goal Of Ideal Parallel Execution Is To Completely Parallelize Those Parts Of A Computation That Are Not Constrained By Data Dependencies. The The Portion Of The Program That Must Be Executed Sequentially The Greater The Scalability Of The Computation Larger Computation Smaller Computation Unambiguous Computation Superior B
CS614 The Goal Of Is To Look At As Few Block As Possible To Find The Matching Records. Indexing Partitioning Joining None Of These Nested Loop Join None Of These C
CS614 The Goal Of Star Schema Design Is To Simplify __________ Logical Data Model Physical Data Model Conceptual Data Model None Of These B
CS614 The Input To The Data Warehouse Can Come From Oltp Or Transactional System But Not From Other Third Party Database True False Na Na B
CS614 The Key Idea Behind __________ Is To Take A Big Task And Break It Into Subtasks That Can Be Processed Concurrently On A Stream Of Data Inputs In Multiple Overlapping Stages Of Execution Pipeline Parallelism Overlapped Parallelism Massive Parallelism Distributed Parallelism A
CS614 The Kimball S Iterative Data Warehouse Development Approach Drew On Decades Of Experience To Develop The __________ Business Dimensional Lifecycle Data Warehouse Dimension Business Definition Lifecycle Olap Dimension A
CS614 The Most Recent Attack Is The __________ Attack On The Cotton Crop During 2003- 04 Resulting In A Loss Of Nearly 0.5 Million Bales Boll Worm Purple Worm Blue Worm Cotton Worm A