1- Write a program in MIPS assembly language to calculate the sum of a list of positive numbers. The list is terminated by a zero. Test your program with this list: 11, 12, 13,14, 15, 16, 17, 18, 19, 20,0. Provide your .asm file so that I can run it on MARS Simulator. 2- In this program you calculate the sum of m data sets. Each data set contains n integer numbers. In the following example there are 3 data sets, each having 10 elements:

1- Write a program in MIPS assembly language to calculate the sum of a list of positive numbers. The list is terminated by a zero. Test your program with this list: 11, 12, 13,14, 15, 16, 17, 18, 19, 20,0. Provide your .asm file so that I can run it on MARS Simulator. 2- In this program you calculate the sum of m data sets. Each data set contains n integer numbers. In the following example there are 3 data sets, each having 10 elements:

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. Write a program to reverse a singly or doubly linked list. (take data as int)2. Write a program to remove duplicates from a doubly linked list. (1,2,3,4,5,2) (you will remove the 2nd duplicate).3. Write a program to swap two data items in a doubly linked list. swap number 2 and number 4 data with each other. course--data structure in c++ perform all three parts in the one cpp file.
2. For the code below, draw a picture of the program stack when the function partition() is called the 2nd time. # extracted from suquant's reply at # https://stackoverflow.com/questions/18262306/quicksort-with-python def partition(array, begin, end): pivot = begin for i in range(begin+1, end+1): if array[i] <= array[begin]: pivot += 1 array[i], array[pivot] = array[pivot], array[i] array[pivot], array[begin] = array[begin], array[pivot] return pivot def quicksort(array, begin, end): if begin >= end: return pivot = partition(array, begin, end) quicksort(array, begin, pivot-1) quicksort(array, pivot+1, end) # added calling code if __name__ == "__main__": mylist = [8, 2, 17, 4, 12] quicksort(mylist, 0, 4)
I need help to modify my code to make it check if my input .cpp source files are balanced in single and double quotes. My code below can determine whether parenthesis and curly brackets are balanced in a .cpp source file.. Here is my code: // A small demonstration program for a stack.#include // Provides cin, cout#include // Provides stack#include // Provides string#include //Creates and/or read filesusing namespace std; // PROTOTYPE for a function used by this demonstration programbool balancedSymbols(const string& sym);// Postcondition: A true return value indicates that the parentheses in the// given expression are balanced. Otherwise, the return value is false. int main(){string userInput; cout << "Enter a .cpp source file to check if symbols are balanced\n";getline(cin, userInput);if (balancedSymbols(userInput))cout << "The parentheses and curly brackets in the source code are balanced.\n";elsecout << "The parentheses and curly brackets in the source code are…
using STL in c++, sort the given numbers in the input.txt file by only using heap data container. your sorted numbers should be written to the output.txt file (i)your code can be tested with an input file which comtains 1 million random numbers (ii) Execution time < 1 sec (iii) memory limit < 64MB
c++ Use the "natural split" algorithm on the file split.txt and answer the following question: How many elements are in the first list? display first list and second list split file: 200 494 774 644 345 521 61 27 28 584 569 66 857 210 2 211 675 548 596 188 647 671 517 408 475 615 113 731 522 850 17 640 940 556 517 602 935 76 578 880 428 168 394 381 497 247 368 137 138 619 973 895 106 838 45 921 800 681 660 490 427 937 917 786 959 152 604 837 749 684 963 926 963 988 492 385 458 788 7 62 46 932 996 787 634 34 616 71 128 686 578 923 532 933 545 100 224 895 595 342 933 934 797 120 565 495 884 237 648 843 599 157 843 192 279 301 649 382 881 667 178 126 746 44 601 22 52 769 708 991 83 447 786 525 168 328 922 153 367 22 689 834 774 93 110 547 597 644 726 237 20 370 573 391 225 750 897 956 839 951 455 8 509 746 338 576 276 277 341 274 891 723 53 966 271 50 990
In C# Suppose variable nums contains a list of integers.List«Integer> nums = Arrays.asList(1, 1, 2, 3, 4, 1, 3, 2, 4, 3, 3, 1);var nums = new List«int> { 1, 1, 2, 3, 4, 1, 3, 2, 4, 3, 3, 1 }Using Java Stream API *or* LINQ, write a short code that prints the following.For each section indicate the platform (whether the solution is given in Java orC# LINQ).A) Print all numbers.B) Print the sum() of the numbers.C) count how many times number '1' appears in the list.
C Programming: Write a separate program that takes one command line argument indicating a binary stack file (e.g., stack.bin). Provide an appropriate error message in case of a missing filename or error opening it. The program should visualize the stack frame and call information in the file as shown in the following sample output: Sample Output: function: 0x5639db7fc2ca, caller: 0x7f8b8f372290, frame pointer: 0x7ffd23831080stack frame: 0x7ffd23831080-0x7ffd23831070, time: 0.003484 (2158-5642)address range initial final0x7ffd2383107f-0x7ffd2383107c: 00007f8b | 00007f8b0x7ffd2383107b-0x7ffd23831078: 8f372290 | 8f3722900x7ffd23831077-0x7ffd23831074: 00000000 | 000000000x7ffd23831073-0x7ffd23831070: 00000001 | 00000001 function: 0x5639db7fc1d9, caller: 0x5639db7fc2f3, frame pointer: 0x7ffd23831060stack frame: 0x7ffd23831060-0x7ffd23831030, time: 0.002587 (2173-4760)address range initial final0x7ffd2383105f-0x7ffd2383105c: 00005639 |…
Python please: Write a program that reads the integers user_index_num and user_element_value as input, and update the list index element with user_element_value. Then output the list. Note: The list given is list = [1,2,3,4]. Use a try block to perform all the statements. Use an except block to catch any IndexError and output an exception message. Use another except block to catch any ValueError caused by invalid input and to output an exception message. Note: Please use list = [1,2,3,4]. IndexError is thrown when an index that is not bound in the list happens. Output wording should match examples below ValueError is thrown when a user enters a value of a different data type than what is defined in the program. Output wording should match example below. Example: If the input of the program is 2 5 the output of the program is [1, 2, 5, 4] Example: If the input of the program is 15 3 the output of the program is Index 15 Error list assignment index out of range Example: If the input of…
Create a software that can read an arbitrary number of lines of VB.NET code and save reserved words in one linked list and identifiers and literals in another. Display the contents of each linked list when the programme has completed reading input.
Write a program to process stock data. The stock data should be read from a text file containing the following data: stock code, stock name, amount invested (XXX.XX), shares held, and current price. Sue the internet or your local paper to gather data on at least 20 stocks. As each stock is read, insert it into a doubly linked list. The first logical list should be ordered on the stock code. The second should be ordered on the gain or loss for the stock. Gain or loss is calculated as the current value of the stock (shares held times current price) minus the amount invested. Include at least one loss in your test data. After building the lists, display a menu that allows the user to display either logical list forward or backward (a total of four options). Each display should contain an appropriate heading and column caption. Run your program and submit a list of your input data and a print out of each display option.
using c++ create a linked list so that the linked list can read content from a binary file and write the list back to a binary file. The binary file to read should look something like this: 9 -3 5 2 6 8 it should have a list of integers to read into your linked list, NOT a list of commands like: L1.insertTail(5);
you need to design, analyze, and implement algorithms to read in a sequence of characters from standard input and maintain the characters in a linked list with no duplicates. When you read in a previously unseen character, insert it at the front of the list. When you read in a duplicate character, delete it from the list and reinsert it at the beginning. The program implements the well-known move-to-front strategy which is useful for caching, data compression, and many other applications where items that have been recently accessed are more likely to be re-accessed. Requirements: The program should read a sequence of characters. The program should insert unseen character at the front of the list. The program should check if the character is not in the list to be inserted at the front of the list. The program should delete a duplicate character and delete it from the list and insert it at the beginning of the list. The program should check if the character is already in the list and…