lab12

Computer science. Correct answer will be upvoted else downvoted.   Think about a n by n chessboard. Its columns are numbered from 1 to n from the top to the base. Its sections are numbered from 1 to n from the passed on to one side. A cell on a convergence of x-th line and y-th section is indicated (x,y). The fundamental corner to corner of the chessboard is cells (x,x) for all 1≤x≤n.    A stage of {1,2,3,… ,n} is composed on the fundamental slanting of the chessboard. There is actually one number composed on every one of the cells. The issue is to segment the cells under and on the principle askew (there are by and large 1+2+… +n such cells) into n associated areas fulfilling the accompanying imperatives:    Each district ought to be associated. That implies that we can move from any cell of a locale to some other cell of a similar area visiting just cells of a similar district and moving from a cell to a neighboring cell.    The x-th area ought to contain cell on the fundamental…

Question 1 Suppose a large group of people in a room were all born in the same year. Consider the following three algorithms, which are each intended to identify the people in the room who have the earliest birthday based on just the month and day. For example, a person born on February 10 is considered to have an earlier birthday than a person born on March 5. Which of the three algorithms will identify the correct people? I. All the people in the room stand up. All standing people form pairs where possible, leaving at most one person not part of a pair. For each pair, the person with the earlier birthday remains standing, while the other person in the pair sits down. If there is a tie, both people sit down. Any individual not part of a pair remains standing. Continue doing this until only one person remains standing. That person has the earliest birthday. II. All the people in the room stand up. All standing people form pairs with another standing person that they have not previously…

Perform an experimental analysis on the two algorithms & Visualize their running times as a function of the input size with a log-log chart. 1. prefixAverage12. prefixAverage2 note: I need with an answer with example to understand it better. Please help me out to complete this question been struggling.

Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. You are given a parallel table of size n×m. This table comprises of images 0 and 1.    You can make such activity: select 3 distinct cells that have a place with one 2×2 square and change the images in these cells (change 0 to 1 and 1 to 0).    Your assignment is to make all images in the table equivalent to 0. You are permitted to make all things considered 3nm activities. You don't have to limit the number of activities.    It tends to be demonstrated that it is consistently conceivable.    Input    The principal line contains a solitary integer t (1≤t≤5000) — the number of experiments. The following lines contain portrayals of experiments.    The principal line of the depiction of each experiment contains two integers n, m (2≤n,m≤100).    Every one of the following n lines contains a parallel line of length m, depicting the images of the following column of the table.    It is…

For your initial post, identify a single algorithm that you use in your day to day life which involves repetition. As an example, washing each dish in a stack of dishes or a walk/don't walk sign switching from one mode to another after a set amount of time. Detail the steps of your algorithm in your post. As you detail the steps, make sure you break down each step fully. At a high level, explain how you would go about implementing the loop. Would you implement a while loop? A for loop? Would you make use of a "break statement?" Would your solution involve a nested loop?

The english alphabet contains 26 letters: 21 consonants (including y) and 5 vowels. The following scenario is inspired by the bath foam letters that are used by my toddler, here are the rules: • there is only 1 of each letter with equal probability of being chosen. • you will choose 4 letters at random without replacement and a word is formed in the order selected • a valid word must also have no more than 2 consonants in a row • words formed in this experiment may be valid under these rules even if they are not dictionary words in english What is the probability of selecting a valid word?

Consider the algorithm that puts minimal effort into splitting the list into one of size n − 1 and one of size one, but puts lots of effort into recombining the sublists. Also consider the algorithm that puts lots of effort into splitting the list into one of size n − 1 and one of size one, but puts minimal effort into recombining the sublists. What are these two algorithms? explain

Suppose we have a group of proposed talks with preset start and end times. Students of CSE340 were asked to design an algorithm to schedule as many of these talks as possible in a lecture hall, under the assumptions that once a talk starts, it continues until it ends, no two talks can proceed at the same time, and a talk can begin at the same time another one ends. Assume that talk j begins at time sj (where s stands for start) and ends at time ej (where e stands for end). One student proposed the algorithm shown in Algorithm 1 on the next page, which simply adds talks in order of earliest start time (smallest sj ). (a) Prove, using a counter example, that the proposed algorithm does not always produce an optimal schedule (i.e., a schedule with most possible talks). (b) Another student proposed adding talks in order of shortest duration (ej - sj ). Prove, using a counter example, that even with this new criteria, the algorithm does not always produce an optimal schedule.

You are given the midsem and endsem marks for the N Students in the course. A student P is said to dominate a student Q, if the midsem and endsem marks of P are both greater than the respective midsem and endsem marks of Q. Design an efficient algorithm for finding all the students that are not dominated by any other student in the class.

Suppose you have algorithms with five running times. Assume these are the exact running times. How much slower do each of these algorithms get when you (a) double the input or (b) increase the input size by one? Do both.  This problem requires discrete math. I solved all of these but I had a quick question. My teacher wanted us to use the big 0 notation for these running times, but the problem is that I'm not sure if that's necessary for these problems for the question it's asking. I tried to the big 0 notations for the first three. For (a) I got 8n3. Which I'm not sure is right. For example, for 1b I got 3n2 + 3n + 1 for how much slower these get from the original. Is that correct? Was I supposed to do something more for the big 0 notation. You can check to see if these answers are correct.  The big O notation formula is f(n) = 0(g(n)).  (a) n2  For double size I got 4n2. I got 2n + 1 from the input the size by one. I think that's all I need to do. I got similar answers for theother…

You are the TA for the FCP course in environment engineering. You are given the midsem and endsem marks for the N Students in the course. A student P is said to dominate a student Q, if the midsem and endsem marks of P are both greater than the respective midsem and endsem marks of Q. Design an efficient algorithm for finding all the students that are not dominated by any other student in the class. Analyse the time complexity as well

Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. One drew a shut polyline on a plane, that comprised distinctly of vertical and even sections (corresponding to the arrange tomahawks). The sections switched back and forth among flat and vertical ones (an even fragment was constantly trailed by an upward one, as well as the other way around). The polyline didn't contain severe self-convergences, which implies that in the event that any two fragments shared a typical point, that point was an endpoint for the two of them (kindly counsel the models in the notes area).    Sadly, the polyline was deleted, and you just know the lengths of the horizonal and vertical portions. Kindly develop any polyline coordinating with the portrayal with such sections, or establish that it doesn't exist.    Input    The primary line contains one integer t (1≤t≤200) — the number of experiments.    The primary line of each experiment contains one integer h…

Answer the following questions given the figure (topic is about the A* algorithm):Legend:P=Player/Starting pointO=ObstacleG=Goal Given the figure, do the following:1. Mark each cell with its heuristic function h, using the "as the bird flies" distance. Use integers only.2. Show how the player (P) will reach the goal (G). For every cell planned for the player movement, show the updates f,g,h of its non-obstacle neighbor cells.

an iterative algorithm for separating n VLSI chips into those that are good and those that are bad by testing two chips at a time and learning either that they are the same or that they are different. To help, at least half of the chips are promised to be good. Now design (much easier) a randomized algorithm for this problem. Here are some hints.Randomly select one of the chips. What is the probability that the chip is good?
How can you learn whether or not the selected chip is good?
If it is good, how can you easily partition the chips into good and bad chips?
If the chip is not good, what should your algorithm do?
When should the algorithm stop?
What is the expected running time of this algorithm?

Correct answer will be upvoted else downvoted. Computer science.    example of a chainword is the accompanying triple:    a line of m lowercase Latin letters;    the main clue: an arrangement of fragments with the end goal that the letters that compare to each portion spell a word from the word reference;    the subsequent clue: one more succession of portions with the end goal that the letters that relate to each section spell a word from the word reference.    Note that the successions of portions don't really need to be unmistakable.    Two occasions of chainwords are considered unique on the off chance that they have various strings, diverse first clues or distinctive second clues.    Count the number of various examples of chainwords. Since the number may be really huge, output it modulo 998244353.    Input    The primary line contains two integers n and m (1≤n≤8, 1≤m≤109) — the number of words in the word reference and the number of letter cells.    Every one of the following n…

