Give an example of a 2x2 matrix of numbers that represent the changes in the size of a predator-prey relationship. Then, conduct an eignvalue/eigenvector analysis of the matrix. Determine the long-term scaling factor for your populations and the long-term distribution of the predators to prey.

Then, compute trajectories for several different starting values of predators and prey. Use eigenvectors to simplify the computation of these trajectories.

In this assignment we are not allowed to make changes to Graph.h it cannot be changed! I need help with the Graph.cpp and the Driver.cpp.

Your assignment is to implement a sparse adjacency matrix data structure Graph that is defined in the header file Graph.h. The Graph class provides two iterators. One iterator produces the neighbors for a given vertex. The second iterator produces each edge of the graph once.

Additionally, you must implement a test program that fully exercises your implementation of the Graph member functions. Place this program in the main() function in a file named Driver.cpp.

The purpose of an iterator is to provide programmers a uniform way to iterate through all items of a data structure using a forloop. For example, using the Graph class, we can iterate thru the neighbors of vertex 4 using:

Graph::NbIterator nit ; for (nit = G.nbBegin(4); nit != G.nbEnd(4) ; nit++) { cout << *nit << " " ; } cout << endl ;

The idea is that nit (for neighbor iterator) starts at the beginning of the data for vertex 4 in nz and is advanced to the next neighbor by the ++ operator. The for loop continues as long as we have not reached the end of the data for vertex 4. We check this by comparing against a special iterator for the end, nbEnd(4). This requires the NbIterator class to implement the ++, !=and * (dereference) operators.

Similarly, the Graph class allows us to iterate through all edges of a graph using a for loop like:

Graph::EgIterator eit ; tuple<int,int,int> edge ; for (eit = G.egBegin() ; eit != G.egEnd() ; eit++) { edge = *eit ; // get current edge cout << "(" << get<0>(edge) << ", " << get<1>(edge) << ", " << get<2>(edge) << ") " ; } cout << endl ;

Note that each edge should be printed only once, even though it is represented twice in the sparse adjacency matrix data structure.

Since a program may use many data structures and each data structure might provide one or more iterators, it is common to make the iterator class for a data structure an inner class. Thus, in the code fragments above, nit and eit are declared asGraph::NbIterator and Graph::EgIterator objects, not just NbIterator and EgIterator objects.

Here are the specifics of the assignment, including a description for what each member function must accomplish.

Requirement: your implementation must dynamically resize the m_nz and m_ci arrays. See the descriptions of Graph(constructor) and addEdge, below.

Requirement: other than the templated tuple class, you must not use any classes from the Standard Template Library or other sources, including vector and list. All of the data structure must be implemented by your own code.

Requirement: your code must compile with the original Graph.h header file. You are not allowed to make any changes to this file. Yes, this prevents you from having useful helper functions. This is a deliberate limitation of this project. You may have to duplicate some code.

Requirement: a program fragment with a for loop that uses your NbIterator must have worst case running time that is proportional to the number of neighbors of the given vertex.

Requirement: a program fragment with a for loop that uses your EgIterator must have worst case running time that is proportional to the number of vertices in the graph plus the number of edges in the graph.

Graph.h:

#ifndef _GRAPH_H_
#define _GRAPH_H_

#include <stdexcept>  // for throwing out_of_range exceptions
#include <tuple>      // for tuple template

class Graph {

public:

  // Graph constructor; must give number of vertices
  Graph(int n);

  // Graph copy constructor
  Graph(const Graph& G);

  // Graph destructor
  ~Graph();

  // Graph assignment operator
  const Graph& operator= (const Graph& rhs);

  // return number of vertices
  int numVert();

  // return number of edges
  int numEdge();

  // add edge between u and v with weight x
  void addEdge(int u, int v, int x);

  // print out data structure for debugging
  void dump();

  // Edge Iterator inner class
  class EgIterator {

  public: 
    // Edge Iterator constructor; indx can be used to
    // set m_indx for begin and end iterators.
    EgIterator(Graph *Gptr = nullptr, int indx = 0);

    // Compare iterators; only makes sense to compare with
    // end iterator
    bool operator!= (const EgIterator& rhs);
         
    // Move iterator to next printable edge
    void operator++(int dummy);   // post increment

    // return edge at iterator location
    std::tuple<int,int,int> operator*();

  private:
    Graph *m_Gptr;    // pointer to associated Graph
    int m_indx;       // index of current edge in m_nz
    int m_row;        // corresponding row of m_nz[m_indx]
  };

  // Make an initial edge Iterator
  EgIterator egBegin();

  // Make an end iterator for edge iterator
  EgIterator egEnd();

  // Neighbor Iterator inner class
  class NbIterator {
    
  public: 
    // Constructor for iterator for vertices adjacent to vertex v;
    // indx can be used to set m_indx for begin and end iterators
    NbIterator(Graph *Gptr = nullptr, int v = 0, int indx = 0);

    // Compare iterators; only makes sense to compare with
    // end iterator
    bool operator!=(const NbIterator& rhs);

    // Move iterator to next neighbor
    void operator++(int dummy);

    // Return neighbor at current iterator position
    int operator*();

  private:
    Graph *m_Gptr;  // pointer to the associated Graph
    int m_row;      // row (source) for which to find neighbors
    int m_indx;     // current index into m_nz of Graph
  };

  // Make an initial neighbor iterator
  NbIterator nbBegin(int v);

  // Make an end neighbor iterator
  NbIterator nbEnd(int v);

private:

  int *m_nz;  // non-zero elements array
  int *m_re;  // row extent array
  int *m_ci;  // column index array
  int m_cap;  // capacity of m_nz and m_ci

  int m_numVert;  // number of vertices
  int m_numEdge;  // number of edges

};
#endif

Discuss the phases of Paget’s disease and the expected pathological changes in bone

You are in charge of leading a meeting for the newest changes for the HEB you work at. The changes needing to be discussed are:

- The new soap dispensers for hands free washing,
- Changing the benefits and pay structures,
- The purchasing of 500 new carts, and
- Employee birthdays that month.

With your knowledge of conducting effective meetings a) generate an appropriate agenda for this meeting, explain why you chose this layout for topics, and describe how you would use your “Closing and Follow up” notes

