Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
Correct Answer :
A. sorted linked list
Related Questions
Which of the following data structure store the homogeneous data elements?
Arrays
Records
Pointers
None
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
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.
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
Which of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following data structure is non linear type?
Lists
Strings
Graph
Stacks
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
The memory address of the first element of an array is called
floor address
foundation address
first address
base address
Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations
True, False
False, True
True, True
False, False
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
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
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
Which of the following data structure is linear data structure?
Trees
Graphs
Arrays
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
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
Finding the location of the element with a given value is:
Traversal
Search
Sort
None of above
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
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
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 term push and pop is related to the
array
lists
stacks
all of above
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
Which of the following data structure is linear type?
Graph
Binary tree
Trees
Stack
Which of the following is two way list?
grounded header list
circular header list
linked list with header and trailer nodes
none of above
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
Which of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
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 complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal