Skip to main content

CS301 Quiz No.2 Shared by Atique

Question # 1 of 10 ( Start time: 07:06:22 PM ) Total Marks: 1
Sub-tree of binary search tree should be ________.
Select correct option:
Binary tree
Binary search tree        ok
Complete binary tree
None of given options


Question # 2 of 10 ( Start time: 07:06:47 PM ) Total Marks: 1
Leaf node of binary search tree contains ________
Select correct option:
One Null pointer        ok
Three Null pointers
Two Null pointers
All of the given


Question # 3 of 10 ( Start time: 07:07:42 PM ) Total Marks: 1
Which of the following data structure is linear type?
Select correct option:
Stack
List
Queue
All of above        ok


Question # 4 of 10 ( Start time: 07:08:01 PM ) Total Marks: 1
In a program a reference variable, say x, can be declared as
Select correct option:
int &x ;    ok
int *x ;
int x ;
None of the given options


Question # 5 of 10 ( Start time: 07:08:12 PM ) Total Marks: 1
The depth of a binary tree is
Select correct option:
Total number of nodes in the tree
Number of leaf nodes in the tree
Number of non-leaf nodes in the tree
Maximum level of a leaf        ok


Question # 6 of 10 ( Start time: 07:08:47 PM ) Total Marks: 1
The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
Select correct option:
ABFCDE
ADBFEC        ok
ABDECF
ABDCEF


Question # 7 of 10 ( Start time: 07:09:45 PM ) Total Marks: 1
A tree is an AVL tree if
Select correct option:
Any one node fulfills the AVL condition
At least half of the nodes fulfill the AVL condition
All the nodes fulfill the AVL condition       
None of the given options


Question # 8 of 10 ( Start time: 07:10:03 PM ) Total Marks: 1
The smallest value element in a binary tree( Each node with left and right pointers)lies at
Select correct option:
Root Node
Left Child of Root        ok
Right Most Node
Left Most Node


Question # 9 of 10 ( Start time: 07:10:34 PM ) Total Marks: 1
In which traversal method, the recursive calls can be used to traverse a binary tree ?
Select correct option:
In preorder traversal only
In inorder traversal only
In postorder traversal only
All of the given options        ok


Question # 10 of 10 ( Start time: 07:10:51 PM ) Total Marks: 1
During deletion of node from BST, if we found this node don’t have in-order successor and predecessor. It means this node is __________.
Select correct option:
Left most node in the binary search tree        ok
Right most node in binary search tree
Root node
None of given options

Comments

Post a Comment

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

Popular posts from this blog

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

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