cpp/linkedlists/monkey_isempty Source

Viewing cpp/linkedlists/monkey_isempty by daveagp@gmail.com. You have unsaved changes. Log in above to create, edit, preview and publish Websheets.

Property Value

Description
html markup
shown to student

Create a member function <tt>bool isEmpty()</tt>
that tells the user whether the list is empty.

Epilogue
html markup
shown when solved

remove
Public permissions remove
Remarks
Comments, history, license, etc.

remove
Engine
Choices
json list of string, bool pairs
e.g. [["good", true], ["bad", false]]

Correct answer
Template / Reference solution

Template / Reference solution

\hide[
#include <iostream>
#include <string>
using namespace std;

// structure of items in list
struct Node {
Node* next; // each node knows "next" node
string name; // and stores a value
Node(string initialName); // constructor for nodes
};

Node::Node(string initialName) {name = initialName; next = NULL;}

class MonkeyChain {
public:
MonkeyChain();
void threeKongs();
void printAll();
void addStart(string newName);
bool isEmpty();
private:
Node* first;
};

MonkeyChain::MonkeyChain() {first = NULL;}

// a demo to create a length-3 list
void MonkeyChain::threeKongs() {
first = new Node("DK Sr.");
first->next = new Node("DK");
first->next->next = new Node("DK Jr.");
}

// we'll provide a working copy of printAll for you
void MonkeyChain::printAll() {
// one possible approach: use a while loop
Node* current = first; // start at beginning

// if current isn't past the last node,
while (current != NULL) {
// print current node's name; then repeat loop w/next one
cout << current->name << endl;
current = current->next;
}
}

// add a new node, containing this name, at the start of the list
void MonkeyChain::addStart(string newName) {
Node* newFirst = new Node(newName);
Node* oldFirst = first;
first = newFirst;
first->next = oldFirst;
// there's also a slightly trickier 2-line solution
}

]\
// add a new node, containing this name, at the start of the list
bool MonkeyChain::isEmpty() {
\[
return first == NULL;
]\
}

int main() {
cout << boolalpha;
MonkeyChain mc;
cout << mc.isEmpty() << endl;
mc.addStart("King Kong");
cout << mc.isEmpty() << endl;
mc.addStart("Bubbles");
cout << mc.isEmpty() << endl;
}

Java test suite
See manual

C++ test suite
json list of stdin/args tests
e.g. [{"stdin":"hi", "args":["4", "5"]}, {"stdin":"noargs"}]
to just run once with no input use [{}]

[
{}
]

C++ test suite
See manual

Forbidden substrings
json list of strings
e.g. ["for","while"]

remove
Solution visibility remove
Java imports
json list of importables
e.g. ["java.util.*"]

remove
Override Java classname
else defaults to
websheet name
remove
Dependent on other websheets?
json list of websheet names in this folder
e.g. ["DataStructure"]

remove
Is example?
i.e., just a demo
remove
Add compiler flag(s)
json list of flags
e.g. ["-Wno-unused-variable"]

remove
Remove default compiler flag(s)
json list of flags
see default_cppflags
e.g. ["-Wno-write-strings"]

remove

Property	Value
Description html markup shown to student	Create a member function <tt>bool isEmpty()</tt> that tells the user whether the list is empty.
Epilogue html markup shown when solved	remove
Public permissions	remove
Remarks Comments, history, license, etc.	remove
Engine
Choices json list of string, bool pairs e.g. `[["good", true], ["bad", false]]`
Correct answer
Template / Reference solution
Template / Reference solution	\hide[ #include <iostream> #include <string> using namespace std; // structure of items in list struct Node { Node* next; // each node knows "next" node string name; // and stores a value Node(string initialName); // constructor for nodes }; Node::Node(string initialName) {name = initialName; next = NULL;} class MonkeyChain { public: MonkeyChain(); void threeKongs(); void printAll(); void addStart(string newName); bool isEmpty(); private: Node* first; }; MonkeyChain::MonkeyChain() {first = NULL;} // a demo to create a length-3 list void MonkeyChain::threeKongs() { first = new Node("DK Sr."); first->next = new Node("DK"); first->next->next = new Node("DK Jr."); } // we'll provide a working copy of printAll for you void MonkeyChain::printAll() { // one possible approach: use a while loop Node* current = first; // start at beginning // if current isn't past the last node, while (current != NULL) { // print current node's name; then repeat loop w/next one cout << current->name << endl; current = current->next; } } // add a new node, containing this name, at the start of the list void MonkeyChain::addStart(string newName) { Node* newFirst = new Node(newName); Node* oldFirst = first; first = newFirst; first->next = oldFirst; // there's also a slightly trickier 2-line solution } ]\ // add a new node, containing this name, at the start of the list bool MonkeyChain::isEmpty() { \[ return first == NULL; ]\ } int main() { cout << boolalpha; MonkeyChain mc; cout << mc.isEmpty() << endl; mc.addStart("King Kong"); cout << mc.isEmpty() << endl; mc.addStart("Bubbles"); cout << mc.isEmpty() << endl; }
Java test suite See manual
C++ test suite json list of stdin/args tests e.g. `[{"stdin":"hi", "args":["4", "5"]}, {"stdin":"noargs"}]` to just run once with no input use `[{}]`	[ {} ]
C++ test suite See manual
Forbidden substrings json list of strings e.g. `["for","while"]`	remove
Solution visibility	remove
Java imports json list of importables e.g. `["java.util.*"]`	remove
Override Java classname else defaults to websheet name	remove
Dependent on other websheets? json list of websheet names in this folder e.g. `["DataStructure"]`	remove
Is example? i.e., just a demo	remove
Add compiler flag(s) json list of flags e.g. `["-Wno-unused-variable"]`	remove
Remove default compiler flag(s) json list of flags see default_cppflags e.g. `["-Wno-write-strings"]`	remove

Optional properties:

Note: problems are open-source by default (see 'Public permissions'). Assumed license for open problems is Creative Commons 4.0 Attribution-ShareAlike unless specified in 'Remarks'.