The memory address of the first element of an array is called
floor address
foundation address
first address
base address
Correct Answer :
B. foundation address
Related Questions
If the values of a variable in one module is indirectly changed by another module, this situation is called
internal change
inter-module change
side effect
side-module update
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 above
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
Arrays are best data structures
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the above
Each array declaration need not give, implicitly or explicitly, the information about
the name of array
the data type of array
the index set of the array
the first data from the set to be stored
The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
11
12
13
14
Linked lists are best suited
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
underflow
overflow
housefull
saturated
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations
True, False
False, True
True, True
False, False
When determining the efficiency of algorithm, the space factor is measured by
Counting the maximum memory needed by the algorithm
Counting the minimum memory needed by the algorithm
Counting the average memory needed by the algorithm
Counting the maximum disk space needed by the algorithm
Which of the following is not a limitation of binary search algorithm?
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.
Which data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
When determining the efficiency of algorithm the time factor is measured by
Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
3 additions and 2 deletions
2 deletions and 3 additions
3 deletions and 4 additions
3 deletions and 3 additions
Which of the following data structure is linear type?
Graph
Binary tree
Trees
Stack