The time factor when determining the efficiency of algorithm is measured by ___________.

Counting the kilobytes of algorithm Counting microseconds Counting the number of key operations Counting the number of statements

The Worst case occur in linear search algorithm when ___________.

Item is not in the array at all Item is the last element in the array Item is somewhere in the middle of the array Item is the last element in the array or is not there at all

The complexity of the average case of an algorithm is _____.

Much more complicated to analyze than that of worst case Much more simpler to analyze than that of worst case Sometimes more complicated and some other times simpler than that of worst case Both b & c

The complexity of Binary search algorithm is ______.

O(n log n) O(n2) O(log ) O(n)

Which of the following data structure is linear data structure?

Trees List Graphs Arrays

If yyy, xxx and zzz are the elements of a lexically ordered binary tree, then in preorder traversal which node will be traverse first

can not be determined xxx yyy zzz

In an array representation of binary tree the right child of root will be at location of

3 2 4 5

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

isolated strongly connected finite complete

When representing any algebraic expression E which uses only binary operations in a 2-tree,

the operations in E will appear as external nodes and variables in internal nodes the variables and operations in E will appear only in external nodes the variable in E will appear as external nodes and operations in internal nodes the variables and operations in E will appear only in internal nodes

In a graph if e=(u, v) means _______.

e end at u and begins at v e begins at u and ends at v u is processor and v is successor both b and c

## Post a Comment