A developer wants to know if the houses in two different neighborhoods were built at roughly the same time. She takes a random sample of six houses from each neighborhood and finds their ages from local records. The accompanying table shows the data for each sample​ (in years). Assume that the data come from a distribution that is Normally distributed.

Neighborhood 1: 50, 68, 65, 52, 53, 54

Neighborhood 2: 33, 32, 44, 38, 54, 51

​a) Find a 95​% confidence interval for the mean​ difference μ1- μ2​, in ages of houses in the two neighborhoods. (Round to two decimal places as needed)

​b) Is 0 within the confidence​ interval?

(Yes or No)

​c) What does the confidence interval suggest about the null hypothesis that the mean difference is​ 0?

A.Reject H0 since 0 is a plausible value for the true mean difference.

B. Fail to reject H0 since 0 is a plausible value for the true mean difference.

C.Reject H0 since 0 is not a plausible value for the true mean difference.

D.Fail to reject H0 since 0 is not a plausible value for the true mean difference.

A binary search tree can be built with a traditional insertion method given a list of integers. Binary search trees (BSTs) are binary trees where the data is ordered such that nodes in the subtree to the left of a given node are smaller than or equal to the node, and the right subtree will contain nodes with values greater than the given node. With a built binary search tree, one can traverse the tree to print each node’s data in each order of traversal or perform some other operations. Further, one can tell by comparing nodes between two given trees whether they relate to each other, by having a reflected symmetric structure (i.e. being mirror images of each other), having identical structure, or not being related at all. In this assignment, you are asked to implement the following features.
Hard-code some paired lists of integers.
Build binary search trees from each list
Print the binary search trees in the three orders discussed in class.
Determine if the two binary search trees are identical, mirrors of each other, or neither
Remove a number in each tree at random and compare the tree pair again

Further, since the methods of the binary search tree class have been presented with recursive function calls, it is now up to you to implement these recursive functions with iterative loops.

You must write a Class Node, a class TreeChecker and a class BinarySearchTree. For Java users, they must implement the following interfaces respectively:

public interface INode {

   //Getter of node data
   T getData();

   //Setter of node data
   void setData(T data);

    INode getLeftChild() ;

   void setLeftChild(INode leftChild) ;

   INode getRightChild() ;

   void setRightChild(INode rightChild);
  
}
public interface ITree {
   void setRoot(INode root);
INode getRoot();
void preorder();   // print tree in a preorder traversal
void inorder();   // print tree in an inorder traversal
void postorder();   // print tree in a postorder traversal
INode insert(INode root, T data); // insert data into tree
   INode remove(INode root, T data); //search/remove node with data
   T search(INode root, T data); //search and return data if it exists
   INode getMax(INode root); //return node with maximum value of subtree
   INode getMin(INode root); //return node with minimum value of subtree
}  
public interface ITreeChecker {
  
boolean isMirror(ITree root1, ITree root2); // check if two trees are mirror
// images
   boolean isSame(ITree root1, ITree root2); // check if two trees are identical
}

In C++

Write a program that dynamically allocates a built-in array large enough to hold a user-defined number of test scores. (Ask the user how many grades will be entered and use a dynamic array to store the numbers.) Once all the scores are entered, the array should be passed to a function that calculates the average score. The program should display the scores and average. Use pointer notation rather than array notation whenever possible. (Input Validation: Do not accept negative numbers for test scores.) Make it a class, call it something like gradeholder. You will need a destructor because you are using dynamic arrays.

I need your help. Thank you

Problem:

A university administrator is interested in whether a new building can be planned and built on campus within a four-year time frame. He considers the process in two phases. Phase I: Phase I involves lobbying the state legislature and governor for permission and funds, issuing bonds to obtain funds, and obtaining all the appropriate legal documents. Past experience indicates that the time required to complete phase I is approximately normally distributed with a mean of 16 months and standard deviation of 4 months. If X = phase I time, then X ~ N(μ = 16 months, σ = 4 months). Phase II: Phase II involves creation of blue prints, obtaining building permits, hiring contractors, and, finally, the actual construction of the building. Past data indicates that the time required to complete these tasks is approximately normally distributed with a mean of 18 months and a standard deviation of 12 months. If Y = phase II time, then Y ~ N(μ = 18 months, σ = 12 months). a) A new random variable, T = total time for completing the entire project, is defined as T = X + Y. What is the probability distribution of T? (Give both the name of the distribution and its parameters.) b) Find the probability that the total time for the project is less than four years. (In symbols, calculate P(T < 48 months).) c) Find the 95th percentile of the distribution of T.

Conduct research on one of the first built tombs in the world. The selected tomb should have a superstructure. Specifically, focus on the, Evidential, Historical, Aesthetic and Communal Values of the tombs. In other words, determine the specific futures of a tomb in relation to their evidential, historical, aesthetic, and communal values

