16 Questions
| Attempts: 14519

Questions and Answers

- 1.How can you measure the efficiency of an the algorithm?
- A.
Processor and memory

- B.
Complexity and capacity

- C.
Time and space

- D.
Data and space

- 2.How can we measure the time factor when determining the efficiency of the algorithm?
- A.
Counting microseconds

- B.
Counting the number of key operations

- C.
Counting the number of statements

- D.
Counting the kilobytes of algorithm

- 3.The complexity theory does not contain the following case, which is?
- A.
Best case

- B.
Worst case

- C.
Average case

- D.
Null case

- 4.The Average case occurs in the 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

- 5.The complexity of the linear search algorithm is
- A.
O(n)

- B.
O(log n)

- C.
O(n2)

- D.
O(n log n)

- 6.The complexity of the Binary search algorithm is
- A.
O(n)

- B.
O(log )

- C.
O(n2)

- D.
O(n log n)

- 7.The complexity of the Bubble sort algorithm is
- A.
O(n)

- B.
O(log n)

- C.
O(n2)

- D.
O(n log n)

- 8.The complexity of the merge sort algorithm is
- A.
O(n)

- B.
O(log n)

- C.
O(n2)

- D.
O(n log n)

- 9.When an indirect change of the values of a variable in one module by another module happens, it's called what?
- A.
Internal change

- B.
Inter-module change

- C.
Side effect

- D.
Side-module update

- 10.Can you guess which of the following data structure is NOT a linear data structure?
- A.
Arrays

- B.
Linked lists

- C.
Both of above

- D.
None of above

- 11.Can you guess which of the following data structure is linear data structure?
- A.
Trees

- B.
Graphs

- C.
Arrays

- D.
None of above

- 12.Which function findings the location of the element with a given value is:
- A.
Traversal

- B.
Search

- C.
Sort

- D.
None of above

- 13.Arrays are the best data structures
- A.
For relatively permanent collections of data

- B.
For the size of the structure and the data in the structure are constantly changing

- C.
For both of the above situation

- D.
For none of the above situation

- 14.Linked lists are the best suited
- A.
For relatively permanent collections of data

- B.
for the size of the structure and the data in the structure are constantly changing

- C.
For both of the above situation

- D.
For none of the above situation

- 15.Each array declaration does not give, implicitly or explicitly, the information about which of the following?
- A.
The name of the array

- B.
The exact data type of array

- C.
The first data from the set that will be stored

- D.
Index set

- 16.Why are the elements of an array are stored successively memory cells?
- A.
In this way, the computer can keep track only the address of the first element, and the addresses of other elements can be calculated

- B.
The architecture of computer memory does not allow arrays to store other than serially

- C.
Both of above

- D.
None of above

×

Wait!

Here's an interesting quiz for you.