Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
Correct Answer :
C. both of above
Related Questions
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
Which of the following data structure is not linear data structure?
Arrays
Linked lists
Both of above
None of above
Which of the following is non-liner data structure?
List
Stacks
Trees
Strings
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
……………. Is a pile in which items are added at one end and removed from the other.
Queue
Stack
List
None of the above
Which of the following data structures are indexed structures?
linear arrays
linked lists
both of above
none of above
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.
Inserting an item into the stack when stack is not full is called _______ Operation and deletion of item form the stack, when stack is not empty is called _______operation.
push, pop
insert, delete
pop, push
delete, insert
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
The elements of an array are stored successively in memory cells because
by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
the architecture of computer memory does not allow arrays to store other than serially
both of above
none of 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
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
A ______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
Stacks linked list
Queue linked list
Both of them
Neither of them
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
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
Finding the location of the element with a given value is:
Traversal
Search
Sort
None of above
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following statement is false?
Arrays are dense lists and static data structure
data elements in linked list need not be stored in adjacent space in memory
pointers store the next data element of a list
linked lists are collection of the nodes that contain information part and next pointer
Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
Which of the following data structure is non linear type?
Lists
Strings
Graph
Stacks
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
Which of the following is not the required condition for binary search algorithm?
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
The Average case occur in linear search algorithm
When Item is somewhere in the middle of the array
When Item is not in the array at all
When Item is the last element in the array
When Item is the last element in the array or is not there at all
The difference between linear array and a record is
An array is suitable for homogeneous data but the data items in a record may have different data type
In a record, there may not be a natural ordering in opposed to linear array.
A record form a hierarchical structure but a linear array does not
All of above
Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?
3,4,5,2,1
3,4,5,1,2
5,4,3,1,2
1,5,2,3,4
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
AVL tree
Red-black tree
Lemma tree
None of the 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
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue