Question

The time factor when determining the efficiency of algorithm is measured by

2The space factor when determining the efficiency of algorithm is measured by
The indirect change of the values of a variable in one module by another module is called
Two main measures for the efficiency of an algorithm are
Which of the following case does not exist in complexity theory
Locally optimal decisions which cannot change once made
The complexity of linear search algorithm is
The complexity of Binary search algorithm is
To prime test a number with n binary digits by brute force, we need to check number
Stack is also called as
Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item
. ……………. Is a pile in which items are added at one end and removed from the other.
………… is very useful in situation when data have to stored and then retrieved in reverse order.
Which data structure allows deleting data elements from and inserting at the rear?
Which of the following data structure can’t store the non-homogeneous data elements?
Which of the following data structure is non linear type?
Which of the following data structure is linear type?
To represent hierarchical relationship between elements, Which data structure is suitable?
By tournament method we can find the ______ value
. In ……………, search start at the beginning of the list and check every element in the list.
The advantage of …………….. is that they solve the problem if sequential storage representation. But disa
. ………… is not the operation that can be performed on queue.
Which of the following is not the type of queue?
When new data are to be inserted into a data structure, but there is not available space; this situation
Brute Force Algorithms refers to a programming style that does not include any shortcuts to improve performance,A clasic exa
The time factor when determining the efficiency of algorithm is measured by
The space factor when determining the efficiency of algorithm is measured by
Two main measures for the efficiency of an algorithm are
The example of dynamic programing algorithm technique is/are
The main difference between divide and conqure and dynamic programing is
the formula of the sum of first natural number is
the sum of n times 4 is
A B C D
a. Counting micro seconds b. Counting the number c. Counting the number of
d. Counting the kilobytes of
a. Counting the maximum memo b. counting the minim c. counting the average m
d. counting the maximum dis
a. internal change b. inter-module chang c. side effect d. side-module update
a. Processor and memory b. Complexity and capac. Time and space d. Data and space
a. Best case b. Worst case c. Average case d. Null case
a. Dynamic algorithm b. Greedy algorithm c. Divide and Conquer algor
d. None of Then
a. O(n) b. O(log n) c. O(n2) d. O(n log n)
a. O(n) b. O(logn ) c. O(n2) d. O(n log n)
a. Q(n), b. O(logn) c. 2n d. n
a. Last in first out b. First in last out c. Last in last out d. First in first out
A) push, pop B) pop, push C) insert, delete D) delete, insert
A) Stack B) Queue C) List D) None of the above
A) Stack B) Queue C) List D) Link list
A) Stacks B) Queues C) Dequeues D) Binary search tree
A) Arrays B) Records C) Pointers D) Stacks
A) Strings B) Lists C) Stacks D) Graph
A) Graph B) Trees C) Binary tree D) Stack
A) Dequeue B) Priority C) Tree D) Graph
largest smalest both a and b none
A) Linear search B) Binary search C) Hash Search D) Binary Tree search
A) Lists B) Linked Lists C) Trees D) Queues
A) Insertion B) Deletion C) Retrieval D) Traversal
A) Ordinary queue B) Single ended queueC) Circular queue D) Priority queue
A. Underflow B. overflow C. houseful D. saturated
Travling salsman Problem TSP sequenctial search binary search both a and b
Counting micro seconds Counting the number of Counting the number of Counting the kilobytes of algorithm
Counting the maximum memory Counting the minimumCounting the average meCounting the maximum disk space needed by th
Processor and memory Time and space Complexity and capacityData and space
Knapsack Matrix-chain multiplicabinary search both a and b
Sub process are dependent andSub process are depend Sub process are indepenboth a and b
n^2 (n+10/2 n(n+1)/2 n(n+1)/4
n+4 n n-4 4n
 your roll number is here and answe below result answer
a 0b
b 1b
c 0b
g 0c
d 1d
b 1b
c 0a
d 0b
0c
0b
0a
0b
0a
0b
0a
0d
0d
0c
0c
0A
0B
0D
0B
0b
0D
bytes of algorithm 0c
ximum disk space needed by the algorithm 0D
0b
0D
0A
0C
a 0D