Search & Filtering
Suppose that you have a computer with a memory unit of 24 bits per word. In this computer, the assembly program’s instruction set consists of 198 different operations.
All instructions have an operation code part (opcode) and an address part (allowing for only one address).
Each instruction is stored in one word of memory.
a. How many bits are needed for the opcode?
b. How many bits are left for the address part of the instruction?
c. How many additional instructions could be added to this instruction set without exceeding the assigned number of bits? Discuss and show your calculations.
d. What is the largest unsigned binary number that the address can hold?
b) Add a screenshot of the simulation, showing the result (A screenshot of the MARIE Simulator window after running the program).
Instructions:
- Use “ORG” instruction to start your program at address equivalent to 25610.
- Use your last university ID number to input the value of X. For example, if your ID is1915161678234, then you will use the number 4 as the value of x.
- Do not forget to change the representation of the Input and Output windows in the simulator to Decimal.
a) Write an assembly program using MARIE's assembly Instruction set that prompts the user to enter a non-negative integer that is less than 10. The program should include a subroutine that keeps prompting until a valid value is obtained. When a valid number is entered, it will be displayed. (Hint: Use JNS & JUMPI instructions to implement the subroutine)
N.B: You should include the MARIE code in your Answer, with an explanation of each instruction in your code beside it (not a screenshot!). Example: Subt One /Subtract 1 from AC
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. For example, 12321 is a palindrome number.
Follow up: Could you solve it without converting the integer to a string?
Create a class named Palindrome which will contain the main method. All your code goes in the main method.
Sample Input and output:
Example 1:
Input: x = 121
Output: true
Example 2:
Input: x = -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome
Example 3:
Input: x = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
Example 4:
Input: x = -101
Output: false
Example 5:
Input: x = 3
Output: true
Write a java code that prompts the user to input a non-negative integer and then it will reverse the same number using a while loop. For example, if the input number is 25 the output should be 52.
Sample input and output:
Example 1:
Input: 25
Output: 52
Example 2:
Input: 123
Output: 321
Example 3:
Input: 3
Output: 3
Using the Internet and any other appropriate sources, conduct further research into each of the following hosting solutions for Internet deployment:Host the system on the company’s own servers;Contract with a hosting company for a virtual server;Go to Amazon’s cloud.Using any application and format of your choice, draft a proposal in which you:Briefly describe the system requirements of the company;List the advantages and disadvantages of each potential solution.Recommend which solution you believe would be most appropriate for this small start-up company. Make sure that you justify your recommendation.Save your proposal or the link to it if you created it online. Make sure that you include your surname and student number in the filename.
Write a program to find the table of numbers using a while loop. Your program should ask the
size of the table. That size defines the rows and columns. Sample output:
Enter size: 6
1 2 3 4 5 6
------------------------------------------
1* 1 2 3 4 5 6
2* 2 4 6 8 10 12
3* 3 6 9 12 15 18
4* 4 8 12 16 20 24
5* 5 10 15 20 25 30
6* 6 12 18 24 30 36
. Write a program for: search(LA,ITEM) in Java
1. Search whether the user's entered item is exist or not in the array if exist perform following
2. Print two right neighbors(item/value) in case no right neighbor print message 'no right neighbor'
3. Print two le neighbors(item/value) in case no le neighbor print message 'no le neighbor
Write a program for: insert(LA, K, ITEM )
1. K is not out of range
2. Item must be posive integer
3. Check user's entered ITEM at index K is greater or less than in an array at index K, if less than insert it into the array otherwise not perform any operaon, and prints the message 'ITEM’ at index k is greater than user's entered ‘ITEM'
Given a directed graph G with the set of edges E = { (1, 2), (2, 4), (4, 2) (4, 1)} what will be the set of edge of it transpose
