UGC NET EXPERTS
Data Structure Test 2
* Required
Email address
*
Your email
Q.1. What is used for the comments in an algorithm?
*
1 point
/*.......*/
[....]
//.....
<.....>
Q.2. If we want to search an element which is in 10th position among 10 elements, then the complexity is?
*
1 point
Best case Complexity
Worst case Complexity
Average case Complexity
All of the above
Q.3. What should be the complexity of Big Oh notation with f(n)=2n+3?
*
1 point
2n
2n3
5n
all of the above
Q.4. Which searching method is the step by step searching?
*
1 point
Dope vector
binary search
linear search
sequence search
Q.5. What is the traversing order of this BST with breadthfirst traversing?
*
1 point
5,7,4,10,2,6,12,3
3,12,2,10,6,4,7,5
5,4,7,2,6,10,3,12
2,6,10,5,4,7,3,12
Q.6. What is the traversing order of this BST with preorder traversing?
*
1 point
5,4,7,2,6,10,3,12
5,2,6,3,4,7,10,12
5,4,6,2,3,10,12,7
5,4,2,6,3,7,10,12
Q.7. What is the traversing order of this BST with inorder traversing?
*
1 point
2,4,3,6,5,7,10,12
2,3,6,4,7,10,12,5
2,4,3,6,5,7,10,1
12,10,7,5,3,6,2,4
Q.8. What is the traversing order of this BST with postorder traversing?
*
1 point
2,4,6,3,5,7,12,10
2,3,6,4,12,10,7,5
2,3,6,4,7,10,12,5
2,3,6,12,10,7,4,5
Q.9. What is the order of the binary search algorithm?
*
1 point
n
log(n)
nlog(n)
none of the above
Q.10. Which of the following data structure is hierarchical in nature?
*
1 point
stack
array
tree
queue
Submit
This content is neither created nor endorsed by Google.
Report Abuse

Terms of Service

Privacy Policy
Forms