English Vocabulary from
sponsored links
Two main measures for the efficiency of an algorithm are __________ .
The operation of processing each element in the list is known as_____________.
The amount of space needed to implement recursive procedure depends on the ________________.
The memory address of the first element of an array is called ________.
Give an example of indexed structures?
If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is ?
To represent hierarchical relationship between elements, which data structure is suitable?
If every node u in G is adjacent to every other node v in G, A graph is said to be __________.
The space factor when determining the efficiency of algorithm is measured by _________.
The complexity of merge sort algorithm is _______________.
The inorder traversal of tree will yield a sorted listing of elements of tree in _________.
The complexity of linear search algorithm is ____________.
The time factor when determining the efficiency of algorithm is measured by counting __________.
The depth of a complete binary tree is given by _________.
The post order traversal of a binary tree is DEBFCA. What will be the pre order traversal of that tree ?
When more than one key is mapped to the same location, it is called ________
Quick sort is the best example of which type of sorting algorithm ?
When a file is first created, the records are written into an area called _________
The mapping from key space to address space is done by _________.
Index area is created by ______________.
The operation of processing each element in the list is known as_____________.
The amount of space needed to implement recursive procedure depends on the ________________.
The memory address of the first element of an array is called ________.
Give an example of indexed structures?
If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is ?
To represent hierarchical relationship between elements, which data structure is suitable?
If every node u in G is adjacent to every other node v in G, A graph is said to be __________.
The space factor when determining the efficiency of algorithm is measured by _________.
The complexity of merge sort algorithm is _______________.
The inorder traversal of tree will yield a sorted listing of elements of tree in _________.
The complexity of linear search algorithm is ____________.
The time factor when determining the efficiency of algorithm is measured by counting __________.
The depth of a complete binary tree is given by _________.
The post order traversal of a binary tree is DEBFCA. What will be the pre order traversal of that tree ?
When more than one key is mapped to the same location, it is called ________
Quick sort is the best example of which type of sorting algorithm ?
When a file is first created, the records are written into an area called _________
The mapping from key space to address space is done by _________.
Index area is created by ______________.
sponsored links
gr8
ReplyDeleteplease give the objective set of question for the entire professional section !
ReplyDeleteThanks
very good
ReplyDelete