Question is ⇒ The concept of order (Big O) is important because, Options are ⇒ (A) it can be used to decide the best algorithm that solves a given problem, (B) it determines the maximum size of a problem that can be solved in a given system, in a given amount of time, (C) all of the above, (D) none of these, (E) , Leave your comments or Download question paper.

Question is ⇒ The concept of order (Big O) is important because, Options are ⇒ (A) it can be used to decide the best algorithm that solves a given problem, (B) it determines the maximum size of a problem that can be solved in a given system, in a given amount of time, (C) all of the above, (D) none of these, (E) , Leave your comments or Download question paper. Previous question Next question


Q1.	The concept of order (Big O) is important because
A.	it can be used to decide the best algorithm that solves a given problem [Wrong Answer]
B.	it determines the maximum size of a problem that can be solved in a given system, in a given amount of time [Wrong Answer]
C.	all of the above [Correct Answer]
D.	none of these [Wrong Answer]
View Answer 9 -11 Explanation:- Answer : C Discuss it below : !! OOPS Login [Click here] is required to post your answer/result Help other students, write article, leave your comments

Previous question Next question

Also Read Similar Questions Below :

⇒ Queues serve major role in
Simulation of limited resource allocation
Simulation of arbitrary linked list
Simulation of recursion
All of above

⇒ Six files Fl, F2, F3, F4, F5 and F6 have 100,200,50,80, 120, 150 number of records respectively. In what order should they be stored so as to optimize access time? Assume each file is accessed with th
Fl, F2, F3, F4, F5, F6
F2, F6, F5, Fl, F4, F3
F3, F4, FI, F5, F6, F2
Ordering is immaterial as all files are accessed with the same frequency

⇒ A-2-3 tree is a tree such that 1. All internal nodes have either 2 or 3 children. 2. All paths from root to the leaves have the same length. The number of internal nodes of a 2-3 tree having 9 leaves
2
4
6
8

⇒ The average number of comparisons performed by the merge sort algorithm, in merging two sorted liss of length 2 is
8/3
8/5
8/7
11/7

⇒ The average search time of hashing, with linear probing will be less if the load factor
equals one
is far less than one
is far greater than one
none of these

⇒ Unrestricted use of goto is harmful, because it
results in the compiler generating longer machine code
increases memory requirement of programs
increases the running time of programs
makes debugging difficult

⇒ The depth of a complete binary tree with 'n nodes is (log is to be base two)
log(n)
log(n) + 1
log (n-1) + 1
log (n+1)-1

⇒ The order of an algorithm that finds whether a given Boolean function of 'n' variables, produces a 1 is
linear
constant
exponential
logarithmic

⇒ A matrix "a" is called lower triangular if and only if for all j > ai j = 0. If such a matrix is to be sorted in a one dimensional array, A then ai j could be mapped to which of the following index of
i + j
i (i + 1) + j
1/2 * i (i + 1) j
none of these

⇒ A search begins the search with the element that is located in the middle of the array
serial
binary
parallel
random

⇒ The average search time of hashing, with linear probing will be less if the load factor
equals one
is for less than one
is for greater than one
none of these

⇒ A full binary tree with n non-leaf nodes contains
2n nodes
n - 1 nodes
log2n nodes
2n + 1 nodes

⇒ As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be
heap sort
bubble sort
selection sort
insertion sort

⇒ A priority queue is used to implement a stack S that stores characters PUSH(C)is implemented as INSERT(Q,C,K)where K is an appropriate integer key chosen by the implementation.POP is implemented as DE
Non-increasing order
Non-decreasing order
Strictly increasing order
Strictly decreasing order

⇒ The way a card game player arranges his cards as he picks them up one by one, is an example of
merge sort
bubble sort
selection sort
insertion sort

⇒ The postifx expression for the infix expression A + B* (C+D) / F + D*E is
AB+CD + *F/ D+E*
A + *BCD/ F* DE ++
A*B + CD / F* DE ++
ABCD + *F / + DE* +

⇒ A complete binary tree with the property that the value at each node is at least as large as the values at its children is called
Heap
Binary Tree
Binary search tree
Completely balanced tree

⇒ The average time required to perform a successful sequential search for an element in an array A(1 : n) is given by
n
(n + 1)/2
log2n
n(n + 1)/2

⇒ Which of the following types of expressions does not require precedence rule when evaluated?
Prefix expression
More than one of these
Full parenthesized infix expression
Partially parenthesized infix expression

⇒ For merging two sorted lists of sizes m and n into a sorted list of size m + n, we require comparisons of
O(m)
O(n)
O(m+n)
O(log(m) + log(n))

⇒ The minimum number of edges in a connected cyclic graph on n vertices is
n
n+1
n-1
none of the above

⇒ A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers?
Inorder
Preorder
Postorder
None of these

⇒ Which of the following is false ?
A binary search begins with the middle element in the array
A binary search continues having the array either until a match is found or until there are no more elements to search
For a binary search to work, the data in the array must be arranged in either alphabetical or numerical order
If the search argument is greater than the value located in the middle of the binary, the binary search continues in the upper half of the array

⇒ Which of the following sorting algorithms does not have a worst case running time of O(n2)?
Quick sort
Bubble sort
Merge sort
Insertion sort

⇒ Sparse matrices have
higher dimension
many zero entries
many non-zero entries
none of the above

⇒ The data structure required to evaluate a postfix expression is
Stack
Queue
Array
linked-list

⇒ An ADT is defined to be a mathematical model of a user-defined type along with the collection of all ____________ operations on that model
Primitive
Structured
Cardinality
Assignment

⇒ Which of the following algorithm design technique is used in the quick sort algorithm?
Backtracking
Greedy method
Divide and conquer
Dynamic programming

⇒ The maximum degree of any vertex in a simple graph with n vertices is
n
n+1
n-1
2n-1

⇒ A text is made up of the characters a, b, c, d, e each occurring with the probability .12, .4, .15, .08 and .25 respectively. The optimal coding technique will have the average length of
1.78
2.03
2.15
3.01