Display student class details “HashMap” and “ArrayList” Program Plan: Import required package. Define “StudentIDsListTest” class. Define main function. Create hashmap for student ID and course number. Create an object for scanner class. Declare required variables. Display prompt statement. Performs “do-while” loop. This loop will execute until “studID” is not equal to “-1”. Read student ID from user. If student ID is not equal to “-1”, then read course number from user. If the student ID is contains in “students” list, then Create array list named “class_List”. Add the course number to “class_List” using “add” method. Map the student ID to course number using “put” method. Otherwise, Create array list named “class_List”. If the course number is not in the class list, then add the given course number to “class_List” using “add” method. Display all the classes for each student using “for” loop. Create array list named “stud_List”. Display course number for corresponding student ID.

Question

Write a C program using embedded assembler with a function to convert a digit (0 – 15) to the corresponding ASCII character representing the value in hexadecimal. For numbers 0 – 9, the output will be the characters '0' – '9', for numbers 10 – 15 the characters 'A' – 'F'. The entire core of the program must be written in symbolic instruction language; arrays may not be used. You may only use C to print the result. Tip: This piece of C program will do the same thing: character = number < 10 ? number + '0' : number + 55; As a basis, you can use this program again , which increments a variable. Just replace the INC instruction with ADD and add a test (CMP) with some conditional jump.

Answer 1

Question

Chapter 12, Problem 15PP

Program Plan Intro

Display student class details “HashMap” and “ArrayList”

Program Plan:

Import required package.

Define “StudentIDsListTest” class.

Define main function.

Create hashmap for student ID and course number.

Create an object for scanner class.

Declare required variables.

Display prompt statement.

Performs “do-while” loop. This loop will execute until “studID” is not equal to “-1”.

Read student ID from user.

If student ID is not equal to “-1”, then read course number from user.

If the student ID is contains in “students” list, then

Create array list named “class_List”.

Add the course number to “class_List” using “add” method.

Map the student ID to course number using “put” method.

Otherwise,

Create array list named “class_List”.

If the course number is not in the class list, then add the given course number to “class_List” using “add” method.

Display all the classes for each student using “for” loop.

Create array list named “stud_List”.

Display course number for corresponding student ID.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

Write a C program using embedded assembler with a function to convert a digit (0 – 15) to the corresponding ASCII character representing the value in hexadecimal. For numbers 0 – 9, the output will be the characters '0' – '9', for numbers 10 – 15 the characters 'A' – 'F'. The entire core of the program must be written in symbolic instruction language; arrays may not be used. You may only use C to print the result. Tip: This piece of C program will do the same thing: character = number < 10 ? number + '0' : number + 55; As a basis, you can use this program again , which increments a variable. Just replace the INC instruction with ADD and add a test (CMP) with some conditional jump.

Answer the question fully and accurately by providing the required files(Java Code, Two output files and written answers to questions 1-3 in a word document)meaning question 1 to 3 also provide correct answers for those questions.(note: this quetion is not graded).

.NET Interactive Solving Sudoku using Grover's Algorithm We will now solve a simple problem using Grover's algorithm, for which we do not necessarily know the solution beforehand. Our problem is a 2x2 binary sudoku, which in our case has two simple rules: •No column may contain the same value twice •No row may contain the same value twice If we assign each square in our sudoku to a variable like so: 1 V V₁ V3 V2 we want our circuit to output a solution to this sudoku. Note that, while this approach of using Grover's algorithm to solve this problem is not practical (you can probably find the solution in your head!), the purpose of this example is to demonstrate the conversion of classical decision problems into oracles for Grover's algorithm. Turning the Problem into a Circuit We want to create an oracle that will help us solve this problem, and we will start by creating a circuit that identifies a correct solution, we simply need to create a classical function on a quantum circuit that…