20 pts) write pseudocode for a modified version of counting sort, called progressive-counting-sort, that can sort the entire sequence s in o(m + k). here, assume that the output array b is of size m. hint: use array indexing to make room for the values of the new chunk. (b) (20 pts) assume that the values in s are uniformly distributed between 0 and 1. write pseudocode for a sorting algorithm that combines bucket sort and the merge procedure of merge-sort, called merge-bucket-sort, that can sort the entire sequence s with average complexity o(m). here, the array of bucket lists can hold up to n elements at a time in total. as before, assume that the final output array can hold m elements. you can use as many auxiliary arrays as you need to merge the new chunk with the previous ones.

Which part of the cpu accepts data?

You need to design a circuit that implements the functions in the following table: s0 s1 function0 0 a + 10 1 a – b1 0 a + b1 1 a – 1s0 and s1 are 1-bit control inputs to select the function of the circuit. inputs a and b are 4-bitnumbers in 2s complement form. the output is also a 4-bit number in 2s complement form.you are allowed to use only one ttl 7483 4-bit adder to implement all the functions. but anynumber of other components (except the adder) can be used.hint: design a combinational logic circuit to modify the input b and the “carry input” of theadder depending on the control inputs s0 and s1.important: lab grade will depend on the working of the circuit & will be checked of by your labinstructor.1. is the output valid for the following input combinations: a. s0 = 0, s1 = 0, a = 7, b = 3? b. s0 = 0, s1 = 1, a = 7, b = 3? c. s0 = 1, s1 = 0, a = -4, b = -5? d. s0 = 1, s1 = 1, a = -8, b = 6? 2. what is the range of inputs (for both a and b) that will produce the valid output for all the functions?

Best laptops for college [$100-$500 range]?