Compute the weakest precondition for each of the following assignmentstatements and postconditions:1. a = 2 * (b - 1) - 1 {a > 0}2. b = (c + 10) / 3 {b > 6}3. a = a + 2 * b - 1 {a > 1}4. x = 2 * y + x - 1 {x > 11}

A grid needs a system for numbering the tiles in order to allow random-access lookup.For instance, the rows and columns of a square grid provide a natural numbering for the tiles. Create plans for hexagonal and triangular grids. Create a rule for identifying the neighbourhood (i.e., nearby tiles) of a certain tile in the grid using the numbering scheme. For instance, the neighbourhood of tile I j in a four-connected square grid with indices of I for rows and j for columns may be described as neighbourhood(i, j) = I 1, j, I j 1.

Consider the code C={00010, 01100,01011,11010,01010}. What is the minimum distance of C? For what k is the code C k-error detecting? Write the set of error patterns that C can detect?

Suppose a line segment starts at (x0, y0) and ends at (x1, y1) where, x0, y0, x1 and y1 are sequentially the first, second, third and fourth pair of digits from the left in your student ID. STUDENT ID: 21341040 Q:-  Simulate the midpoint line drawing algorithm to find the first four intermediary pixels of this line after (x0, y0); or, all of them if the line reaches (x1, y1) in less than four pixels.

a.Provide a top-level decomposition of the problem of drawing a frieze pattern, assuming for the moment that the basic element is repeated just exactly 5 times. At this stage you are not trying to produce a solution, just break the problem down into smaller parts. We are looking for a decomposition that could apply to a frieze composed of any basic element, so for now you should just assume that the exact form of the basic element will be considered in a more detailed decomposition, so you can just say “draw basic element” for this step. Your initial decomposition should use exactly one loop. In the remainder of this question, you will design and implement a program to draw the particular frieze shown   In this frieze the length of each of the eight "spokes” of the basic element is 40 and the angle between the spokes is 45º. Each repeat is 100 units to the right of the previous one, as measured from the centre of one basic element to the centre of the next (where the centre is the…

Prove the Property: When searching for a pattern of length M in a text of length N using the Boyer-Moore mismatched character heuristic, N M character comparisons are used.

0) For the pattern P = "0001" and the text T = "000010001010001" simulate the Rabin Karp algorithm with a table of appropriately labeled columns anf for raxis of 2 and prime of 11.

The following is my code in MATLAB to transform kepler elements to cartesian coordinates. Can you give me the code of a function that will transform cartesian coordinates back to kepler elements that will match the inital kepler elements?     mu = 3.986004415e5;a = 2.1656e03;ecc = 0.7404;inc = 123.8490;raan = 127.5686;argp = 180.0180;f = 180;   R = orbitDCM(inc,raan,f+argp); %Create the direction cosine matrixp = a*(1-ecc^2); %Semi latus rectumh = sqrt(mu*p); %Orbital angular momentumrOrb = [p/(1+ecc*cosd(f));0;0]; %Position in orbital framevelOrb = [mu*ecc/h*sind(f);h/rOrb(1);0]; %Velocity in orbital framerxyz = R*rOrbvelxyz = R*velOrb function R = orbitDCM(inc,omeg,th)%Creates the direction cosine matrix for an orbit. The matrix can then%be used to convert between orbit frame coordinates (rhat,theta_hat,h_hat)%and inertial coordinates (x,y,z).R = eye(3);R(1,1) = cosd(omeg)*cosd(th)-sind(omeg)*cosd(inc)*sind(th);R(2,1) = sind(omeg)*cosd(th)+cosd(omeg)*cosd(inc)*sind(th);R(3,1) =…

When rasterizing two triangles that lie on different sides of a common edge, there should be neither multiple fragments for a pixel nor holes between the two triangles. Describe how these requirements can generally be implemented in rasterization! Why is it important that the decision whether a pixel belongs to a triangle can always be made locally based on the data of each individual triangle?