Algos

İş O(nlogn) polynomial complexity?

• Yes

• No

• Depends on n

• -

How many problems were structured as NP complete problems

• 19

• 20

• 21

• 24

İs P=NP?

• Yes

• Depends P

• Nobody knows

• No

Is Independent Set problem P?

• Depends on P

• No

• Yes

• Nobody knows

What is the literial?

• A set of variables

• Clause

• Variable

• A set of clauses

If we can check a solution in polynomial complexity, is it NP-complete?

• More information is needed

• No

• Yes

• Depends on what type of polynomials

We say that a problem is "hard". What does it mean?

• Exponential time complexity

• This problem

• A verification takes polynomial

• There is no solution

In Couting Sort, on the last step, when we insert into array B, where do we start in array A?

• From beginning of array A

• From the last position of array A

• Array B

• Doesn't

It is important for Radix Sort to use Stable Sorting Algorithm

• True

• False

It is important for Bucket Sort to use stable sorting algorithm

• True

• False