UGC NET EXPERTS
Data Structure Test 2
Q.1. What is used for the comments in an algorithm?
Q.2. If we want to search an element which is in 10th position among 10 elements, then the complexity is?
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?
all of the above
Q.4. Which searching method is the step by step searching?
Q.5. What is the traversing order of this BST with breadth-first traversing?
Q.6. What is the traversing order of this BST with pre-order traversing?
Q.7. What is the traversing order of this BST with in-order traversing?
Q.8. What is the traversing order of this BST with post-order traversing?
Q.9. What is the order of the binary search algorithm?
none of the above
Q.10. Which of the following data structure is hierarchical in nature?
This content is neither created nor endorsed by Google.
Terms of Service