Skip to main content

CS604 Current Midterm Paper Shared by sana, Spring 2014

what is process synchronization? give an example
what is indefinite blocking and which technique can be used to resolve this issue.
Critical section ki defination given ti aur batana ta k whether u r agree with it or not.
Resouce sharing is the advantage or disadvantage of thread? explain with strong arguemtns.
2 bhul gai
past paper se koi question ni aya . mcqs past papers se aye ty mostly


Popular posts from this blog

CS614 Quiz No.1 Shared by Manzar (UnSolved)

Question # 1 of 10 ( Start time: 03:35:24 PM )   Total Marks: 1 MDX by Microsoft is an example of _______ Select correct option: HOLAP DOLAP ROLAP None of the given options Question # 2 of 10 ( Start time: 03:36:40 PM )   Total Marks: 1 In decision support system ease of use is achieved by: Select correct option: Normalization Denormalization Drill up Drill down Question # 3 of 10 ( Start time: 03:38:07 PM )   Total Marks: 1 Which of the denormalization technique squeezes master table into detail? Select correct option: Pre-joining Horizontal splitting Vertical splitting Adding redundant column Question # 4 of 10 ( Start time: 03:38:28 PM )   Total Marks: 1 The trade-offs of denormalization is/are: Select correct option: Storage Performance Ease-of-use All of the given options Question # 5 of 10 ( Start time: 03:38:46 PM )   Total Marks: 1 ________is usually deployed when expressions can be used to group data together in...
Post a Comment
Read more

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