13s review

Which of these is not a bitwise operator

• ^

• &

• |

• !

Which of these is not a bitwise operator

• <<

• >

• ~

• >>

Which of the following sets bit n of x to 1

• x ^= (1 << n)

• x = (~x << n)

• x |= (1 << n)

• x &= ~(1 << n)

Which of the following flips bit n of x

• x ^= (1 << n)

• x = ((x >> n) << n)

• x ^= ~(1 << n)

• x &= (-1 << n)

Which question best gets bit n of x

• x >> n

• (x >> n) | 1

• (x >> n) & 1

• x & (1 << n)

What is the time complexity of this code if n is the value of the variable "n"

• O( log n )

• O ( 2^n)

• O (n)

• O(n log n)

What is the time complexity of this code?

• O ( log n)

• O (2n)

• O (n)

• O (n^2)

What sort is this?

• Quick sort

• Bubble sort

• Merge Sort

• Insertion Sort

What is the time complexity of this sort

• O(n^2)

• O(2^n)

• O(n)

• O(n log n)

C is call by

• Pointer

• Reference

• Value

•