How many searches should you complete when looking up information using online references?

DES works by using the same key to encrypt and decrypt a message, so both the sender and the receiver must know and use the same private key. Once the go-to, symmetric-key algorithm for the encryption of electronic data, DES has been superseded by the more secure Advanced Encryption Standard (AES) algorithm.

8 0

2 years ago

Part 1: Create an application that allows you to enter student data that consists of an ID number, first name, last name, and gr

aleksley [76]

PART A

import java.io.*;

import java.util.Scanner;

public class StudentsStanding {

private static final double CUT_OFF = 2.0;

public static void main(String[] args)

{

try {

PrintWriter goodFile = new PrintWriter(new FileWriter("goodStanding.txt"));

PrintWriter probationFile = new PrintWriter(new FileWriter("probation.txt"));

char choice;

String firstName,lastName;

Scanner input = new Scanner(System.in);

int id;

double gradePoint;

do {

System.out.print("Enter student Id: ");

id = input.nextInt();

input.nextLine();

System.out.print("Enter First name: ");

firstName = input.nextLine();

System.out.print("Enter last name: ");

lastName = input.nextLine();

System.out.print("Enter grade point: ");

gradePoint = input.nextDouble();

if(gradePoint<CUT_OFF)

probationFile.println(id+","+firstName+","+lastName+","+gradePoint);

else

goodFile.println(id+","+firstName+","+lastName+","+gradePoint);

System.out.print("Do you want to continue..(y/n): ");

choice = input.next().toLowerCase().charAt(0);

}while (choice!='n');

//close the streams

goodFile.close();

probationFile.close();

}

catch (IOException ex)

{

System.err.println("IO Exception occurs...");

}

PART 2

import java.io.File;

import java.io.FileNotFoundException;

import java.util.Scanner;

public class StudentsStanding2 {

private static final double CUT_OFF = 2.0;

public static void main(String[] args)

{

String header = "ID\t"+"First Name"+"\t"+"Last Name"+"\t"+"Grade Point"+"\t"+"Exceeds/Fall\n";

try {

Scanner probationFile= new Scanner(new File("probation.txt"));

Scanner goodFile = new Scanner(new File("goodStanding.txt"));

System.out.println("Cut Off is: "+CUT_OFF);

System.out.println(header);

double point ,exceed;

while (probationFile.hasNextLine())

{

String[] tokens = probationFile.nextLine().split(",");

point = Double.parseDouble(tokens[3]);

exceed = CUT_OFF-point;

System.out.println(String.format("%4s %7s %10s %10s %10s",tokens[0],tokens[1],tokens[2],point,String.format("%.2f",exceed)));

}

//Close the stream

probationFile.close();

while (goodFile.hasNextLine())

{

String[] tokens = goodFile.nextLine().split(",");

point = Double.parseDouble(tokens[3]);

exceed = point - CUT_OFF;

System.out.println(String.format("%4s %7s %10s %10s %10s",tokens[0],tokens[1],tokens[2],point,String.format("%.2f",exceed)));

}

goodFile.close();

}

catch (FileNotFoundException ex)

{

System.err.println("File not found!!!");

}

6 0

2 years ago

Direct Mapped Cache. Memory is byte addressable. Fill in the missing fields based upon the properties of a direct-mapped cache.

xz_007 [3.2K]

The question given is incomplete and by finding it on internet i found the complete question as follows:

Direct Mapped Cache.

Memory is byte addressable

Fill in the missing fields based upon the properties of a direct-mapped cache. Click on "Select" to access the list of possible answers Main Memory Size Cache Size Block Size Number of Tag Bits 3 1) 16 KiB 128 KiB 256 B 20 2) 32 GiB 32 KiB 1 KiB 3) 64 MiB 512 KiB 1 KiB Select] 4 KiB 4) 16 GiB 10 Select ] Select ] 5) 10 64 MiB [ Select ] 6) Select] 512 KiB 7

For convenience, the table form of the question is attached in the image below.

Answers of blanks:

1. 3 bits

2. 20 bits

3. 64 MB

4. 16 MB

5. 64 KB

6. 64 MB

Explanation:

Following is the solution for question step-by-step:

Part 1:

No. of Tag bits = No. of bits to represent