3 Problems, first 2 are in C regarding Radix sort. Third one is in python regarding Abstract Syntax...

Question

3 Problems, first 2 are in C regarding Radix sort. Third one is in python regarding Abstract Syntax Tree, solution is provided as pseudocode. Need to convert it to a workable program.Microsoft Word - radixsort.docx Objectives 1. To learn how to sort integers using radix sort. 2. To gain more experience with bit-wise operations in C programs. 3. To gain better understanding on the binary representation of integers and float point numbers. Problem 1 Write a C program that sorts the unsigned integers provided through user inputs (not from the command line). Your program can assume that the count of the integers is not greater than 100, and each integer is 4-byte long. Problem 2 Write a C program that sorts the real numbers provided through user inputs (not from the command line). Your program can assume that the count of the real numbers is not greater than 100. The real numbers can be processed as 4-byte float point numbers. Note that the numbers may be a mixture of positive numbers and negative numbers. Instructions The program should ask user for a count before it reads into the numbers. For saving the numbers and for the buckets, your program can use arrays, and the size of each array or bucket is 100. Another choice for this is to allocate 3 pieces of memory spaces using malloc() calls based on the count. Then, in a loop, the program asks user for the numbers (scanf("%d", …) or scanf("%d", …)), and save the numbers in an array or one piece of the memory space. When sorting the numbers, use binary representation and bitwise operations to extract bits and then use the value of the bits as bucket indexes. DO NOT translate the numbers into strings (e.g., strings consist of ‘1’s and ‘0’s, or strings consist of digit characters like “31415926”), because this unnecessarily increases programming complexity and computation workload. DO NOT extract digits and use digits as bucket indexes. For example, the following code extracts a digit from num and use the digit as bucket index (buck_idx) in round rnd_idx. This method CANNOT be used in your program, because it is also much more costly than extracting bits. buck_idx=(num /pow(10, rnd_idx)) % 10; The program prints out the sorted numbers with one number on each line. Applying bitwise operations directly to floating point numbers is not allowed in C. To apply bitwise operations on floating point numbers, your program needs to “instruct” the system to interpret the data as unsigned integers, which have the same length as floating point numbers. You can do this with typecasting using a pointer (check the related slides). This is also illustrated using the following example. float f=123.45; unsigned int *p = (unsigned int *) &f, value_of_bits4to7 = (*p & 0xF0)>>4; Analyzing the following program and its output will also help you understand how to radix-sort float point values. #include  main(){ int i; float value, f[20]; /* typecasting using a pointer */ unsigned int *p = (unsigned int *) f; value = -10.5; for( i = 0; i >16); /* show the float point numbers (column 1) and the corresponding · unsigned int values (column 2). Bit-wise operations are used to · obtain the last column, showing that bit-wise operations can be · used after typecasting float point numbers to unsigned integers. */ } Check the output of the program. The first column shows float point numbers in ascending order. Check column 2, which shows that sorting the corresponding unsigned int values in ascending order is not enough to ensure that the float point values are also in ascending order. By checking column 2, you can understand better the two methods for sorting float point numbers in the slides. Testing Test your programs manually first. Manually type in inputs, and check output. To fully test your programs with more numbers, modify and use the following scripts. $1 of the script is the count. Take screenshot when you test your programs manually, such that we can see the numbers provided to the programs and the output of the programs. Bash script for testing the program radix-sorting unsigned integers: #!/bin/bash count=$1  rm input rm your_output rm standard_output echo "================== input ======================" echo ${count} | tee input for (( i=0; i standard_output echo "====== differences from correct result =======" diff	your_output	standard_output Bash script for testing the program radix-sorting float point numbers: #!/bin/bash count=$1  rm input rm your_output rm standard_output echo "================== input ======================" echo ${count} | tee input for (( i=0; i standard_output echo "====== differences from correct result =======" diff	your_output	standard_output Problem 3  This program parses and evaluates infix arithmetic expressions: parse-exp-value-loop.py Combine this with the Node class from the first assignment, and re-implement the back-end functions to build an Abstract Syntax Tree (AST) from the parse of the infix input expression. Use the functions you wrote in the first assignment to print the four different representations of the AST. Implement another function named eval() that takes the root node of an AST as input and returns the value of the expression. In addition to the four representations, also print the value of the expression.   Solution for Assignment 1:    Pseudocode for Eval, with a note about data types:    ''' This program implements a recursive descent parser for the CFG below: Syntax Rule  Lookahead Set          Strings generated ------------------------------------------------------------ 1  → {+ | -} 2  → {* | /} 3  → () |  ''' import math class ParseError(Exception): pass #============================================================== # FRONT END PARSER #============================================================== i = 0 # keeps track of what character we are currently reading. err = None #--------------------------------------- # Parse an Expression    → {+ | -} # def exp():     global i, err     value = term()     while True:         if w[i] == '+':             i += 1             value = binary_op('+', value, term())         elif w[i] == '-':             i += 1             value = binary_op('-', value, term())         else:             break     return value #--------------------------------------- # Parse a Term    → {+ | -} # def term():     global i, err     value = factor()     while True:         if w[i] == '*':             i += 1             value = binary_op('*', value, factor())         elif w[i] == '/':             i += 1             value = binary_op('/', value, factor())         else:             break     return value #--------------------------------------- # Parse a Factor    → () |   #        def factor():     global i, err     value = None     if w[i] == '(':         i += 1          # read the next character         value = exp()         if w[i] == ')':             i += 1             return value         else:             print('missing )')             raise ParseError     elif w[i] == 'pi':         i += 1          # read the next character         return math.pi     else:         try:             value = atomic(w[i])             i += 1          # read the next character         except ValueError:             print('number expected')             value = None          #print('factor returning', value)          if value == None: raise ParseError     return value #============================================================== # BACK END PARSER (ACTION RULES) #============================================================== def binary_op(op, lhs, rhs):     if op == '+': return lhs + rhs     elif op == '-': return lhs - rhs     elif op == '*': return lhs * rhs     elif op == '/': return lhs / rhs     else: return None def atomic(x):     return float(x) w = input('
Enter expression: ') while w != '':     #------------------------------     # Split string into token list.     #     for c in '()+-*/':         w = w.replace(c, ' '+c+' ')     w = w.split()     w.append('$') # EOF marker     print('
Token Stream:     ', end = '')     for t in w: print(t, end = '  ')     print('
')     i = 0     try:         print('Value:           ', exp()) # call the parser     except:         print('parse error')     print()     if w[i]

Swapnil · Accepted Answer

87129/1.c
#include 
int main(int argc, char* argv[])
{
	char const* const fName = argv[1];
	FILE* file = fopen(fName, "r");
	char l[256];
	uint32_t pArray[256];
	int cmpr(const void *a, const void *b)
	{
		const unsigned long long *x = a, *y = b;
		if(*x > *y)
		return 1;
		else
		return(*x 
int main()
{
	int ar, br, cr;
	float exchng, desc[100];
	printf("Enter How many elements to sort : 
");
	scanf("%d", &ar);
	printf("Enter %d Real numbers 
", ar);
	for (br=1; br desc[cr])
			{
				exchng = desc[br];

Microsoft Word - radixsort.docx Objectives 1. To learn how to sort integers using radix sort. 2. To gain more experience with bit-wise operations in C programs. 3. To gain better understanding on the...

Answer To: Microsoft Word - radixsort.docx Objectives 1. To learn how to sort integers using radix sort. 2. To...

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment