Skip to main content

CS604 Current Final Term Fall 2013 Shared by Sumaira Shabbir File 3



my today paper
mcqz
60% from past paper and 40% from handouts
1.Difference b/w local & global replacement with respect to page replacement algorithm???
2.diffe b/w deadlock prevention and deadlock avoidance????
3.why we use the safety algrithm with banker algorithm ?????
4.a process in normal executatin but some time its resources are preempted write down the method to handle this condition?????
5.a process average time is 20 millisecond and memory access time is 100 nanosecond find its effective access time????
6.which memry you used if you are writting a prgram in c language t store and execute the program??????
7.consider the following program techique and data structure in demand pagging environment which of following is good or bad explain with sold reason????
1.stack
2.hash table
3. sequential search
8. ek table tha compare karna tha paging and segmentation ko yes or no main ans day k ????
9. 2 code dea hovy thy unka purpose likhna tha k yeh code kis lea use kea jatay haen ????
10.segment table base register and segmant table length register k define karna tha????
baqiii q yaad nhiiiii best of luck t0 alll of you stay blessed and remember me in your prayerz

Comments

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...

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 __...

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...