Computational Thinking for Problem Solving

Computers cannot solve problems on their own. We must provide clear, step-by-step directions on how to solve the issue, this solving technique is known as ____________.

• Problem Solving 
  
  
  

• Problem Addressing

• Problem Analysis

• None of the above

Why do we need an Algorithm?

• Accuracy
  
  
  

• b. Minimized mistakes

• c. Best possible solution

• d. All of the above 

Process is also called ________, it represents a process, action, or a single step.

• a. Terminator
  
  
  

• b. Action Symbol 

• c. Decision

• d. Input/ Output

The word “pseudocode” means ___________.

• Not real code 
  
  
  

   

• b. Real code

• c. Temporary code

• d. None of the above

Which of the following is not a backtracking algorithm?

• Knight tour problem

• N queen problem

• Tower of hanoi

• M coloring problem

Backtracking may lead to a solution that is:

• Optimal 

• Suboptimal 

• Efficient 

• Deterministic

Who coined the term "Backtracking"?

• Lehmer

• Donald

• Ross

• Ford

What is the time complexity of fun()? 

• C

int fun(int n)

{

    int count = 0;

    for (int i = 0; i < n; i++)

        for (int j = i; j > 0; j--)

            count = count + 1;

    return count;

}

Run on IDE

• Theta (n)

• Theta (n²)

• Theta (n*log(n))

• Theta (n*(log(n*log(n))))

   

In quick sort, for sorting n elements, the (n/4)th smallest element is selected as a pivot using an O(n) time algorithm. What is the worst-case time complexity of the quick sort?

• 0(n)

• 0(n*log(n))

• 0(n²)

• o(n^{2 log n})

Which of the following is not a stable sorting algorithm in its typical implementation.

• Insertion Sort

• Merge Sort

• Quick Sort

• Bubble Sort