Use CA10RAM to get 10%* Discount.
Order Now
Please write in “correct” in the box next to the lines that are correct. If the line is wrong, please correct the entire line. Write the correct line in the provided box next to the line.
INSTRUCTIONS TO CANDIDATESANSWER ALL QUESTIONS
need to have the C++ program that bends rules of Hangman using ElviHangman.cpp & FamilySet.cpp together with FamilySet.h (please see attached files that includes readme file for instruction & Clion setups).
Please note that this program requires CLion to run (just like the last request). Please look at/follows instructions in the readme file and please make sure the code passes the main tests (Elvilhangman.cpp & FamilySet.cpp, FamilySet.cpp) and
all individual unit tests (FamilySet_Tests) inside Clion. Please see attachment below for more info. Please also, answer questions.
1) Correct the following code:
Please write in “correct” in the box next to the lines that are correct. If the line is wrong, please correct the entire line. Write the correct line in the provided box next to the line.
Template <class T>
Void ChunkQueue <T>::Enqueue(int value)_ _ _ _ _
{
If (head==tail)_ _ _ _
{
head=new Node;
tail=head;_ _ _ _ _--->tail=nullptr
next=nullptr;_ _ _ _ _
prev=nullptr;_ _ _ _ _
len=0; _ _ _ _ _
{
tail--->values[0]=value;_ _ _ _ _
len++;//_ _ _ _
If (tail-->len=<ARRAY_SIZE)//_ _ _ _ _
{
node*newTail=new Node;
newTail-->next=tail;_ _ _ _ _ _
newTail-->prev=nullptr;_ _ _ _
newTail-->len=0;
tail-->next=newTail;_ _ _ _
tail=nullptr;_ _ _ _
}
}
2) Fill in the blanks
The following program outputs four lines of output.
Write what the output would be for each line:
Line1:”_ _ _ _ _ _”
Line2:”_ _ _ _ _ _ _ _ _ _ _ _ _ _ _”
Line3:”_ _ _ _ _ _ _ _ _ _ _ _ _ _ _”
For the purpose of this problem assume that the variables i main are stored at the following memory addresses:
The variable a in the main is stored at address 100
The variable b in the main is stored at address 200
The variable c in the main is stored at address 300
The variable d in the main is stored at address 400
The variable e in the main is stored at address 500
Memory allocated on the heap using new will be stored at address 800
Void mystery (int *a, int & b) {
B- -;
*a=6;
caut<<*a<<””<<b<<endl;
a=&b;
}
Int main () {
Int a=2;
Int b=60;
Int c=200;
Int *d=new int;
*d=b;
d=&b;
Int *e=&c;
Mystery (d,c);
Caut <<a<<””<<b<<””<<c<<””<<d<<””<<e<<endl;
caut<<8a<<””<<8b<<””<<8c<<””<<*d<<””<<8e<<endl;
Return 0;
}
3) Code
Complete code
Template <class T>
Void Trec<T>:: Add (T elem) {
Node* curr=_ _ _;
//create newNode
Node*newNode=_ _ _;
_ _ _=elem;
_ _ _=1;
NewNode-->_ _ _=nullptr;
newnode-->right=_ _ _;
if(_ _ _( )) {
root=_ _ _;
_ _ _++;
return;
}
while (_ _ _):=nullptr) {
If (elem=curr-->value) {
delete NewNode;
_ _ _ ++;
break;
}
else if (elem<curr-->value) {
If (_ _ _) {
curr-->left=_ _ _
break;
} else {
curr=_ _ _;
}
}
else {
If (curr-->right==_ _ _)
_ _ _=newNode;
_ _ _;//found the left
} else (
_ _ _=curr-->right;
}
}
}
_ _ _++;
}
Template <class T>
Void tree <T>::place In Order (Node * node) {
If (node==_ _ _) {
return;
}
Place in order (_ _ _);
for (int i=0; i<_ _ _; i ++) {
iterQue.push(_ _ _);
}
Place In Order (_ _ _ _);
Attachments:
Related Questions
. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C
DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma
. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an
Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t
. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual
Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th
. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:
1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:
1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
