1. Translate the following code into MIPS code.

B[i + 10] = B[i -2] + 40;

i = i + 10;
B[3] = B[i - 1];

a) Assume B is an array of integers (each integer takes 4 bytes). B's address
is stored at register $10. Also assume that the compiler associates the
variable i to the register $11.
b) Assume B is an array of characters (each character takes one byte). B's address
is stored at register $10. Also assume that the compiler associates the variable i to   the register $11.

2. Translate the following code into MIPS code.
       

B [0] = 5;

for (i = 1 ; i < 50 ; i = i + 2)

{

            B[i] =i + B[i-1];

}

Assume the compiler associates the variable i to the register $t0. Also, assume B is an array of integers and its address is stored at register $s1.   

3. Translate the following code into MIPS code.

            for (i=0; i<=5; i=i+1)

                        {

                        if (i != k)

                                    k=(k *2)-1;

                                    else

                                    k=(k *4)+1;

                        }

Assume the compiler associates the variables i and k to the registers $s0 and $s1, respectively.

4. Translate the following code into MIPS code.

Test (int i, int j)

                        {

                        int k;

                        k = Double(i+1) + Double (j-10)

                        return k;

                        }

Sub (int m)

                        {

                        int g;

                        g = m + m;

                        return g;

                        }

Assume the compiler associates the variable k to the register $s0. Assume the compiler associates the variable g to the register $t0.

Create a JavaScript program that asks for the input of at least five words (a total of 25+ characters) string from a user and performs the following functions to it:

STRING METHODS

1. Check to see if the string input meets the 25+ character limit. If it does not, send a message and ask for another string.
2. Output the original string as it was entered onto the web page document.
3. Output the original string in all lower case letters. Do not change the original string value.
4. Output the original string in all upper case letters. Do not change the original string value.
5. Output a message indicating the total characters within the string.
6. Output the characters between index 5 and index 10.
7. Output 5 characters starting from position 15.
8. Combine the string with another string of your choice that also has 25+ characters. The new string should be at the end of the first string. Output the combined string.
9. Finally, split your string into an array for the 2nd part of the assignment. Each word (not each character) should be a value for the array.

Example: Input 5 words

Note: This is an example with example input. Your input will make this much different so don't hard code my examples into your code. The program should ask for input for the 5 words.

Enters: I think therefore I am

Check to make sure it is 25 characters in length. (step 1) - it is not, it is only 22 characters so have them try again.

Enters: Failure is success in progress (this is over 25 characters)

Output: Failure is success in progress (step 2)

Output in lowercase: failure is success in progress (step 3)

Output in uppercase: FAILURE IS SUCCESS IN PROGRESS (step 4)

Output character count: Your string has 30 characters. (step 5)

Output characters between index 5 and 10. re is (step 6)

Output 5 characters starting from position 15. ess i (step 7)

Combine with a 25+ character string you have created: Failure is success in progress Success is dependent on effort (step 8)

ARRAY METHODS - Working with the same string as the String Methods program, continue your program by completing these steps.

1. Output the list of array values.
2. Output the total number of items in the array.
3. Remove the first item in the array. Output the new array values.
4. Add the word "banana" to the end of the array. Output the new array values.
5. Reverse the elements in the array. Output the new array values.
6. Replace the item in the 2nd position/key with the word stardust. Output the new array values showing the word in the correct position.
7. Sort the array in alphabetical order. Output the alphabetical list of array values.

Example continued: Array Methods

Your list should be output of all words in your combined string: (step 1)

failure
is
success
in
progress
Success
is
dependent
on
effort

Output: Your string contains 10 words. (step 2)

Output after removing the first array item (step 3)

is
success
in
progress
Success
is
dependent
on
effort

Output after adding the word banana to the end of the array (step 4)

is
success
progress
Success
is
dependent
on
effort
banana

Output after reversing the array elements (step 5)

banana
effort
on
dependent
is
Success
progress
success
is

Output after updating the second array item with the word stardust (step 6)

banana
effort
stardust
dependent
is
Success
progress
success
is

Output after sorting the array (step 7)

Success
banana
dependent
effort
is
is
progress
stardust
success

You need to prompt the user to enter three integer numbers from the keyboard, and then display the largest number among the three.
Please create a function to find the largest number among three numbers, and call the maxAmongThree function in the main function.

Using the code below as a template, write a program that asks the user to enter two integers, and finds and prints their greatest common denominator (GCD) in Java!

package cp213;

import java.util.Scanner;

public class Lab01 {

    /**
     * @param a
     * @param b
     * @return
     */
    public static int gcd(int a, int b) {

        // your code here

    }

    /**
     * @param args
     */
    public static void main(String[] args) {
        Scanner keyboard = new Scanner(System.in);
        int a = 0;
        int b = 0;
        int c = 0;

        // Read an integer from the keyboard.
        System.out.print("Enter a (0 to quit): ");
        a = keyboard.nextInt();

        // your code here

        // gcd function call
        c = Lab01.gcd( a, b );

        // your code here

    }

}

The multi-merge sort algorithm (M&M sort) works like merge sort, except that instead of dividing the array into 2 partitions, it divides the array into p partitions. It recursively sorts each of the p partitions and then merges the results doing a p-way merge (except, of course, for the base case of a singleton or empty array). (a) Write the recurrence for T(n) for M&M sort for the case where p is a constant. Then, give a closed-form solution to the recurrence using the Master Theorem, and note which case applied. (b) Now assume that p is not a constant, but rather p(n) = n/10. Rewrite T(n) for this case. Then, give a closed form solution. Use the Master Theorem if it applies, or any other means of arriving at the result.

Lab – Linux Fundamentals Instructions: Using Kali Linux, the Windows Linux Sub-System, or another Debian based Linux distribution, perform the following tasks based on the Linux Fundamentals lecture. For this lab, take screenshots for all major steps completed to illustrate that each task was successfully completed (the same method as would be used for other labs).

9. Display your current directory in the terminal

10. Display your current directories contents including the inode value and permissions for each file and directory

11. Without using an editor, create a file with no contents called billy_bobs_diary.txt in the user BillyBob’s home directory

12. Edit your file using nano or vi and add the following string into the contents of the file: “This is my super-duper secret diary. No one shall read my diary for as long as I live. I will encrypt this with the moistest strongest encryption that is known to man. P.S. I really love kitten memes”

13. Rename the file to secret_file.txt using the command line

14. Move the file, secret_file.txt, to a directory named secret located in /opt

15. Create a copy of the file, secret_file.txt, and place it in BillyBob’s home directory

16. On the file, secret_file.txt, located in /opt/secret, change the file permissions so that all users have read/write access, but not execute

17. After you get weirded out that your professor just did that for fun, change the permissions so that the owning user has r/w, the owning group has r/w, and all other users have read only access

18. Display the contents of secret_file.txt via the command line without using a text editor

19. Append the following line to the document without using a text editor: “I have hidden this file so cleverly, that no one will ever find it. My secrets are safe here.”

20. Using the command line, clone the GitHub repository below into the /opt directory. Use the ReadMe to introduce yourself to the mystery scenario. After familiar with the scenario and the instructions, solve the mystery and take snapshots along the way, especially when you figure out who done it! GitHub Repository: https://github.com/veltman/clmystery

1. Obtain the following string: abcdefghijklmnopqrstuvwxyz (as input or using initialization)

2. Using recursion, write a reverse function that reverses the characters in a string or character array given two indices (starting and ending). The string or the character array should reflect the reversal.

3. Read indices as input 11,18 (i.e. letters 12,19)

4. Call the reverse function to reverse letters: 12-19

5. Read indices as input 4,22 (i.e. letters 5,23)

6. Call the reverse function to reverse letters: 5,23

7. Using the reverse function, reverse the alphabet 8. Print the reversed string or character array.

Your output should contain:

abcdefghijksrqponmltuvwxyz

abcdwvutsrqponmlkjihgfexyz

zyxwvutsrqponmlkjihgfedcba

NOTE: your recursive function should modify the original string passed in as an argument, NOT make additional copies of the original string

Assume a 32-bit system, with a 2-level page table, with a page size of 4KiB (p1=10bits, p2=10bits, offset=12bits).

(i) A program on this system requires 16MiB in total: the program text segment uses 4MiB, the program data requires 2MiB, the program dynamically allocates 8MiB on the heap, and the stack utilises 2MiB. How many page-table pages are required for this process? (Don’t answer with just a number, explain your reasoning. Without your reasoning we cannot award part marks if your answer is incorrect.)

(ii) Describe the lookup steps within the page tables to find the physical address of the logical address 0x00403004.

(iii) If the reference time to access the physical memory frame is 20 nanoseconds. Assume that all required pages are in memory. How long does a paged memory reference take, if—
i. There is no TLB?
ii. There is a TLB, with an access speed of 0.05 nanoseconds, but the TLB does not contain information on the required page?
iii. There is a TLB, with an access speed of 0.05 nanoseconds, and the TLB contains information on this page?

Do not answer with just a number, explain your reasoning.

Write a C# program using repl.it that asks the user for three integers and prints the average value as a double. Example calculation (3 + 6 + 7) / 3 = 5.33333333333333 Given the data above, the output should be similar to: The average for the values entered is: 5.33333333333333 As always comments in your code are expected (what why how etc… ) Submit your repl.it link to the assignment dropbox text submission area.

Must be using Java Eclipse Please

4. Test program LinkedList.java, and make sure that you understand each operation in the
program. (refer to linkedListApplication.java)

