test
qq
ww
ee
rr
The complexity of Binary search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
The indirect change of the values of a variable in one module by another module is called
internal change
inter-module change
side effect
side-module update
Which of the following data structure is not linear data structure?
Arrays
Linked lists
Both of above
None of above
Which of the following data structure is linear data structure?
Trees
Graphs
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
Finding the location of the element with a given value is:
Search
Sort
Arrays are best data structures
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation
Linked lists are best suited
Each array declaration need not give, implicitly or explicitly, the information about
the name of array
the data type of array
the first data from the set to be stored
the index set of the array