Explain how the supply curve changes as the elasticity of supply increases.

Please only answer if you are 100% sure and I need the answers now.

QUESTION 6

1. Suppose that a Japanese firm imports iron for its operations from the US and sells its finished products to Spain. If the yen depreciates against the US dollar and appreciates against the euro, which of the following will occur, all else being equal?

   		The Japanese firm's value will increase because they will pay less yen for their imports.
   		The Japanese firm's value will increase because they will receive more yen from their exports.
   		The Japanese firm's value will be unaffected by the exchange rate fluctuations.
   		None of the above.

5 points   

QUESTION 7

1. If a country's currency appreciates relative to its trading partners, its balance of trade should rise in the long run, all else being equal.

   True

   False

5 points   

QUESTION 8

1. Use the following information to answer the next three questions.

   Transactions between Australia and the rest of the world in 2017 are shown below.

   1. The Australian government sells 18 million Australian dollars worth of treasury securities to UK citizens.
   2. Australian companies sell 30 million Australian dollars worth of iron in the UK.
   3. Australian companies pay 5 million Australian dollars in dividends to investors abroad.
   4. Australian citizens spend 35 million Australian dollars while touring the US.
   5. Australian government sends 12 million Australian dollars in aid to Africa.
   6. US citizens spend 8 million Australian dollars in tuition at Australian universities.
   7. Australian central bank buys 4 million Australian dollars worth of gold.

   Find the current account balance in terms of millions of Australian dollars.  

   		-9
   		-2
   		-14
   		none of the above

5 points   

QUESTION 9

1. Find the capital account balance in terms of millions of Australian dollars. Do not use currency symbols when entering your response.

5 points   

QUESTION 10

1. Based on the information provided, which of the following statements is true?

   		Australia was a net importer of capital in 2017.
   		Australia's balance of trade will have no affect on the value of the Australian dollar, all else being equal.
   		Australia exported more goods and services than it imported in 2017.
   		None of the above.

Required information

Problem 7-1A Special journals, subsidiary ledgers, trial balance-perpetual LO C3, P1, P2

[The following information applies to the questions displayed below.]

Church Company completes these transactions and events during March of the current year (terms for all its credit sales are 2/10, n/30).

Assume the following ledger account amounts Inventory (March 1 beg. bal. is $63,000), Z. Church, Capital (March 1 beg. bal. is $63,000) and Church Company uses the perpetual inventory system.

Problem 7-1A Part 2

Required:

2-a. Enter the transactions in a sales journal.
2-b. Enter the transactions in a purchases journal.
2-c. Enter the transactions in a cash receipts journal.
2-d. Enter the transactions in a cash disbursements journal.
2-e. Enter the transactions in a general journal.

Post information from the journals in Part 2 to the general ledger and the accounts receivable and accounts payable subsidiary ledgers.

Prepare the March 31 trial balance, schedule of accounts receivable and schedule of accounts payable.

An income statement

reports the assets, liabilities, and stockholders' equity at a specific date.

presents the revenues and expenses for a specific period of time.

reports the changes in assets, liabilities, and stockholders' equity over a period of time.

summarizes the changes in retained earnings for a specific period of time.