Question

1. Design an algorithm to find all the non-common elements in two sorted lists of numbers. What is the maximum number of comparisons your algorithm makes if the lengths of the two given lists are m and n, ?respectively 2. Estimate how many times faster it will be to find ged(98765, 56789) by Euclid's algorithm compared with the algorithm based on checking consecutive integers from min{m, n} down to gcd(m, n). 3. For each of the following functions, indicate how much the function's value will change if its argument is increased five- fold. 4. Write Java or Python program that finds the binary representation of a positive decimal integer.

Answer 1

Ans 92 - Algorithm to find non-common element in two sorled list g numbers. What is the maximum number of comparison your algorithm makes if the length of the two ginen list are m and n resp. ? The maximum number of comparison an algorithm takes is equivalent to taceat value between m andn let's suppose we have two list list LL and list L2 here the maximum comparison would require is 4 21-> [112] 3410 12 → LO 11-12 will start comparing both the list jp (LL = = 12 ) mcrement LL. and L2 and again goes 765 compcritthu ebe. put element in array or keep in non common Element arrcy; and whose element is smau we will move for coond to next element in that list and compone with the last element of the other list lajier while toob while (.11 ) = NULL 11 L2 !=NULL) (LLE NULL) { if fill = =+22). ? append au element quin array.com { LL-Ll+l; z non common element ? L2-L2+1 ebe ébe if {ALL <* L2) Keep him keep LL in sponde { append all element - 1 LL=24tts. get az inanay } else { L2 = 12 + 1; } non common flemy } nos LLLL LOWY L2 inama om merement comes.

04 pyllen code to find bmory topselection - decimal nimbul som der Decimal Toßmany (num): :נל ווטן * Decimal To Bincny ( num 1/2) point I num%2, end ='') #Driver code if name = 'main dec.-val =24 Decimdi To B many dec_val), output; 11000

02 Sofumon! By Euclid's Algorithm, G1CD Covic) befr in fine steps comparison for any number, but by minim,n) method it w could tako more componisian Dioration to find god If the difference- beliveon two numbers (m, n) is more, GX By mm (m,n) methot By Eudid's Algo nu minco, b) I mit euclid (jot a, ints) Lohilela !-b) int if (axb) 11 loop till remainder is 30ro a = 9-b; While 670) else bab-a; r=a%b; a=b; returna b=r, return a