Algorithms Answers

QUESTION 26

Which one of the following statements regarding updating of sequential files is FALSE?

1. If minor changes are needed the transaction file is not necessary.

2. The new master file always contains the most current updates.

3. The old master file is normally kept for referencing, even after the new master file has

 successfully been created.

4. The error report file is necessary to take corrective action after errors occurred during an 

 update process.

QUESTION 27

Consider the following 4 files involved in updating a sequential file:

A. The old master file.

B. The new master file.

C. The transaction file.

D. The error report file.

Which of the following options regarding files A to D is TRUE?

1. File C contains a record of each successful write operation to file B.

2. File A is deleted as soon as file B is closed after the update.

3. File A can be updated directly, which makes file B unnecessary.

4. File D is updated with all errors that occur during the update process.

Write an algorithm to determine the average of any five(5) numbers and display the below after: the sum, the product and the average.

The length of time a full length movie runs from opening to credits is normally distributed with a mean of 2.2 hours and standard deviation of 0.2 hours. Calculate the following:A random movie is between 1.8 and 2.0 hours.A movie is shorter than 1.6 hours.

A movie is longer than 2.4 hours.

1(a) Write an algorithm/pseudocode for a movie rental company that wants to screen their customers from 18 years and above. 

The system should be able to deny access to customers that appear below 18.

b. Draw a flowchart to illustrate the above program.

Convert -218 to binary and represent it in Sign-and-Size code

Convert -2116  to binary and represent it in Sign-and –Size code

Deep Learning has become the main driver of many new applications and it's time to really

look at why this is the case. With so many other options that we have been using for so long,

why Deep Learning is getting so popular these days?

You’re interviewing for your dream job at an ecological ethical tech company with healthy snacks. You already passed 28 stages of interviews, and your final interviewer asks you to design a binary search tree data structure that performs INSERT operations in O( √ log n) time using a comparison-based algorithm. Design such a data structure or prove that this is impossible.

Draw the activity diagram of autonomous cars project in draw.io online software?

Why we study numerical method?