Computer Time is Based on Milliseconds • Generally, we count time in computer software in milliseconds (thousandths of a second) since 1970/01/01 01:00:00 - that is 1AM on 1st January 1970. • You might think "that's over 50 years of milliseconds - it must be a huge number". And you'd be right - in fact, the number will get too big to store in "normal" ints in 2038 (not just for Java) now uses the long datatype instead of int to store time values (these won't run out for nearly 300 billion years). • Working with time in Java (and other languages) basically involves using built-in libraries to convert time to/from milliseconds. • You'll also need (maybe.) to be able to covert milliseconds to seconds (divide by 1000), minutes (divide again by 60) and hours (should be clear what you need to do now). • There are several libraries for this in Java - which is (a) confusing and (b) dangerous since some are now deprecated (as in you shouldn't use them). • We will be using two - LocalDateTime (for actually handling dates) and DateTimeFormatter (for turning strings into dates)- both of which are up to date. • In common with standard practice when we say "date" we mean "date and time". The 'long' Datatype Because the numbers we are dealing with are potentially very large, we need to use long not int. Using long is basically the same as using int except that you generally need to put an Lon the e prevent Java compiler errors because numbers are too large. For example: long exanple 1998614713000L; /1998614713000 wdthout the L Nould be too big - the L forces it to be a long DateTimeFormatter We will use the date format: year/month/day hour:mins:secs to represent dates as a String, where each of the components is two digits except year, which is four. To do this we first need to cr Datetimefornatter of - Datetineformatter.ofPattern("yy/vad HHim:ss"): This creates an object df which we can use to both parse dates (turn strings in the above format into milliseconds) and generate date strings (turn milliseconds into strings representing dates). You need to have the import statement: Irport java. tine.fornat.DateTimeFormatters in your code LocalDateTime This needs the import statements: import java.tine.Instant; Smport java.time.LocalDetetime inport java.tine. Zonetd And you'll need two different kinds of code fragments. To turn a String in the format above into milliseconds: long milliseconds - LocalDatetine.parse(date, of).atzone(Zoneia. systenoefault()).tolnstant().totpoci110: where date is a string in the format above, and df is the DateTimeFormatter above. Note that the result is a long, not an int! To turn milliseconds back into a String (which depending on how you approach the problems you may not have to do): LocalDetetime dniis - LocalDetetine.ofInstant(Instant.ofpochni11i(nil1is), Zoneid.systenbefault()); string datestring - oniis.fornat(of); where millis is a long (not an int!) representing the date in milliseconds. Danger! If you look at the documentation for LocalDateTime you'll find a lot of methods to do with e.g. hours, minutes and seconds - you might think these might come in handy to convert from millisec you might first think they do and are unlikely to be useful (except to waste valuable time). Q1 Time: Which of the pairs of dates below is separated by 178665918000L milliseconds? 1998/03/16 22:03:02 and 2003/12/01 08:01:46 1998/03/22 03:40:40 and 2003/11/06 23:47:43 1998/03/29 20:59:25 and 2003/12/11 09:14:32 O 1998/03/16 13:29:46 and 2003/11/07 22:56:07 O 1998/04/03 01:27:45 and 2003/11/30 21:53:03

what is the correct formula to solve this

Our everyday number system in the UK and many other parts of the world is a base-10 system using Arabic numerals, namely the digits 0, 1, 9. Integers larger than 9 are represented by sequences of these elementary numerals. The numerical value encoded by such a sequence is determined by multiplying each numeral by 10k, where k is the position of the numeral counted from the back and starting at zero, and then summing together the contributions from all numerals. For example, 5207 = 5 × 10³ +2×10² +0×10¹ + 7×10⁰ The built-in int function in Python can take a string (type str) representing such a number and convert it to a Python integer (type int). Write a similar function base14_convert that takes a string and converts it to a Python integer according to the following number system: • the base is 14, i.e., the individual digits have to be multiplied by powers of 14 to obtain the numerical value; digits are represented by lower-case letters 'a', 'b', 'c', 'd', ..., i.e., 'a' is…

Computer Science Please answer the questions. It is either yes or no for the answers.

The "e" number is an important constant real number in mathematics and engineering science.It's definition of natural logarithm and also an irrational number.Approximate value is e=2.718281828459045235360287471352662497757247.....In the following equation which discovered by Harlan A. Brothers and John A. Knox, the greater the number "x", the result approximates the actual number "e".((2x+1)/(2x-1))^x Code a "C" program to calculate the approximate value of "e" by increasing the value of "x" (x=1, x=2, x=3...)Let the value of "x" continue to increase (if the difference is bigger) until the difference between the results from the equations and value 2.718281 is less than 0.000001.When the difference is less than 0.000001, project the x value at that moment and the result obtained from the equation on the screen.

Draw out a TM (computable function) that does the following: - Input: Two binary string of equal length separated by # (example: 0110#1010) - Output: The result from performing logical AND on the two binary strings (0010). You may write the output on Tape 2.

With a fancy calculator, finding square roots is easy. But what if you only had a basic four-function calculator? Assuming that number holds the value that you want to calculate the square root of, the following algorithm approximates the square root of a number: Get a guess from a human Square the guess If the squared guess is within 0.1 of the original number, we will accept the guess as our answer If it is not, try again with a different guess and keep trying until we get an answer that is close enough This algorithm relies on a human to make the guesses, though it wouldn't be too hard to also design an algorithm for making an appropriate guess. What would be a flowchart for this?

Computer Science- AI- NLP - You are given a training set of 30 numbers that consists of 21 zeros and 1 each of the other digits 1-9. Now we see the following test set: 0 0 0 0 0 3 0 0 0 0. What is the unigram perplexity?

Using Python or awk script and any given text file such as a book find: (A) the number of unique words,(B) the ten most and least frequently used words,(C) the top five frequently used five-letter words,(D) the top five frequently used six-letter words,(E) the top five frequently used words with seven or more letters,(F ) the average number of words between each word with seven or more letters (and the standard deviation)

Write a Python program that implements the Taylor series expansion of the function (1+x) for any x in the interval (-1,1], as given by: 1(1+x) = x-x²/2 + x³/3 - x^/4 + x³/5. The program prompts the user to enter the number of terms n. If n> 0, the program prompts the user to enter the value of x. If the value of xis in the interval (-1, 1], the program calculates the approximation to l(1+x) using the first n terms of the above series. The program prints the approximate value. Note that the program should validate the user input for different values. If an invalid value is entered, the program should output an appropriate error messages and loops as long as the input is not valid. Sample program run: Enter number of terms: 0 Error: Zero or negative number of terms not accepted Enter the number of terms: 9000 Enter the value of x in the interval (-1, 1]: -2 Error: Invalid value for x Enter the value of x in the interval (-1, 1]: 0.5 The approximate value of ln (1+0.5000) up to 9000 terms…