Questions
A supervisor's annual performance rating on a scale of 1 (lowest) to 10 (highest) for each...

A supervisor's annual performance rating on a scale of 1 (lowest) to 10 (highest) for each of 20 employees. This is an example of what scale of measurement?

In: Statistics and Probability

Which of the following stocks is most likely to be priced highest? Assume that all stocks...

Which of the following stocks is most likely to be priced highest? Assume that all stocks pay $3 dividend per share per year and are the same in all other aspects.

a)A stock whose annual dividend is expected to grow by 12% for the first two years and then 4% thereafter, with the discount rate of 12%.

b)A stock whose annual dividend is expected to not grow, with the discount rate of 12%.

c)A stock whose annual dividend is expected to grow by 4% per year forever, with the discount rate of 12%.

In: Finance

14. What are the highest tax rates for each of the following scenarios? ____. Operating income...

14. What are the highest tax rates for each of the following scenarios?

____. Operating income from a hotel earned by a foreign corporation (excluding branch profits tax)

____. Interest income earned by a foreign corporation from a US borrower

____. Net rental income earned by an U.S. individual (exclude the passthrough deduction)

____. Capital gain earned by an U.S. individual

____. Interest income earned by a U.S. corporation

____. Capital gain earned by an U.S. corporation

____. Depreciation recapture on the sale of U.S. real estate (Section 1250 property) for an individual

____. Depreciation recapture on the sale of U.S. real estate (Section 1245 property) for an individual

In: Accounting

A price floor is A. almost always equal to the price ceiling. B. the highest possible...

A price floor is
A.
almost always equal to the price ceiling.
B.
the highest possible legal price that can be charged for a good or service.
C.
the lowest legal price at which a good or service can be traded.
D.
a legal price of zero that can be charged for a good or service.
E.
usually equal to the equilibrium price established before the government imposed the price floor

In: Economics

What is the role of rating agencies of fixed income securities? What is the highest possible...

What is the role of rating agencies of fixed income securities? What is the highest possible rating? What is the difference between investment grade and speculative grade debt?

In: Accounting

Banks often claim that credit quality is their highest priority. Yet pressure for earnings in a...

Banks often claim that credit quality is their highest priority. Yet pressure for earnings in a highly competitive environment often result in Corporate priorities being relaxed. A clear example was the off-balance sheet transactions that were thriving just before the global financial crisis. Consider the Global Financial Crisis and the introduction of various risky asset backed securities and the creation of entities to handle off-balance sheet transactions that resulted in insolvency for many financial entities. Discuss how a Bank with a values-driven culture would have coped during this period. Would a Bank with an Unfocused culture have survived? In your discussion you must justify your arguments with clear explanations referring to both Securitisation and Corporate Culture.

In: Finance

Part A Which of the following ionic compounds is expected to have the highest lattice energy?...

Part A

Which of the following ionic compounds is expected to have the highest lattice energy?

KI

NaCl

NaF

MgO

BaS

Part B

Which of the following atoms could form a fluoride compound (i.e. MFn) in which M has an "expanded octet" (more than an octet on the centrat atom)?

C

P

Be

O

H

Part C

Which of the elements below, when found in a covalently bonded compound, could have an incomplete octet (have less than a full octet of electrons) and still have a valid Lewis Structure?

B

C

P

S

Br

In: Chemistry

Implement a priority queue using a DoublyLinkedList where the node with the highest priority (key) is...

Implement a priority queue using a DoublyLinkedList where the node with the highest priority (key) is the right-most node.
The remove (de-queue) operation returns the node with the highest priority (key).
If displayForward() displays List (first-->last) : 10 30 40 55
remove() would return the node with key 55.
Demonstrate by inserting keys at random, displayForward(), call remove then displayForward() again.

You will then attach a modified DoublyLinkedList.java (to contain the new priorityInsert(long key) and priorityRemove() methods).

Use the provided PQDoublyLinkedTest.java to test your code.

I cant get PQDoublyLinkedTest to work with my code. I already got the rest of code working. Please comment if you want me to add the rest of the code.

PLEASE DO NOT MODIFY PQDoublyLinkedTest!!! its just for testing the code.

public class PQDoublyLinkedTest
{
public static void main(String[] args)
{ // make a new list
DoublyLinkedList theList = new DoublyLinkedList();

theList.priorityInsert(22); // insert at front
theList.priorityInsert(44);
theList.priorityInsert(66);

theList.priorityInsert(11); // insert at rear
theList.priorityInsert(33);
theList.priorityInsert(55);
  
theList.priorityInsert(10);
theList.priorityInsert(70);
theList.priorityInsert(30);

theList.displayForward(); // display list forward
Link2 removed = theList.priorityRemove();
System.out.print("priorityRemove() returned node with key: ");
removed.displayLink2();
  
} // end main()
} // end class PQDoublyLinkedTest

