UGC NET EXPERTS
Data Structure Test 2
Email address *
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
Q.3. What should be the complexity of Big Oh notation with f(n)=2n+3? *
1 point
Q.4. Which searching method is the step by step searching? *
1 point
Q.5. What is the traversing order of this BST with breadth-first traversing? *
1 point
Captionless Image
Q.6. What is the traversing order of this BST with pre-order traversing? *
1 point
Captionless Image
Q.7. What is the traversing order of this BST with in-order traversing? *
1 point
Captionless Image
Q.8. What is the traversing order of this BST with post-order traversing? *
1 point
Captionless Image
Q.9. What is the order of the binary search algorithm? *
1 point
Q.10. Which of the following data structure is hierarchical in nature? *
1 point
Submit
This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy