June 9, 2016
Home


编程范围:

C/C++/Java/Python/Matlab/Android/Jsp/Prolog/MIPS/Haskell/R/Linux/C#/PHP/SQL/.Net/Hadoop/Processing/JS/Ruby/Scala/Rust/数据库/Oracle/Mysql/Sqlite/IOS/网络编程/多线程编程/Linux编程/操作系统/计算机网络


面向顾客:美国,欧洲,澳洲,加拿大,新西兰等海外留学生

编程团队:硅谷工程师、BAT一线工程师,国内Top5硕士、博士生。


支付费用:一般100USD+

支付方式:微信、支付宝、PayPal,付款先付一半以上定金。


July 2, 2017
MIPS | MIPS 代写 | CS230 Spring 2016 – Assignment 3 Due Date: Thursday, June 30, 2016, 11:59 p.m. NOTE the different due date and time. Weight: 6% of the course grade All questions are equally weighted

CS230 Spring 2016 – Assignment 3 Due Date: Thursday, June 30, 2016, 11:59 p.m. NOTE the different due date and time. Weight: 6% of the course grade
All questions are equally weighted
• See the file MIPSinstructions.pdf, for instructions on how to assemble and execute your assembly language programs.
• The files submitted must plain text files with a .asm extension.
• Your solutions should include comments at the beginning that include your name, your Quest ID, a brief description of the program that describes how the registers
are being used.
• Add comments to the body of your program where you think it would be useful
for the markers to understand your thought process.
• The contents of the registers that are explicitly mentioned in the problem

February 7, 2017
CS112Assignment2

第一份文件:Board.Java
package hw2;

