_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
Correct Answer :
B. Implementation level
Related Questions
Which of the following data structures are indexed structures?
linear arrays
linked lists
both of above
none of above
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
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 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 term push and pop is related to the
array
lists
stacks
all of above
The memory address of the first element of an array is called
floor address
foundation address
first address
base address
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the above
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
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
Which of the following is two way list?
grounded header list
circular header list
linked list with header and trailer nodes
none of above
Which of the following data structure is not linear data structure?
Arrays
Linked lists
Both of above
None of above
Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
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
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
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
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 operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
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.
The situation when in a linked list START=NULL is
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 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
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
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
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
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