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
Correct Answer :
A. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
Related Questions
Merge sort uses ?
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
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
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
Which of the following data structure is non linear type?
Lists
Strings
Graph
Stacks
For an algorithm the complexity of the average case is
Much more complicated to analyze than that of worst case
Much more simpler to analyze than that of worst case
Sometimes more complicated and some other times simpler than that of worst case
None or above
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the above
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
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.
Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
elementary items
atoms
scalars
all of above
Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?
mn
max(m,n)
min(m,n)
m+n-1
The term push and pop is related to the
array
lists
stacks
all of above
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
Which of the following data structure is linear type?
Graph
Binary tree
Trees
Stack
Which of the following is non-liner data structure?
List
Stacks
Trees
Strings
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following data structure is not linear data structure?
Arrays
Linked lists
Both of above
None of above
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
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
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque
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
Which of the following data structure store the homogeneous data elements?
Arrays
Records
Pointers
None
Which of the following data structure is linear data structure?
Trees
Graphs
Arrays
None of above
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
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
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)