Architect, architectural features, construction year and duration, construction materials, construction type, structural features, construction purpose and the features that make it different and significant and the importance of the construction for the society should be included and explained under the headings of Evidential, Historical, Aesthetic and Communal Values in the report. You should illustrate your explanations with photographs which should be referred in your report.

Prepare a maximum 350-words long document

The majority of new railways are being built for use with electric traction, with many existing railways also being electrified. Summarise:

(i) The benefits of an electrified railway when compared with conventional (diesel) motive power

(ii) The advantages and disadvantages of the two different types of electrification system

(iii) The practical applications of each type of system. Give reasons for your answer.

(b) Describe some common ways of stabilising failed soil slopes. Explain your answer using sketch drawings where appropriate.

(c) Detail and discuss three aspects of water management and control within railway geotechnics and the implications of mismanagement.

Hamad International Airport was built on artificial land that was reclaimed from the gulf waters. This project reclaimed more than 60 million m³ sand in less than 2 years. This project is one of the most innovative land reclamation projects in Middle East.

Based on your knowledge; answer the following questions:                                                                                   

1. What type of dredger(s) can be used in the presence of sand material?   

2. What type(s) of dredging methods can be used? why?                                                                       

3. Identify five different type of risk categories with its examples that might be involved in this project using the table below;

Serial.flush() and Delay() are the two built-in functions. Place them in the following code to remove the garbage data printing as discussed in class.

Code:

char data;

void setup() {

// put your setup code here, to run once:

Serial.begin(9600);

}

void loop() {

// put your main code here, to run repeatedly:

while(Serial.available()==NULL){

data = Serial.read();

Serial.print("given character is: ");

Serial.println(data);

}

Serial.end();

}

Programming Activity 7 - Guidance =================================

This assignment uses a built-in Python dictionary. It does not use a dictionary implementation from the textbook collections framework. It does not require any imports/files from the textbook collections framework. This week's "examplePythonDictionary.py" example uses a built-in Python dictionary. Note that the mode() function begins by creating an empty Python dictionary. You must use this dictionary in the following parts.

Part 1 ------ In this part you will add entries to the dictionary. Use a "for" loop to iterate through the values in the data list. For each value, use it as a dictionary key to see if it is already in the dictionary. If it is already in the dictionary, add one to that dictionary entries value. Each dictionary value contains the number of times that value occurs in the data. You reference the current value for a key via dictionary[key]. If it is not in the dictionary, add it by assigning an entry for it with a value of 1.

Part 2 ------ Python has a built-in max() function that finds the maximum in any iterable object. Use max() on the list of dictionary values to obtain the maximum number of times a value occurs. Assign this to a variable called maxTimes. You will make use of maxTimes in part 3.

Part 3 ------ Note that this part begins by creating an empty modes list. Use a "for" loop to loop through the dictionary keys. The default "for" iterator for a Python dictionary iterates through its keys. For each key, see if its associated dictionary value is equal to maxTimes. If it is equal, append that key to the modes list.

Part 4 ------ If no item in the data set is repeated, then your modes list at this point will be the same as your starting data list. However, this case actually should mean there is no mode. Actually, every item is a mode with a frequency of 1. But, we want to return an empty modes list for this case. If the modes list and the data list have the same length, reset modes to an empty list. Note that modes is already being returned at the end of the function.

=============================================================================================================================

useDictionary.py

# This program uses a Python dictionary to find the mode(s) of a data set.

# The mode of a data set is its most frequently occurring value.
# A data set may have more than one mode.
# Examples:
# mode of [1,2,3,4,5,6,7] is none
# mode of [1,2,3,4,5,6,7,7] is 7
# modes of [1,2,2,2,3,3,4,5,6,7,7,7] are 2 and 7

# Replace any "<your code>" comments with your own code statement(s)
# to accomplish the specified task.
# Do not change any other code.

# This function returns a list containing the mode or modes of the data set.
# Input:
# data - a list of data values.
# Output:
# returns a list with the value or values that are the mode of data.
# If there is no mode, the returned list is empty.
def mode(data):
dictionary = {}

# Part 1:
# Update dictionary so that each dictionary key is a value in data and
# each dictionary value is the correspinding number of times that value occurs:
# <your code>

# Part 2:
# Find the maximum of the dictionary values:
# <your code>

# Part 3:
# Create a list of the keys that have the maximum value:
modes = []
# <your code>

# Part 4:
# If no item occurs more than the others, then there is no mode:
# <your code>

return modes

data1 = [1,2,3,4,5,6,7]
print(data1)
print("mode:", mode(data1))
print()

data2 = [1,2,3,4,5,6,7,7]
print(data2)
print("mode:", mode(data2))
print()

data3 = [1,2,2,2,3,3,4,5,6,7,7,7]
print(data3)
print("mode:", mode(data3))
print()

data4 = ["blue", "red", "green", "blue", "orange", "yellow", "green"]
print(data4)
print("mode:", mode(data4))
print()