Skip to main content

CS609 Current Final Term Fall 2013 Shared by Irum_MCS File 1



Objective 20 % from moaaz file and subjective 30 %
 Q: what is differenc between tracks and sectors:
Q: Write disadvantages and advantages of  FAT32:
 Q:How disk scan identify the bad sectors?
Answer:-  • It attempts to write a block. • After write it reads back the block contents. • Performs the CRC test on data read back. • If there is an error then the data on that block is not stable the cluster of that block should be marked bad. • The cluster is marked bad by placing the appropriate code for bad cluster so that they may not be allocated to any file.
 Q) Write down a procedure to convert the cluster number into sector number?
Q# Suppose a disk is divided into two partition and we have read MBR at LBA=0 to get information about primary partition a) How many bytes of code part we need to skip to get information about primary partition? b) How many bytes of code part we need to read information?
Q# Write down procedure to convert a cluster number into sector number
Answer:-  NTFS simply the following formula will be used to translate the sector number into cluster number. Sector # = Cluster # * Sector Per Cluster
 Q: In FAT32, what is the size of FSInfo?
Answer:- On a FAT32 volume, the FAT can be a large data structure, unlike on FAT16 where it is limited to a maximum of 128K worth of sectors and FAT12 where it is limited to a maximum of 6K worth of sectors.

remember me in ur prayers





Comments

Post a Comment

Please give us your feedback & help us to improve this site.

Popular posts from this blog

CS301 Current Finalterm Paper Spring 2014 Shared By M. Waleed

My Tday's Cs301 Paper: Mcq's Are From Moaz And Some Are From Handouts. Subjective Is From Moaz Majority One. 1- The Image Segmentation Define? 2- The Maximum Number Level Of Nodes In Binary Tree 3-The Iteration Array Have To Sort. 4- The Hapified Array Have To Solved 5- The Algorithm Of Binary Seaoh Tree 6-Sara Arrays Wala He Tha Ya Heap Wala. 7-....Wala Wala Wala...
1 comment
Read more

CS614 Quiz No.3 Shared by Students (Solved), Spring 2014

______ index stores first value in each block in the sequential file and a pointer to the block.  Select correct option:   Dense  Sparse  B-Tree  Hash In context of data parallelism, the work done by query processor should be:  Select correct option:  Almost zero  Maximum  Pipelined  Filtered across partitions The optimizer uses a hash join to join two tables if they are joined using an equijoin and  Select correct option:   Outer table has less number of rows  Inner table has less number of rows  Cardinality of tables is equal  Large amount of data needs to be joined Bitmap index is appropriate for:  Select correct option:  Low cardinality data  High cardinality data  Clustered data  Aggregated data If a task takes “T” time units to execute on a single data item, then execution of this task on “N” data items will take __...
Post a Comment
Read more

CS614 Quiz No.4 Shared by MT Khan (Solved)

Question # 1 of 10 ( Start time: 09:04:39 PM ) Total Marks: 1 A typical cycle of implementing the change in DWH comprises of the sequence: Select correct option: Production -> QA -> Development Development-> QA -> Production(CORRECT) Development -> Production -> QA Production -> Development -> QA Question # 2 of 10 ( Start time: 09:05:16 PM ) Total Marks: 1 Vertically wide data means: Select correct option: Dataset has large no. of attributes Dataset has large no. of records(CORRECT) Dataset has attribute skews Dataset has partitioning skews Question # 3 of 10 ( Start time: 09:05:43 PM ) Total Marks: 1 In ___________ phase of kimballs approach, we identify the components needed now and in future. Select correct option: Requirement definition Architectural design Product development Analytical application development Question # 4 of 10 ( Start time: 09:06:56 PM ) Total Marks: 1 Technical architecture design supports the communicat...
2 comments
Read more