Ancestral Trees Program Plan: Include required header files. Declare and initialize string arrays “people []”, “mother []”, and “father []”. Declare and initialize positions for the integer arrays “mom []”, and “pop []”. Give function prototype “ancestors ()”. Given function definition for “ancestors ()”. Print the name of the person. Check if mom’s position is not equal to -1. Call the function ““ancestors ()”. Check if pop’s position is not equal to -1. Call the function ““ancestors ()”. Define the function “main ()”. Inside this function, Print the ancestors of the person containing index “0” from “people []” array by calling the function “ancestors ()” by passing “0” as the argument. Print the ancestors of the person containing index “6” from “people []” array by calling the function “ancestors ()” by passing “6” as the argument. Return the statement.

Question

Want to see the full answer?

Answer 1

Question

Chapter 14, Problem 12PC

Program Plan Intro

Ancestral Trees

Program Plan:

Include required header files.

Declare and initialize string arrays “people []”, “mother []”, and “father []”.

Declare and initialize positions for the integer arrays “mom []”, and “pop []”.

Give function prototype “ancestors ()”.

Given function definition for “ancestors ()”.

Print the name of the person.

Check if mom’s position is not equal to -1.

Call the function ““ancestors ()”.

Check if pop’s position is not equal to -1.

Call the function ““ancestors ()”.

Define the function “main ()”. Inside this function,

Print the ancestors of the person containing index “0” from “people []” array by calling the function “ancestors ()” by passing “0” as the argument.

Print the ancestors of the person containing index “6” from “people []” array by calling the function “ancestors ()” by passing “6” as the argument.

Return the statement.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

7. Dynamic MathStack The MathStack class shown in this chapter has only two member functions: add and sub. Write the following additional member functions: Function Description mult Pops the top two values off the stack, multiplies them, and pushes their product onto the stack. div Pops the top two values off the stack, divides the second value by the first, and pushes the quotient onto the stack. addAll Pops all values off the stack, adds them, and pushes their sum onto the stack. multA11 Pops all values off the stack, multiplies them, and pushes their prod- uct onto the stack. Demonstrate the class with a driver program. here is the extention file please use it. // Specification file for the IntStack class #ifndef INTSTACK_H #define INTSTACK_H class IntStack { private: int *stackArray; // Pointer to the stack array int stackSize; // The stack size int top; // Indicates the top of the stack public: // Constructor IntStack(int); // Copy constructor…

C++ Binary Search Tree program Create a class "Person" with three member variables string first name, string last name, int age. The primary key will be the last name. User will be prompted with a menu with two options: 1, "Enter person", where they will enter the persons first name, last name and age, or 2, "View person list" where the person may view the information previously added.

int main() //default function for call { int a[100],n,i,j; for (int i = 0; i < n; i++) //Loop for ascending ordering { for (int j = 0; j < n; j++) //Loop for comparing other values { if (a[j] > a[i]) //Comparing other array elements { int tmp = a[i]; //Using temporary variable for storing last value a[i] = a[j]; //replacing value a[j] = tmp; //storing last value } } } printf("\n\nAscending : "); //Printing message for (int i = 0; i < n; i++) //Loop for printing array data after sorting { printf(" %d ", a[i]); } } Need to transform this C code to MIPS Assembly Language Code simple steps