ESE 224 Spring 2015 Course Project Description
Over the course of this semester, you learn various coding concepts in C++ that are applicable to programming in general. This class project is designed to show you how many of these concepts can be used together in a single application and will test your familiarity with programming these concepts. This project is intended for 2-4 people groups.
We will provide a rigid skeleton guide which you MUST follow, but how to implement components in the skeleton is your decision. This means that any public method signature should not be modified (its return type, name, and parameters). However, you are free to remove, add, or edit any private methods you feel necessary. The private methods are included as a guideline to structuring and organizing your code. The private variables should also not be modified, as much of the public functions rely on these private variables. This means we (i.e
CSCI212 assignment3 solution: shell interpreter implementation
CSCI212/MCS9212
Assignment 3 (7.5 marks)
Due 11:59pm Sunday May 17, 2015.
The aim of this assignment is to write a simple shell interpreter demonstrating you knowledge of process
control. In addition to this you will get some experience with file system API’s.
Task One (4.5 marks)
You first task is to write a simple shell interpreter, which executes commands. You shell interpreter should
display a $ prompt and wait for user input.
You shell interpreter is to be a little simplistic, all you can do is execute commands. If a command cannot be
found you should display a suitable error message. When executing a command the shell interpreter should
wait until the command terminates. To implement command execution simply use the function call fork()
and exec(). Note that there are many variations on the exec() function call. To block the shell, you
should use the wait() (or similar) function call.
At the end of this step you should be able to do this:
$ ./foobar
./foobar does not exist.
$ ls
CS100: Matrices solution
CS100: Matrices
Revision Date: April 16, 2015
Printable Version
Preamble
The purpose of this assignment is to give you some practice in creating and using matrices. We want to make sure students are comfortable with iteration and recursion involving matrices. In addition to the above we want to make it so students are familiar with reading in matrices from a file as well.
Task 0: Create your directories (10 points)
Create your directories with the commands
cd
cd cs100/labs
mkdir lab7
cd lab7
mkdir month ascii maze
You should be able to just copy and paste these commands into your console. When finished you should have three directories under your lab7 directory called ascii, maze, and month.
Task 1: Generate a month for a calendar (30 points)
Move into dir
c++ virtual function 实现猜想
bmp manipulation
// ~ Overview ~ //
This exercise will familiarize you with structures, dynamic memory allocation, and
file operations.
// ~ Learning Goals ~ //
(1) To learn to read and write a structure into a file
(2) To learn to manipulate arrays
// ~ Submitting Your Assignment ~ //
You must submit one zip file to blackboard. This zip file must
contain:
(1) pe07.c
(2) bmp.c
You create the zip file using the following command.
> zip pe07.zip pe07.c bmp.c
// ~ Overview ~ //
The main purpose of this exercise is to familiarize you with
structures. It will also give you more practice with file operations
and memory allocation.
This exercise (and the next one) will gear you up for PA04, which
deals with an image format called BMP, which is commonly used in the Windows
operating system. Most web browsers are also able to read and display BMP files.
It is a modification of the exercise that Prof. Yung-Hsiang Lu gave to
his class.
In this exercise, you will read in a BMP file, and depending on the option
given, outpu
syr cis341 缓存区溢出漏洞利用实现
这个作业很刺激。。。
syr cis341 solution
Project 2: Buffer Overflow
1. Objective
Buffer overflows have been the most common form of security vulnerability in the
last ten years. Moreover, buffer overflow vulnerabilities dominate in the area of
remote network penetration vulnerabilities, where an anonymous Internet user seeks
to gain partial or total control of a host. These kinds of attacks enable anyone to take
total control of a host and thus represent one of the most serious security threats. [1]
Definition of buffer overflow from Wikipedia [2]: A buffer overflow, or buffer
overrun, is an anomaly where a program, while writing data to a buffer, overruns the
buffer’s boundary and overwrites adjacent memory. This is a special case of violation
of memory safety.
The goal of this lab is to get intimately familiar with the layout and use of data section,
code section and, particularly, call stacks, as well as MIPS machine language,
assembly and disassembly, debugging, and reverse engineering. As a side ben
若干c语言基础题目代写
c程序代做
1.6 – The Preprocessor
All exercises in this Level must be coded exclusively in C syntax (no
<iostream>, cout, cin, classes, etc.)
Exercise 1
Write a C-program that contains two print macro calls. The first prints the variable a, the
second prints the variables a and b. Printing happens by the use of the PRINT1 and
PRINT2 macros that accept arguments. These macros must be defined in an include-file.
The variables a and b gets their value in the function main().
Name the program “Macro.c” and the include-file “Defs.h”. Don’t forget to implement
the mechanism to avoid multiple inclusion of the header file.
Exercise 2
Create the two macros MAX2(x,y) and MAX3(x,y,z). These macros must return the
maximum value of the given arguments. Let the macro MAX3 make use of the macro
MAX2. Add these macros to the file “Defs.h”.
1.7 – Pointers and Arrays
Exercise 1
Try to create a function Swap(). This function must exchange the value of two variables.
For example: if i=123 and j=456, then i=456
c语言程序代写: Min/Max stack
CS 136 Assignment 10
Due Monday, April 6 at 11:59 AM sharp (noon).
Please read the preamble in Assignment 1.
Only the C language features introduced in this course are allowed.
In your code, you do NOT have to check that the value returned from malloc (or realloc) is invalid (NULL).
You may assume that all C strings are null terminated: you do not have to assert this.
If a requires statement specifies that a structure is “valid”, you may assume this, and you do not have to assert it.
Assignment 10 Problem 1. [15 Marks for correctness and efficiency.]
Write a C module mmstack.c that implements a Min/Max Stack ADT (MMStack) as described in mmstack.h.
We have provided a simple <
c语言程序代写: list, tree, binary search tree
Assignment 9 Problem 0. [2+2=4 Marks correctness]
Problem 0 is a “warm-up” question. You are allowed to collaborate with your fellow classmates and discuss the solution on piazza.
a) Complete the C program mylist.c to print the following: 10 9 8 7 6 5 4 3 2 1
b) Complete the C program mytree.c to print the following: 20 35 78
Note: No helper functions are allowed (for both parts a & b). You are supposed to build the list (in part a) or the BST tree (in part b) node by node. You are NOT allowed to change any implementation provided in mylist.c nor in mytree.c
Assignment 9 Problem 1. [36 Marks Correctness. File: list.c]
Goal: to practice implementing linked list in C
c++ rot13 xor cipher
You have been hired by XYZ Stealth Incorporated to design their next generation of data encryption software, and in particular, your task is to create a C++ class that supports the ability to perform 2 common data encryption techniques:
- ROT-13 – en.wikipedia.org/wiki/ROT13
- XOR Cipher – en.wikipedia.org/wiki/XOR_
cipher
The class will support the following capabilities:
- initialize the class with a block of data – a) string b) an arbitrary array of data (supplied via void *) and a length
- a method to load data from disk (filename supplied)
- a method to select encryption technique
- a method to set the key for the XOR Cipher
- a method to perform encryption
- a method to save manipulated data to disk (filename supplied)
- a method to decrypt (study the 2 wiki descriptions carefully, a