KYT/CAT - Algorithms

Q.1 What common thing represents an algorithm?:

• [x] A cooking recipe

• ok

Q.2 Which action is based on NP-problems?:

• Encryption of data

• ok

Q.3 What are 2 advantages of a greedy algorithm?:

• [x] It has a reasonable complexity

• It is easy to implement

Q.4 Which statement is correct?:

• dynamic programming is less efficient than divide and conquer

• dynamic programming is recursive

• dynamic programming uses the answers of previous sub problems

Q.5 What is the major inconvenient of a greedy algorithm?:

• [x] it doesn’t always provide the globally optimum solution

• ok

Q.6 How could we consider heuristics?

• [x] as shortcuts

• ok

Q.7 Which problem is not a NP-one?:

• Rubik’s cube

• ok

Q.8 When inputs are almost sorted, which statement is correct about sorting algorithms?:

• [x] Some algorithms are slower than usual

• Some algorithms are more efficient than usual

Q.9 What is the complexity of an algorithm containing one loop in one loop?:

• [x] O(N2)

• ok

Q.10 Which sorting algorithm uses a “divide and conquer” technique?:

• [x] merge sort

• ok