1. The memory address of
the first element of an array is called
a. floor address
b. foundation address
c. First address
d. base address
Answer
d. base address
2. The memory address of
fifth element of an array can be calculated by the formula
a.
LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the
number of words per memory cell for
the array
b.
LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of
words per memory cell for the array
c.
LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of
words per memory cell for the array
d.
None of above
Answer
a.
LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the
number of words per memory cell for the array
3. Which of the following
data structures are indexed structures?
a.
linear arrays
b.
linked lists
c.
both of above
d.
none of above
Answer
a.
linear arrays
4. Which of the following
is not the required condition for binary search algorithm?
a.
The list must be sorted
b.
there should be the direct access to the middle element in any sublist
c.
There must be mechanism to delete and/or insert elements in list
d.
none of above
Answer
c.
There must be mechanism to delete and/or insert elements in list
5. Which of the following
is not a limitation of binary search algorithm?
a.
must use a sorted array
b.
requirement of sorted array is expensive when a lot of insertion and deletions
are needed
c.
there must be a mechanism to access middle element directly
d.
binary search algorithm is not efficient when the data elements are more than
1000.
Answer
d.
binary search algorithm is not efficient when the data elements are more than
1000
6. Two dimensional arrays
are also called
a.
tables arrays
b.
matrix arrays
c.
both of above
d.
none of above
Answer
c.
both of above
7. A variable P is called
pointer if
a.
P contains the address of an element in DATA.
b.
P points to the address of first element in DATA
c.
P can store only memory addresses
d.
P contain the DATA and the address of DATA
Answer
a.
P contains the address of an element in DATA.
8. Which of the following
data structure can't store the non-homogeneous data elements?
a.
Arrays
b.
Records
c. Pointers
d.
None
Answer
a.
Arrays
9. Which of the following
data structure store the homogeneous data elements?
a.
Arrays
b.
Records
c.
Pointers
d.
None
Answer
b.
Records
10. Each data item in a
record may be a group item composed of sub-items; those items which are
indecomposable are called
a.
elementary items
b.
atoms
c.
scalars
d.
all of above
Answer
d.
all of above
11. The difference between
linear array and a record is
a.
An array is suitable for homogeneous data but hte data items in a
record may have different data type
b.
In a record, there may not be a natural ordering in opposed to
linear array.
c.
A record form a hierarchical structure but a lienear array does not
d.
All of above
Answer
d.
All of above
12. Which of the following
statement is false?
a.
Arrays are dense lists and static data structure
b.
data elements in linked list need not be stored in adjecent space in memory
c.
pointers store the next data element of a list
d.
linked lists are collection of the nodes that contain information part and next
pointer
Answer
c.
pointers store the next data element of a list
13. Binary search algorithm
can not be applied to
a.
sorted linked list
b.
sorted binary trees
c.
sorted linear array
d.
pointer array
Answer
a.
sorted linked list
14. When new data are to be
inserted into a data structure, but there is no available space; this situation
is usually called
a.
underflow
b.
overflow
c.
housefull
d.
saturated
Answer
b.
overflow
15. The situation when in a
linked list START=NULL is
a.
underflow
b.
overflow
c.
housefull
d.
saturated
Answer
a.
underflow
16. Which of the following
is two way list?
a.
grounded header list
b.
circular header list
c.
linked list with header and trailer nodes
d.
none of above
Answer
d.
none of above
17. Which of the following
name does not relate to stacks?
a.
FIFO lists
b.
LIFO list
c.
Piles
d.
Push-down lists
Answer
a.
FIFO lists
18. The term
"push" and "pop" is related to the
a. array
b.
lists
c.
stacks
d.
all of above
Answer
c.
stacks
19. A data structure where
elements can be added or removed at either end but not in the middle
a.
Linked lists
b.
Stacks
c.
Queues
d.
Deque
Answer
Deque
20. When inorder traversing
a tree resulted E A C K F H D B G; the preorder traversal would return
a.
FAEKCDBHG
b.
FAEKCDHGB
c.
EAFKHDCBG
d.
FEAKDCHBG
Answer
b.
FAEKCDHGB
