Tag: architecture

Arrays

Records

Pointers

None

Arrays

Records

Pointers

None

elementary items

atoms

scalars

all of above

floor address

foundation address

first address

base address

linear arrays

linked lists

both of above

none of above

The list must be sorted

there should be the direct access to the middle element in any sublist

There must be mechanism to delete and/or insert elements in list

none of above

must use a sorted array

requirement of sorted array is expensive when a lot of insertion and deletions are needed

there must be a mechanism to access middle element directly

binary search algorithm is not efficient when the data elements are more than 1000.

tables arrays

matrix arrays

both of above

none of above

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 above

Linked lists

Stacks

Queues

Deque