Requirement

In this assignment, you will compare the characteristics and performance of different classifiers, namely logistic regression, k-nearest neighbours and naive Bayes. You will experiment with these extensions and extend the provided code. Note that you should understand the code first instead of using it as a black box.
Python versions of the code have been provided. You are free to work with whichever you wish.

Requirement

Prior to beginning tis assignment, please download the studentsdb.sql, studentdb.pdf and the Index.php file from the course web site.
In this assignment, you are to complete the php script, Index.php, which will use the values input by the user. This script contains one push botton and one textbox in order to perform the interaction.
The web page should provide the following functions:

1. Connect to the database
2. Check if the database connection is successful
3. Validation on user typing
4. Search and display the query result of each student
5. Error message if no student found

Requirement

In this assignment, each student is to write a program that provides a file listing for the given directory. The program should list the filename, file size, and time last modified for each file within the directory. The program should provide the user with the option to sort the listing based on filename, on file size, or on time last modified. The program should run once and quit (it does not loop).
The syntax (usage) for the program should be:

1

prog_name [directory] [[-s][-t]]

where –s indicates sort by file size and –t indicates sort by time last modified. These flags are optional but mutually exclusive. The directory is also optional; if it is omitted than a default directory of “.” (the current directory) should be assumed. Every possible combination of command line arguments, from the above syntax, will be tested.

Requirement

This final project is a group project, each group should have two people. The goal of this project is to develop a java based racing game. The space racing game should provide the following functions:

1. One computer graphics environment
2. User-controlled car
3. User controlled viewpoint
4. Game AI

The racing vehicle car’s movement can be determined by its velocity and acceleration vectors.
When the user wants to turn the car, the direction of the velocity is changed based on the amount of turning the user provides.

为什么你需要编程作业代写帮助？

计算机编程一直都不是一个简单的领域，即使是对于那些痴迷于计算机编程的同学，乃至大神们，也很难掌握所有的理论和概念。但是，教授、讲师们不可能延长课时，让同学们有充分时间去领悟其中的精髓，甚至是精通计算机编程。
那有什么办法可以让同学们熟练掌握计算机编程呢？7*24的图书馆学习吗？当然不是！俗话说的好，“火车跑得快，全靠车头带”，同学们需要的是一名专业的工程师，在前方带领大家。

为什么你需要一名专业的工程师指导？

同学们寻求作业代写帮助往往有下面几个原因：没有足够的时间编程，理论概念太多需要时间梳理，不知道如何调试，无法修复Bug等等。其实这些原因并不特别，在我们工程师的日常工作中，这些也都是司空见惯的事情：项目明天要上线，技术调研需要时间整理汇总，生产环境不让调试，程序有Bug等等。当我们工程师自己解决不了的时候，也是去询问更资深的工程师，甚至专家。在他们帮忙解决问题、敲代码调试的时候，我们工程师也是坐在旁边观摩学习的。

专业工程师指导的好处有哪些？

首先，可以随时方便的获得在线帮助，尽可能专业地回答你相关领域的问题，包括理论问题、作业讲解、例题辅导，代码调试等等，甚至可以发给你参考材料的网址，省去了你在图书馆埋头的时间。
其次，专业的工程师都不会轻易放弃。对于专业的工程师来说，解决难题就是一种挑战，没有理由放弃任何难题。讲解的程序通常都是高品质的代码，结合了工程师多年的一线经验，会让你感受到醍醐灌顶，茅塞顿开的畅快。
最后，专业的工程师能快速理解需求，为每名同学量身定制最实惠的价格！

(本文出自csprojectedu.com，转载请注明出处)

Requirement

In this Assignment, you should write a class that, given a circle’s radius, has methods that return the circle’s area, diameter, and circumference.
In case you have forgotten, the equations for a circle’s area, diameter, and circumference is given below.

1
2
3

area = πrr
diameter = 2r
circumference = 2πr

Based on Chapter 3, Programming Challenge # 8 Circle class in your textbook. Your output is given below.

1
2
3
4

Enter the radius of a circle: 5.3
The circle's area is            88.2472631
The circle's diameter is        10.6
The circle's circumference is   33.300854

Write a separate class called CircleDemo with a main method that asks the user for the circle’s radius, creates a Circle object, and then reports the circle’s area, diameter, and circumference using the circle’s getter methods.

Requirement

In this Assignment, you should write a program that allows the user to perform simple arithmetic in binary. Upon starting, the program should tell the user that it is a binary math program, along with brief instructions on how to use the program.
The program should then enter a loop, where it gives a prompt, such as “input>”. Upon receiving input from the user, the program should process it, report the output result (or error), and loop back to the prompt. This should continue until the user gives the keyphrase to exit the program (keyphrase is your choice, good choices are “quit”, “end”, “exit”, etc.). For example:

1
2
3
4

Input> 101+1100
10001
Input> 111001-1010
101111

Requirement

Implement a templated Stack class. It must implement the following interface (abstract class), which you should inherit from. In other words, create a file IStack.h which contains this definition, and then your own class (which may be called something like ListStack or ArrayStack or other, depending on how you impement it) should inherit publicly from IStack.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

template <class T>
class IStack
{
public:
  /* returns whether the stack contains any elements */
  virtual bool isEmpty() const = 0;
  
  /* adds a value to the top of the stack */
  virtual void push(const T& val) = 0;
  
  /* deletes the top value from the stack.
     Throws EmptyStackException if stack was empty.
     However, you should avoid having this exception thrown,
     by checking whether the stack is empty before calling it. */
  virtual void pop() = 0;
  
  /* returns the top value on the stack.
     Throws EmptyStackException if stack was empty.
     However, you should avoid having this exception thrown,
     by checking whether the stack is empty before calling it. */
  virtual const T& top() const = 0;
};

Your implementation can reuse some of your earlier linked list code, or you can build it on top of an array (which you dynamically allocate) - your choice. You must ensure that all functions run in time O(1) (amortized time O(1) if you use an array implementation), and should give an explanation with your code for why your code runs in O(1) time.
Your solution to this problem absolutely cannot use STL container classes (so no stack or vector or deque or list or such provided by STL).

Requirement

In this lab, each student is to write a program that allows the user to manipulate the entries in vector, or in a matrix. The program should keep track of one vector of variable length, and one matrix of exactly 4x4 size. The program should enter a loop, displaying a set of options (given below). Once the user selects an option, the program should display the vector (or matrix, as appropriate) before and after the operation chosen by the user. For example, if the user selects “reverse vector” and the current vector is [-3 0 2 5] then the program should display:

1
2
3
4

input
-3 0 2 5
reversed
5 2 0 -1

The program should run until the user selects an option to quit.
The program must use the following structure definitions.

1
2
3
4
5
6
7
8

struct vector {
  float *data;
  int    size;
};

struct matrix {
  struct vector rows[4];
};

Requirement

In this assignment you will write a graphics-based program to do a random walk, sometimes also known as a drunkard’s walk. This random walk simulates the wandering of an intoxicated person on a square street grid. The drunkard will start out in the middle of the grid and will randomly pick one of the four compass directions, and take a step in that direction, then another step from that new location in a random direction, etc.

This assignment will give you practice with creating classes, using loops, using the java library for random number generation, doing console-based IO, and drawing to a graphics window. Also you’ll get practice in general program development.