Programming & Computer Science Answers

Write a python program that takes 2 inputs from the user. The first input is a string and the second input is a letter. The program should remove all occurences of the letter from the given string and print the output. If the letter is not found in the string and the length of string is greater than 3, then remove the first letter and last letter of the given string and print it. Otherwise print the string as it is. You can assume that all the input will be in lowercase letter.

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

Sample Input 1:

tanjiro kamado a

Sample output 1:

tnjiro kmdo

Write a Python program that will take one input from the user made up of two strings separated by a comma and a space (see samples below). Then create a mixed string with alternative characters from each string. Any leftover chars will be appended at the end of the resulting string.

Hint: For adding the leftover characters you may use string slicing.

Note: Please do not use lists for this task.

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

Sample Input 1:

ABCD, efgh

Sample Output 1:

AeBfCgDh

I have tried to do the question but it got tricky for me to complete it.

the question is on the following link

https://drive.google.com/file/d/17kEiEoJFVYfc2zLqDdPskPKBD_MTjpKu/view?usp=sharing

what I have done so far is on the following link:

https://drive.google.com/file/d/1N_Y0Fqr0zEbvd0JrYWs1JJWmz_k4bAZC/view?usp=sharing

please assist

Recall that a full binary tree is a binary tree where each level of the tree has the maximum

number of nodes possible.

a. If the level of the root of a non-empty full binary tree is level 1, the level of the root's

children is level 2, etc., how many nodes are on level i, i ≥ 1?

b. If a non-empty full binary tree has n levels (or a height of n), how many nodes does the

tree have in total? Express your answer in closed form (i.e. do not use "..." in your final

answer).

c. Prove that the number of leaves in a non-empty full binary tree is 1 more than the number

of non-leaves. When you prove this, don't just show an example. Write your proof in

general for ANY non-empty full binary tree.

Let us now try comparing two numbers by letting the user input two different numbers and say "Greater" if the first inputted number is greater than the second one, and "Lesser" if it’s the other way around.

Let's go!

Input

A line containing two different numbers separated by a space.

1.2·1.02

Output

A line containing a string.

Greater

Consider the two different techniques we used for implementing traversals of a binary

tree. Why must we check before the call to preorder when implementing as a method,

whereas we could check inside the call when implementing as a function?

You wish to create a database of stars. For each star, the database will store several megabytes of data. Considering that your database will store billions of stars, choose the data structure that will provide the best performance. With this data structure you should be able to find, insert, and delete stars. Justify your choice. 

1. The total number of missing values within the dataset.

2. Which column / feature requires correction in the type of value they hold?

3. After imputation of nulls with mean what is the average value of the compressive strength in concrete?

4. The feature that has a moderately strong relationship with compressive strength in concrete is?

5. Standardize the dataset using standardscaler(), split the dataset into train and test of proportions 70:30 and set the random state to 1. Build a Linear Regression Model on the data and the resulting r-squared value is between which range?

Create a program that identifies if the entered number is divisible by 7.Use tbe mod operator

Create a program that identifies if the entered number is am odd number.Use the mod operator