IBPS IT Officer MCQ – 4 (Data Structure)

The IBPS Specialist Officer (SO) Exam 2016 for recruitment of specialist officer vacancies in public sector banks has been announced. So we D2G Team is here with IBPS SO Material.



21. The depth of a complete binary tree is given by
(A) Dn = n log2n
(B) Dn = n log2n+1
(C) Dn = log2n
(D) Dn = log2n+1

22. The complexity of Binary search algorithm is

(A) O(n)
(B) O(log )
(C) O(n log n)
(D) None of the above

23. The complexity of Bubble sort algorithm is
(A) O(n)
(B) O (n2)
(C) O(n log n)
(D) None of the above

24. When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return

25. When representing any algebraic expression E the following uses only binary operations in a 2-tree
(A) the variable in E will appear as external nodes and operations in internal nodes
(B) the operations in E will appear as external nodes and variables in internal nodes
(C) the variables and operations in E will appear only in internal nodes
(D) None of the above

26. When converting binary tree into extended binary tree, all the original nodes in binary tree are
(A) internal nodes on extended tree
(B) external nodes on extended tree
(C) vanished on extended tree
(D) None of the above

27. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
(D) None of the above

28. Which of the following data structure is linear data structure?
(A) Trees
(B) Graphs
(C) Arrays
(D) None of the above

29. The operation of processing each element in the list is known as
(A) Merging
(B) Inserting
(C) Traversal
(D) All the above

30. Finding the location of the element with a given value is called
(A) Traversal
(B) Search
(C) Sort
(D) All of the above

Answers:  21. (D) 22. (B) 23. (B) 24. (B) 25. (A) 26. (A) 27. (C) 28. (C) 29. (C) 30. (B)

Click the below IT Officer Tag and explore more quizzes under this category.

Leave a Comment