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
Correct Answer :
D. 14
Related Questions
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
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
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 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
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 number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
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
Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
Which of the following statement is true ?
Breath first search cannot be used to find converted components of a graph.
Optimal binary search tree construction can be performed efficiently using dynamic programming.
Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
Depth first search can be used to find connected components of a graph.
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
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 operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
Which of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
Which of the following data structure is linear type?
Graph
Binary tree
Trees
Stack
In linear search algorithm the Worst case occurs when
The item is somewhere in the middle of the array
The item is not in the array at all
The item is the last element in the array
The item is the last element in the array or is not there at all
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the above
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
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
Two dimensional arrays are also called
tables arrays
matrix arrays
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
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
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 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
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
Which of the following data structure store the homogeneous data elements?
Arrays
Records
Pointers
None