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 Abdul_Mateen (Solved)

Question # 1 of 10 ( Start time: 01:03:34 PM ) Total Marks: 1 The first step of the “12-steps data warehouse implementation approach” of Shaku Atre is: Select correct option: Finding user needs (Page No. 336) Planning system resources Finding system scope Data acquisition and cleansing Question # 2 of 10 ( Start time: 01:04:15 PM ) Total Marks: 1 Users do not care, how advance the front end of your DWH is, what they care is that: Select correct option: Tables should be properly denormalized Proper partitioning technique should be used At least star or snow flake schema should be implemented They should get information in timely manner and the way they want   Question # 3 of 10 ( Start time: 01:04:49 PM ) Total Marks: 1 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 user Not being an accommodating person (Page No. 316) Isolating IT support p...
Post a Comment
Read more

CS614 Quiz No.3 Shared by Sweety (Solved)

Question # 1 of 10 ( Start time: 09:48:28 PM ) Total Marks: 1 Mining multi dimensional databases allow users to: Select correct option: Categorize the data Analyze the data Summarize the data All of the given options   (Correct) Question # 2 of 10 ( Start time: 09:49:23 PM ) Total Marks: 1 As per Bill Inmon, a data warehouse, in contrast with classical applications is: Select correct option: Data driven   (Correct) Resource driven Requirement driven Time sensitive Question # 3 of 10 ( Start time: 09:50:11 PM ) Total Marks: 1 In ________learning you don’t know the number of clusters and no idea about their attributes. Select correct option: Supervised learning Unsupervised learning   (Correct) Multi Dimension modeling None of the given options Question # 4 of 10 ( Start time: 09:51:04 PM ) Total Marks: 1 Identify the TRUE statement: Select correct option: The data value increases as volume decreases   (Correct) The data value decreases ...
Post a Comment
Read more

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