The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Correct Answer :
A. O(n)
Related Questions
Which of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
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 data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
Merge sort uses ?
Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
underflow
overflow
housefull
saturated
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 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 data structure store the homogeneous data elements?
Arrays
Records
Pointers
None
Which of the following data structure is non linear type?
Lists
Strings
Graph
Stacks
The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
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 case does not exist in complexity theory
Best case
Null case
Worst case
Average case
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
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
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
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 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
Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
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 is not the part of ADT description?
Data
Operations
Both of the above
None of the above
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
Which of the following data structures are indexed structures?
linear arrays
linked lists
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
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
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
Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
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