Question 4a) Explain, with an example, how the use of multithreading enables a program to run faster.Use pseudocode or actual code to illustrate your answer.b) The following is non-concurrent code for working out the cosine of a sequence ofintegers. Rewrite this in Python so that it is concurrent. Your program must return theresults in the order of the input sequence. This code is available with this TCA as Q4.zip.import mathvalues = [12,20,4,100,64,77,200,9,10]def mycosine (n) :woonwww.return math.cos(n)wwwwwwwwwwdef non concurrent cosines():wwwwwfor val in values:wwwwwres = mycosine (val)wwwwwprint('Cosine of %s is %s' % (val,res), '\n')non concurrent cosines ()wwwwwwc) Use Python's datetime function to time the execution of the concurrent code, and to printout the result. Add the lines of code that support this to your solution to Question 4 (b). 1 import math23 values = [12,20,4,100,64,77,200,9,10]45 def cosine(n):6677Vreturn math.cos(n)8 ✓ def non_concurrent_cosines():v9 v101112for val in values:res = cosine(val)print('Cosine of %s is %s' % (val, res), '\n')13 non_concurrent_cosines()14

In the given pseudocode, calculate_sum is a function that calculates the sum of elements in an…

Answered: Question 4 a) Explain, with an example,…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

I am working a program to create a Koch curve using a main() with a recursive function that outputs postscript cout statements. At time of execution, we do output redirection to a .ps file to view the curve. How do I calculate the coordinates given beginning and end points (x1,y1) & (x2,y2)? We are using c++11 so I can’t import turtle or any other graphics library, nor should I need too.
Using only getchar from stdio.h along with the standard operators, create a program in c language, write a sample program in c language which takes an input stream of characters (max of 1000 characteres), and where the input words will be sorted out by bruteforce, mergesort, and quicksort on the output.
Translate the following code into a C program and explain what it does.MOV r2, #1MOV rl, #1loop CMP rl, r0 BGT done MUL r2, rl, r 2 ADD rl, rl , #1 B loop done MOV r0, r2
Answer in C++, show example output please There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initiallyempty. Using these three buckets, we can perform any number of the following twotypes of operations. We can fill the smallest bucket (of size X) completely to the top with X units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. We can fill the medium bucket (of size Y) completely to the top with Y units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. Although we may not be able to completely fill the size-M bucket, but we can stilldetermine the maximum amount of milk we can possibly add to largest bucket. Sample input:17 25 77 Sample output:76 In this example, we fill the bucket of size 17 three times and then bucket of size 25once, accumulating a total of 76 units of water. You could use additional test case to test your program:Input: 52 791…
please answer with proper explanation and step by step solution. Question: Write a C program that allows input for an integer, where it is passed to a ConvertDecimaltoBinary function that bit shifts the number 8 times, stores each of those values in an int array, then reads is backwards if the number in the array is even store character '0' in an array or if it is odd store character '1' in a character array. Ultimately, converting decimal to Binary in the way I have explained, in C.
Write a program using Assembly to OR the values stored in R2 and R3, storing the result in R4 BEFORE ANYTHING, I been told that this works for the question, but I don't understand what it means - =========================== LDR R2 ; load R2 ADD R4, R2, R3 ; R4= R2 + R3 STR R4 ; store the result in R4 ======================= How is this implemented into assembly, and what should the whole code look like? previous answers are confusing Requirements: Code will perform an “OR” operation “OR” will operate on data in Registers Values to be “OR”’s are loaded “by hand” into R2 and R3 before the program is run The result of “OR” is stored in R4 ------------------------------------------------------------------ Test Data set outputs: R2: xFF00 + R3: x00FF. R4 should = xFFFF R2: x1234 + R3: x4321 R4 should = x5335 R2: xF00D + R3: x0000 R4 should = xF00D
Write a program in HACK assembly, without using symbols, that sums the consecutive set of memory locations starting from the memory address stored in RAM[1]up to, but not including, the memory address RAM[1] + RAM[2]. The result of thecomputation should be stored in RAM[0]. Note, you need not consider the case ofan overflow.You can think of RAM[1] as being a pointer to an array of numbers, and RAM[2] asbeing the length of the array you are summing over.
Answer the given question with a proper explanation and step-by-step solution. Write an MIPS program that computes terms of the Fibonacci series, defined as: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 ... (This is sometimes started with a 0th term: 0, 1, 1, 2, etc.)The first two terms in the series are fixed, and each subsequent term in the series is the sum of the preceding two terms. So, for example, the term 13 is the sum of the terms 5 and 8.Write the program as a counting loop that terminates when the 100th term of the series has been computed. Use a register for the current term and a register for the previous term. Each execution of the loop computes a new current term and then copies the old current term to the previous term register. Count the number of passes to stop after the 100th term. Do not worry about overflow: this will FAR exceed the capacity of a register to hold the value. Stop the program with a syscall with 10 in $v0.
4. Given the following recursive definitionseq(1) = seq(2) = 1seq(n) = 2 ∗ seq(n − 1) + 3 ∗ seq(n − 2)implement the corresponding program and use it to calculate seq(5).How many invocations are made to the function seq when calculating seq(5)?
To better understand the concept of recursion, let’s look at an example that’s quite familiar to computerusers—the recursive definition of a file-system directory on a computer. A computer normally stores related filesin a directory (also called a folder). A directory can be empty, can contain files and/or can contain other directories,usually referred to as subdirectories. Each of these subdirectories, in turn, may also contain both files anddirectories. If we want to list each file in a directory (including all the files in the directory’s subdirectories), weneed to create a function that first lists the initial directory’s files, then makes recursive calls to list the files in eachof that directory’s subdirectories. The base case occurs when a directory is reached that does not contain anysubdirectories. At this point, all the files in the original directory have been listed, and no further recursion isnecessary. Write a print_directory function that recursively walks through the…
Using only getchar from stdio.h along with the standard operators, create a program in c language where: -Initialize a multidimensional array words, where the size of the first dimension is MAXWORDS and the size of the second dimension is MAXLEN. -Write lines of code which takes an input stream of characters (max of 1000 characteres) from the user using getchar, until the user triggers the end of file.-Create three arrays of pointers p1[], p2[], p3[], where each element of these arrays point to a string.
Using the C Programming language, write two versions of a function that contains a loop. Eachthe function should accept two numbers and calculate the sum of all numbers between the first numberand last number (inclusive of the first and last number). Once each function is writtenand tested for correct output, generate an assembly language version of the function. Write a version of the function using a while loop Write a version of the function using a goto loop Is the assembly language version of each loop function the same or different? (hint: Number of registers used Number of jumps (iterations), Total number of operations).

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS