java code

Question 4:

Iterating with loops

You can process the list using a For loop. The variable in the For loop becomes the index value for each of the items in the loop. Everything you do to an element inside the loop gets done for the entire list. Examine the following loops. Then use what you know to write the following loops.

int[] numbers = new int[100];

for(int i = 0; i < numbers.length; i++){

numbers[i] = i;

}

int sum = 0;

for(int i = 0; i < numbers.length; i++){

sum += numbers[i];

}

1. Write a loop to display all the numbers in the list.

2. Write a loop to display the number in the list in reverse order.

3. Write a loop with an if statement to print only the even numbers in the list.

4. Write a loop to subtract the value 50 to every element in the list.

5. Write a loop to count the number of negative values in the list.

RACKET

a) Write a recursive function (gen-list start end). This function will generate a list of consecutive integers, from start to end. If start > end then an empty list is generated. For example: (gen-list 1 5) ---> (1 2 3 4 5)

b) write a recursive function pair-sum? that takes an integer sequence as generated by the gen-list function in exercise 4 above. This function tests whether any two adjacent values in the given list sum to the given val. For example,

   (pair-sum? '(1 2 3) 3) ---> #t since 1+2=3. Similarly,

   (pair-sum? (gen-list 1 100) 1000) ---> #f since no two adjacent integers in the range 1 to 100 can sum to 1000.

You must use recursion, and not iteration. Please include explanation thanks.

[ RACKET]

a) Write a recursive function (gen-list start end). This function will generate a list of consecutive integers, from start to end. If start > end then an empty list is generated.

For example: (gen-list 1 5) ---> (1 2 3 4 5)

b) write a recursive function pair-sum? that takes an integer sequence as generated by the gen-list function in exercise 4 above. This function tests whether any two adjacent values in the given list sum to the given val.

For example,

   (pair-sum? '(1 2 3) 3) ---> #t since 1+2=3. Similarly,

   (pair-sum? (gen-list 1 100) 1000) ---> #f since no two adjacent integers in the range 1 to 100 can sum to 1000.

You must use recursion, and not iteration. Please include explanation thanks.

Laboratory Tasks

public class LinkedList {

             Node head;

              class Node {  

                    int data;

                    Node next;

                    Node(int d) {

                            data = d;

                            next = null;

                    }

                }

}

Complete the above java program by adding the following methods:

Part1:

1. isEmpty() checks if the linked list is empty or not. (return type is boolean)
2. printList() prints all data in the linked list. (void method)
3. insertFirst(int newData) add newData at the head of the linked list. (void method)
4. insertLasL(int newData) add newData at the tail of the linked list. (void method)
5. findMiddle() finds the middle element in the list and displays its value. (void method)
6. deleteFirst() deletes the first element of the list. (void method)
7. sizeList() returns the number of elements in the list. (return type is int)
8. Main method that calls all the previous seven methods.

A firm producing computers considers a new investment which is about opening a new plant.

The project’s lifetime is estimated as 5 years and requires 22 million $ as investment cost. Salvage value of the project is estimated as 4 million $ (which will be received in the sixth year) However the firm prefers to show salvage value only as 2 million $. The firm uses 5-year straight-line depreciation.

It is estimated that the sales will be 12 million $ next year and then sales will grow by 20% each year.

It is estimated that fixed costs will be 1.5 million next year and then will grow by 5% each year.

Variable costs are projected %10 of sales each year.

This project, in addition, requires a working capital of $ 3 million in the first year, 4 million in the second year, 4 million in the third year, 3 million in the fourth year and 1.5 million in the fifth year.

Firm plans to use a debt/equity ratio of %50 in this project.

The company can borrow $ loan with an interest cost of 14% before tax. Corporate tax rate is 20%. The shares of this company in NYSE are selling at 8 $ and the stocks have approximately market risk and have a strong correlation with NYSE index. 10- year government bond yields at %12 and market risk premium is %8.

Given this information; find the NPV and IRR of the project; is this project feasible or not?

What is the result of higher WACC ? Can a company reduce its WACC ? If yes, how? Give numerical example related with this project and explain this topic briefly regarding to the capital structure theories.

Please solve this CLEARLY

Andrew Jim Moore. UC Berkeley.

Only need answers for e,f,g,h,i

Jacob has the utility function for goods x and y asu(x, y) = ?2/3?2/3.

The price of good x is $2 each, and the price of good y is $5 each. Jacob has a total income of $120 to spend on these two goods.

(a) Write down Jacob's budget line, and show in the graph.
(b) Write down the budget exhaustion condition (BC) of Jacob’s optimization problem.(c) Write down the rationality condition (RC) of Mr. Jacob’s optimization problem.

(d) Given the two conditions from (b) and (c), calculate the optimal bundle (x*, y*) that he will choose in order to maximize his utility, and (approximately) indicate this optimal bundle in the graph.

Now, the price of good x increases to $4 each, and everything else remains the same.

(e) Given the change in the price of good x, calculate the new optimal bundle (x**, y**).

(f) How much additional income does Jacob need in order to consume at the original optimal bundle as in (d)?

(g) Suppose Jacob is a cardholder of a credit card, where the credit card company decides to compensate its members, so all of its members are able to maintain their utility level as the same as before the price changed. Write down the utilization condition (UC) of Jacob’soptimization problem after price changed.

(h) Given the condition in (g), calculate Jacob’s new optimal bundle (xc, yc) under the compensation.

(i) What is the amount that the credit card company needs to compensate Jacob? Compare the result with (f).

You would like to implement a list where you put in operations at any position to the list occur frequently. Would you use an array-based list? Explain why or why not?

Question: Write an implementation of the ADT sorted list that uses a resizable array (vector class of C++ STL) to represent the list items. Anytime the list becomes full, double the size of the array.

In python Consider the tuple t = (2,3,4,5). Write a function tuList( t ) that takes in a tuple, makes a list out of it, and also creates a new list of all possible sums of elements of the list