Blog

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?

In the code above, what will be the result after executing line 25:  Dog *pd0 = &d0;

Starting with a queue of characters named line1 with the following values [C, +, +, f, u, n]  and an empty stack named stk. What would the final contents of stk be when these operations have completed?  Mark out any empty stack nodes -do not exist- with an ‘X’ (example: if queue only contains a, b, c  then [a b c X X X]) Note:  Front of the queue here –> [C, +, +, f, u, n] 

What is the difference between a struct and a class in C++?

In the code above. the Line 24:    d0.name = “Ronda”; What will be the value of name on d0 after this line executes? :

Part III – Short answers (19 points) Assume all necessary libraries have been included.

In the code above, Riddle is an example of:

Double-ended queue (abbreviated to deque) is a generalized version of the queue data structure that allows insert and delete at both ends. We can implement a Deque class using linked lists. In this question, we define nodes for a deque as: struct Node{ int value; Node* next; Node* prev; }; When a Node object is used for linked lists, we use the next pointer to point to its next node in the list, and use the prev pointer to point to its previous node in the list. If one node does not have a next or previous node (which means it is the last or the first node in this list), its corresponding pointer is set to NULL. We can define a Deque class as follows. class Deque{ public: Deque(); // Initialize an empty Deque. void insertFront(int num); // Add a node at the front of Deque. void insertRear(int num); // Add a node at the rear of Deque. int removeFront(); // Delete a node from front of Deque // and return its value. int removeRear(); // Delete a node from rear of Deque // and return its value. int size() const; // Return the number of nodes. /* More member function declarations are omitted */ private: Node* front; Node* rear; }; For each Deque object, we have two pointers, front and rear. The front pointer is used to point to the first node in the list, and the rear pointer is used to point to the last node. If a deque is empty, both pointer are set to NULL.