public class DoublyLinkedList
{
private Link first; // ref to first item
private Link last; // ref to last item
public DoublyLinkedList() // constructor
{
first = null; // no items on list yet
last = null;
}

public boolean isEmpty() // true if no links
{
return first == null;
}

public void insertFirst(long dd) // insert at front of list
{
Link newLink = new Link(dd); // make new link
if (isEmpty()) // if empty list,
last = newLink; // newLink <-- last
else
first.previous = newLink; // newLink <-- old first
newLink.next = first; // newLink --> old first
first = newLink; // first --> newLink
}

public void insertLast(long dd) // insert at end of list
{
Link newLink = new Link(dd); // make new link
if (isEmpty()) // if empty list,
first = newLink; // first --> newLink
else {
last.next = newLink; // old last --> newLink
newLink.previous = last; // old last <-- newLink
}
last = newLink; // newLink <-- last
}

public Link deleteFirst() // delete first link
{ // (assumes non-empty list)
Link temp = first;
if (first.next == null) // if only one item
last = null; // null <-- last
else
first.next.previous = null; // null <-- old next
first = first.next; // first --> old next
return temp;
}

public Link deleteLast() // delete last link
{ // (assumes non-empty list)
Link temp = last;
if (first.next == null) // if only one item
first = null; // first --> null
else
last.previous.next = null; // old previous --> null
last = last.previous; // old previous <-- last
return temp;
}
// insert dd just after key

public boolean insertAfter(long key, long dd)
{ // (assumes non-empty list)
Link current = first; // start at beginning
while (current.dData != key) // until match is found,
{
current = current.next; // move to next link
if (current == null)

return false; // didn't find it
}
Link newLink = new Link(dd); // make new link

if (current == last) // if last link,
{
newLink.next = null; // newLink --> null
last = newLink; // newLink <-- last
} else // not last link,

{
newLink.next = current.next; // newLink --> old next
// newLink <-- old next
current.next.previous = newLink;
}
newLink.previous = current; // old current <-- newLink
current.next = newLink; // old current --> newLink
return true; // found it, did insertion

}

public Link deleteKey(long key) // delete item w/ given key
{ // (assumes non-empty list)
Link current = first; // start at beginning
while (current.dData != key) // until match is found,
{
current = current.next; // move to next link
if (current == null)
return null; // didn't find it
}

if (current == first) // found it; first item?
first = current.next; // first --> old next
else
// not first
// old previous --> old next
current.previous.next = current.next;

if (current == last) // last item?
last = current.previous; // old previous <-- last
else
// not last
// old previous <-- old next
current.next.previous = current.previous;
return current; // return value
}

public void displayForward()
{
System.out.print("List (first-->last): ");
Link current = first; // start at beginning
while (current != null) // until end of list,
{
current.displayLink(); // display data
current = current.next; // move to next link
}
System.out.println("");
}

public void displayBackward()
{
System.out.print("List (last-->first): ");
Link current = last; // start at end
while (current != null) // until start of list,
{
current.displayLink(); // display data
current = current.previous; // move to previous link
}
System.out.println("");
}

public void insertSorted(long key)
{
// if list is empty or key is less than current first, inserting at
// first
if (isEmpty() || key < first.dData) {
insertFirst(key);
return; // exiting method
}
// taking a reference to first
Link current = first;
// looping as long as current.next is not null
while (current.next != null) {
// checking if key can be added between current and current.next
if (key >= current.dData && key <= current.next.dData) {
// adding between current and current.next and updating all
// links
Link lnk = new Link(key);
lnk.next = current.next;
current.next.previous = lnk;
current.next = lnk;
lnk.previous = current;
return; //exiting
}
//otherwise, advancing to next link
current = current.next;
}
//if the element is still not inserted, adding to the end
insertLast(key);
}
} // end class DoublyLinkedList

class Link
{
public long dData; // data item
public Link next; // next link in list
public Link previous; // previous link in list
public Link(long d) // constructor
{
dData = d;
}

public void displayLink() // display this link
{
System.out.print(dData + " ");
}
} // end class Link

In: Computer Science

2. The Cahora Bassa dam, located in Mozambique, is the highest dam in Africa. The hydroelectric...

2. The Cahora Bassa dam, located in Mozambique, is the highest dam in Africa. The hydroelectric facility within the dam generates an average 1,925 MWe. Nearly all of this electricity is exported to South Africa. The power station is linked to Pretoria, 1,420 km away, by a 533.0 kV high-voltage DC (HVDC) transmission line. a. The transmission line consists of eight cables made of aluminum with a steel core for strength and structural support. The total cross-sectional diameter of each cable is 28 mm, while the cross-sectional diameter of the steel core is 14 mm (consider the cross-sectional area as a steel circle in the middle of an an aluminum circle). Treat each cable as if it consisted of one steel and one aluminum resistor arranged in parallel, while the cables themselves are arranged in parallel with each other. What is the total resistance of the transmission line? Material resistivities:

ρ_steel=7.2〖*10〗^(-7) Ω•m

ρ_alum=2.7*10^(-8) Ω•m.

(15 points)

b. On average, how much current flows through the transmission lines? What is the power loss in the line? What is the percentage of power loss relative to the average power generated? (10 points)

c. If the power were transmitted at 333.0 kV over the same cables, what would the power loss percentage be? (10 points)

d. If the dam’s power is sold wholesale to South Africa for US$90.00/MWh, how much revenue would be lost per year, transmitting at 333.0 kV instead of 533.0 kV? (note: the 1,920 MW average production already accounts for the dam’s capacity factor) (5 points)

e. Say you are interested in doing a life cycle assessment to estimate the amount of energy used to build the Cahora Bassa power system, from dam to end user (not the amount energy produced by the system itself). Consider the major parts of the Cahora Bassa power system, from the dam, to the power lines, to the electrical equipment, and everything that was required to manufacture and build them. List ten energy-consuming materials or processes that would be used as inputs in a life-cycle assessment of the construction of this system. (10 points)

In: Physics

If you knew you would be born into and stay among the highest 10% of earners...

If you knew you would be born into and stay among the highest 10% of earners in a country, which one would you chose and why? Things to keep in mind is income inequality.

In: Economics