CS301 Current Midterm Paper Fall 2013 File 4

by meya on December 20, 2013 at 4:29pm

75 percent MCQs from Moaaz file

How we can delete a node with two Childs in a binary search tree using its right sub tree.(2 Marks)

Explain the two cases in which we apply double rotation in An Avl tree.(2 Marks)

If we delete the node from the given tree then draw the tree.(3 Marks)

Draw AVL tree 2,1,4,5,9,3,6.(5 Marks)

Comments

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.4 Shared by Princess (solved), Spring 2014

“What means What”. The phrase refers to: Select correct option: Meta data External data Transformed data Internal representations Question # 2 of 10 Which of the following is NOT one of the activities of “Maintenance and Growth” phase in Kimball’s DWH development approach? Select correct option: Education Technical Education Program Support Interface Deployment Question # 3 of 10 Horizontally wide data means: Select correct option: Dataset has large no. of attributes Dataset has large no. of records Dataset has attribute skews Dataset has partitioning skews Question # 4 of 10 Which of the following is NOT one of the top-10 mistakes that should be avoided during DWH development? Select correct option: Not interacting directly with end ...

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

Virtual University Forum

Search This Blog