Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
Correct Answer :
A. Binary search
Related Questions
Which of the following data structure store the homogeneous data elements?
Arrays
Records
Pointers
None
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
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
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
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
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
Stack
Input restricted dequeue
Priority queues
Output restricted qequeue
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
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
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
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
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
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque
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
Merge sort uses ?
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
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
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 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
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
Which of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
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
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
The term push and pop is related to the
array
lists
stacks
all of above
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
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
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 data structure is not linear data structure?
Arrays
Linked lists
Both of above
None of above