Prove the correctness of the following pattern-matching algorithm. The input consists of a string S[1..n], and a pattern P[0..m − 1], where 1 ≤ m ≤ n. The algorithmlocates the first contiguous occurrence of the pattern P in the string S, that is, . = p if S[p..p + m − 1] = P, and . = n − m + 1 if the pattern P does not occur at all in the string S. function match(P, S, n, m) comment Find the pattern P[0..m − 1] in string S[1..n] 1. . := 0; matched := false 2. while (. ≤ n − m) ∧ ¬matched do 3. . := . +1; 4. r := 0; matched := true 5. while (r<m) ∧ matched do 6. matched := matched ∧ (P[r] = S[. + r]) 7. r := r + 1 8. return(.)

In the maze-solving program presented in this chapter, the program un marks each square as it retreats during its backtracking phase. Since this removes the marks from the blind alleys that the program tries along the way, this process ensures that the final path will be displayed correctly.. However, if the goal is to find the finish square in the shortest possible time, it is more efficient to leave these markers in place. Discuss how this change affects the efficiency of the algorithm. In what situations would this new approach improve the program's performance?

A men and women's assignment can be created using the postponed acceptance procedure. Members of one gender act as suitors in this algorithm, while members of the opposite gender act as suitees. Every suitor whose proposal was rejected in the previous round makes a proposal to his or her highest-ranking suitee who has not yet rejected this suitor in the algorithm's sequence of rounds. Except for the suitor who ranks highest among all the suitors who have proposed in this round or prior rounds, the suitees reject all the proposals. This highest ranking suitor's proposal is still pending and will be rejected if a more alluring suitor makes a proposal in a later round. The series of rounds ends when every suitor has exactly one pending proposal. All pending proposals are then accepted.a) Write the deferred acceptance algorithm in pseudocode.b) Show that the deferred acceptance algorithm terminates.c) Show that the deferred acceptance always terminates with a stable assignment

One-dimensional range searching can be done with O(N log N) steps for preprocessing and O(R+log N) for range searching, where R is the number of points actually falling in the range.

Consider the following algorithms for determining whether anyone in the room has the same marks as yours in DAA subject. Algorithm 1: You say your marks and ask whether anyone in the room has the same marks. If anyone does have the same marks, they answer yes. Algorithm 2: You tell the first person your marks and ask if they have the same marks; if they say no, you tell the second person your marks and ask whether they have the same marks; etc., for each person in the room. A. For each algorithm, what is the problem size? B. In the worst case, how many questions will be asked for each of the algorithms? Page 1 of 2 C. For each algorithm, say whether it is constant, linear, or quadratic in the problem size in the worst case.

6. There are currently several online newspapers in Bangladesh, such as prothom Alo, bdnews24, daily star, Bangla tribunes, etc. Suppose you have access to these online newspapers contest and want to group them into a set of articles about the same story (e.g., all the sports news of all these newspapers will appear in the same place). What type of algorithms will you use to perform such kind of operation above? What are the motivations for choosing your algorithm? Explain.

The Boyer-Moore algorithm is used to find the pattern P in the string T. What will be the values of i, j, T[i], and P[j] when we perform comparison number 5 by the algorithm. The first comparison is already given to you. 1 3 4 6 7 8 9 10 11 12 13 14 15 16 17 A i i t i w g a n g P = S t i Comparison # i T[i] Pi] 1 g 2 3 4 O 4,4,n,n 9, 5, space, g 15,5,i,g 8,5,n,g None of the above

A sorting algorithm is in O(n2) in the worst case. It takes 3 seconds to sort 10,000 records, i.e. n = 10,000.   What is the predicted time for the algorithm to sort 30,000 records? Suppose that you are presented with a machine that is 100 times as fast. How many records will you be able to process on the new machine in 3 seconds?

Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. You have n particular focuses (x1,y1),… ,(xn,yn) on the plane and a non-negative integer boundary k. Each point is a tiny steel ball and k is the draw in force of a ball when it's charged. The draw in power is something very similar for all balls.    In one activity, you can choose a ball I to charge it. When charged, all balls with Manhattan distance all things considered k from ball I move to the situation of ball I. Many balls may have a similar facilitate after an activity.    All the more officially, for all balls j with the end goal that |xi−xj|+|yi−yj|≤k, we dole out xj:=xi and yj:=yi.    An illustration of an activity. Subsequent to charging the ball in the middle, two different balls move to its position. On the right side, the red dab in the middle is the normal situation of those balls.    Your errand is to observe the base number of activities to move all balls to a similar…

