Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

package unl.cse.stacks; import java.io.File; import java.io.FileNotFoundExceptio

ID: 3569416 • Letter: P

Question

package unl.cse.stacks;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

/**
* A basic JSON validator. This validator only checks that the JSON file is
* well-balanced: that all opening brackets have a corresponding closing bracket
* and that they follow legal nesting rules.
*
*/
public class JsonValidator {

   public static void validate(String jsonString) {
       //TODO: implement this function
   }
  
   public static String getFileContents(String fileName) {
       StringBuilder sb = new StringBuilder();
       Scanner s = null;
       try {
           s = new Scanner(new File(fileName));
       } catch (FileNotFoundException e) {
           throw new RuntimeException(e);
       }
       while(s.hasNext()) {
           sb.append(s.nextLine());
       }
       s.close();
       return sb.toString();
   }
  
   public static void main(String args[]) {
       String jsonFileName = "data/data001.json";
       String jsonString = getFileContents(jsonFileName);
       validate(jsonString);
   }
}

Explanation / Answer

A=0;
x=0;
n=input('How many variables=');
disp('Enter the coefficients along with constants For instance if x+y+3z=-5 then enter 1 1 3 -5 each number followed by an enter not space');
for i=1:n
   for j=1:n+1
       A(i,j)=input('');
   end
end
%pivoting
for i=1:n-1
   for j=i+1:n
       if abs(A(j,i))>abs(A(i,i))
           T=A(j,:);
           A(j,:)=A(i,:);
           A(i,:)=T;
       end
   end
end
disp('After pivoting');
disp(A);
for k=1:n-1
   for i=k+1:n
       m=A(i,k)/A(k,k);
       for j=k:n+1
           A(i,j)=A(i,j)-m*A(k,j);
       end
   end
end
disp('Triangularize Form ');
disp(A);
           
if A(n,n)==0
   disp('No unique solution');
end
   x(n)=A(n,n+1)/A(n,n);
   for j=n-1:-1:1
       sum=0;
   for i=1:n
       sprintf('x%.0f=%.10f',i,x(i))
   end
       

       for i=1:n-j
           sum=sum+A(j,n+1-i)*x(n+1-i);
       end
       x(j)=(A(j,n+1)-sum)/A(j,j);
   end