Blog

What is the order of the following data after 3 iterations (i.e. passes) of an ascending (i.e. least-to-greatest) selection sort algorithm?  [12, 24, 36, 54, 30, 73, 46, 56] 

What is the order of the following data after 3 iterations (i.e. passes) of a descending (i.e. greatest-to-least) insertion sort algorithm? [36, 92, 35, 93, 83, 87, 58, 84]

Student studentObj = new CSStudent(); Given the class hierarchy and code statement above, which of the following methods are allowed and are not allowed to be called on the studentObj variable? code() : [1] eat() : [2] For each statement below, indicate which class provides the implementation of each of the methods called. studentObj.study(); [3] studentObj.toString(); [4]

What is the order of the following data after 3 iterations (i.e. passes) of an ascending (i.e. least-to-greatest) selection sort algorithm?  [1, 80, 42, 81, 94, 58, 65, 88] 

What is the order of the following data after 3 iterations (i.e. passes) of an ascending (i.e. least-to-greatest) insertion sort algorithm? [91, 62, 20, 87, 33, 3, 90, 68]

For an interface named Barkable, we can create a new instance with the following statement: Barkable doggo = new Barkable();

(((_.-=-._.-=-._.-))) ))~~~~~~~~~~~~~~~(( (( > Asymptotics < )) ))...............(( (((`-._.-'`-._.-'`)))

For an interface named Vehicle, we can create a new instance with the following statement:   Vehicle camry = new Vehicle(); 

Identify the Big-O (i.e. worst-case complexity) of each of the following blocks of code (assume the “stuff” being done is some constant time). n is the input size:  [block1] for(int i=0; i0; i–) {   // do some stuff…} [block3] for(int i=0; i=0; j–) {    // do some other stuff…    }} [block4] for(int i=0; i0; i=i/2) {   // do some stuff…}

Identify the Big-O (i.e. worst-case complexity) of each of the following blocks of code (assume the “stuff” being done is some constant time). n is the input size:  [block1] for(int i=0; i