______ i s a pile in which items are added at one end and removed from the other.

List Stack Queue none of the above

When determining the efficiency of algorithm the time factor is measured by_____________.

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

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

LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array none of the above

A linked list index is ____ that represents the position of a node in a linked list.

a variable a character a Boolean An Integer

In a Stack the command to access nth element from the top of the stack s will be ___________.

S [top-n-1] S [Top+n] both a & b S[Top-n]

______ form of access is used to add and remove nodes from a stack.

FIFO LIFO both a & b none of the above

The in order traversal of tree will yield a sorted listing of elements of tree in _______________.

Binary search trees Heaps Binary trees None of above

Each data item in a record may be a group item composed of sub-items; those items which are in decomposable are called ________.

scalars atoms elementary items all of above

Suppose we need to sort a list of employee records in ascending order, using the social security number (a 9-digit number) as the key (i.e., sort the records by social security number). If we need to guarantee that the running time will be no worse than n log n, which sorting methods could we use?

quick sort insertion sort merge sort none of above

The way a card game player arranges his cards as he picks them one by one can be compared to ____.

Merge sort Bubble sort Quick sort Insertion sort

## Post a Comment