Scribd
Upload
89 views40 pages

011 C and Data Structres Quiz

The document discusses various measures for determining the efficiency of algorithms, including time and space complexity. It states that time complexity is measured by counting the number of key operations, while space complexity is measured by counting the maximum memory needed. It then provides examples of time complexities for different algorithms, such as linear search being O(n) and binary search being O(log n).

Uploaded by

vinay harsha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
89 views40 pages

011 C and Data Structres Quiz

The document discusses various measures for determining the efficiency of algorithms, including time and space complexity. It states that time complexity is measured by counting the number of key operations, while space complexity is measured by counting the maximum memory needed. It then provides examples of time complexities for different algorithms, such as linear search being O(n) and binary search being O(log n).

Uploaded by

vinay harsha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 40

Two main measures for the efficiency of an algorithm are

a. Processor and memory


b. Complexity and capacity
c. Time and space
d. Data and space
1. Two main measures for the efficiency of an algorithm are
c. Time and space
2. The time factor when determining the efficiency of algorithm is
measured by
a. Counting microseconds
b. Counting the number of key operations
c. Counting the number of statements
d. Counting the kilobytes of algorithm
2. The time factor when determining the efficiency of algorithm is
measured by

b. Counting the number of key operations


3. The space factor when determining the efficiency of algorithm is
measured by
a. Counting the maximum memory needed by the algorithm
b. Counting the minimum memory needed by the algorithm
c. Counting the average memory needed by the algorithm
d. Counting the maximum disk space needed by the algorithm
3. The space factor when determining the efficiency of algorithm is
measured by

a. Counting the maximum memory needed by the algorithm


4. Which of the following case does not exist in complexity theory
a. Best case
b. Worst case
c. Average case
d. Null case
4. Which of the following case does not exist in complexity theory
d. Null case
5. The Worst case occur in linear search algorithm when
a. Item is somewhere in the middle of the array
b. Item is not in the array at all
c. Item is the last element in the array
d. Item is the last element in the array or is not there at all
5. The Worst case occur in linear search algorithm when

d. Item is the last element in the array or is not there at all


6. The Average case occur in linear search algorithm
a. When Item is somewhere in the middle of the array
b. When Item is not in the array at all
c. When Item is the last element in the array
d. When Item is the last element in the array or is not there at all
6. The Average case occur in linear search algorithm

a. When Item is somewhere in the middle of the array


7. The complexity of the average case of an algorithm is
a. Much more complicated to analyze than that of worst case

b. Much more simpler to analyze than that of worst case

c. Sometimes more complicated and some other times simpler than


that of worst case

d. None or above
7. The complexity of the average case of an algorithm is

a. Much more complicated to analyze than that of worst case


8. The complexity of linear search algorithm is
a. O(n)
b. b. O(log n)
c. c. O(n2)
d. d. O(n log n)
8. The complexity of linear search algorithm is

a. O(n)
9. The complexity of Binary search algorithm is
a. O(n)
b. b. O(log )
c. c. O(n2)
d. d. O(n log n)
9. The complexity of Binary search algorithm is

b. O(log n)
10. The complexity of Bubble sort algorithm is
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)
10. The complexity of Bubble sort algorithm is

c. O(n 2 )
11. The complexity of merge sort algorithm is
a. O(n)
b. O(log n)
c. O(n2)
d. O(n log n)
11. The complexity of merge sort algorithm is

d. O(n log n)
12. The indirect change of the values of a variable in one module by
another module is called

a. internal change

b. inter-module change

c. side effect

d. side-module update
12. The indirect change of the values of a variable in one module by
another module is called

c. side effect
13. Which of the following data structure is not linear data structure?

d. None of above
14. Which of the following data structure is linear data structure?

c. Arrays
15. The operation of processing each element in the list is known as

d. Traversal
16. Finding the location of the element with a given value is:

b. Search
17. Arrays are best data structures

a. for relatively permanent collections of data


18. Linked lists are best suited

b. for the size of the structure and the data in the structure are
constantly changing
19. Each array declaration need not give, implicitly or explicitly, the
information about

c. the first data from the set to be stored


20. The elements of an array are stored successively in
memory cells because

a. by this way computer can keep track only the address of the
first element and the addresses of other elements can be
calculated.

You might also like