Problem D. Greatest Input file: Output file: standard input standard output 2 seconds Time limit: Memory limit: 64 megabytes You are given an even number N and an integer K and you have to find the greatest odd number M less than N such that the sum of digits in binary representation of M is at most K. Input 2 numbers. Output 1 number Examples standard input standard output 10 2 25 1 Note For case when N = 10, K = 2. Binary representation of 10 is 1010 and binary representation of 9 is 1001, hence greatest odd number less than 10 whose sum of digits in its binary representation is at most 2 is 9. Hence output is 9.

C++ Problem!! Sort A List Of Integers Given a file of 100,000 unsorted integers, write a program that first prompt user to enter file name and reads those integers into an array and sorts the integers in the array. The program should then prompt the user for an index, and then display the integer at that index.  For example, if the array contains ten integers and the contents are 79  4  42  51  12  22  33  17  91  10 after sorting, the integer at index 6 is 42 Download the "List of 100,000 Unsorted Integers" from below link and sort that list, then enter the value at index 10000 (ten thousand) for a screenshot. https://1drv.ms/t/s!AuFS4mkcuYyBjHZ_SIudb93bq2uy?e=CsyvZj

Write pseudocode to solve the following problem. Must use iterative dynamic programming (tabulation) and run in O(n) time. Input: positive integer n Output: two non-negative integer x and y where n = x185 + y120 Example: if n=1230 then x=6 and y=1 (1314 = 6(185) + 1(120))

Assume we are running code on a 7-bit machine using two's complement arithmetic for signed integers. A "short" integer is encoded using 3 bits. Fill in the empty boxes in the table below. The following definitions are used in the table: short sy = -3; int y = sy; int x = -12; unsigned ux = x; Note: You need not fill in entries marked with "-". Expression Decimal Binary Zero -8 10 0110 ux y x >> 2 ux & y TMax TMax + TMin

An interesting application of a PLA is conversion from the old, obsolete punched cards character codes to ASCII codes. The standard punched cards that were so pop- ular with computers in the past had 12 rows and 80 columns where holes could be punched. Each column corresponded to one character. so each character had a 12-bit code. However, only 96 characters were actually used. Consider an application that reads punched cards and converts the character codes to ASCII. a. Describe a PLA implementation of this application. b. Can this problem be solved with a ROM? Explain.