[ad_1]

Get college assignment help at uniessay writers b) Let S to be the result when Alice digitally signs the message M = 25. What is S? If Bob receives M and S, explain the process Bob will use to verify the signature. Show that in this case the signature verification will succeed.

a. Design a sate diagram to recognize one form of the comments of the C-based programming languages, those that begin with /* and end with */. b. Write and test the code to implement the state diagram of part a.

Exercise 3 page 34: Consider the information stored on your personal computer. For each of the terms listed, find an example and document it: threat, threat agent, vulnerability, exposure, risk, attack, and exploit

Sourcing scenarios ,Just give short answer,not need long essay

I need help writing these codes the instruction to write them are in green with astricks by them the complier i am using is Code Block there are two files zipped together dates and charcount

How to calculate the half,square and Quetion in ijvm

You are given two inputs: an integer k, and an array A containing n integers. Give an algorithm to ﬁnd any one of the k smallest elements of A, using at most n − k comparisons. (In other words, your algorithm must return one of the k smallest elements of A, but it doesn’t matter which one.) Explain why your algorithm is guaranteed to ﬁnd a correct answer and why it satisﬁes the bound on the running time. (Hint: there is a very easy way to solve this problem). (b) Show that your algorithm from (a) is optimal by proving a lower bound of n − k on the number of comparisons required to solve the problem.

Suppose you have an array A of n items, and you want to ﬁnd the k items in A closest to the median of A. For example, if A contains the 9 values {7, 14, 10, 12, 2, 11, 29, 3, 4} and k = 5, then the answer would be the values {7, 14, 10, 12, 11}, since the median is 10 and these are the ﬁve values in A closest to the value 10. Give an algorithm to solve this problem in O(n) time, and explain why your algorithm runs in O(n) time. You may use the selection algorithms discussed in the book and the notes as subroutines of your solution. (Hint: you may want to call the selection algorithm more than once.)

Consider the following problem. You are given a bit string of n bits. You can examine any bit in the string, to see if it contains 0 or 1. More precisely, the function probe(i) returns the value of the ith bit in the string (either 0 or 1). You wish to determine whether the bit string contains two consecutive 1 bits. Obviously, you can do this using n probes. For which values of n in the range {3, 4, 5, 6, 7} can this be done using fewer than n probes? Explain your answer carefully. Work out the answer for each of the ﬁve values separately. The answers for smaller values of n may be helpful for ﬁnding the answers for larger values of n.

Consider the information stored on your personal computer. For each of the terms listed, find an example and document it: threat, threat agent, vulnerability, exposure, risk, attack, and exploit.

Get college assignment help at uniessay writers 3. p.273 Assignments 1-4 Identify possible use cases and actors, and create a use case diagram for the Personal Trainer information system. Select one of the use cases and create a class diagram. Create an object relationship diagram for the system. Create a state transition diagram that describes typical member states and how they change based on specific actions and events.

Write java program that lets you enter a number n and that calculates the nth Fibonacci number: 1,1,2,3,5,8,… Each new number is the sum of the last two.

Matrix multiplication is not commutative. That is, if A and B are each n×n matrices, then it is not always true that AB=BA. Write a program that does the following. 1. Inputs an integer n and checks that it is positive. 2. Creates two n×n double matrices A and B. 3. Inputs in values for A and B. 4. Computes and prints both AB and BA. 5. Computes and prints AB-BA. 6. Prints whether the matrices were commutative or not. 7. Inputs an integer p and checks that it is positive. 8. Prints Aj-Bj and (A-B)j, for j=1,2,..p. Your program must contain a method public static void matMult(int n, double[][]A, double[][]B, double[][]C) You may use the one from the notes. This method must be called for each multiplication. Whenever the user is to input values, a prompt must be printed.

