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 user Not being an accommodating person Isolating IT support people from business users Training the users with dummy data and considering it success             
1 comment
Read more

CS502 Quiz No.4 File 3

There is relationship between number of back edges and number of cycles in DFS Select correct option: Both are equal. Cycles are half of back edges.   Cycles are one fourth of back edges. There is no relationship between back edges and number of cycles .         (Correct) In strong components algorithm, the form of graph is used in which all the vertices of original graph G have been reversed in direction. Select correct option: True                 (Correct)   False In Kruskal's algorithm, the next edge is added to viable set A, if its adding does not induce a/an __________ . Select correct option: Vertex Edge   Cycle               (Correct)   Tree For undirected graph, there is no distinction between forward and back edges. Select correct option: True                 (Correct)   False You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ? Select correct option: (V+E)             (Corre
Post a Comment
Read more

CS301 Quiz No.2 Shared by Tayyeba

Binary search algorithm can not be applied to ____ Select correct option: sorted linked list sorted binary trees        ok sorted linear array pointer array During in-order traversal using recursive calls, if we found a node is NULL. It means this node will satisfy following condition. Select correct option: It will not have left child        ok It will not have right child It will not have both left and right children None of given options Identify the data structure which allows deletions at both ends of the list but insertion at only one end. Select correct option: Input-restricted deque Output-restricted deque Priority queues        ok A BST generated from the data in ascending order is ____________. Select correct option: Linear Nonlinear Balanced        ok Un sorted 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 he depth of a complete bina
Post a Comment
Read more