Student information is stored in a data area, and each student entry is formatted as follows: The first nine bytes are the student ID in ASCII format. The following byte is the course score. The following phrase is the section identifier. There are over 300 such student records in memory, which have been loaded consecutively beginning at address $10000. To indicate the conclusion of the records, the last record loaded is a dummy record with a section identifier of $FFFF. Create an assembler subroutine GetMax that searches the complete list for the highest mark. If there is a tie, the student with the highest score on the list should be found. The beginning address of the subroutine should be returned.

Student information is stored in a data area, and each student entry is formatted as follows: The first nine bytes are the student ID in ASCII format. The following byte is the course score. The following phrase is the section identifier. There are over 300 such student records in memory, which have been loaded consecutively beginning at address $10000. To indicate the conclusion of the records, the last record loaded is a dummy record with a section identifier of $FFFF. Create an assembler subroutine GetMax that searches the complete list for the highest mark. If there is a tie, the student with the highest score on the list should be found. The beginning address of the subroutine should be returned.

Name: Student information is stored in a data area, and each student entry i
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Student information is stored in a data area, and each student entry is formatted as follows:The first nine bytes are the student ID in ASCII format.The following byte is the course score.The following phrase is the section identifier.There are over

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 19SA

See similar textbooks

Similar questions

Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifierThere are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records.Write an assembler subroutine GetMax that will scan the entire list and find the highest mark. If there is a tie, the first student in the list with the highest mark should be found. The subroutine should return the starting address of this record in address register a3.
Suppose that a 2 MB file consisting of 512-byte logical blocks is stored on a disk drive with the following characteristics: Parameter Value Rotational rate 15,000 RPMTavg seek 4 msAverage number of sectors/track 1,000Surfaces 8Sector size 512 bytes For each case below, suppose that a program reads the logical blocksof the file sequentially, one after the other, and that the time to positionthe head over the first block is Tavg seek + Tavg rotation .A. Best case: Estimate the optimal time (in ms) required to readthe file over all possible mappings of logical blocks to disksectors. B. Random case: Estimate the time (in ms) required to read thefile if blocks are mapped randomly to disk sectors.
Read question properly and give correct answer fastttt within 30 minutes.... will upvote Answer the questions below using the following information: Consider a disk with block size B = 512 bytes. A block pointer is P = 6 bytes long, and a record pointer is PR = 7 bytes long. A file has r = 30,000 EMPLOYEE records of fixed length. Each record hs the following fields: Name (30 bytes), SSN (9 bytes), Department_code (9 bytes), Address (40 bytes), Phone (9 bytes), Birth_date (8 bytes), Sex (1 byte), Job_code (4 bytes), Salary (4 bytes, real number). An additional byte is used as a deletion marker. Suppose that the file is not ordered by the key field SSN and we want to construct a B+-tree access structure (index) on SSN. Calculate: The orders p and pleaf of the B+-treeThe number of leaf-level blocks needed if blocks are approximately 69 percent full (rounded up for convenience)The number of levels needed if internal nodes are also 69 percent full (also rounded up)The total number of blocks…
SAME PARAMETERS: In the RENTALS table shown in fig 2, 40 customers have created 50 rental contracts over time. A RENTALS record is 122 bytes and the block size for your OS is set to 1024 bytes with each block having a 1 byte pointer to the next written block as well as a 1 byte pointer to the next physically consecutive block. Assuming spanned organization, how many blocks do you estimate the RENTALS file is using at its current size? multiple choice a.50 b.6 c.400 d.7
1. In a certain device, the disk rotates at 5000rpm. a) how long does one revolution take? b) what is the average rotational delay of this disk drive 2. Consider a disk dirve with 1000 tracks, numbered 0 to 999. The request queue has the following composition: 300 740 150 940 200 850 145 555 775 695. The current position is 197 and the previous request was served at 100. For each of the following disk scheduling algorithsm, compute the total distance (in tracks) that the disk arm would move. Include the calculation steps in your answers. 2.1 First - In-First-Out (FIFO) 2.2 Shortest - Service-Time - First (SSTF) 2.3 SCAN (no LOOK variation) 2.4 C-SCAN (No C-LOOK variation)
Write Assembly code to calculate average BMI of N students. Address 10 has the total number of students (N) followed by N weights and heights. Store the computed average BMI at the address 70.There are 2 records. Weight and height of the 1st person is 96 and 05 respectively. Similarly, 5A and 06 are the weight and height of the second person.Assume decimal points are ignored and the average will be a rounded integer value. All divisions are integer divisions as well. NEED TO WRITE CODE IN ASSEMBLY CODE PLEASE (for example: MOV AL, 10)
Consider a Data file of r=30,000 EMPLOYEE records of fixed-length, consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long and a record pointer is P R =7 bytes long. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), DEPARTMENTCODE (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), JOBCODE (4 bytes), SALARY (4 bytes, real number). An additional byte is used as a deletion marker. Calculate the record size R in bytes. Calculate the blocking factor bfr and the number of file blocks b assuming an unspanned organization. Suppose the file is ordered by the key field SSN and we want to construct a primary index on SSN. Calculate the index blocking factor bfr .
The following data segment starts at memory address 1000h (hexadecimal) .data printString BYTE "ASSEMBLY IS FUN",0 moreBytes BYTE 25(DUP)0 dateIssued DWORD ? dueDate DWORD ? elapsedTime Word ? What is the hexadecimal address of dueDate ? a. 1045h b. 1029h c.1010h d. 102Dh
If the value 8 is stored in the memory location indicated by address 5, then what is the functional difference between copying the value 5 into cell 6 and copying the contents of cell 5 into cell 6?
Operating system The free space bitmap looks like this:1010 0000 0000 0000:The system always searches for free blocks starting at the lowest numbered block. Block size is 4 KiB. (Blocks that belong to the same le do not need to be contiguous.) Write down the bitmap after each of the following actions:(a) File A of size 22 KiB is written.(b) File B of size 10 KiB is written.(c) File A is deleted.(d) File C of size 29 KiB is written.(e) File B is deleted.
Problem Given the target file f0 and candidate files f1-f20, there is an identical copy of f0 among the files f1-f20. Write a python program to perform the following tasks: · Read in each file and calculate the hex hash values by using SHA3 function with the length of 512 for all the given files f0, f1-f20. · Save the hex hash values of each file as a new line in a .txt file named hash.txt file. · Read hash values from hash.txt and compare them to find the identical copy of f0 among f1-f20. · Write the finding result (the matched file name) back to hash.txt Submission • Name your project fileHash.py and submit both fileHash.py and hash.txt on Blackboard. • The program should be properly documented. • The program should have user friendly Input/Output design • Duplicate work (or obviously similar one) will result in an F grade in the course. Grading 1. Include comments as specified in the course syllabus. (10%) 2. Source code and results. · Correctness (70%) · User-friendliness…
1) The R programming code shown below will produce the following output: Output: one two 1 1 TRUE 2 2 TRUE 3 3 FALSE 4 4 FALSE Code:> x <- data.frame(one = 1:4, two = c(T, T, F, F)) > x True False 2) readlines is used for working on data. True False 3) The function as.matr() converts a data frame into a matrix. True False 4) The R programming statement data <- read.table(“egcc.txt”) read file “egcc.txt.” True False 5) The following R programming code will read 100 rows: tabAll <- read.table(“datatable.txt”, colClasses = classes) True False 6) Read.csv is used to read in tabular data. True False 7) The R programming load function is used for reading in saved workspaces. True False 8) The copy function accepts any number of arguments and concatenates them into character strings. True False 9) The read.data() function is one of the most commonly used functions for reading data True False 10) To read in data from a saved workspace, use the load command. True…