Implement Queens algorithm: pre-cond: C = 1, c1, 2, c2, ... , r, cr  places the jth queen in the jth row and the cjth column. The remaining rows have no queen.post-cond: Returned if possible is a placement optSol of the n queens consistent with this initial placement of the first r queens. A placement is legal if no two queens can capture each other. Whether this is possible is flagged with optCost equal to one or zero.

You will analyze three algorithms to solve the maximum contiguous subsequence sum problem, and then evaluate the performance of instructor-supplied implementations of those three algorithms.  You will compare your theoretical results to your actual results in a written report. What is the maximum contiguous subsequence sum problem? Given a sequence of integers A1, A2, ..., An (where the integers may be positive or negative), find a subsequence Aj, ... , Ak that has the maximum value of all possible subsequences. The maximum contiguous subsequence sum is defined to be zero if all of the integers in the sequence are negative. Consider the sequence shown below.   A1:  -2  A2:  11  A3:  -4  A4:  13  A5:  -5  A6:   2 The maximum contiguous subsequence sum is 20, representing the contiguous subsequence in positions 2, 3, and 4 (i.e. 11 + (-4) + 13 = 20).  The sum of the values in all other contiguous subsequences is less than or equal to 20. Consider a second sequence, shown below.   A1:   1…

Given: NFA 1 q4 q3 q2 Using State Elimination Method, construct the regular expression equivalent to the given NFA. Add new start state q0 and new final state q1. Eliminate state q2 first, then state q3, then state q4, and state q5 last. Upon elimination of the four (4) states, the regular expression RE equivalent to the given NFA is Sample Answer: 10*(10)* NOTE: In your answer just use the exact number of parenthesis. That is, do not use extra parenthesis in your answer.

Computer Science Given a dataframe with two columns (x and y), I have found a function on Python that gives a local fit value (essentially between two set values x it gives the average of all values of y). Now the questions asks us to create 2 graphs - one that shows the average per value of x and another one that shows the difference to that average that we found. What does this mean?

Create a simple matching algorithm for a round robin competition. in which the number of participants is n (1  n) and the round index is r (0  r  2  (n  1)/2.out: When i = 0,..., n/2  1, a sequence R of n player indices signaling the match pairings between players R2i and R2i+1; if n is odd, Rn1 denoting the resting player

Z = 1 Consider line function f(x,y) = 3x – 2y - 6+ Z, where Z is your student number mod 3. a) By using DDA algorithm, b) By using Bresenham algorithm, Show your steps and find the pixels to be colored between x = -1 and x=(4+Z).

Researchers are trying to use machine learning algorithms to make redistricting more equitable and efficient. For a sample of six zones (labelled Z1-Z6), each zone can be described by at least one letter (A-F), which is a qualitative measure of that zone. One part of the algorithm is to output a potential district layout, which can only happen if each zone can be matched to exactly one letter.Consider the following descriptions for one sample of six zones: Z1 matches B or D; Z2 matches C, E, or F; Z3 matches A or F; Z4 matches B or D; Z5 matches C or F; and Z6 matches D.(a)  Draw the bipartite graph that models the zones (Z1-Z6) and the letters they match (A-F).(b) Use Hall’s theorem to determine if algorithm will be able to successfully create a district layout.

A computer science student designed two candidate algorithms for a problem while working on his part-time job The time complexity of these two algorithms are ?1(?) = 3 ? log ? and ?2(?) = ? 6/5a) Which algorithm is better? Why?b) If we run both algorithms at the same time with an input size of 105 which algorithm produces results faster than the other one? Why?