6. (Programming) Use LinkedList as a reference, add the following operations in the class
LinkedList;
a) Find the average data values of the linked list.
b) Find the node with largest key, and then delete the node. (Note, you must return
the node, not just the largest key)
c) Test ALL operations (Search, Insert, Delete, Append/Remove to/from the header)
in the Main method. (Also display the average of the data values of the linked list,
the largest key, the linked list before and after deleting the node with the largest
key;

7. (Programming) Modify LinkedList.java programs so that it handles employee objects.
Make your program menu-driven.
a) Find the average salary of the employees in the linked list.
b) Find the employee with largest ID, and then delete the node. (Note, you must return
the employee, not just the largest key, and delete it)
c) Test ALL operations (Search, Insert, Delete, Append/Remove to/from the header) in
the Main method. (Also display the average salary, the employee with largest ID, the
linked list before and after deleting the employee with the largest key;

LinkedList.java

import java.util.*;

public class LinkedList
{
   public Node header;

   public LinkedList()
   {
       header = null;
   }

   public final Node Search(int key)
   {
       Node current = header;
       while (current != null && current.item != key)
       {
           current = current.link;
       }
       return current;
   }

   public final void Append(int newItem)
   {
       Node newNode = new Node(newItem);
       newNode.link = header;
       header = newNode;
   }

   public final Node Remove()
   {
       Node x = header;
       if (header != null)
       {
           header = header.link;
       }
       return x;
   }

   public final Node searchPrevious(int key)
   {
       if (header == null)
       {
           return header;
       }
       else
       {
           Node current = header;
           while (!(current.link == null) && (current.link.item != key))
           {
               current = current.link;
           }
           return current;
       }
   }

   public final void Insert(int newItem, int preKey)
   {
       Node current;
       Node newNode = new Node(newItem);
       current = Search(preKey);
       if (current == null)
       {
           System.out.println("there is no such preKey!");
       }
       else
       {
           newNode.link = current.link;
           current.link = newNode;
       }
   }

   public final void Delete(int key)
   {
       if (header == null) // The list is empty!
       {
           System.out.println("The list is empty!");
       }
       else
       {
           if (header.item == key) // header to be deleted.
           {
               header = header.link;
           }
           else
           {
               Node p = searchPrevious(key);
               if (p.link == null)
               {
                   System.out.println("There is no such item!");
               }
               else
               {
                   p.link = p.link.link;
               }
           }
       }
   }

public final void ShowLinkedList()
{
if (header == null)
   System.out.println("The list is empty!");
else
{
Node current = header;
System.out.printf("%1$s->", current.item);
while (!(current.link == null))
{
current = current.link;
System.out.printf("%1$s->", current.item);

}
System.out.printf("null");
System.out.println();
}
}
   public final void PrintList()
   {
       if (header == null)
       {
           System.out.println("The list is empty!");
       }
       else
       {
           Node current = header;
           System.out.println(current.item);
           while (!(current.link == null))
           {
               current = current.link;
               System.out.println(current.item);
           }
       }
   }
}

In this programming assignment, you need to create 3 files.

1. DateType.h

2. DateType.cpp

3. A test driver for testing the class defined in the other 2 files. You can name your file in the way you like. Remember it must be a .cpp file.

In DateType.h file, type these lines:

// To declare a class for the Date ADT // This is the header file DateType.h

class DateType

{
public:

void Initialize(int newMonth, int newDay, int newYear); int GetYear() const;
int GetMonth() const;
int GetDay() const;

private:
int year;

int month;

int day; };

// Class implementation // DateType.cpp

#include "DateType.h"

void DateType::Initialize(int newMonth, int newDay, int newYear)

{
year = newYear;

month = newMonth;

day = newDay; }

int DateType::GetMonth() const

{
return month;

}

In DateType.cpp file, type these lines:

int DateType::GetDay() const

{
return day;

}

int DateType::GetYear() const

{

return year; }

In you test driver, type in these lines:

// test driver
// I give the file name: testDriver.cpp
// To compile, type c++ DataType.cpp testDriver.cpp, this will generate an a.out executable.
// Or, type c++ Type.cpp testDriver.cpp –o testdriver, this will generate an executable named testdriver.

#include "DateType.h" #include <iostream>

using namespace std;

int main()

{
DateType today;

DateType anotherDay; today.Initialize(9, 24, 2003); anotherDay.Initialize(9, 25, 2003);

cout << "Today is " << today.GetMonth() << "/" << today.GetDay() << "/" << today.GetYear() << endl;

cout << "Anotherday is " << anotherDay.GetMonth() << "/" << anotherDay.GetDay() << "/" << anotherDay.GetYear() << endl;

return 0; }

Once you have the 3 files ready, you can compile them. The compile command is in the comments of the test driver.

After the compilation, you run the program, and see what output you get.
Now, modify the code to initialize 2 different dates, compile and run it, and see what the output is.

Main task is solving problem, in this code there is problem. and you should explain?
#include <unistd.h> 
#include <fcntl.h>
#include <stdlib.h>
#include <stdio.h>

int main(int argc, char *argv[]){ 
 int fd1, fd2;
 char buffer[100];  long int n1;

 if(((fd1 = open(argv[1], O_RDONLY)) == -1) ||  ((fd2 = open(argv[2],  
       O_CREAT|O_WRONLY|O_TRUNC,0700)) == -1)){
     perror("file problem ");  
     exit(1);
 }

 while((n1=read(fd1, buffer, 512) > 0))  
      if(write(fd2, buffer, n1) != n1){
             perror("writing problem ");  exit(3);
       }

// Case of an error exit from the loop  
 if(n1 == -1){
    perror("Reading problem ");  
    exit(2);
  }
  close(fd2);  
  exit(0);
}

Please answer full question thoroughly (A- D) showing detailed work. SUBMIT ORIGINAL work and ensure it is correct for thumbs up.

a) Show that an n-element heap has height  

b) Show that in any subtree of a max-heap, the root of the subtree contains the largest value occurring anywhere in that subtree.

c) Where in a max-heap might the smallest element reside, assuming that all elements are distinct?

d) Show that, with the array representation for storing an n-element heap, the leaves are the nodes indexed by  

1. List the course ID, course name, section, day, time, and room for all course sections. Order by course ID and section. Note you must join the courses and sections tables for this question.

2. Repeat for CRN 1003 only.
3. List the course ID, course name, section, instructor name, day, time, and room for all course sections. Be sure to join the proper tables.
4. List the course ID, course name, section, student ID, and student name for CRN 1003. Display the list in ascending order of student last and first names. Be sure to join the proper tables.