/**
* @author: ENTER YOUR FIRST AND LAST NAME HERE
* @email: ENTER YOUR BU EMAIL HERE
*/
public class Board {
// 0 means empty, 1 means X, 2 means O
public static final char[] sym = {‘ ‘, ‘X’, ‘O’};
private int[][] board;
private int height, width;
private int winLength;

public Board(int h, int w, int winLen) {
height = h;
width = w;
winLength = winLen;
board = new int[height][width];
// Java initializes new array elements to 0 automatically, so the board is empty
}

public int getWidth() {
return width;
}

January 28, 2017
Python | CIS 211 Project 3: OOP

1/27/2017 planets (1)
CIS 211 Project 3: OOP Due 11:00 P.M. January 27, 2017
Reading: M&R 10.1 ­­ 10.4
Our goal this week is to gain some experience writing class definitions for some simple objects. The classes are part of a solar system simulation. This week we’ll define the objects used in the simulation. Next week we’ll implement the simulation itself, and later in the term we’ll add visualization.
Part 1: Vectors (50 points)
Define a class named Vector. Instances of this class will be Euclidan vectors (https://en.wikipedia.org/wiki/Euclidean_vector (https://en.wikipedia.org/wiki/Euclidean_vector)).
An instance of this class will have three attributes, representing , , and coordinates in space. When a Vector object is created the constructor should be passed three numbers to use as the initial values of the coordinates.
Your class should also have:
accessor functions named x, y, and z, which return the current value of the specified coordinate
a __repr__ function that displays a Vector as a tuple of 3 numbers; use “%.3g” in the format statement so coordinates are shown with 3
significant digits
methods that implement ==, +, ‐, and * operations (see below)
a method named norm that computes the length, or magnitude, of the vector, defined by the equation
a method named clear that sets all coordinates to 0
To see if two vectors are equal, simply see if their , , and components are the same. This will almost certainly fail (due to roundoff errors) when the coordinates are of the size used in the solar system simulation, but it will help test the other operations, and we’ll use small numbers in these tests.
To add or subtract two vectors, make a new vector that has the sum or difference of the components of two existing vectors.
The method that implemements multiplication should implement scalar multiplication: the second operand should be an integer or a float, and the result is a new vector where all components are multiplied by the scalar.

January 25, 2017
MIPS | CMPUT 229 (Winter 2017) – Homewor

CMPUT 229 (Winter 2017) – Homework #1 Instructor: Karim Ali
Question 1: (5 points)
Consider that a processor architecture ToyProc, which was initially designed as big- endian, is changed to use little-endian byte ordering. Assuming the subset of the MIPS ISA that you are familiar with, and assuming a memory with a word-level interface, give examples of instructions whose operations will be affected by such a change in endianness.
Question 2: (5 points)
Write the C code that best corresponds to the following MIPS assembly code. Assume that registers $s1, $s2, and $s3 store the values of 32-bit integers x, y, and z.
L1: beq $s1, $zero, L2
addu $s1, $s1, $s2
addu $s1, $s1, $s3
L2:
Question 3: (15 points)
For this question, assume that:
• p, q, i, j are 32-bit integers whose values are stored in $s0, $s1, $s2, and $s3, respectively.
• A and B are arrays of integers.
• r is a pointer declared as int *r.
• r, the base address of array A, and the base address of array B are all in the stack frame of the current function, as shown below
For each of the C statements below, give the translation into MIPS. Do not use pseudo- instructions in your code. Clearly label which MIPS instructions are for which statement.
a. (5 points) q = *r
b. (5 points) B[i] = A[j]
c. (5 points) p = q + A[B[j]] Question 4: (15 points)
Write the assembly code to implement the following C function:
int selector(int array[], int i) {
return array[array[i]];
}

January 20, 2017
Processing | Excel | Matlab | EXAM – ECE 102

EXAM – ECE 102
Instructor: Peter Jamieson
Directions:
– This is a take home exam. The work must be your own. Any common code will result in the exam being forwarded to administration for academic integrity violation. Do not show, give, or tell anyone else how you are solving the problems.
– Submit your zipped file.
– Please read all instructions carefully!
Details:
– The total for the exam is 100 marks.
– Submit your zip file with the exact details below
ZIP File:
Your zip file for answering the questions should have where XYOURUSERNAMEX is equal to your Miami username. Any additional changes I need to make will result in point deductions from the respective question:
– XYOURUSERNAMEX.xls or a link to a google spreadsheet for question 1
– XYOURUSERNAMEX/XYOURUSERNAMEX.pde a directory and in that directory a processing file for question 2
– MATLAB/ XYOURUSERNAMEX.m a directory called MATLAB with a matlab script for question 3
– ETHICS/ XYOURUSERNAMEX.doc or .txt a directory called ETHICS with a document describing your ethical thoughts

January 12, 2017
MIPS | Algorithm | Minecraft-Texturen

作业 Minecraft-Texturen
在本次作业中,您将开发一个 MIPS 汇编程序,包含降低分辨率和降低数字图像 的色彩深度。
程序框架见 vorgabe.s 图像见 Ha01 文件夹
作业 1: Load and save images (7 分)
提示
1. An image can be stored in the memory as an array by continuously storing the individual lines with image points one behind the other.
2. At the beginning of the image there is also a header, which contains the width, height and color depth, which is the number of colors.
要求
1.Your program should be able to read and write image files in the PGM format (binary, P5). a) 提示:To read and write files, QtSPIM, similar, or other operating system, provides different syscalls. You must calculate the value of the number from a string of digits.
To do this You need an ASCII table.
2.Implement a routine load_img that loads an image and processes the header

January 10, 2017
Processing | COMP115 – Introduction to Computer Programming

Department of Computing
COMP115 – Introduction to Computer Programming Assignment 2
ASSESSMENT DETAILS
Due: 23:45, 17th January, 2017
Worth: 20% (marked out of 100)
Updated: 9th January, 12:45pm. Update 1: added values for S1 and S2 under subtask 1.1. Update 2: corrected weight of assignment (20)
INSTRUCTIONS
In this assignment, you will write a simple particles simulation. A particle is represented by a circle, filled with a random colour and size. Each particle moves at a velocity and bounces when hits with the edges of the simulation screen. The simulator must be able to run on the graphic screen of different size.
NATURE OF THE TASK
The assignment is an individual task.
MATERIALS REQUIRED / SUGGESTED RESOURCES

December 25, 2016
Rust | Homework 5: Postfix Evaluation

2016/12/25 shtech.org/course/programming/homework/5/index.md
Homework 5: Postfix Evaluation Submission instructions
Description
Write a postfix expression evaluator. An expression consists of operands and operators. An operand is a signed integer ( isize ). An operator is + , ­ , or * with their common semantics. An expression is valid if it can be evaluated to a signed integer.
For example, the following are valid expressions:
The following expressions are invalid:
Public API
Your program must provide the following public API.
$ cargo new 5 ­­name your
$ git push origin master
$ cd 5
$ # Save your program in `src/lib.rs`
$ git add Cargo.toml src/lib.rs
$ git commit

December 15, 2016
SQL | 代写 | INFO 6250: Web APPLICATION FINAL PROJECT BREAKDOWN

INFO 6250: Web APPLICATION FINAL PROJECT BREAKDOWN

1. Submission
A. Where to submit: Bitbucket and Blackboard
i. Blackboard: Zip Project, Bitbucket: GIT COMMIT and GIT PUSH
B. What to submit
i. Entire Eclipse Project (Angular and REST)
ii. SQL File (Export SQL from MySQLWorkbench)
1. Table Structure
2. Default Data.
iii. PowerPoint Presentation. (No submission needed. Bring for demo)
2. Demo (Duration: 25 MINS)
A. Setup: 2 mins.
i. Download from Blackboard.
ii. Import Project into Eclipse
iii. Create Database via Scripts.
iv. Insert Default Data (Admin or Any Data required for Setup) – via Scripts.

December 13, 2016
Machine Learning | 代写 | CSE 491: Introduction to Machine Learning (Fall 2016)

CSE 491: Introduction to Machine Learning (Fall 2016)
Exam 3 Take Home, Due: 11:30AM on Dec 14, 2016
• The exam should be completed independently and discussions of any type are NOT allowed.
• A PDF version should be electronically submitted to D2L Dropbox with the file name
LastName_FirstName_CSE491EXAM3.pdf
1. (20 points) Support Vector Machines. Given two data points x1 = (1, 0)T , y1 = −1, and x2 = (3, 0)T , y2 = 1.
(a) Compute the optimal w and b in support vector machine by solving the primal formu- lation given as follows:
min 1wTw w,b 2
subject to yi(wT xi + b) ≥ 1, ∀i.
(b) Compute the optimal α in the dual formulation of support vector machine.
(c) Compute the optimal w based on the optimal α obtained from the dual formulation of support vector machine and compare with the results in (a).