data structures & algorithms set 2 Detailed Explanation And More Example

Question : 1

If every node u in G is adjacent to every other node v in G, A graph is said to be

a) Isolated

b) Complete

c) Finite

d) Strongly connected

Question : 2

Two dimensional arrays are also called

a) tables arrays

b) matrix arrays

c) both of the above

d) none of the above

Question : 3

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

Question : 4

The memory address of fifth element of an array can be calculated by the formula

a) LOC(Array[5])=Base(Array[5])+(5-lower boun(D), where w is the number of words per memory cell for the array

b) LOC(Array[5])=Base(Array[4])+(5-Upper boun(D), where w is the number of words per memory cell for the array

c) LOC(Array[5]=Base(Array)+w(5-lower boun(D), where w is the number of words per memory cell for the array

d) None of the above

Question : 5

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