write and describe code

import java.util.*; import java.io.BufferedReader; import java.io.FileNotFoundException; import java.io.FileReader; import java.io.IOException;

public class InfixtoPrefix {

public static String infixToPrefix(String infix) { // write your code here

}

public static void main(String[] args) {

try { String sCurrentLine; // read the input file in1.txt BufferedReader br = new BufferedReader(new FileReader("in1.txt")); System.out.println("reading input file: in1.txt"); while ((sCurrentLine = br.readLine()) != null) { String prefix = infixToPrefix(sCurrentLine); System.out.println("Infix notation " + sCurrentLine + " in Prefix notation is " + prefix); }

} catch (FileNotFoundException e) { e.printStackTrace(); } catch (IOException e) { e.printStackTrace(); } } }

explain your answers

Consider the following contract specification for the static method smooth

* * @replaces s2

* @requires |s1| >= 1

* @ensures

* |s2| = |s1| - 1 and * for all i, j: integer, a, b: string of integer * where (s1 = a * * * b) * (there exists c, d: string of integer * (|c| = |a| and * s2 = c * * d)) * */ public static void smooth(Sequence s1, Sequence s2) {...} Answer the following questions.

1. Suppose seq1 = , seq2 = . What are the values of seq1 and seq2 after the call smooth(seq1, seq2)?

2. Suppose seq1 = , seq2 = . What are the values of seq1 and seq2 after the call smooth(seq1, seq2)?

need all questions answered Write program that prints your full name.

Write program to test truth value of logical connectives.

a program to check equality of two sets.

Program to calculate the summation from 1-10

A C program uses the

line buf = (char *) malloc((n+7) >> 3);

in order to allocate an d n 8 e-bytes long memory buffer, large enough to receive n bits of data, where n is an unsigned integer type. (i) How could this line represent a security vulnerability

write program to input and print whether a number is negative or positive

(b) A noisy binary communication channel randomly corrupts bits with probability p, so its channel matrix is: 1 - P P p 1- p (f) If the input bit values {0,1} are equiprobable, what is the mutual information between the input and output for this noisy channel? (2 marks] (ii) What is the channel capacity of this noisy channel? [1 mark] (in) If an error-correcting code were designed for this noisy channel, what would be the maximum possible entropy of an input source for which reliable transmission could still be achieved? Express your answer in terms of p. [1 mark]