Write a program that uses nested for loops to print a multiplication table. Your program should print out the multiplication table starting a 1 and going to 12. Output should be like:

1 x 1 =

.1 x 2 = 2

anwer in kotlin

fun main() {
val text = "Kotlin".getFirstAndLast()

val firstChar = text["first"]
val lastChar = text["last"]

// TODO 2
println()

}

// TODO 1
fun String.getFirstAndLast() = mapOf<String, Char>()

TODO 1:
Make the getFirstAndLast function the extension of the String class with the return type Map <String, Char>

TODO 2:
Add functions to print the values of the firstChar and lastChar variables in the console.

there no more information from this task

i dont know.
this is the full task

on python 3.6:

Write a program that will quickly estimate pi to a precision of 1e-4 using Archimedes approach of averaging polygon perimeters. Your program should employ a loop where the number of sides of the polygon are increased each iteration until the absolute value of the difference between the current estimate and the previous estimate is less than 1e-4. l. The program should output the estimate of pi and the number of iterations needed to reach the desired level of precision.

the code for the finding pi using the Archimedes approach is:

numside_ins=float(input(enter the number of sides of the inscribed polygon))

numside_cis=float(input(enter the number of sides of the circumscribed polygon))

diameter= 1
length_ins= 2*(diameter/2)*sin(pi/numside_ins)
peri_ins= numside_ins*length_ins
length_cir= 2*(diameter/2)*tan(pi/numside_cir)
peri_cir = numside_cir * length_cir
ave_peri=((peri_cir + peri_ins) / 2)
found_pi= ave_peri/diameter
print(found_pi)

1. Find the propagation delay for a signal traversing the following networks at the speed of light in cable (2.3 × 108 meter/second).

(a) metropolitan area, 100 km

(b) continent, 5000 km

2. How many (i.e. maximum) bits are in transit during the/a propagation delay (assuming the pipe is full) in the case (a) of Question 1 if bits are entering the network at the following transmission speeds:

(a) 1 Megabits/second

(b) 100 Megabits/second

(c) 10 Gigabits/second

3. In the case (b) of Question 1 and Question 2, how long does it take to send an L-bit file in the following cases:

(a) L = 10^3

(b) L = 10^6

(c) L = 10^9

Define a class Fraction3YourName as follows,

/**
* Program Name: Fraction3YourName.java
* Discussion: Fraction3Yourname class
* written By:
* Date: 2019/09/19
*/
public class Fraction3YourName {
private int sign;
private int num;
private int denom;
public Fraction3YourName() {
//sign = ;
//denom = ;
}
public Fraction3YourName(int n) {
//sign = ;
//num = n;
//denom = ;
}
public Fraction3YourName(int s, int n, int d) {
//sign = s;
//num = n;
//denom = d;
}
}

by java programming

Explain about security that can be provided in these three layers: Application layer, TCP/IP layer, network layer.

Try to make it as simple as you can and explain as much as it needed.

1. What are the differences between symmetric encryption and asymmetric encryption? (1 point)

Ans:

2. What is pseudo random numbers? (1 point)

Ans:

3. What is Moore’s Law? (1 point)

Ans:

4. What are four different block cipher modes? (1 point)

Ans:

5. What is one-time pad? (1 point)

Ans:

This is a java coding String manipulation Question.

Let us say I have a String which looks something likes this:

String x = "MATH,PHYSICS,CHEMISTRY,CODING"

And then I have another String which looks something like this:

String y = "XXXXMXXXAXXXTXXXXHXXXXXXCXXXXOXXXXDXXXIXXXXNXXXGXXXX"

and another String that looks like this:

String z = "XXXXHXXTXXXXAXXMXXXXXCXXXOXXXDXXXIXXXNXXXG"

I want to take String y and print the words that are found in String x as such:

Math

Coding

and for String z if I want to take it and print the words also found in x as such:

Math

Coding

So basically I want to the program to print the possible words from the letters I have in String y and z.

and only print possible words from my String x.

I want to know how I can do such thing please explain so that I understand what is going on. I have tried replacing the Xs with nothing and then I would have the letters and then I'll use it to check if it has something in String x. but that made me use arrays and also if I replaced Xs with nothing and I had to words in Z or Y then I'll end up with something I can not work with only letters.