DROP TABLE registration;
DROP TABLE sections;
DROP TABLE courses;
DROP TABLE students;
DROP TABLE instructors;

CREATE TABLE courses (
cid varchar2(9) NOT NULL,
cname varchar2(50) NOT NULL,
credits number(1) DEFAULT 3,
prereq varchar2(9),
CONSTRAINT pk_courses PRIMARY KEY (cid)
);

INSERT INTO courses VALUES ('IS 201','Java Programming',3,null);
INSERT INTO courses VALUES ('IS 202','C++ Programming',3,'IS 201');
INSERT INTO courses VALUES ('IS 301','Web Design',3,null);
INSERT INTO courses VALUES ('IS 331','Business Applications',3,null);
INSERT INTO courses VALUES ('IS 401','Database Design',3,'IS 331');
INSERT INTO courses VALUES ('IS 413','SQL Programming',3,'IS 401');

CREATE TABLE students (
sid char(9)   NOT NULL,
lname varchar(30) NOT NULL ,
fname varchar2(30) NOT NULL ,
gender char(1) NOT NULL ,
addr varchar2(50) NOT NULL ,
city varchar2(20) NOT NULL ,
state char(2) NOT NULL ,
zip varchar2(10) NOT NULL ,
phone varchar2(14) NULL ,
birthdate date NULL ,
tuitionRate number(7, 2) NOT NULL ,
creditsEarned number(3) NOT NULL ,
CONSTRAINT pk_students PRIMARY KEY (sid)
);

INSERT INTO students VALUES ('100000001','Lee','George','M','15 Merchant Street','Honolulu','HI','96818','808-524-3333','01-MAY-1965',5000.00,47);
INSERT INTO students VALUES ('100000002','Yamamoto','Bill','M','3432 Birch Street','Honolulu','HI','96814','808-522-2212','03-JUN-1958',5000.00,12);
INSERT INTO students VALUES ('100000003','Carver','Hillary','F','22 Aardvark Avenue','Washington','DC','10101','800-212-3246','23-AUG-1991',5000.00,69);
INSERT INTO students VALUES ('100000004','King','Linda','F','341 Kaapahu Road','Paauilo','HI','96776',NULL,'01-SEP-1998',4399.00,6);
INSERT INTO students VALUES ('100000005','Rollings','Willie','M','1221 Ala Moana Blvd','Honolulu','HI','96814',NULL,NULL,4888.00,0);
INSERT INTO students VALUES ('100000006','Alexander','Wanda','F','93-123 Old Mill Road','Honokaa','HI','96727','808-776-2313','02-OCT-1997',5000.00,99);
INSERT INTO students VALUES ('100000007','Carver','Bill','M','33 Richards Street','Honolulu','HI','96813',NULL,'22-OCT-1990',5000.00,0);
INSERT INTO students VALUES ('100000008','DeLuz','Bob','M','102 Orleans Ave','San Francisco','CA','97745','808-555-3324','01-MAR-1998',5000.00,14);
INSERT INTO students VALUES ('100000009','Lee','Lisa','F','45 Fong Avenue','San Francisco','CA','97767','808-333-3432','21-APR-1997',5000.00,26);
INSERT INTO students VALUES ('100000010','Garcia','Sherrie','F','2 S. Beretania','Honolulu','HI','96817','808-663-4453','03-DEC-1997',5000.00,29);
INSERT INTO students VALUES ('100000011','Kamaka','Oscar','M','34 Kapolani Blvd','Honolulu','HI','96813','808-533-3332','12-FEB-1998',5000.00,0);

CREATE TABLE instructors (
inId char(9) NOT NULL,
iLname varchar2(30) NOT NULL,
iFname varchar2(30) NOT NULL,
rank varchar2(10) NOT NULL,
office varchar2(10) NULL,
phone varchar2(20) NULL,
salary number(8,2) DEFAULT 0,
CONSTRAINT pk_instructors PRIMARY KEY (inID)
);

