Pages

Thursday, 24 September 2015

Latest Data Structure Online Quiz Questions And Answers

61. The complexity of merge sort algorithm is
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)
Ans:c

62. 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. side-module update
Ans:d

63. Which of the following data structure is not linear data structure?
a. Arrays
b. Linked lists
c. Both of above
d. None of above
Ans:d

64. Which of the following data structure is linear data structure?
a. Trees
b. Graphs
c. Arrays
d. None of above
Ans:c

65. The operation of processing each element in the list is known as
a. Sorting
b. Merging
c. Inserting
d. Traversal
Ans:d

66. Finding the location of the element with a given value is:
a. Traversal
b. Search
c. Sort
d. None of above
Ans:b

67. Arrays are best data structures
a. for relatively permanent collections of data
b. for the size of the structure and the data in the structure are constantly changing
c. for both of above situation
d. for none of above situation
Ans:a

68. Linked lists are best suited
a. for relatively permanent collections of data
b. for the size of the structure and the data in the structure are constantly changing
c. for both of above situation
d. for none of above situation
Ans:b

69. Each array declaration need not give, implicitly or explicitly, the information about
a. the name of array
b. the data type of array
c. the first data from the set to be stored
d. the index set of the array
Ans:c

70. The elements of an array are stored successively in memory cells because
a. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
b. the architecture of computer memory does not allow arrays to store other than serially
c. both of above
d. none of above
Ans: a

More Questions & Answers:-
Page1 Page2 Page3 Page4 Page5 Page6 Page7 Page8 Page9

No comments:

Post a Comment