// Using the startup code, implement the following: // 1-Create List L1 of 10 elements (task IDs), e.g. L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10; // // 2-Insert a new list element in between (at every other element), such as: 1,100, 2,200, 3,300, 4,400, ... 10,1000; // Simulate a new CPU core assignment: // // 3-Create another List L2, and extract the newly inserted elements into this new list L2 // i.e. L1 should go back to the original list // L2 should be: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000 // 4-Create a Queue Q1 by extracting L1, and inserting L2 elements: i.e. Q should start with: 1,2,3, ... 10, and (10, 20 ... 100) will be inserted // Q1=1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000 // Label tasks as finished with the possibility of revisiting a task, such as: // 5-Create a Stack S1 which by deleting the elements of Q1 and inserting them in L1 // 6-Pop out all elements of the Stack, i.e. should end up with an empty stack // Extra credit: Simulate a re-executed task, i.e. Pop out a task out of the Stack and reinsert, this simulate a failed task

Lab3.cpp:

template

class Stack { public: bool isEmpty() const { return theList.empty(); } const Object& top() const { return theList.front(); } void push(const Object& x) { theList.push_front(x); } void pop(Object& x) { x = theList.front(); theList.pop_front(); } private: List