Alert dont submit AI generated answer. Consider the following page reference string: 1, 2, 3,3, 4, 7, 1, 5, 6, 1,2,3,7 ,6,3,2,1,2,3,6How many page faults would occur for the following replacement algorithms: • LRU replacement • FIFO replacement • Optimal replacement (Remember that all frames are initially empty, so your first unique pages Pick a number between 3 and six and illustrate out LRU, FIFO and Optimal page replacement for that many pages for the given reference string.

Draw the state of the array after a first pass of a shellsort with gap size 5, and then again after a second pass with gap size 3.

Given 3 strings, compare the all corresponding characters of all 3 strings and return similar characters at the similar indexs. The length of the strings could be different. getSimilars("ab", "ab", "ab")→ "ab" getSimilars("ab", "ac", "ad")→ "a" getSimilars("a", "ab", "abc") → "a" Go ...Save, Compile, Run (ctrl-enter)

# pyspark # picture attached Given a decomposed separable filter: ⎡⎣⎢⎢121⎤⎦⎥⎥ * [−101] ⎣⎢⎡​121​⎦⎥⎤​∗[−1​0​1​] and part of an image: ⎡⎣⎢⎢115124170656067120100114103898710111075⎤⎦⎥⎥ ⎣⎢⎡​115124170​656067​120100114​1038987​10111075​⎦⎥⎤​ Apply this filter to an image (to 3 consecutive pixels with stride 1 and no padding). Find $\max(r) - \min(r)$, difference between maximum and minimum values of a filtered image

Question 12 Use the following graph to trace the execution of Dijkstra's algorithm as it finds the shortest path from vertex A to all the other vertices. Draw the resulting vertex-weighted graph and use it to answer the following: (a) List the vertices of the resulting graph along with the cost of reaching each one from the starting vertex in the form: V1: Cost, V2: Cost, etc. (b) List the actual edges that are followed to obtain the costs listed in (a) above in the form: (V1, V2), (V3, V4), etc. Note: In tracing the algorithm, if at any time you encounter more than one vertex with minimal cost, you must finalize the first one alphabetically. E 6. F 8. hp 144 IOI