IBPS IT Officer MCQ – 5 (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.

keep-calm-and-study-data-structures-2

DATA STRUCTURE – 1
DATA STRUCTURE – 2
DATA STRUCTURE – 3

31. Arrays are best data structures for
(A) relatively permanent collections of data
(B) the size of the structure and the data in the structure are constantly changing
(C) both of above situation
(D) none of above situation

32. Linked lists are best suited for
(A) relatively permanent collections of data
(B) the size of the structure and the data in the structure are constantly changing
(C) both of above situation
(D) none of above situation

33. Each array declaration need not give, implicitly or explicitly, the information about the
(A) name of array
(B) data type of array
(C) first data from the set to be stored
(D) index set of the array

34. The complexity of merge sort algorithm is
(A) O(n)
(B) O(log n)
(C) O(n log n)
(D) None of these

35. The indirect change of the values of a variable in one module by another module is called
(A) internal change
(B) inter-module change
(C) side effect
(D) all the above

36. Two main measures for the efficiency of an algorithm are
(A) Time and space
(B) Processor and memory
(C) Complexity and capacity
(D) Data and space

37. The time factor when determining the efficiency of algorithm is measured by
(A) Counting the number of key operations
(B) Counting the number of statements
(C) Counting the kilobytes of algorithm
(D) None of the above

38. The space factor when determining the efficiency of algorithm is measured by
(A) Counting the maximum memory needed by the algorithm
(B) Counting the minimum memory needed by the algorithm
(C) Counting the average memory needed by the algorithm
(D) Counting the maximum disk space needed by the algorithm

39. All the above* Which of the following data structures are indexed structures
(A) linear arrays
(B) linked lists
(C) both of above
(D) none of above

40. Which of the following is not the required condition for binary search algorithm
(A) there must be mechanism to delete and/ or insert elements in list
(B) the list must be sorted
(C) there should be the direct access to the middle element in any sublist
(D) none of the above

Answers:  31. (A) 32. (B) 33. (C) 34. (C) 35. (C) 36. (A) 37. (A) 38. (A) 39. (A) 40. (A) 


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




Leave a Comment