vu cs301 Mid Term Subjective Solved Past Paper No.3

vu cs301 Data Structures Solved Past Papers

Solved Past Papers

This subjective solved past paper is related to book/course code vu cs301 Data Structures which belongs to vu organization. We have 3 past papers available related to the book/course Data Structures. This past paper has a total of 8 subjective questions belongs to topic Mid Term to get prepared. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to get prepared for exams by learning subjective questions online on NVAEducatio.

NVAEducation also facilitates users to download these solved past papers with an affordable prices. However, users are not enforced to pay for money, rather they can use credits to buy such stuff on NVAEducation. Users can earn credits for doing some little tasks and then you will be able to use that credits to buy solved past papers on NVAEducation.

Question 1: What is the concept of store and forward technology?
Answer:

STORE AND FORWARD

Data delivery from one computer to another is accomplished through store and forward technology. In this technology packet switch stores incoming packet and also forwards that packet to another switch or computer. For this purpose packet switch has internal memory into which it can hold packet if outgoing connection is busy. Packets for each connection held on queue (Page 56)

Question 4: After completing the transformation task, data loading activity is started. How many types of data loading strategies are and when each type of strategy is adopted explain.
Answer:
Once we have transformed data, there are three primary loading strategies:
" Full data refresh with BLOCK INSERT or "block slamming into empty table.
" Incremental data refresh with BLOCK INSERT or "block slamming into existing (populated) tables. " Trickle/continuous feed with constant data collection and loading using row level insert and update operations.
Question 5: Briefly describe features of MOLAP.
Answer:

MOLAP cubes are built for fast data retrieval, and are optimal for slicing and dicing operations.

They can also perform complex calculations. All calculations have been pre-generated when the cube is created. Hence, complex calculations are not only doable, but they return quickly.

Question 6: Briefly describe snowflake schema.
Answer:
Snowflake schema is a logical arrangement of tables in a multidimensional database such that the entity relationship diagram resembles a snowflake in shape. The snowflake schema is represented by centralized fact tables which are connected to multiple dimensions.
Question 7: Briefly describe the features of Star Schema?
Answer:
Dimensional hierarchies are collapsed into a single table for each dimension. Loss of information A single fact table created with a single header from the detail records, resulting in:
  1. A vastly simplified physical data model!
  2. Fewer tables (thousands of tables in some ERP systems).
  3. Fewer join resulting in high performance.
  4. Some requirement of additional space.

Solved Past Papers of cs301 Data Structures

Other cs related subjective solved past papers

Other categories of vu Solved Past Papers

Other organizations

Theme Customizer

Gaussian Texture



Gradient Background