1. Many artificial vision systems have been motivated by the image sensing capabilities of biological vision systems. One such mechanism is scene sampling, motivated by the inherent structure of the retina. Photoreceptors in the retina are distributed to provide high resolution on the central part of the retina (fovea) with decreasing resolution towards the periphery. This has motivated the log-polar image geometry. When compared to the usual cartesian images, the log-polar images allow faster sampling rates on artificial vision systems without reducing the size of the field of view. The log-polar transformation is a conformal mapping from the points on the cartesian plane (x,y) to points in the log-polar plane (ρ,θ): The mapping is described by: ρ = log x2 y2 θ = a tan y x ⎛⎝ ⎜ ⎞⎠ ⎟ Write a program to map an input image to the log-polar space. For visualization, ρ should be a discrete variable. You can achieve this by equating ρ=radius and ignoring the log operation. θ sampling should be a free parameter. Test your code with θ=64. This should result in a polar image of size 128×64 for an input image of size 256×256. In addition, develop a simple user interface that allows for selection of a point in an image and performs the mapping to generate the retinal image. 2. Test the developed operations with the images provided and report on the results.

4.1. Consider a simple telephone network consisting of two end offices and one intermediate switch with a 1-MHz full duplex trunk between each end office and the intermediate switch. The average telephone is used to make four calls per eight hour workday, with a mean call duration of six minutes. Ten percent calls are long distance. What is the maximum no. of telephones an end office can support?

1. Convert decimal number 25 and 3 in 16-bit binary.Show your work. 2.Add the binary numbers in the above question using the rules for binary addition .Show your work. 3.If 11 bits were used to represent a binary number,what is the largest number it could be stored in 11 bits?

Adding To and Removing From an Integer List File IntegerList.java contains a Java class representing a list of integers. The following public methods are provided: IntegerList(int size)—creates a new list of size elements. Elements are initialized to 0. void randomize()—fills the list with random integers between 1 and 100, inclusive. void print()—prints the array elements and indices File IntegerListTest.java contains a Java program that provides menu-driven testing for the IntegerList class. Copy both files to your directory, and compile and run IntegerListTest to see how it works. It is often necessary to add items to or remove items from a list. When the list is stored in an array, one way to do this is to create a new array of the appropriate size each time the number of elements changes, and copy the values over from the old array. However, this is rather inefficient. A more common strategy is to choose an initial size for the array and add elements until it is full, then double its size and continue adding elements until it is full, and so on. (It is also possible to decrease the size of the array if it falls under, say, half full, but we won’t do that in this exercise.) The CDCollection class in Listing 7.8 of the text uses this strategy—it keeps track of the current size of the array and the number of elements already stored in it, and method addCD calls increaseSize if the array is full. Study that example. 1. Add this capability to the IntegerList class. You will need to add an increaseSize method plus instance variables to hold the current number of integers in the list and the current size of the array. Since you do not have any way to add elements to the list, you won’t need to call increaseSize yet. 2. Add a method void addElement(int newVal) to the IntegerList class that adds an element to the list. At the beginning of addElement, check to see if the array is full. If so, call increaseSize before you do anything else. Add an option to the menu in IntegerListTest to test your new method. This is the code // **************************************************************** // IntegerList.java // // Define an IntegerList class with methods to create