INSERT INTO instructors VALUES ('200000001','Souza','Edward','Lecturer','LM101','808-533-4241',5000.00);
INSERT INTO instructors VALUES ('200000002','Tenzer','Laurie','Associate','LM102','808-533-4244',5000.00);
INSERT INTO instructors VALUES ('200000003','Otake','Bill','Assistant','MR101','808-533-4247',5800.00);

CREATE TABLE sections (
crn char(4) NOT NULL,
cid varchar2(9) NOT NULL,
section char DEFAULT 'A',
inId char(9) NOT NULL,
days varchar2(10) DEFAULT 'TBA',
time varchar2(16) DEFAULT 'TBA',
room varchar2(10) NULL,
CONSTRAINT pk_sections PRIMARY KEY (crn),
CONSTRAINT fk_inid_sections FOREIGN KEY (inid) REFERENCES instructors(inid),
CONSTRAINT fk_cid_sections FOREIGN KEY (cid) REFERENCES courses(cid)
);

INSERT INTO sections VALUES ('1000','IS 201','A','200000003','MWF','08:00 - 08:50','CL100');
INSERT INTO sections VALUES ('1001','IS 201','B','200000003','MWF','09:00 - 09:50','CL100');
INSERT INTO sections VALUES ('1002','IS 201','C','200000001','TTh','08:00 - 09:15','CL102');
INSERT INTO sections VALUES ('1003','IS 301','A','200000002','TTh','09:30 - 10:45','CL340');
INSERT INTO sections VALUES ('1004','IS 301','B','200000002','MWF','09:00 - 09:50','CL340');
INSERT INTO sections VALUES ('1005','IS 413','A','200000001','MWF','09:00 - 09:50','CL230');

CREATE TABLE registration (
crn char(4) NOT NULL,
sid char(9) NOT NULL,
CONSTRAINT pk_registration PRIMARY KEY (crn,sid),
CONSTRAINT fk_crn_registration FOREIGN KEY (crn) references sections(crn),
CONSTRAINT fk_sid_registration FOREIGN KEY (sid) references students(sid)
);

INSERT INTO registration VALUES ('1000','100000001');
INSERT INTO registration VALUES ('1003','100000001');
INSERT INTO registration VALUES ('1005','100000001');
INSERT INTO registration VALUES ('1001','100000002');
INSERT INTO registration VALUES ('1004','100000002');
INSERT INTO registration VALUES ('1005','100000003');
INSERT INTO registration VALUES ('1002','100000004');
INSERT INTO registration VALUES ('1003','100000004');
INSERT INTO registration VALUES ('1005','100000004');
INSERT INTO registration VALUES ('1000','100000005');
INSERT INTO registration VALUES ('1003','100000005');
INSERT INTO registration VALUES ('1002','100000008');
INSERT INTO registration VALUES ('1004','100000008');
INSERT INTO registration VALUES ('1002','100000009');
INSERT INTO registration VALUES ('1005','100000009');
INSERT INTO registration VALUES ('1002','100000010');
INSERT INTO registration VALUES ('1005','100000010');
INSERT INTO registration VALUES ('1000','100000011');
INSERT INTO registration VALUES ('1003','100000011');
INSERT INTO registration VALUES ('1005','100000011');
commit;

Using Perl;

Part 1:
Allow the user to enter a full name in the “first last” format
Print just the first name
Print just the last name
Print the name in “last, first” format
Print the entire name out in all capital letters
Use a single print statement to print out the first name on one line and the last name on
the next line.
There should be 5 print statements generating 6 lines of output.

Part 2:
Enter a three digit number (such as 316)
Print out the number from the hundreds place (for example, 3 in 316)
Print out the number from the ten’s place (for example, 1 in 316)
Print out the number from the one’s place (for example, 6 in 316)
Print out the original number
All output will be appropriately labeled and on a separate line, such as “hundreds
place”, “tens place”, and so on.
ALL the numeric values MUST be right justified in the output using formatted output
All work done for this part MUST treat the information as numeric values – do not treat
the input as a string or as an array.
There should be 4 print statements generating 4 lines of output.