CS301 Quiz No.2 Shared by Annie

Question # 1 of 10 ( Start time: 07:00:53 PM ) Total Marks: 1
Which of the following statement is false?
Select correct option:
Arrays are dense lists and static data structure
data elements in linked list need not be stored in adjecent space in memory        ok
pointers store the next data element of a list
linked lists are collection of the nodes that contain information part and next pointer


Question # 2 of 10 ( Start time: 07:01:32 PM ) Total Marks: 1
Which one is not the property of binary tree?
Select correct option:
Every node in binary tree should have maximum two children.
Only one node should have two parents.        ok
Sibling nodes should have same parent.
None of given options.


Question # 3 of 10 ( Start time: 07:01:53 PM ) Total Marks: 1
Deleting a _____ node in BST is a _______ case
Select correct option:
Root, simplest
Left child, simplest        ok
Right child, simplest
Leaf, simplest


Question # 4 of 10 ( Start time: 07:02:24 PM ) Total Marks: 1
To represent hierarchical relationship between elements, which data structure is suitable?
Select correct option:
Dequeue
Priority
Stack
Tree        ok


Question # 5 of 10 ( Start time: 07:02:45 PM ) Total Marks: 1
The _________ of a binary tree is the maximum level of its leaves (also called the depth).
Select correct option:
Level        ok ?
Width
Height       
None of the above


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


Question # 7 of 10 ( Start time: 07:03:36 PM ) Total Marks: 1
Suppose there is a BST with elements, 13,3,14,1,4,18 and 2. Now if the method insert(4) is called, which message will be

displayed?
Select correct option:
Node is inserted in root
Node is inserted in left subtree        ok
Node is inserted in right subtree
Node already exist in the tree


Question # 8 of 10 ( Start time: 07:04:03 PM ) Total Marks: 1
A BST generated from the data in ascending order is ____________.
Select correct option:
Linear
Nonlinear
Balanced        ok
Un sorted


Question # 9 of 10 ( Start time: 07:04:25 PM ) Total Marks: 1
The depth of a complete binary tree is given by _________
Select correct option:
Dn = n log2n
Dn = n log2n+1
Dn = log2n
Dn = log2(n+1)-1        ok


Question # 10 of 10 ( Start time: 07:04:38 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