Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
Correct Answer :
D. None of the above
Related Questions
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
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
The memory address of the first element of an array is called
floor address
foundation address
first address
base address
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
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
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
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
……………. Is a pile in which items are added at one end and removed from the other.
Queue
Stack
List
None of the above
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
A variable P is called pointer if
P contains the address of an element in DATA.
P points to the address of first element in DATA
P can store only memory addresses
P contain the DATA and the address of DATA
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
The term push and pop is related to the
array
lists
stacks
all of above
Which of the following data structure is linear data structure?
Trees
Graphs
Arrays
None of above
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
Which data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
Which of the following is non-liner data structure?
List
Stacks
Trees
Strings
Which of the following data structure is not linear data structure?
Arrays
Linked lists
Both of above
None of above
Which of the following data structures are indexed structures?
linear arrays
linked lists
both of above
none of above
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the 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
Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
Two dimensional arrays are also called
tables arrays
matrix arrays
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.
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