Blog

For the polynomial, list each real zero(roots). Determine whether the graph crosses or touches the x-axis at each x -interceptf(x) = x4 – 9×2 List zeros as ORDERED PAIRS: [zeros] List zeros as ORDERED PAIRS where the graph touches and turns (bounces): [bounce] List zeros as ORDERED PAIRS where the graph crosses (cuts through): [cuts]  

https://www.desmos.com/scientific  If this link doesn’t work, chat with Honorlock.  They can help.

In the code above. what would be the result of Line 23?:    Dog d1.Dog(d0);

A collection that organizes elements in a sequence and processes them in First In/First Out order is best known as:

Using the function template below, type a working recursive function.  Make sure your function conforms to the instructions given in the comments for the function. [Note: You must include the function header in you answer, you don’t need to copy the comment section in your response]  

In the code above. what would be the result of Line 22?:    Dog d0(“Captain”, “Corgi”);

For the code above, how could an object mys of the class Mistery be declared in the program show below:   int main(){ … // how to declare mys ?? mys.enigma(1); … ..}

As we discussed in class, you want to separate the classes (ADTs) and program into separate files and then compile and link them to generate an executable file and create your own libraries. Specify where each one of the components shown below should be placed/stored or how to compile to generate it, e.g.  in the interface file, or in the implementation file or in the application file or how to compile and generate the executable file.  Do that by matching the components on the left side with the sentence from the dropdown on the right side, choosing the option that best describes the file type or how to generate that file:   

The queue shown below stores integer values. front() is another queue member function that reads the value at the head (front) of the queue and returns it. What value does the head of the queue have at the end of this segment of code?.   queue vals;int tmp;vals.push(9);while (vals.front() < 14) {   tmp = vals.front();   vals.push(tmp + 3);   vals.pop();   vals.push(tmp); } int result = vals.front(); vals.pop();  

Which of the following is true about the linked list implementation of stacks?