I have also thought about making a char array from the resulting String after replacing Xs. and then split String x by ',' and after make a char array of each word and then check if the char array of each word contains the chars of the resulting String after replacing Xs with nothing.

but that also does not work.

I think this is a simple problem that I am over complicating.

Please help and thank you.

Explain any android application in detail and on your own words

it should include the purpose, security features and you suggest to improve it

Given that Sale[NUM_ROW][NUM_COLUMN] is a two dimensional array of float-

point type and the two constants are defined as follows:

#define NUM_ROW 4

#define NUM_COLUMN 4

float Value[NUM_ROW][NUM_COLUMN] =

{

2.1, 2.2, 2.3, 2.4, 1.5, 1.6, 1.7, 1.8, 1.9, 2.0, 2.1, 2.2, 2.1, 2.2, 2.3, 2.4

};

Write a C++ main function that computes and prints out the following information about

this 2d array:

(1) The mean of all the Value[][] array elements (0.5 points).

(2) The median of all the Value[][] array elements (0.5 points)

(3) The local average values of all the array elements (1.0 points). For instance, the

local average value at position i, j = (Value[i-1][j]+Value[i+1][j]+Value[i][j+1]+Value[i][j-1]+Value[i][j])/5.

If (i+1) > NUM_ROW-1 or (i-1) < 0, use modulus operator to wrap around to the other end of the array index.

Create another array: Average[NUM_ROW][NUM_COLUMN], and use this array to store the values

of local average at each position of this 2d array. At the end, you need print out

the values of all the array elements of Average[][] on computer screen.

Parts (2) only please.

Create a website for an online movie rental store, using HTML (and any other client technologies) and PHP. The website should include:

- A front/home page containing a list of movies available for rent (list at least 10 movies).

o Each movie should have a listed rental price.

o Additional information provided:

§ name of actors in the movie (list at least 2)

- The home page should link to a form for renting a movie

o Selecting and submitting a movie for rent will lead to a page displaying

§ the name of the movie rented,

§ the amount charged (calculated with 5% tax),

§ the date and time rented, and § the date and time the movie is due for return (in 5 days).

- A form linked through the home page for selecting a movie and submitting a user review.

o Input fields should include

§ The name of the movie

§ Username

§ Rating in 5 stars

§ User review

o Output after submitting a review should show the name of the movie and all submitted information.

Try to make it as simple as you can and explain as much as it needed.

1. What are the differences between symmetric encryption and asymmetric encryption? (1 point)

Ans:

2. What is pseudo random numbers? (1 point)

Ans:

3. What is Moore’s Law? (1 point)

Ans:

4. What are four different block cipher modes? (1 point)

Ans:

5. What is one-time pad? (1 point)

Ans:

Try to make it as simple as you can and explain as much as it needed.

1. Define Integrity and Nonrepudiation? (2 points)

Ans:

2. What are the differences between Stream Cipher and Block Cipher? (2 points)

Ans:

3. What is Access Control and why is it important? (2 points)

Ans:

4. Message Authentication Code ensures authentication or integrity or both? Justify and explain your answer. (3 points)

Ans:

5. What are the weaknesses of DES? Why triple DES is better than Double DES? (3 points)

Ans:

This problem should be solved using the DrRacket software in Racket/Scheme language.

Write a function (merge-sorter L1) that takes list-of-integers L1 and returns all elements of L1 in sorted order. You must use a merge-sort technique that, in the recursive case, a) splits L1 into two approximately-equal-length lists, b) sorts those lists, and then c) merges the lists to obtain the result. See the following examples for clarificaton.

(merge-sorter '(3 1 5 4 2) ---> (1 2 3 4 5)
(merge-sorter '()) ---> ()
(merge-sorter '(1)) ---> (1)

Q: Let’s say you have an unordered list of numbers and you wanted to put them in order from lowest to highest value. How would you do that? You’re probably thinking that you would just look at all the numbers, find the lowest number and put it at the beginning of your list. Then you would find the next largest number and put it in the second spot in the list, and so on until you’ve ordered the entire list of numbers. It’s simple, basic, and not very exciting. Now, let’s say that instead of ordering the list yourself, you decide it’s a better idea to write a computer program to order the list for you. Now you don’t have to deal with moving the numbers around, you just need to tell your program how to move the numbers, and then let the program handle any list you give it.Identify all possible ways of telling your program how to move the numbers, where each way provides the required result.

(Note: The program code is preferred to be in Java)