LAB ASSIGNMENT A6.2 page 12 of 12 RegularPolygon Background: Polygons are two-dimensional shapes formed by line segments. The segments are edges that meet in pairs at corners called vertices. A polygon is regular if all its sides are equal and all its angles are equal. For an n-sided regular polygon of side s, the angle at any vertex is q, and the radii of the inscribed and circumscribed circles are r and R respectively. A 5-sided regular polygon (pentagon) would be represented as follows: Assignment: Create a RegularPolygon class to model any regular polygon. Use the following declarations as a starting point for your lab work. Write two constructor methods. The default constructor creates a 3-sided polygon (triangle). The other constructor takes an integer value representing the number of sides and a double value representing the length of the sides and constructs the corresponding regular polygon. Write a method that calculates the vertex angle, q. This angle can be determined as follows: where n represents the number of sides. Write a method that calculates the perimeter. This value is determined simply as the number of sides, n, times the length of a side, s: Write a method that calculates the radius of the inscribed circle, r. The inscribed circle is the circle that can be drawn inside of the regular polygon such that it is tangent to every side of the polygon, for example, the smaller circle in the diagram above. It can be calculated as: where n represents the number of sides, s represents the length of a side, and cot() is the trigonometric function, cotangent. We use the value π instead of 180 in the formula because the Java math functions assume that angles are given in radians instead of degrees. Note: the built-in Java method math.PI produces the value of π. An alternative is to replace π with 180 in all the formulas here and use following method from the Math Class to convert from degrees to radians: Math.toRadians(double angdeg) The cotangent function is not part of the Java Math library, however, the cotangent of an angle can be calculated as the reciprocal of the tangent as follows: Write a method that calculates the radius of the circumscribed circle, R. The circumscribed circle is the circle that intersects each vertex of the polygon, for example the larger circle in the diagram above. R can be calculated as: where n represents the number of sides, s represents the length of a side and csc() is the trigonometric function, cosecant. The cosecant function is not part of the Java Math Class, however, the cosecant of an angle can be calculated as the reciprocal of the sine as follows: Write a method that calculates the area of the regular polygon. It can be calculated as: where n represents the number of sides and R represents the radius of the circumscribed circle. All trigonometric function in the Java Math Class take radians as the parameter. To convert an angle measured in degrees to the equivalent angle measured in radians use the following method from the Math Class: public static double toRadians(double angdeg) Instructions: Test the default constructor by constructing a regular polygon with no parameters as follows: RegularPolygon poly = new RegularPolygon(); Use the following values to test your functions: Square: number of sides = 4, length of side = 10 Octagon: number of sides = 8, length of side = 5.75 Enneadecagon: number of sides = 19, length of side = 2 Enneacontakaihenagon: number of sides = 91, length of side = 0.5 Answers:

In the analysis of the deterministic selection algorithm discussed in class, we proved the following upper bound: |L| â‰¤ ô°€ 7n 10 ô° 3. But we did not claim that this was a tight bound. For n = 25, give a tight upper bound on the size of L. In other words, ï¬nd the value k such that both of the following conditions hold: â€¢ |L| will always be â‰¤ k when n = 25, and â€¢ there is a set S of 25 elements for which L does indeed contain k elements. Justify your answer. How does this compare with the upper bound

Use VB to allow a user to manipulate a database according to the following: * Allow the user to scroll through the list of students while showing student ID, student name, advisor name, and department. * Allow the user to add a new student record, delete an existing student record, and update an existing student record. * When a user adds a new student, a new student ID should be assigned automatically. Do not reuse old student IDs from deleted students. * Provide a list the students in ascending alphabetical order according to name. Program Requirements * Create a database using the three tables: one for student information, one for advisor information, and one for department information. It may be an Access database or created using the VB data manager. * You must center all forms on the screen using a common procedure.

Draw a level-1 DFD for the following scenario. Attached is the level-0 DFD for you to help. — The purpose of the green acres real estate system is to assist agents as they sell houses. Sellers contact the agency, and an agent is assigned to help the seller complete a listing request. Information about the house and lot taken from that request is stored in a file. Personal information about the sellers is copied by the agent into a sellers file. When a buyer contacts the agency, he or she fills out a buyer request. Every two weeks, the agency sends prospective buyers area real estate listings and an address cross reference listing containing actual street addresses. Periodically, the agent will find a particular house that satisfies most or all of a specific buyer’s requirements, as indicated in the buyer’s requirements statement distributed weekly to all agents. The agent will occasionally photocopy a picture of the house along with vital data and send the multiple listing statement (mls) to the potential buyer. When the buyer selects a house, he or she fills out an offer that is forwarded through the real estate agency to the seller, who responds with either an offer acceptance or a counteroffer. After an offer is accepted, a purchase agreement is signed by all parties. After a purchase agreement is notarized, the agency sends an appraisal request to an appraiser, who appraises the value of the house and lot. The agency also notifies its finance company with a financing application.

The post b) Let S to be the result when Alice digitally signs appeared first on uniessay writers.

[ad_2]

Source link

November 3, 2019