-- This is the shell-c Test- --shell -test sub #include -ctype-h- -- C.pdf
•
0 likes•2 views
// This is the shell.c Test: ./shell -test sub #include <ctype.h> /* Character types */ #include <stdio.h> /* Standard buffered input/output */ #include <stdlib.h> /* Standard library functions */ #include <string.h> /* String operations */ #include <sys/types.h> /* Data types */ #include <sys/wait.h> /* Declarations for waiting */ #include <unistd.h> /* Standard symbolic constants and types */ #include "smp1_tests.h" /* Built-in test system */ /* DEFINE SECTION */ #define SHELL_BUFFER_SIZE 256 /* Size of the Shell input buffer */ #define SHELL_MAX_ARGS 8 /* Maximum number of arguments parsed */ #define SHELL_HISTORY_SIZE 10 /* VARIABLE SECTION */ enum { STATE_SPACE, STATE_NON_SPACE }; /* Parser states */ char shell_history[SHELL_HISTORY_SIZE][SHELL_BUFFER_SIZE]; int shell_history_next_index = 0; int imthechild(const char *path_to_exec, char *const args[]) { // TO-DO P5.1 return execvp(path_to_exec, args) ? -1 : 0; } void imtheparent(pid_t child_pid, int run_in_background) { int child_return_val, child_error_code; /* fork returned a positive pid so we are the parent */ fprintf(stderr, " Parent says 'child process has been forked with pid=%d'\n", child_pid); if (run_in_background) { fprintf(stderr, " Parent says 'run_in_background=1 ... so we're not waiting for the child'\n"); return; } // TO-DO P5.4 wait(&child_return_val); /* Use the WEXITSTATUS to extract the status code from the return value */ child_error_code = WEXITSTATUS(child_return_val); fprintf(stderr, " Parent says 'wait() returned so the child with pid=%d is finished.'\n", child_pid); if (child_error_code != 0) { fprintf(stderr, " Parent says 'Child process %d failed with code %d'\n", child_pid, child_error_code); } } int get_shell_command(char *buffer, int size) { int i = 0; char c; while (i < size - 1 && (c = getchar()) != EOF && c != '\n') { buffer[i++] = c; } buffer[i] = '\0'; return i; } void parse_command(char *command, char **exec_args, int *exec_bg) { int argc = 0; *exec_bg = 0; while (*command != '\0') { /* Strip whitespace. */ while (isspace(*command)) { ++command; } if (*command == '\0') { break; } /* Save the argument. */ if (argc < SHELL_MAX_ARGS) { exec_args[argc++] = command; } while (*command != '\0' && !isspace(*command)) { ++command; } if (*command != '\0') { *command++ = '\0'; } } exec_args[argc] = NULL; /* Check for background execution request. */ if (argc > 0 && !strcmp(exec_args[argc - 1], "&")) { *exec_bg = 1; exec_args[--argc] = NULL; } } void run_shell_command; int main(int argc, char **argv) { pid_t shell_pid, pid_from_fork; int n_read, i, exec_argc, parser_state, run_in_background; char buffer[SHELL_BUFFER_SIZE]; char *exec_argv[SHELL_MAX_ARGS + 1]; // TO-DO new variables for P5.2, P5.3, P5.6 if (argc > 1 && !strcmp(argv[1], "-test")) { return run_smp1_tests(argc - 1, argv + 1); } shell_pid = getpid(); int command_counter = 1; while (1) { /* The Shell runs in an infinite loop, processing input. */ if (exec_argc > 0) { command_counter++; } // TO-DO P5.2 .
Report
Share
Report
Share
Download to read offline
![// This is the shell.c
Test: ./shell -test sub
#include <ctype.h> /* Character types */
#include <stdio.h> /* Standard buffered input/output */
#include <stdlib.h> /* Standard library functions */
#include <string.h> /* String operations */
#include <sys/types.h> /* Data types */
#include <sys/wait.h> /* Declarations for waiting */
#include <unistd.h> /* Standard symbolic constants and types */
#include "smp1_tests.h" /* Built-in test system */
/* DEFINE SECTION */
#define SHELL_BUFFER_SIZE 256 /* Size of the Shell input buffer */
#define SHELL_MAX_ARGS 8 /* Maximum number of arguments parsed */
#define SHELL_HISTORY_SIZE 10
/* VARIABLE SECTION */
enum { STATE_SPACE, STATE_NON_SPACE }; /* Parser states */
char shell_history[SHELL_HISTORY_SIZE][SHELL_BUFFER_SIZE];
int shell_history_next_index = 0;
int imthechild(const char *path_to_exec, char *const args[])
{
// TO-DO P5.1
return execvp(path_to_exec, args) ? -1 : 0;
}](https://image.slidesharecdn.com/thisistheshell-ctest-shell-testsubinclude-ctype-h-c-230309171402-30cb0c4e/85/This-is-the-shell-c-Test-shell-test-sub-include-ctype-h-C-pdf-1-320.jpg)
Recommended
finalprojtemplatev5finalprojtemplate.gitignore# Ignore the b
finalprojtemplatev5/finalprojtemplate/.gitignore
# Ignore the build directory
build
# Ignore any executables
bin/*
# Ignore Mac specific files
.DS_Store
finalprojtemplatev5/finalprojtemplate/Makefile
# Script adapted from https://hiltmon.com/blog/2013/07/03/a-simple-c-plus-plus-project-structure/
CC := /usr/local/classes/eecs/spring2021/cs472/public/gcc/bin/g++
STRIPUTIL = strip
SRCDIR = src
BUILDDIR = build
TARGET = bin/cache_sim
# Handle debug case
DEBUG ?= 1
ifeq ($(DEBUG), 1)
CFLAGS += -g -Wall
else
CFLAGS += -DNDEBUG -O3
endif
SRCEXT = cpp
SOURCES = $(shell find $(SRCDIR) -type f -name *.$(SRCEXT))
OBJECTS = $(patsubst $(SRCDIR)/%,$(BUILDDIR)/%,$(SOURCES:.$(SRCEXT)=.o))
LDFLAGS += -Wl,-rpath,/usr/local/classes/eecs/spring2021/cs472/public/gcc/lib64
LIB += -pthread
INC += -I $(SRCDIR)
$(TARGET): $(OBJECTS)
@echo "Linking..."
@echo " $(CC) $^ -o $(TARGET) $(LIB) $(LDFLAGS)"; $(CC) $^ -o $(TARGET) $(LIB) $(LDFLAGS)
$(BUILDDIR)/%.o: $(SRCDIR)/%.$(SRCEXT)
@mkdir -p $(BUILDDIR)
@echo " $(CC) $(CFLAGS) $(INC) -c -o [email protected] $<"; $(CC) $(CFLAGS) $(INC) -c -o [email protected] $<
clean:
@echo "Cleaning...";
@echo " $(RM) -r $(BUILDDIR) $(TARGET)"; $(RM) -r $(BUILDDIR) $(TARGET)
.PHONY: clean
finalprojtemplatev5/finalprojtemplate/resources/simpletracefile==This is a simple tracefile for testing purposes L 08 L 808 L 1006 L 08 S 1805 L 1002 L 808 M 1806 L 1008 S 1005 S 1808 L 808 M 08 M 04 L 2804 M 808
finalprojtemplatev5/finalprojtemplate/resources/testconfig
1
230
8
16
3
1
0
13
finalprojtemplatev5/finalprojtemplate/src/CacheController.cppfinalprojtemplatev5/finalprojtemplate/src/CacheController.cpp/*
Cache Simulator (Starter Code) by Justin Goins
Oregon State University
Spring Term 2021
*/
#include"CacheController.h"
#include<iostream>
#include<fstream>
#include<regex>
#include<cmath>
usingnamespace std;
CacheController::CacheController(CacheInfo ci, string tracefile){
// store the configuration info
this->ci = ci;
this->inputFile = tracefile;
this->outputFile =this->inputFile +".out";
// compute the other cache parameters
this->ci.numByteOffsetBits = log2(ci.blockSize);
this->ci.numSetIndexBits = log2(ci.numberSets);
// initialize the counters
this->globalCycles =0;
this->globalHits =0;
this->globalMisses =0;
this->globalEvictions =0;
// create your cache structure
// ...
// manual test code to see if the cache is behaving properly
// will need to be changed slightly to match the function prototype
/*
cacheAccess(false, 0);
cacheAccess(false, 128);
cacheAccess(false, 256);
cacheAccess(false, 0);
cacheAccess(false, 128);
cacheAccess(false, 256);
*/
}
/*
Starts reading the tracefile and processing memory operations.
*/
voidCacheController::runTracefile(){
cout <<"Input tracefile: "<< inputFile << endl;
cout <<"Output file name: "<< outputFile << endl;
// process each input line
string line;
// define regular expressions that are used to locate ...
Shell to be modified#include stdlib.h #include unistd.h .pdf
Shell to be modified
#include
#include
#include
#include
#include
#include
#include
#include
// Simplifed xv6 shell.
#define MAXARGS 10
// All commands have at least a type. Have looked at the type, the code
// typically casts the *cmd to some specific cmd type.
struct cmd {
int type; // ' ' (exec), | (pipe), '<' or '>' for redirection
};
struct execcmd {
int type; // ' '
char *argv[MAXARGS]; // arguments to the command to be exec-ed
};
struct redircmd {
int type; // < or >
struct cmd *cmd; // the command to be run (e.g., an execcmd)
char *file; // the input/output file
int mode; // the mode to open the file with
int fd; // the file descriptor number to use for the file
};
struct pipecmd {
int type; // |
struct cmd *left; // left side of pipe
struct cmd *right; // right side of pipe
};
int fork1(void); // Fork but exits on failure.
struct cmd *parsecmd(char*);
// Execute cmd. Never returns.
void
runcmd(struct cmd *cmd)
{
int p[2], r;
struct execcmd *ecmd;
struct pipecmd *pcmd;
struct redircmd *rcmd;
if(cmd == 0)
exit(0);
switch(cmd->type){
default:
fprintf(stderr, "unknown runcmd\n");
exit(-1);
case ' ':
ecmd = (struct execcmd*)cmd;
if(ecmd->argv[0] == 0)
exit(0);
fprintf(stderr, "exec not implemented\n");
// Your code here ...
break;
case '>':
case '<':
rcmd = (struct redircmd*)cmd;
fprintf(stderr, "redir not implemented\n");
// Your code here ...
runcmd(rcmd->cmd);
break;
case '|':
pcmd = (struct pipecmd*)cmd;
fprintf(stderr, "pipe not implemented\n");
// Your code here ...
break;
}
exit(0);
}
int
getcmd(char *buf, int nbuf)
{
if (isatty(fileno(stdin)))
fprintf(stdout, "$ ");
memset(buf, 0, nbuf);
fgets(buf, nbuf, stdin);
if(buf[0] == 0) // EOF
return -1;
return 0;
}
int
main(void)
{
static char buf[100];
int fd, r;
// Read and run input commands.
while(getcmd(buf, sizeof(buf)) >= 0){
if(buf[0] == 'c' && buf[1] == 'd' && buf[2] == ' '){
// Clumsy but will have to do for now.
// Chdir has no effect on the parent if run in the child.
buf[strlen(buf)-1] = 0; // chop \n
if(chdir(buf+3) < 0)
fprintf(stderr, "cannot cd %s\n", buf+3);
continue;
}
if(fork1() == 0)
runcmd(parsecmd(buf));
wait(&r);
}
exit(0);
}
int
fork1(void)
{
int pid;
pid = fork();
if(pid == -1)
perror("fork");
return pid;
}
struct cmd*
execcmd(void)
{
struct execcmd *cmd;
cmd = malloc(sizeof(*cmd));
memset(cmd, 0, sizeof(*cmd));
cmd->type = ' ';
return (struct cmd*)cmd;
}
struct cmd*
redircmd(struct cmd *subcmd, char *file, int type)
{
struct redircmd *cmd;
cmd = malloc(sizeof(*cmd));
memset(cmd, 0, sizeof(*cmd));
cmd->type = type;
cmd->cmd = subcmd;
cmd->file = file;
cmd->mode = (type == '<') ? O_RDONLY : O_WRONLY|O_CREAT|O_TRUNC;
cmd->fd = (type == '<') ? 0 : 1;
return (struct cmd*)cmd;
}
struct cmd*
pipecmd(struct cmd *left, struct cmd *right)
{
struct pipecmd *cmd;
cmd = malloc(sizeof(*cmd));
memset(cmd, 0, sizeof(*cmd));
cmd->type = '|';
cmd->left = left;
cmd->right = right;
return (struct cmd*)cmd;
}
// Parsing
char whitespace[] = " \t\r\n\v";
char symbols[] = "<|>";
int
ge.
httplinux.die.netman3execfork() creates a new process by.docx
http://linux.die.net/man/3/exec
fork() creates a new process by duplicating the calling process. The new process, referred to as the child, is an exact duplicate of the calling process, referred to as the parent#include <unistd.h>pid_t fork(void);
The exec() family of functions replaces the current process image with a new process image. The functions described in this manual page are front-ends for execve(2). (See the manual page for execve(2) for further details about the replacement of the current process image.)
The exec() family of functions include execl, execlp, execle, execv, execvp, and execvpe to execute a file.
The ANSI prototype for execl() is:
int execl(const char *path, const char *arg0,..., const char *argn, 0)
http://www.cems.uwe.ac.uk/~irjohnso/coursenotes/lrc/system/pc/pc4.htm #inciude <stdio.h> #inciude <unistd.h> main() { execl("/bin/ls", "ls", "-l", 0); printf("Can only get here on error\n"); }
The first parameter to execl() in this example is the full pathname to the ls command. This is the file whose contents will be run, provided the process has execute permission on the file. The rest of the execl() parameters provide the strings to which the argv array elements in the new program will point. In this example, it means that the ls program will see the string ls pointed to by its argv[0], and the string -l pointed to by itsargv[1]. In addition to making all these parameters available to the new program, the exec() calls also pass a value for the variable: extern char **environ;
This variable has the same format as the argv variable except that the items passed via environ are the values in the environment of the process (like any exported shell variables), rather than the command line parameters. In the case of execl(), the value of the environ variable in the new program will be a copy of the value of this variable in the calling process.
The execl() version of exec() is fine in the circumstances where you can ex-plicitly list all of the parameters, as in the previous example. Now suppose you want to write a program that doesn't just run ls, but will run any program you wish, and pass it any number of appropriate command line parameters. Obviously, execl() won't do the job.
The example program below, which implements this requirement, shows, however, that the system call execv() will perform as required: #inciude <stdio.h> main(int argc, char **argv) { if (argc==1) { printf("Usage: run <command> [<paraneters>]\n"); exit(1) } execv(argv[l], &argv[1)); printf("Sorry... couldn't run that!\n"); }
The prototype for execv() shows that it only takes two parameters, the first is the full pathname to the command to execute and the second is the argv value you want to pass into the new program. In the previous example this value was derived from the argv value passed into the run command, so that the run command can take the command line parameter values you pass it and just pass them on. int execl(.
IO redirection in C shellPlease implement input output redirect.pdf
I/O redirection in C shell
Please implement input / output redirection in the code posted below. Here are the specs:
Your shell will need to support file redirection. Use the same syntax as defined in the Bash shell:
a single \'>\' implies that one needs to redirect the standard output of the program being started to
the referenced file while a single \'<\' implies the same with standard input. The double \'>>\'
implies that standard output will append to an existing file rather than create a new file (similar
behavior is required for the \'<<\' operator and standard input). You do not need to implement
support for the Bash pipeline operator \'|\'.
Before calling exec to begin execution, the child process may have to close stdin (file desriptor
0) and/or stdout (file descriptor 0), open the corresponding file and use the dup2 system call to
make it the appropriate file descriptor. Don\'t forget to use the close system call to close the old
file descriptor.
#include
#include
#include
#include
#include
#include
using namespace std;
int change_dir(char* args[])
{
if (args[1] == NULL)
{
chdir(getenv(\"HOME\"));
return 1;
}
else
{
if (chdir(args[1]) == -1)
{
cout << \"No such directory\" << args[1];
return -1;
}
}
return 0;
}
int helper_func(char* args[])
{
cout << \"Builtin commands so far are; cd, and help.\ \";
return 0;
}
int main()
{
while(true)
{
cout << \"$ \";
char cmd[128];
cin.getline(cmd,128);
vector args;
char *line = strtok(cmd, \" \");
char *tmp = line;
while (tmp != NULL)
{
args.push_back(tmp);
tmp = strtok(NULL, \" \");
}
char** argv = new char*[args.size() + 1];
for (int i = 0; i < args.size(); i++)
argv[i] = args[i];
argv[args.size()] = NULL;
if (strcmp(cmd, \"exit\") == 0)
{
{
exit(0);
}
}
//else if (strcmp(args[0], \"cd\") == 0) change_dir(args);
if (strcmp(cmd, \"cd\") == 0)
{
change_dir(argv);
}
if (strcmp(cmd, \"help\") == 0)
{
helper_func(argv);
}
else
{
pid_t pid;
pid_t wpid;
int status;
pid = fork();
if (pid == 0)
{
if (execvp(args[0], argv) == -1)
{
perror(\"cmd\");
}
exit(EXIT_FAILURE);
}
else if (pid < 0)
{
perror(\"cmd\");
}
{
do {
wpid = waitpid(pid, &status, WUNTRACED);
} while (!WIFEXITED(status) && !WIFSIGNALED(status));
}
}
}
signal(SIGINT, SIG_IGN);
signal(SIGTERM, SIG_DFL);
return 0;
}
Solution
#include
#include
#include
#include
#include
#include
using namespace std;
int change_dir(char* args[])
{
if (args[1] == NULL)
{
chdir(getenv(\"HOME\"));
return 1;
}
else
{
if (chdir(args[1]) == -1)
{
cout << \"No such directory\" << args[1];
return -1;
}
}
return 0;
}
int helper_func(char* args[])
{
cout << \"Builtin commands so far are; cd, and help.\ \";
return 0;
}
int main()
{
while(true)
{
cout << \"$ \";
char cmd[128];
cin.getline(cmd,128);
vector args;
char *line = strtok(cmd, \" \");
char *tmp = line;
while (tmp != NULL)
{
args.push_back(tmp);
tmp = strtok(NULL, \" \");
}
char** argv = new char*[args.size() + 1];
for (int i = 0; i < args.size(); i++)
argv[i] = args[i];
argv[args.size()] = NULL;
if (strcmp(cmd, \.
proxyc CSAPP Web proxy NAME IMPORTANT Giv.pdf
/* # INPUT: a node z in the AVL Tree # OUTPUT: the new root node r of the subtree originally
rooted at z before the restructure/rebalancing at z # PRECONDITION: z is the only unbalanced
node in the subtree that it roots; the difference in height of its children is exactly 2 #
POSTCONDITION: the subtree originally rooted at z is a proper AVL subtree with node heights
properly set AVLTreeMap: : Node* AVLTreeMap::rebalance(AVLTreeMap::Node* z) {
AVLTreeMap::Node* r=z; // Your code here return r;.
Game unleashedjavascript
JavaScript for Unleashed a game about a robbery in London and its pretty long i do not know why you would want it but here have it :P also this is not pro its just for school because i am a loner like that and i have nothing better to do
Recommended
finalprojtemplatev5finalprojtemplate.gitignore# Ignore the b
finalprojtemplatev5/finalprojtemplate/.gitignore
# Ignore the build directory
build
# Ignore any executables
bin/*
# Ignore Mac specific files
.DS_Store
finalprojtemplatev5/finalprojtemplate/Makefile
# Script adapted from https://hiltmon.com/blog/2013/07/03/a-simple-c-plus-plus-project-structure/
CC := /usr/local/classes/eecs/spring2021/cs472/public/gcc/bin/g++
STRIPUTIL = strip
SRCDIR = src
BUILDDIR = build
TARGET = bin/cache_sim
# Handle debug case
DEBUG ?= 1
ifeq ($(DEBUG), 1)
CFLAGS += -g -Wall
else
CFLAGS += -DNDEBUG -O3
endif
SRCEXT = cpp
SOURCES = $(shell find $(SRCDIR) -type f -name *.$(SRCEXT))
OBJECTS = $(patsubst $(SRCDIR)/%,$(BUILDDIR)/%,$(SOURCES:.$(SRCEXT)=.o))
LDFLAGS += -Wl,-rpath,/usr/local/classes/eecs/spring2021/cs472/public/gcc/lib64
LIB += -pthread
INC += -I $(SRCDIR)
$(TARGET): $(OBJECTS)
@echo "Linking..."
@echo " $(CC) $^ -o $(TARGET) $(LIB) $(LDFLAGS)"; $(CC) $^ -o $(TARGET) $(LIB) $(LDFLAGS)
$(BUILDDIR)/%.o: $(SRCDIR)/%.$(SRCEXT)
@mkdir -p $(BUILDDIR)
@echo " $(CC) $(CFLAGS) $(INC) -c -o [email protected] $<"; $(CC) $(CFLAGS) $(INC) -c -o [email protected] $<
clean:
@echo "Cleaning...";
@echo " $(RM) -r $(BUILDDIR) $(TARGET)"; $(RM) -r $(BUILDDIR) $(TARGET)
.PHONY: clean
finalprojtemplatev5/finalprojtemplate/resources/simpletracefile==This is a simple tracefile for testing purposes L 08 L 808 L 1006 L 08 S 1805 L 1002 L 808 M 1806 L 1008 S 1005 S 1808 L 808 M 08 M 04 L 2804 M 808
finalprojtemplatev5/finalprojtemplate/resources/testconfig
1
230
8
16
3
1
0
13
finalprojtemplatev5/finalprojtemplate/src/CacheController.cppfinalprojtemplatev5/finalprojtemplate/src/CacheController.cpp/*
Cache Simulator (Starter Code) by Justin Goins
Oregon State University
Spring Term 2021
*/
#include"CacheController.h"
#include<iostream>
#include<fstream>
#include<regex>
#include<cmath>
usingnamespace std;
CacheController::CacheController(CacheInfo ci, string tracefile){
// store the configuration info
this->ci = ci;
this->inputFile = tracefile;
this->outputFile =this->inputFile +".out";
// compute the other cache parameters
this->ci.numByteOffsetBits = log2(ci.blockSize);
this->ci.numSetIndexBits = log2(ci.numberSets);
// initialize the counters
this->globalCycles =0;
this->globalHits =0;
this->globalMisses =0;
this->globalEvictions =0;
// create your cache structure
// ...
// manual test code to see if the cache is behaving properly
// will need to be changed slightly to match the function prototype
/*
cacheAccess(false, 0);
cacheAccess(false, 128);
cacheAccess(false, 256);
cacheAccess(false, 0);
cacheAccess(false, 128);
cacheAccess(false, 256);
*/
}
/*
Starts reading the tracefile and processing memory operations.
*/
voidCacheController::runTracefile(){
cout <<"Input tracefile: "<< inputFile << endl;
cout <<"Output file name: "<< outputFile << endl;
// process each input line
string line;
// define regular expressions that are used to locate ...
Shell to be modified#include stdlib.h #include unistd.h .pdf
Shell to be modified
#include
#include
#include
#include
#include
#include
#include
#include
// Simplifed xv6 shell.
#define MAXARGS 10
// All commands have at least a type. Have looked at the type, the code
// typically casts the *cmd to some specific cmd type.
struct cmd {
int type; // ' ' (exec), | (pipe), '<' or '>' for redirection
};
struct execcmd {
int type; // ' '
char *argv[MAXARGS]; // arguments to the command to be exec-ed
};
struct redircmd {
int type; // < or >
struct cmd *cmd; // the command to be run (e.g., an execcmd)
char *file; // the input/output file
int mode; // the mode to open the file with
int fd; // the file descriptor number to use for the file
};
struct pipecmd {
int type; // |
struct cmd *left; // left side of pipe
struct cmd *right; // right side of pipe
};
int fork1(void); // Fork but exits on failure.
struct cmd *parsecmd(char*);
// Execute cmd. Never returns.
void
runcmd(struct cmd *cmd)
{
int p[2], r;
struct execcmd *ecmd;
struct pipecmd *pcmd;
struct redircmd *rcmd;
if(cmd == 0)
exit(0);
switch(cmd->type){
default:
fprintf(stderr, "unknown runcmd\n");
exit(-1);
case ' ':
ecmd = (struct execcmd*)cmd;
if(ecmd->argv[0] == 0)
exit(0);
fprintf(stderr, "exec not implemented\n");
// Your code here ...
break;
case '>':
case '<':
rcmd = (struct redircmd*)cmd;
fprintf(stderr, "redir not implemented\n");
// Your code here ...
runcmd(rcmd->cmd);
break;
case '|':
pcmd = (struct pipecmd*)cmd;
fprintf(stderr, "pipe not implemented\n");
// Your code here ...
break;
}
exit(0);
}
int
getcmd(char *buf, int nbuf)
{
if (isatty(fileno(stdin)))
fprintf(stdout, "$ ");
memset(buf, 0, nbuf);
fgets(buf, nbuf, stdin);
if(buf[0] == 0) // EOF
return -1;
return 0;
}
int
main(void)
{
static char buf[100];
int fd, r;
// Read and run input commands.
while(getcmd(buf, sizeof(buf)) >= 0){
if(buf[0] == 'c' && buf[1] == 'd' && buf[2] == ' '){
// Clumsy but will have to do for now.
// Chdir has no effect on the parent if run in the child.
buf[strlen(buf)-1] = 0; // chop \n
if(chdir(buf+3) < 0)
fprintf(stderr, "cannot cd %s\n", buf+3);
continue;
}
if(fork1() == 0)
runcmd(parsecmd(buf));
wait(&r);
}
exit(0);
}
int
fork1(void)
{
int pid;
pid = fork();
if(pid == -1)
perror("fork");
return pid;
}
struct cmd*
execcmd(void)
{
struct execcmd *cmd;
cmd = malloc(sizeof(*cmd));
memset(cmd, 0, sizeof(*cmd));
cmd->type = ' ';
return (struct cmd*)cmd;
}
struct cmd*
redircmd(struct cmd *subcmd, char *file, int type)
{
struct redircmd *cmd;
cmd = malloc(sizeof(*cmd));
memset(cmd, 0, sizeof(*cmd));
cmd->type = type;
cmd->cmd = subcmd;
cmd->file = file;
cmd->mode = (type == '<') ? O_RDONLY : O_WRONLY|O_CREAT|O_TRUNC;
cmd->fd = (type == '<') ? 0 : 1;
return (struct cmd*)cmd;
}
struct cmd*
pipecmd(struct cmd *left, struct cmd *right)
{
struct pipecmd *cmd;
cmd = malloc(sizeof(*cmd));
memset(cmd, 0, sizeof(*cmd));
cmd->type = '|';
cmd->left = left;
cmd->right = right;
return (struct cmd*)cmd;
}
// Parsing
char whitespace[] = " \t\r\n\v";
char symbols[] = "<|>";
int
ge.
httplinux.die.netman3execfork() creates a new process by.docx
http://linux.die.net/man/3/exec
fork() creates a new process by duplicating the calling process. The new process, referred to as the child, is an exact duplicate of the calling process, referred to as the parent#include <unistd.h>pid_t fork(void);
The exec() family of functions replaces the current process image with a new process image. The functions described in this manual page are front-ends for execve(2). (See the manual page for execve(2) for further details about the replacement of the current process image.)
The exec() family of functions include execl, execlp, execle, execv, execvp, and execvpe to execute a file.
The ANSI prototype for execl() is:
int execl(const char *path, const char *arg0,..., const char *argn, 0)
http://www.cems.uwe.ac.uk/~irjohnso/coursenotes/lrc/system/pc/pc4.htm #inciude <stdio.h> #inciude <unistd.h> main() { execl("/bin/ls", "ls", "-l", 0); printf("Can only get here on error\n"); }
The first parameter to execl() in this example is the full pathname to the ls command. This is the file whose contents will be run, provided the process has execute permission on the file. The rest of the execl() parameters provide the strings to which the argv array elements in the new program will point. In this example, it means that the ls program will see the string ls pointed to by its argv[0], and the string -l pointed to by itsargv[1]. In addition to making all these parameters available to the new program, the exec() calls also pass a value for the variable: extern char **environ;
This variable has the same format as the argv variable except that the items passed via environ are the values in the environment of the process (like any exported shell variables), rather than the command line parameters. In the case of execl(), the value of the environ variable in the new program will be a copy of the value of this variable in the calling process.
The execl() version of exec() is fine in the circumstances where you can ex-plicitly list all of the parameters, as in the previous example. Now suppose you want to write a program that doesn't just run ls, but will run any program you wish, and pass it any number of appropriate command line parameters. Obviously, execl() won't do the job.
The example program below, which implements this requirement, shows, however, that the system call execv() will perform as required: #inciude <stdio.h> main(int argc, char **argv) { if (argc==1) { printf("Usage: run <command> [<paraneters>]\n"); exit(1) } execv(argv[l], &argv[1)); printf("Sorry... couldn't run that!\n"); }
The prototype for execv() shows that it only takes two parameters, the first is the full pathname to the command to execute and the second is the argv value you want to pass into the new program. In the previous example this value was derived from the argv value passed into the run command, so that the run command can take the command line parameter values you pass it and just pass them on. int execl(.
IO redirection in C shellPlease implement input output redirect.pdf
I/O redirection in C shell
Please implement input / output redirection in the code posted below. Here are the specs:
Your shell will need to support file redirection. Use the same syntax as defined in the Bash shell:
a single \'>\' implies that one needs to redirect the standard output of the program being started to
the referenced file while a single \'<\' implies the same with standard input. The double \'>>\'
implies that standard output will append to an existing file rather than create a new file (similar
behavior is required for the \'<<\' operator and standard input). You do not need to implement
support for the Bash pipeline operator \'|\'.
Before calling exec to begin execution, the child process may have to close stdin (file desriptor
0) and/or stdout (file descriptor 0), open the corresponding file and use the dup2 system call to
make it the appropriate file descriptor. Don\'t forget to use the close system call to close the old
file descriptor.
#include
#include
#include
#include
#include
#include
using namespace std;
int change_dir(char* args[])
{
if (args[1] == NULL)
{
chdir(getenv(\"HOME\"));
return 1;
}
else
{
if (chdir(args[1]) == -1)
{
cout << \"No such directory\" << args[1];
return -1;
}
}
return 0;
}
int helper_func(char* args[])
{
cout << \"Builtin commands so far are; cd, and help.\ \";
return 0;
}
int main()
{
while(true)
{
cout << \"$ \";
char cmd[128];
cin.getline(cmd,128);
vector args;
char *line = strtok(cmd, \" \");
char *tmp = line;
while (tmp != NULL)
{
args.push_back(tmp);
tmp = strtok(NULL, \" \");
}
char** argv = new char*[args.size() + 1];
for (int i = 0; i < args.size(); i++)
argv[i] = args[i];
argv[args.size()] = NULL;
if (strcmp(cmd, \"exit\") == 0)
{
{
exit(0);
}
}
//else if (strcmp(args[0], \"cd\") == 0) change_dir(args);
if (strcmp(cmd, \"cd\") == 0)
{
change_dir(argv);
}
if (strcmp(cmd, \"help\") == 0)
{
helper_func(argv);
}
else
{
pid_t pid;
pid_t wpid;
int status;
pid = fork();
if (pid == 0)
{
if (execvp(args[0], argv) == -1)
{
perror(\"cmd\");
}
exit(EXIT_FAILURE);
}
else if (pid < 0)
{
perror(\"cmd\");
}
{
do {
wpid = waitpid(pid, &status, WUNTRACED);
} while (!WIFEXITED(status) && !WIFSIGNALED(status));
}
}
}
signal(SIGINT, SIG_IGN);
signal(SIGTERM, SIG_DFL);
return 0;
}
Solution
#include
#include
#include
#include
#include
#include
using namespace std;
int change_dir(char* args[])
{
if (args[1] == NULL)
{
chdir(getenv(\"HOME\"));
return 1;
}
else
{
if (chdir(args[1]) == -1)
{
cout << \"No such directory\" << args[1];
return -1;
}
}
return 0;
}
int helper_func(char* args[])
{
cout << \"Builtin commands so far are; cd, and help.\ \";
return 0;
}
int main()
{
while(true)
{
cout << \"$ \";
char cmd[128];
cin.getline(cmd,128);
vector args;
char *line = strtok(cmd, \" \");
char *tmp = line;
while (tmp != NULL)
{
args.push_back(tmp);
tmp = strtok(NULL, \" \");
}
char** argv = new char*[args.size() + 1];
for (int i = 0; i < args.size(); i++)
argv[i] = args[i];
argv[args.size()] = NULL;
if (strcmp(cmd, \.
proxyc CSAPP Web proxy NAME IMPORTANT Giv.pdf
/* # INPUT: a node z in the AVL Tree # OUTPUT: the new root node r of the subtree originally
rooted at z before the restructure/rebalancing at z # PRECONDITION: z is the only unbalanced
node in the subtree that it roots; the difference in height of its children is exactly 2 #
POSTCONDITION: the subtree originally rooted at z is a proper AVL subtree with node heights
properly set AVLTreeMap: : Node* AVLTreeMap::rebalance(AVLTreeMap::Node* z) {
AVLTreeMap::Node* r=z; // Your code here return r;.
Game unleashedjavascript
JavaScript for Unleashed a game about a robbery in London and its pretty long i do not know why you would want it but here have it :P also this is not pro its just for school because i am a loner like that and i have nothing better to do
[2007 CodeEngn Conference 01] seaofglass - Linux Virus Analysis
2007 CodeEngn Conference 01
리눅스 바이러스인 Sickabs.dr에 대해 각 함수별 상세 분석 설명과 이를 C 언어로 구현하여 설명한다. File #1은 Sickabs.dr 바이러스를 C로 복원한 파일이고, File #2는 Sickabs.dr 바이러스 백신이다.
http://codeengn.com/conference/01
#define ENABLE_COMMANDER#define ENABLE_REPORTER#include c.docx
#define ENABLE_COMMANDER
#define ENABLE_REPORTER
#include <cctype> // for toupper()
#include <cstdlib> // for EXIT_SUCCESS and EXIT_FAILURE
#include <cstring> // for strerror()
#include <cerrno> // for errno
#include <deque> // for deque (used for ready and blocked queues)
#include <fstream> // for ifstream (used for reading simulated process programs)
#include <iostream> // for cout, endl, and cin
#include <sstream> // for stringstream (for parsing simulated process programs)
#include <sys/wait.h> // for wait()
#include <unistd.h> // for pipe(), read(), write(), close(), fork(), and _exit()
#include <vector> // for vector (used for PCB table)
using namespace std;
class Instruction {
public:
char operation;
int intArg;
string stringArg;
};
class Cpu {
public:
vector<Instruction> *pProgram;
int programCounter;
int value;
int timeSlice;
int timeSliceUsed;
};
enum State {
STATE_READY,
STATE_RUNNING,
STATE_BLOCKED,
STATE_END
};
class PcbEntry {
public:
int processId;
int parentProcessId;
vector<Instruction> program;
unsigned int programCounter;
int value;
unsigned int priority;
State state;
unsigned int startTime;
unsigned int timeUsed;
};
// The number of valid priorities.
#define NUM_PRIORITIES 4
// An array that maps priorities to their allotted time slices.
static const unsigned int PRIORITY_TIME_SLICES[NUM_PRIORITIES] = {
1,
2,
4,
8
};
unsigned int timestamp = 0;
Cpu cpu;
// For the states below, -1 indicates empty (since it is an invalid index).
int runningState = -1; // The index of the running process in the PCB table.
// readyStates is an array of queues. Each queue holds PCB indices for ready processes
// of a particular priority.
deque<int> readyStates[NUM_PRIORITIES];
deque<int> blockedState; // A queue fo PCB indices for blocked processes.
deque<int> deadState;
// In this implementation, we'll never explicitly clear PCB entries and the
// index in the table will always be the process ID. These choices waste memory,
// but since this program is just a simulation it the easiest approach.
// Additionally, debugging is simpler since table slots and process IDs are
// never re-used.
vector<PcbEntry *> pcbTable;
double cumulativeTimeDiff = 0;
int numTerminatedProcesses = 0;
// Sadly, C++ has no built-in way to trim strings:
string &trim(string &argument)
{
string whitespace(" \t\n\v\f\r");
size_t found = argument.find_last_not_of(whitespace);
if (found != string::npos) {
argument.erase(found + 1);
argument.erase(0, argument.find_first_not_of(whitespace));
} else {
argument.clear(); // all whitespace
}
return argument;
}
bool createProgram(const string &filename, vector<Instruction> &program)
{
ifstream file;
int lineNum = 0;
program.clear();
file.open(filename.c_str());
if (!file.is_open()) {
cout << "Error opening file " << filename << ...
various tricks for remote linux exploits by Seok-Ha Lee (wh1ant)
Modern operating systems include hardened security mechanisms to block exploit attempts. ASLR and NX (DEP) are two examples of the mechanisms that are widely implemented for the sake of security. However, there exists ways to bypass such protections by leveraging advanced exploitation techniques. It becomes harder to achieve code execution when the exploitation originates from a remote location, such as when the attack originates from a client, targeting server daemons. In such cases it is harder to find out the context information of target systems and, therefore, harder to achieve code execution. Knowledge on the memory layout of the targeted process is a crucial piece of the puzzle in developing an exploit, but it is harder to figure out when the exploit attempt is performed remotely. Recently, there have been techniques to leverage information disclosure (memory leak) vulnerabilities to figure out where specific library modules are loaded in the memory layout space, and such classes of vulnerabilities have been proven to be useful to bypass ASLR. However, there is also a different way of figuring out the memory layout of a process running in a remote environment. This method involves probing for valid addresses in target remote process. In a Linux environment, forked child processes will inherit already randomized memory layout from the parent process. Thus every client connection made to server daemons will share the same memory layout. The memory layout randomization is only done during the startup of the parent service process, and not randomized again when it is forking a child process to handle client connections. Due to the inheritance of child processes, it is possible to figure out a small piece of different information from every connection, and these pieces can be assembled later to get the idea of a big picture of the target process's remote memory layout. Probing to see if a given address is a valid memory address in context of the target remote process and assembling such information together, an attacker can figure out where the libc library is loaded on the memory, thus allowing exploits to succeed further in code execution. One might call it brute force, but with a smart brute forcing strategy, the number of minimal required attempts are significantly reduced to less than 10 in usual cases. In this talk, we will be talking about how it is possible to probe for memory layout space utilizing a piece of code to put the target in a blocked state, and to achieve stable code execution in remote exploit attempt scenarios using such information, as well as other tricks that are often used in remote exploit development in the Linux environment.
http://codeblue.jp/en-speaker.html#SeokHaLee
Add a 3rd field help that contains a short help string for each of t.pdf
Add a 3rd field help that contains a short help string for each of the commands you were to
implement in assignment #3. Make sure that your array(s) are big enough to handle 5 extra items
beyond your initialization. To save time only include help for exercises 4, 5, 6 and 8 in this
assignment, and use No help for the other entries.
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
void ctrlCHandler(int signum)
{
fprintf(stderr,"Command server terminated using C\n");
exit(1);
}
char * fExport(char *cmd, char *tokensleft[])
{
setenv(tokensleft[0],tokensleft[1],1);
return "Command 'export' was received";
}
char * fChdir(char *cmd,char *tokensleft[])
{
int ch=chdir(tokensleft[0]);
if(ch<0)
perror("chdir change of directory not successful\n");
else
printf("chdir change of directory successful\n");
return "Command 'chdir' was received\n";
}
char * fAccess(char *cmd,char *tokensleft[])
{
int exists =0;
for(int i=0;tokensleft[i]; i++) {
exists =0;
if(access(tokensleft[i],F_OK)==0){
exists = 1;
printf("file %s exists\n",tokensleft[i]);
}else{
printf("file %s does not exists\n",tokensleft[i]);
}
if (exists == 1){
if(access(tokensleft[i],R_OK)==0) {
printf("file %s is readable\n",tokensleft[i]);
}else{printf("file %s is not readable\n",tokensleft[i]);}
if(access(tokensleft[i],W_OK)==0) {
printf("file %s is writeable\n",tokensleft[i]);
}else{
printf("file %s is not writeable\n",tokensleft[i]);
}
if(access(tokensleft[i],X_OK)==0) {
printf("file %s is executeable\n",tokensleft[i]);
}else{
printf("file %s is not executeable\n",tokensleft[i]);
}
}// exists if
} //for
return "Command 'acsess' was received\n";
}
char * fChmod(char *cmd,char *tokensleft[])
{
unsigned int octalPerm;
sscanf(tokensleft[0],"%o",&octalPerm);
for(int i=1;tokensleft[i]; i++) {
if(chmod(tokensleft[i],octalPerm)==0 ){
chmod(tokensleft[i],octalPerm);
}else{
printf("Error: %s \n",strerror(errno));
}
}
return "Command 'chmod' was received";
}
char * fPath(char *cmd,char *tokensleft[])
{
char *pathLink;
char actualPath[PATH_MAX+1];
char *pointer;
char *bName;
char *dName;
for(int i=0;tokensleft[i]; i++) {
pathLink = tokensleft[i];
pointer =realpath(pathLink,actualPath);
bName = basename(actualPath);
dName = dirname(tokensleft[i]);
if (pointer){
printf("The Real path of %s is: %s\n",tokensleft[i],actualPath);
printf("The Dir name path of %s is: %s\n",tokensleft[i],dName);
printf("The Base name of %s is: %s\n",tokensleft[i],bName);
}else{
printf("Error: %s \n",strerror(errno));
}
}
return "Command 'path' was received";
}
char * fTouch(char *cmd,char *tokensleft[])
{
extern int optind,optopt,opterr;
struct FLAG{
bool aFlag;
bool mFlag;
} flags = { false, false };
int t1 = time(NULL), t2 = time(NULL);
int argc = 0;
int flag;
for (int i = 0; tokensleft[i]; i++) {
argc++;
}
while ((flag = getopt(argc, tokensleft, "m.
Workshop 1: Good practices in JavaScript
Workshop Good Practices in JavaScript. Regular Expressions. Scopes & Closures. Memory Leaks.
Presentado por Ing. Mario García
ood evening people. Ive been working on this code that sends a bur.pdf
ood evening people. I\'ve been working on this code that sends a burst on the client side as well
as the private fifo name over a struct, to a server which will process several clients and the burst
time that will be sent back to the client through the private fifo.
The issue is that once I enter the burst on the client side, it won\'t send the proper burst to the
server, which in turn it will read the private fifo name but not the burst, since there is no burst
(and the server has a set burst entered by the user), the actual burst will become a giantnumber.
I\'m attaching my code hoping than maybe another pair of eyes can see where I am getting my
mistake and help me to correct it. Thanks
client:
my input for the client:
server:
the input and outcome from the server:
at this point I canceled the program with a ctrl + C to cancel the recurring burst in reversive
count.
Again any help or suggestion is well received. Thanks
Solution
client:
#include
#include
#include
#include
#include
#include
#include
#include
typedef struct values {
char name[30];
int arrivalTime;
int burst; //used for both the initial size of the process and to send the completion time
} Process; /*Datatype of the elements in the queue*/
int main( int argc, char *argv[] ){
Process process;
int fdIN; //to write to character server
int fdOUT; //to read from character server
int clientID;
clientID = getpid();
sprintf(process.name, \"FIFO_%d\", clientID);
printf(\"\ FIFO name is %s \", process.name);
if((mkfifo(process.name, 0666)<0 && errno != EEXIST))
{
perror(\"Can\'t create private FIFO\ \");
exit(-1);
}
printf(\"\ Enter burst: \ \")
scanf(\"%d\", &process.burst);
if((fdIN=open(\"commFIFO\", O_WRONLY))<0) //writting into fifo
printf(\"cant open fifo to write\");
write(fdIN, &process, sizeof(process));
if((fdOUT=open(process.name, O_RDONLY))<0) //reading from fifo
printf(\"cant open fifo to read\");
read(fdOUT, &process, sizeof(process));
printf(\"\ arrival time: %d \ \", process.arrivalTime);
unlink (\"commFIFO\");
unlink (process.name);
close(fdIN);
close(fdOUT);
}
SERVER:
#include
#include
#include
#include
#include
#include
#include
#include
//Inbox/Outbox structure
typedef struct values {
char name[30];
int arrivalTime;
int burst; //used for both the initial size of the process and to send the completion time
} Process;
//Node definition
typedef struct node{ /*Nodes stored in the linked list*/
struct values request;
struct node *next;
} Node;
//Queue Definition
typedef struct queue{ /*A struct facilitates passing a queue as an argument*/
Node *head; /*Pointer to the first node holding the queue\'s data*/
Node *tail; /*Pointer to the last node holding the queue\'s data*/
int sz; /*Number of nodes in the queue*/
} Queue;
int size( Queue *Q ){
return Q->sz;
}
int isEmpty( Queue *Q ){
if( Q->sz == 0 ) return 1;
return 0;
}
void enqueue( Queue *Q, struct values elem ){
Node *v = (Node*)malloc(sizeof(Node));/*Allocate memory for the Node*/
if( !v ){
printf(\"ERROR: Insufficien.
Containers: What are they, Really?
Inspired by Liz Rice, I'll attempt to create a container runtime of myself in Go while eventually explaining linux containerization primitives and discussing the ecosystem.
Write a C++ program 1. Study the function process_text() in file.pdf
Write a C++ program
1. Study the function process_text() in file \"text_processing.cpp\". What do the string member
functions find(), substr(), c_str() do?
//text_processing.cpp
#include \"util.h\"
#include \"text_processing.h\"
#include
using namespace std;
int process_text( fstream &ifs, fstream &ofs, char target[] )
{
string replace_str( \"XXX\" ); //hard-coded string for replacement
int tlen = strlen( target ); //string length of target
int max_len = 200; //maximum length of a line
char s[max_len+1];
clear_screen(); //clear the screen
while ( !ifs.eof() ) {
int i2, i1 = 0, len=0;
ifs.getline( s, max_len ); //get one line from file
string str( s ); //construct a string object
i2 = str.find ( target, i1 ); //find target
len = i2 - i1;
if ( i2 > -1 && len > 0 ){ //if target found
print_text( str.substr( i1, i2 ).c_str() ); //print up to target
ofs << str.substr( i1, i2 );
}
while ( i2 > -1 ) {
print_text_inverse ( target ); //highlight target
ofs << replace_str;
i1 = i2 + tlen; //new search position
i2 = str.find ( target, i1 ); //find next target
len = i2 - i1;
if ( i2 > -1 && len > 0 ){ //found target
print_text( str.substr( i1, len ).c_str() ); //print up to target
ofs << str.substr( i1, len );
}
}
len = str.length() - i1;
if ( len > 0 ) { //print the remainder
print_text( str.substr( i1, len ).c_str() );
ofs << str.substr( i1, len );
}
ofs << endl;
getnstr( s, 1 ); //prompt for
} //while ( !ifs.eof() )
restore_screen(); //restore the old screen
return 1;
}
//text_processing.h
#ifndef TEXT_PROCESSING_H
#define TEXT_PROCESSING_H
#include
#include
using namespace std;
int process_text( fstream &ifs, fstream &ofs, char target[] );
#endif
//util.h
#ifndef UTIL_H
#define UTIL_H
#include
#include
#include
#include
#include
using namespace std;
void usage ( char program_name[] );
void clear_screen();
void print_text( const char *s );
void print_text_inverse( const char *s );
void get_input_text( char *s, int max_len );
void restore_screen();
#endif
//util.cpp
#include \"util.h\"
void usage ( char program_name[] )
{
cout << \"Usage: \" << program_name << \" infile outfile search_string\" << endl;
return;
}
/*
The following are some curses functions. You can find
the details by the command \"man ncurses\". But its use
can be transparent to you.
*/
void clear_screen()
{
initscr();
scrollok ( stdscr, true ); //allow window to scroll
}
void print_text ( const char *s )
{
printw(\"%s\", s );
refresh();
}
void print_text_inverse( const char *s )
{
attron( A_REVERSE );
printw(\"%s\", s );
attroff( A_REVERSE );
refresh();
}
void get_input_text( char *s, int max_len )
{
getnstr( s, max_len );
}
void restore_screen()
{
endwin();
}
//str_main.cpp
#include \"util.h\"
#include \"text_processing.h\"
#include
using namespace std;
/*
Note that grace_open() must be defined in same file
as main(), otherwise the destructor of fstream will
automatically close the opened file as it finds that
its out of scope upon exiting the function.
*/
int grace_open( char *s, fst.
Were writing code for a project that dynamically allocates an arra.pdf
We\'re writing code for a project that dynamically allocates an array stack. My other code works,
but my Min(), Max(), and Peek() functions fail. I\'ve provided my code for those functions at the
end of the post.
main.cpp
_________________________________________
#include
#include
#include
#include
#include \"stack.h\"
using namespace std;
int main(int argc, char* argv[])
{
ifstream inputs; // Input file for commands
char op; // Hold operation and optional char input
int value; // Value input from file
string comment; // Holds comment from file
Stack* sPtr = NULL; // Will point to TemplateQ object
// Output usage message if one input file name is not provided
if (argc != 2)
{
cout << \"Usage:\ project03 \ \";
return 1;
}
// Attempt to open input file -- terminate if file does not open
inputs.open(argv[1]);
if (!inputs)
{
cout << \"Error - unable to open input file\" << endl;
return 1;
}
// Input and echo header comment from file
getline(inputs, comment); // Input and echo the comment appearing in the test file
cout << endl << \'#\' << comment << endl;
// Process commands from input file
inputs >> op; // Attempt to input first command
while (inputs)
{
switch (op) // Process operation input from file
{
case \'#\': // Test file comment
getline(inputs, comment); // Input and echo the comment appearing in the test
file
cout << \'#\' << comment << endl;
break;
case \'c\': // Parameterized Constructor
inputs >> value;
cout << endl << \"Stack(\" << value << \")\";
try
{
sPtr = new Stack(value); // Attempt to create a stack object with array size
value
cout << \" -- completed\" << endl;
}
catch ( std::bad_alloc )
{
cout << \"Failed : Terminating now...\" << endl;
return 1;
}
break;
case \'+\': // Push
inputs >> value;
cout << \"Push(\" << value << \") -- \";
try
{
sPtr->Push(value);
cout << \"completed\";
}
catch (StackFull)
{
cout << \"Failed Full Stack\";
}
catch (...)
{
cout << \"operation failed\" << endl;
}
cout << endl;
break;
case \'-\': // Pop
cout << \"Pop() -- \";
try
{
sPtr->Pop();
cout << \"completed\";
}
catch (StackEmpty)
{
cout << \"Failed Empty Stack\";
}
catch (...)
{
cout << \"operation failed\" << endl;
}
cout << endl;
break;
case \'f\': // IsFull
cout << \"IsFull() -- \";
try
{
if (sPtr->IsFull())
cout << \"true\";
else
cout << \"false\";
}
catch ( ... )
{
cout << \"operation failed\";
}
cout << endl;
break;
case \'e\': // IsEmpty
cout << \"IsEmpty() -- \";
try
{
if (sPtr->IsEmpty())
cout << \"true\";
else
cout << \"false\";
}
catch ( ... )
{
cout << \"operation failed\";
}
cout << endl;
break;
case \'m\': // Make Empty
cout << \"MakeEmpty() -- \";
try
{
sPtr->MakeEmpty();
cout << \"completed\" << endl;
}
catch (...)
{
cout << \"operation failed\" << endl;
}
break;
case \'p\': // Print Stack
cout << \"Print() -- \";
sPtr->Print();
break;
case \'t\': // Top of Stack
try
{
cout << \"Top() -- \" << sPtr->Top() << endl;
}
catch (StackEmpty)
{
cout << \"Top() -- Failed Empty Stack\" << endl;
}
catch (...)
{
cout << \"operation failed\" .
Start with the inclusion of libraries#include iostream .docx
// Start with the inclusion of libraries
#include <iostream> //The library of io functions
#include <fstream> //The library of external stream functions
#include <cstdlib> //The library for external errors
#include <string> //The library for string functions
#include <cmath> //The library of C math functions
#include <iomanip> //Allows setting widths, etc. for I/O
#include <stdlib.h>
#include <stdio.h>
#include<vector>
using namespace std;
// Define all of the prototypes for functions used in the program
// Counts the number of unique letters seen
int countunique(int *array, int size);
// Creates the input file and formats it for use by the cipher section.
void createinput(string ifile, string ofile);
// Creates the encoded input file
void createcipher(int key, string ifile, string ofile);
// Finds and counts the number of digrams
int digram(int *pointer, string ifile);
// Counts the letter frequency in the encoded input file
int lettercount(int*, string ifile, string ofile);
// Finds the highest count in the singlton (or any other) array
int singleton(int*, int size);
// Trims an input file to the right size starting at an offset
void trimfile(string ifile, string ofile, int offset, int size);
// Begin the main function for testing
int main(int argc, char* argv[])
{
int count = 0;
int second = 0;
int singlefreq[26];
int *single = singlefreq;
int delta;
int loop; //The loop counter for arguments
int final = 0;
int totalcnt;
int key = -1; //Sets the key value
int len = 0; //The length to investigate for testing
int off; //Holds the offset into the file
double m; //Holds the metric error value
char loopletter;
float percent;
string ifile1 = "";
string ofile1 = "";
string deflt = "c:\\dissertation\\ShiftandSubcipherC++files\\clean.txt";
string ifile2 = "";
string ofile2 = ""; //Holds selected file path names
string cmdarg; //Holds the command line argument
string stop = "l"; //Gives the stop condition, assumes l
string reportfile = "c:\\dissertation\\test\\report.txt";
ofstream outs; //Declare an output stream for reporting
int digramc[676]; //Set up the digram array
int *two = digramc; //Point to the digram array
int dicount = 0; //Holds the count of the number of digrams
int total = 0; //Counts the total number of letters seen for analysis
for (loop = 1; loop<argc; loop++) //Decide if we have arguments or must use defaults
{
if (!argv[1])
{
// cout << "No argument found.\n";
ifile1 = deflt;
}
else
{
cmdarg = argv[loop];
if (cmdarg == "-k")
{
loop++;
key = atoi(argv[loop]);
cout << "key = " << key << endl;
}
if (cmdarg == "-l")
{
loop++;
len = atoi(argv[loop]);
cout << "Run for " << len << " characters.\n";
}
if (cmdarg == "-m")
{
loop++;
m = atof(argv[loop]);
cout << "Run until and error of " << m << "\n";
}
if (cmdarg == "-off")
{
loop++;
off = atoi(argv[loop]);
cout << ...
assign4assign4_part1bonnie.c This is a file system ben.docx
assign4/assign4_part1/bonnie.c
/*
* This is a file system benchmark which attempts to study bottlenecks -
* it is named 'Bonnie' after Bonnie Raitt, who knows how to use one.
*
* Commentary on Bonnie's operations may be found at
* http://www.textuality.com/bonnie/intro.html
*
* COPYRIGHT NOTICE:
* Copyright (c) Tim Bray, 1990-1996.
*
*/
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <stdio.h>
#include <errno.h>
#include <fcntl.h>
#include <time.h>
#include <sys/time.h>
#include <sys/types.h>
#include <sys/wait.h>
#if defined(SysV)
#include <limits.h>
#include <sys/times.h>
#else
#include <sys/resource.h>
#endif
#define IntSize (sizeof(int))
/*
* N.B. in seeker_reports, CPU appears and Start/End time, but not Elapsed,
* so position 1 is re-used; icky data coupling.
*/
#define CPU (0)
#define Elapsed (1)
#define StartTime (1)
#define EndTime (2)
#define Seeks (4000)
#define UpdateSeek (10)
#define SeekProcCount (3)
#define Chunk (16384)
/* labels for the tests, used as an array index */
typedef enum {
Putc, ReWrite, FastWrite, Getc, FastRead, Lseek, TestCount
} tests_t;
static double cpu_so_far();
static void doseek(off_t where, int fd, int update);
static void get_delta_t(tests_t test);
static void io_error(char *message);
static void newfile(char *name, int *fd, FILE * *stream, int create);
static void fill_file_char();
static void fill_file_block();
static void file_read_rewrite_block();
static void file_read_getc();
static void file_read_chunk();
#if defined(SysV)
/* System V wrappers for randomizers */
static long random();
static void srandom(int seed);
#endif
static void report(char *machine, off_t size);
static double time_so_far();
static void timestamp();
static void usage();
/*
* Housekeeping variables to build up timestamps for the tests;
* global to make it easy to keep track of the progress of time.
* all of this could have been done with non-global variables,
* but the code is easier to read this way and I don't anticipate
* much software engineering down the road
*/
static int basetime; /* when we started */
static double delta[(int) TestCount][2]; /* array of DeltaT values */
static double last_cpustamp = 0.0; /* for computing delta-t */
static double last_timestamp = 0.0; /* for computing delta-t */
char name[Chunk];
FILE *stream;
int fd;
off_t words;
off_t size;
int buf[Chunk / IntSize];
int bufindex;
int chars[256];
int next;
/* entry point for LMP1 */
int bonnie_main(int argc, char **argv)
{
int child;
char *dir;
double first_start;
double last_stop;
int lseek_count = 0;
char *machine;
int seek_control[2];
int seek_feedback[2];
char seek_tickets[Seeks + SeekProcCount];
double seeker_report[3];
fd = -1;
basetime = (int) time((time_t *) NULL);
size = 100;
dir = ".";
machine = "";
/* parse the argument sent from the command line */
for (next = 1; next < argc; next++) {
if (strcmp(argv[next], "-s") ...
Tested on ubuntu,Linux#include stdio.h #include string.h.pdf
//Tested on ubuntu,Linux
#include
#include
#include
#include //for getpid()
#include //for wait
/*Main function start*/
void main(int argc, char *argv[])
{
pid_t pid;//storing process id
int i;
int status = 0;
/*Start for loop*/
for (i = 1; i < argc; i++)
{
pid=fork();//forking process
if (pid == 0)// child process
{
/*Printing file name and process Id*/
printf(\"Filename: %s PID: %d\ \",argv[i],getpid());
return;
}else{
pid = wait(&status);//waiting for child process to complete
}
}/*End for loop*/
printf(\"done!\ \");
}
/*Main function End*/
/************output**************/
gopal@gopal:~/Desktop/chegg$ gcc fork.c -o program2
gopal@gopal:~/Desktop/chegg$ ./program2 *.c
Filename: Calculator.c PID: 22742
Filename: char2dArray.c PID: 22743
Filename: client.c PID: 22744
Filename: commandLine.c PID: 22745
Filename: directory.c PID: 22746
Filename: dLinkedList.c PID: 22747
Filename: duplicateArrayRemove.c PID: 22748
Filename: fileReading.c PID: 22749
Filename: fork.c PID: 22750
Filename: hailstone.c PID: 22751
Filename: hello.c PID: 22752
Filename: interest.c PID: 22753
Filename: inventory.c PID: 22754
Filename: largeNumber.c PID: 22755
Filename: lscat.c PID: 22756
Filename: main.c PID: 22757
Filename: nestedLoop.c PID: 22758
Filename: Person.c PID: 22759
Filename: prime.c PID: 22760
Filename: railCiper.c PID: 22761
Filename: random.c PID: 22762
Filename: readFile.c PID: 22763
Filename: rollercoaster.c PID: 22764
Filename: server.c PID: 22765
Filename: simple-cat.c PID: 22766
Filename: simple-ls.c PID: 22767
Filename: sumRecursion.c PID: 22768
Filename: Tree.c PID: 22769
done!
gopal@gopal:~/Desktop/chegg$ ./program2 Person.c server.c
Filename: Person.c PID: 22814
Filename: server.c PID: 22815
done!
Thanks a lot
Solution
//Tested on ubuntu,Linux
#include
#include
#include
#include //for getpid()
#include //for wait
/*Main function start*/
void main(int argc, char *argv[])
{
pid_t pid;//storing process id
int i;
int status = 0;
/*Start for loop*/
for (i = 1; i < argc; i++)
{
pid=fork();//forking process
if (pid == 0)// child process
{
/*Printing file name and process Id*/
printf(\"Filename: %s PID: %d\ \",argv[i],getpid());
return;
}else{
pid = wait(&status);//waiting for child process to complete
}
}/*End for loop*/
printf(\"done!\ \");
}
/*Main function End*/
/************output**************/
gopal@gopal:~/Desktop/chegg$ gcc fork.c -o program2
gopal@gopal:~/Desktop/chegg$ ./program2 *.c
Filename: Calculator.c PID: 22742
Filename: char2dArray.c PID: 22743
Filename: client.c PID: 22744
Filename: commandLine.c PID: 22745
Filename: directory.c PID: 22746
Filename: dLinkedList.c PID: 22747
Filename: duplicateArrayRemove.c PID: 22748
Filename: fileReading.c PID: 22749
Filename: fork.c PID: 22750
Filename: hailstone.c PID: 22751
Filename: hello.c PID: 22752
Filename: interest.c PID: 22753
Filename: inventory.c PID: 22754
Filename: largeNumber.c PID: 22755
Filename: lscat.c PID: 22756
Filename: main.c PID: 22757
Filename: nestedLoop.c PID: 22758
Filena.
1- Answer the following characteristics for Chytridiomycota Fungi- A-.pdf
1. Answer the following characteristics for Chytridiomycota Fungi.
A. Color
B. Texture
C. Form
D. Size
E. Starch storage (where)
1. Answer the following characteristics for Chytridiomycota Fungi.
A. Color
B. Texture
C. Form
D. Size
E. Starch storage (where).
1- A TIPS has a coupon of 7-- paid semiannually- The current rate of i.pdf
1. A TIPS has a coupon of 7% , paid semiannually. The current rate of inflation is 6% . Calculate
the total dollar coupon interest that will be paid during the first 12 months..
More Related Content
Similar to -- This is the shell-c Test- --shell -test sub #include -ctype-h- -- C.pdf
[2007 CodeEngn Conference 01] seaofglass - Linux Virus Analysis
2007 CodeEngn Conference 01
리눅스 바이러스인 Sickabs.dr에 대해 각 함수별 상세 분석 설명과 이를 C 언어로 구현하여 설명한다. File #1은 Sickabs.dr 바이러스를 C로 복원한 파일이고, File #2는 Sickabs.dr 바이러스 백신이다.
http://codeengn.com/conference/01
#define ENABLE_COMMANDER#define ENABLE_REPORTER#include c.docx
#define ENABLE_COMMANDER
#define ENABLE_REPORTER
#include <cctype> // for toupper()
#include <cstdlib> // for EXIT_SUCCESS and EXIT_FAILURE
#include <cstring> // for strerror()
#include <cerrno> // for errno
#include <deque> // for deque (used for ready and blocked queues)
#include <fstream> // for ifstream (used for reading simulated process programs)
#include <iostream> // for cout, endl, and cin
#include <sstream> // for stringstream (for parsing simulated process programs)
#include <sys/wait.h> // for wait()
#include <unistd.h> // for pipe(), read(), write(), close(), fork(), and _exit()
#include <vector> // for vector (used for PCB table)
using namespace std;
class Instruction {
public:
char operation;
int intArg;
string stringArg;
};
class Cpu {
public:
vector<Instruction> *pProgram;
int programCounter;
int value;
int timeSlice;
int timeSliceUsed;
};
enum State {
STATE_READY,
STATE_RUNNING,
STATE_BLOCKED,
STATE_END
};
class PcbEntry {
public:
int processId;
int parentProcessId;
vector<Instruction> program;
unsigned int programCounter;
int value;
unsigned int priority;
State state;
unsigned int startTime;
unsigned int timeUsed;
};
// The number of valid priorities.
#define NUM_PRIORITIES 4
// An array that maps priorities to their allotted time slices.
static const unsigned int PRIORITY_TIME_SLICES[NUM_PRIORITIES] = {
1,
2,
4,
8
};
unsigned int timestamp = 0;
Cpu cpu;
// For the states below, -1 indicates empty (since it is an invalid index).
int runningState = -1; // The index of the running process in the PCB table.
// readyStates is an array of queues. Each queue holds PCB indices for ready processes
// of a particular priority.
deque<int> readyStates[NUM_PRIORITIES];
deque<int> blockedState; // A queue fo PCB indices for blocked processes.
deque<int> deadState;
// In this implementation, we'll never explicitly clear PCB entries and the
// index in the table will always be the process ID. These choices waste memory,
// but since this program is just a simulation it the easiest approach.
// Additionally, debugging is simpler since table slots and process IDs are
// never re-used.
vector<PcbEntry *> pcbTable;
double cumulativeTimeDiff = 0;
int numTerminatedProcesses = 0;
// Sadly, C++ has no built-in way to trim strings:
string &trim(string &argument)
{
string whitespace(" \t\n\v\f\r");
size_t found = argument.find_last_not_of(whitespace);
if (found != string::npos) {
argument.erase(found + 1);
argument.erase(0, argument.find_first_not_of(whitespace));
} else {
argument.clear(); // all whitespace
}
return argument;
}
bool createProgram(const string &filename, vector<Instruction> &program)
{
ifstream file;
int lineNum = 0;
program.clear();
file.open(filename.c_str());
if (!file.is_open()) {
cout << "Error opening file " << filename << ...
various tricks for remote linux exploits by Seok-Ha Lee (wh1ant)
Modern operating systems include hardened security mechanisms to block exploit attempts. ASLR and NX (DEP) are two examples of the mechanisms that are widely implemented for the sake of security. However, there exists ways to bypass such protections by leveraging advanced exploitation techniques. It becomes harder to achieve code execution when the exploitation originates from a remote location, such as when the attack originates from a client, targeting server daemons. In such cases it is harder to find out the context information of target systems and, therefore, harder to achieve code execution. Knowledge on the memory layout of the targeted process is a crucial piece of the puzzle in developing an exploit, but it is harder to figure out when the exploit attempt is performed remotely. Recently, there have been techniques to leverage information disclosure (memory leak) vulnerabilities to figure out where specific library modules are loaded in the memory layout space, and such classes of vulnerabilities have been proven to be useful to bypass ASLR. However, there is also a different way of figuring out the memory layout of a process running in a remote environment. This method involves probing for valid addresses in target remote process. In a Linux environment, forked child processes will inherit already randomized memory layout from the parent process. Thus every client connection made to server daemons will share the same memory layout. The memory layout randomization is only done during the startup of the parent service process, and not randomized again when it is forking a child process to handle client connections. Due to the inheritance of child processes, it is possible to figure out a small piece of different information from every connection, and these pieces can be assembled later to get the idea of a big picture of the target process's remote memory layout. Probing to see if a given address is a valid memory address in context of the target remote process and assembling such information together, an attacker can figure out where the libc library is loaded on the memory, thus allowing exploits to succeed further in code execution. One might call it brute force, but with a smart brute forcing strategy, the number of minimal required attempts are significantly reduced to less than 10 in usual cases. In this talk, we will be talking about how it is possible to probe for memory layout space utilizing a piece of code to put the target in a blocked state, and to achieve stable code execution in remote exploit attempt scenarios using such information, as well as other tricks that are often used in remote exploit development in the Linux environment.
http://codeblue.jp/en-speaker.html#SeokHaLee
Add a 3rd field help that contains a short help string for each of t.pdf
Add a 3rd field help that contains a short help string for each of the commands you were to
implement in assignment #3. Make sure that your array(s) are big enough to handle 5 extra items
beyond your initialization. To save time only include help for exercises 4, 5, 6 and 8 in this
assignment, and use No help for the other entries.
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
void ctrlCHandler(int signum)
{
fprintf(stderr,"Command server terminated using C\n");
exit(1);
}
char * fExport(char *cmd, char *tokensleft[])
{
setenv(tokensleft[0],tokensleft[1],1);
return "Command 'export' was received";
}
char * fChdir(char *cmd,char *tokensleft[])
{
int ch=chdir(tokensleft[0]);
if(ch<0)
perror("chdir change of directory not successful\n");
else
printf("chdir change of directory successful\n");
return "Command 'chdir' was received\n";
}
char * fAccess(char *cmd,char *tokensleft[])
{
int exists =0;
for(int i=0;tokensleft[i]; i++) {
exists =0;
if(access(tokensleft[i],F_OK)==0){
exists = 1;
printf("file %s exists\n",tokensleft[i]);
}else{
printf("file %s does not exists\n",tokensleft[i]);
}
if (exists == 1){
if(access(tokensleft[i],R_OK)==0) {
printf("file %s is readable\n",tokensleft[i]);
}else{printf("file %s is not readable\n",tokensleft[i]);}
if(access(tokensleft[i],W_OK)==0) {
printf("file %s is writeable\n",tokensleft[i]);
}else{
printf("file %s is not writeable\n",tokensleft[i]);
}
if(access(tokensleft[i],X_OK)==0) {
printf("file %s is executeable\n",tokensleft[i]);
}else{
printf("file %s is not executeable\n",tokensleft[i]);
}
}// exists if
} //for
return "Command 'acsess' was received\n";
}
char * fChmod(char *cmd,char *tokensleft[])
{
unsigned int octalPerm;
sscanf(tokensleft[0],"%o",&octalPerm);
for(int i=1;tokensleft[i]; i++) {
if(chmod(tokensleft[i],octalPerm)==0 ){
chmod(tokensleft[i],octalPerm);
}else{
printf("Error: %s \n",strerror(errno));
}
}
return "Command 'chmod' was received";
}
char * fPath(char *cmd,char *tokensleft[])
{
char *pathLink;
char actualPath[PATH_MAX+1];
char *pointer;
char *bName;
char *dName;
for(int i=0;tokensleft[i]; i++) {
pathLink = tokensleft[i];
pointer =realpath(pathLink,actualPath);
bName = basename(actualPath);
dName = dirname(tokensleft[i]);
if (pointer){
printf("The Real path of %s is: %s\n",tokensleft[i],actualPath);
printf("The Dir name path of %s is: %s\n",tokensleft[i],dName);
printf("The Base name of %s is: %s\n",tokensleft[i],bName);
}else{
printf("Error: %s \n",strerror(errno));
}
}
return "Command 'path' was received";
}
char * fTouch(char *cmd,char *tokensleft[])
{
extern int optind,optopt,opterr;
struct FLAG{
bool aFlag;
bool mFlag;
} flags = { false, false };
int t1 = time(NULL), t2 = time(NULL);
int argc = 0;
int flag;
for (int i = 0; tokensleft[i]; i++) {
argc++;
}
while ((flag = getopt(argc, tokensleft, "m.
Workshop 1: Good practices in JavaScript
Workshop Good Practices in JavaScript. Regular Expressions. Scopes & Closures. Memory Leaks.
Presentado por Ing. Mario García
ood evening people. Ive been working on this code that sends a bur.pdf
ood evening people. I\'ve been working on this code that sends a burst on the client side as well
as the private fifo name over a struct, to a server which will process several clients and the burst
time that will be sent back to the client through the private fifo.
The issue is that once I enter the burst on the client side, it won\'t send the proper burst to the
server, which in turn it will read the private fifo name but not the burst, since there is no burst
(and the server has a set burst entered by the user), the actual burst will become a giantnumber.
I\'m attaching my code hoping than maybe another pair of eyes can see where I am getting my
mistake and help me to correct it. Thanks
client:
my input for the client:
server:
the input and outcome from the server:
at this point I canceled the program with a ctrl + C to cancel the recurring burst in reversive
count.
Again any help or suggestion is well received. Thanks
Solution
client:
#include
#include
#include
#include
#include
#include
#include
#include
typedef struct values {
char name[30];
int arrivalTime;
int burst; //used for both the initial size of the process and to send the completion time
} Process; /*Datatype of the elements in the queue*/
int main( int argc, char *argv[] ){
Process process;
int fdIN; //to write to character server
int fdOUT; //to read from character server
int clientID;
clientID = getpid();
sprintf(process.name, \"FIFO_%d\", clientID);
printf(\"\ FIFO name is %s \", process.name);
if((mkfifo(process.name, 0666)<0 && errno != EEXIST))
{
perror(\"Can\'t create private FIFO\ \");
exit(-1);
}
printf(\"\ Enter burst: \ \")
scanf(\"%d\", &process.burst);
if((fdIN=open(\"commFIFO\", O_WRONLY))<0) //writting into fifo
printf(\"cant open fifo to write\");
write(fdIN, &process, sizeof(process));
if((fdOUT=open(process.name, O_RDONLY))<0) //reading from fifo
printf(\"cant open fifo to read\");
read(fdOUT, &process, sizeof(process));
printf(\"\ arrival time: %d \ \", process.arrivalTime);
unlink (\"commFIFO\");
unlink (process.name);
close(fdIN);
close(fdOUT);
}
SERVER:
#include
#include
#include
#include
#include
#include
#include
#include
//Inbox/Outbox structure
typedef struct values {
char name[30];
int arrivalTime;
int burst; //used for both the initial size of the process and to send the completion time
} Process;
//Node definition
typedef struct node{ /*Nodes stored in the linked list*/
struct values request;
struct node *next;
} Node;
//Queue Definition
typedef struct queue{ /*A struct facilitates passing a queue as an argument*/
Node *head; /*Pointer to the first node holding the queue\'s data*/
Node *tail; /*Pointer to the last node holding the queue\'s data*/
int sz; /*Number of nodes in the queue*/
} Queue;
int size( Queue *Q ){
return Q->sz;
}
int isEmpty( Queue *Q ){
if( Q->sz == 0 ) return 1;
return 0;
}
void enqueue( Queue *Q, struct values elem ){
Node *v = (Node*)malloc(sizeof(Node));/*Allocate memory for the Node*/
if( !v ){
printf(\"ERROR: Insufficien.
Containers: What are they, Really?
Inspired by Liz Rice, I'll attempt to create a container runtime of myself in Go while eventually explaining linux containerization primitives and discussing the ecosystem.
Write a C++ program 1. Study the function process_text() in file.pdf
Write a C++ program
1. Study the function process_text() in file \"text_processing.cpp\". What do the string member
functions find(), substr(), c_str() do?
//text_processing.cpp
#include \"util.h\"
#include \"text_processing.h\"
#include
using namespace std;
int process_text( fstream &ifs, fstream &ofs, char target[] )
{
string replace_str( \"XXX\" ); //hard-coded string for replacement
int tlen = strlen( target ); //string length of target
int max_len = 200; //maximum length of a line
char s[max_len+1];
clear_screen(); //clear the screen
while ( !ifs.eof() ) {
int i2, i1 = 0, len=0;
ifs.getline( s, max_len ); //get one line from file
string str( s ); //construct a string object
i2 = str.find ( target, i1 ); //find target
len = i2 - i1;
if ( i2 > -1 && len > 0 ){ //if target found
print_text( str.substr( i1, i2 ).c_str() ); //print up to target
ofs << str.substr( i1, i2 );
}
while ( i2 > -1 ) {
print_text_inverse ( target ); //highlight target
ofs << replace_str;
i1 = i2 + tlen; //new search position
i2 = str.find ( target, i1 ); //find next target
len = i2 - i1;
if ( i2 > -1 && len > 0 ){ //found target
print_text( str.substr( i1, len ).c_str() ); //print up to target
ofs << str.substr( i1, len );
}
}
len = str.length() - i1;
if ( len > 0 ) { //print the remainder
print_text( str.substr( i1, len ).c_str() );
ofs << str.substr( i1, len );
}
ofs << endl;
getnstr( s, 1 ); //prompt for
} //while ( !ifs.eof() )
restore_screen(); //restore the old screen
return 1;
}
//text_processing.h
#ifndef TEXT_PROCESSING_H
#define TEXT_PROCESSING_H
#include
#include
using namespace std;
int process_text( fstream &ifs, fstream &ofs, char target[] );
#endif
//util.h
#ifndef UTIL_H
#define UTIL_H
#include
#include
#include
#include
#include
using namespace std;
void usage ( char program_name[] );
void clear_screen();
void print_text( const char *s );
void print_text_inverse( const char *s );
void get_input_text( char *s, int max_len );
void restore_screen();
#endif
//util.cpp
#include \"util.h\"
void usage ( char program_name[] )
{
cout << \"Usage: \" << program_name << \" infile outfile search_string\" << endl;
return;
}
/*
The following are some curses functions. You can find
the details by the command \"man ncurses\". But its use
can be transparent to you.
*/
void clear_screen()
{
initscr();
scrollok ( stdscr, true ); //allow window to scroll
}
void print_text ( const char *s )
{
printw(\"%s\", s );
refresh();
}
void print_text_inverse( const char *s )
{
attron( A_REVERSE );
printw(\"%s\", s );
attroff( A_REVERSE );
refresh();
}
void get_input_text( char *s, int max_len )
{
getnstr( s, max_len );
}
void restore_screen()
{
endwin();
}
//str_main.cpp
#include \"util.h\"
#include \"text_processing.h\"
#include
using namespace std;
/*
Note that grace_open() must be defined in same file
as main(), otherwise the destructor of fstream will
automatically close the opened file as it finds that
its out of scope upon exiting the function.
*/
int grace_open( char *s, fst.
Were writing code for a project that dynamically allocates an arra.pdf
We\'re writing code for a project that dynamically allocates an array stack. My other code works,
but my Min(), Max(), and Peek() functions fail. I\'ve provided my code for those functions at the
end of the post.
main.cpp
_________________________________________
#include
#include
#include
#include
#include \"stack.h\"
using namespace std;
int main(int argc, char* argv[])
{
ifstream inputs; // Input file for commands
char op; // Hold operation and optional char input
int value; // Value input from file
string comment; // Holds comment from file
Stack* sPtr = NULL; // Will point to TemplateQ object
// Output usage message if one input file name is not provided
if (argc != 2)
{
cout << \"Usage:\ project03 \ \";
return 1;
}
// Attempt to open input file -- terminate if file does not open
inputs.open(argv[1]);
if (!inputs)
{
cout << \"Error - unable to open input file\" << endl;
return 1;
}
// Input and echo header comment from file
getline(inputs, comment); // Input and echo the comment appearing in the test file
cout << endl << \'#\' << comment << endl;
// Process commands from input file
inputs >> op; // Attempt to input first command
while (inputs)
{
switch (op) // Process operation input from file
{
case \'#\': // Test file comment
getline(inputs, comment); // Input and echo the comment appearing in the test
file
cout << \'#\' << comment << endl;
break;
case \'c\': // Parameterized Constructor
inputs >> value;
cout << endl << \"Stack(\" << value << \")\";
try
{
sPtr = new Stack(value); // Attempt to create a stack object with array size
value
cout << \" -- completed\" << endl;
}
catch ( std::bad_alloc )
{
cout << \"Failed : Terminating now...\" << endl;
return 1;
}
break;
case \'+\': // Push
inputs >> value;
cout << \"Push(\" << value << \") -- \";
try
{
sPtr->Push(value);
cout << \"completed\";
}
catch (StackFull)
{
cout << \"Failed Full Stack\";
}
catch (...)
{
cout << \"operation failed\" << endl;
}
cout << endl;
break;
case \'-\': // Pop
cout << \"Pop() -- \";
try
{
sPtr->Pop();
cout << \"completed\";
}
catch (StackEmpty)
{
cout << \"Failed Empty Stack\";
}
catch (...)
{
cout << \"operation failed\" << endl;
}
cout << endl;
break;
case \'f\': // IsFull
cout << \"IsFull() -- \";
try
{
if (sPtr->IsFull())
cout << \"true\";
else
cout << \"false\";
}
catch ( ... )
{
cout << \"operation failed\";
}
cout << endl;
break;
case \'e\': // IsEmpty
cout << \"IsEmpty() -- \";
try
{
if (sPtr->IsEmpty())
cout << \"true\";
else
cout << \"false\";
}
catch ( ... )
{
cout << \"operation failed\";
}
cout << endl;
break;
case \'m\': // Make Empty
cout << \"MakeEmpty() -- \";
try
{
sPtr->MakeEmpty();
cout << \"completed\" << endl;
}
catch (...)
{
cout << \"operation failed\" << endl;
}
break;
case \'p\': // Print Stack
cout << \"Print() -- \";
sPtr->Print();
break;
case \'t\': // Top of Stack
try
{
cout << \"Top() -- \" << sPtr->Top() << endl;
}
catch (StackEmpty)
{
cout << \"Top() -- Failed Empty Stack\" << endl;
}
catch (...)
{
cout << \"operation failed\" .
Start with the inclusion of libraries#include iostream .docx
// Start with the inclusion of libraries
#include <iostream> //The library of io functions
#include <fstream> //The library of external stream functions
#include <cstdlib> //The library for external errors
#include <string> //The library for string functions
#include <cmath> //The library of C math functions
#include <iomanip> //Allows setting widths, etc. for I/O
#include <stdlib.h>
#include <stdio.h>
#include<vector>
using namespace std;
// Define all of the prototypes for functions used in the program
// Counts the number of unique letters seen
int countunique(int *array, int size);
// Creates the input file and formats it for use by the cipher section.
void createinput(string ifile, string ofile);
// Creates the encoded input file
void createcipher(int key, string ifile, string ofile);
// Finds and counts the number of digrams
int digram(int *pointer, string ifile);
// Counts the letter frequency in the encoded input file
int lettercount(int*, string ifile, string ofile);
// Finds the highest count in the singlton (or any other) array
int singleton(int*, int size);
// Trims an input file to the right size starting at an offset
void trimfile(string ifile, string ofile, int offset, int size);
// Begin the main function for testing
int main(int argc, char* argv[])
{
int count = 0;
int second = 0;
int singlefreq[26];
int *single = singlefreq;
int delta;
int loop; //The loop counter for arguments
int final = 0;
int totalcnt;
int key = -1; //Sets the key value
int len = 0; //The length to investigate for testing
int off; //Holds the offset into the file
double m; //Holds the metric error value
char loopletter;
float percent;
string ifile1 = "";
string ofile1 = "";
string deflt = "c:\\dissertation\\ShiftandSubcipherC++files\\clean.txt";
string ifile2 = "";
string ofile2 = ""; //Holds selected file path names
string cmdarg; //Holds the command line argument
string stop = "l"; //Gives the stop condition, assumes l
string reportfile = "c:\\dissertation\\test\\report.txt";
ofstream outs; //Declare an output stream for reporting
int digramc[676]; //Set up the digram array
int *two = digramc; //Point to the digram array
int dicount = 0; //Holds the count of the number of digrams
int total = 0; //Counts the total number of letters seen for analysis
for (loop = 1; loop<argc; loop++) //Decide if we have arguments or must use defaults
{
if (!argv[1])
{
// cout << "No argument found.\n";
ifile1 = deflt;
}
else
{
cmdarg = argv[loop];
if (cmdarg == "-k")
{
loop++;
key = atoi(argv[loop]);
cout << "key = " << key << endl;
}
if (cmdarg == "-l")
{
loop++;
len = atoi(argv[loop]);
cout << "Run for " << len << " characters.\n";
}
if (cmdarg == "-m")
{
loop++;
m = atof(argv[loop]);
cout << "Run until and error of " << m << "\n";
}
if (cmdarg == "-off")
{
loop++;
off = atoi(argv[loop]);
cout << ...
assign4assign4_part1bonnie.c This is a file system ben.docx
assign4/assign4_part1/bonnie.c
/*
* This is a file system benchmark which attempts to study bottlenecks -
* it is named 'Bonnie' after Bonnie Raitt, who knows how to use one.
*
* Commentary on Bonnie's operations may be found at
* http://www.textuality.com/bonnie/intro.html
*
* COPYRIGHT NOTICE:
* Copyright (c) Tim Bray, 1990-1996.
*
*/
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <stdio.h>
#include <errno.h>
#include <fcntl.h>
#include <time.h>
#include <sys/time.h>
#include <sys/types.h>
#include <sys/wait.h>
#if defined(SysV)
#include <limits.h>
#include <sys/times.h>
#else
#include <sys/resource.h>
#endif
#define IntSize (sizeof(int))
/*
* N.B. in seeker_reports, CPU appears and Start/End time, but not Elapsed,
* so position 1 is re-used; icky data coupling.
*/
#define CPU (0)
#define Elapsed (1)
#define StartTime (1)
#define EndTime (2)
#define Seeks (4000)
#define UpdateSeek (10)
#define SeekProcCount (3)
#define Chunk (16384)
/* labels for the tests, used as an array index */
typedef enum {
Putc, ReWrite, FastWrite, Getc, FastRead, Lseek, TestCount
} tests_t;
static double cpu_so_far();
static void doseek(off_t where, int fd, int update);
static void get_delta_t(tests_t test);
static void io_error(char *message);
static void newfile(char *name, int *fd, FILE * *stream, int create);
static void fill_file_char();
static void fill_file_block();
static void file_read_rewrite_block();
static void file_read_getc();
static void file_read_chunk();
#if defined(SysV)
/* System V wrappers for randomizers */
static long random();
static void srandom(int seed);
#endif
static void report(char *machine, off_t size);
static double time_so_far();
static void timestamp();
static void usage();
/*
* Housekeeping variables to build up timestamps for the tests;
* global to make it easy to keep track of the progress of time.
* all of this could have been done with non-global variables,
* but the code is easier to read this way and I don't anticipate
* much software engineering down the road
*/
static int basetime; /* when we started */
static double delta[(int) TestCount][2]; /* array of DeltaT values */
static double last_cpustamp = 0.0; /* for computing delta-t */
static double last_timestamp = 0.0; /* for computing delta-t */
char name[Chunk];
FILE *stream;
int fd;
off_t words;
off_t size;
int buf[Chunk / IntSize];
int bufindex;
int chars[256];
int next;
/* entry point for LMP1 */
int bonnie_main(int argc, char **argv)
{
int child;
char *dir;
double first_start;
double last_stop;
int lseek_count = 0;
char *machine;
int seek_control[2];
int seek_feedback[2];
char seek_tickets[Seeks + SeekProcCount];
double seeker_report[3];
fd = -1;
basetime = (int) time((time_t *) NULL);
size = 100;
dir = ".";
machine = "";
/* parse the argument sent from the command line */
for (next = 1; next < argc; next++) {
if (strcmp(argv[next], "-s") ...
Tested on ubuntu,Linux#include stdio.h #include string.h.pdf
//Tested on ubuntu,Linux
#include
#include
#include
#include //for getpid()
#include //for wait
/*Main function start*/
void main(int argc, char *argv[])
{
pid_t pid;//storing process id
int i;
int status = 0;
/*Start for loop*/
for (i = 1; i < argc; i++)
{
pid=fork();//forking process
if (pid == 0)// child process
{
/*Printing file name and process Id*/
printf(\"Filename: %s PID: %d\ \",argv[i],getpid());
return;
}else{
pid = wait(&status);//waiting for child process to complete
}
}/*End for loop*/
printf(\"done!\ \");
}
/*Main function End*/
/************output**************/
gopal@gopal:~/Desktop/chegg$ gcc fork.c -o program2
gopal@gopal:~/Desktop/chegg$ ./program2 *.c
Filename: Calculator.c PID: 22742
Filename: char2dArray.c PID: 22743
Filename: client.c PID: 22744
Filename: commandLine.c PID: 22745
Filename: directory.c PID: 22746
Filename: dLinkedList.c PID: 22747
Filename: duplicateArrayRemove.c PID: 22748
Filename: fileReading.c PID: 22749
Filename: fork.c PID: 22750
Filename: hailstone.c PID: 22751
Filename: hello.c PID: 22752
Filename: interest.c PID: 22753
Filename: inventory.c PID: 22754
Filename: largeNumber.c PID: 22755
Filename: lscat.c PID: 22756
Filename: main.c PID: 22757
Filename: nestedLoop.c PID: 22758
Filename: Person.c PID: 22759
Filename: prime.c PID: 22760
Filename: railCiper.c PID: 22761
Filename: random.c PID: 22762
Filename: readFile.c PID: 22763
Filename: rollercoaster.c PID: 22764
Filename: server.c PID: 22765
Filename: simple-cat.c PID: 22766
Filename: simple-ls.c PID: 22767
Filename: sumRecursion.c PID: 22768
Filename: Tree.c PID: 22769
done!
gopal@gopal:~/Desktop/chegg$ ./program2 Person.c server.c
Filename: Person.c PID: 22814
Filename: server.c PID: 22815
done!
Thanks a lot
Solution
//Tested on ubuntu,Linux
#include
#include
#include
#include //for getpid()
#include //for wait
/*Main function start*/
void main(int argc, char *argv[])
{
pid_t pid;//storing process id
int i;
int status = 0;
/*Start for loop*/
for (i = 1; i < argc; i++)
{
pid=fork();//forking process
if (pid == 0)// child process
{
/*Printing file name and process Id*/
printf(\"Filename: %s PID: %d\ \",argv[i],getpid());
return;
}else{
pid = wait(&status);//waiting for child process to complete
}
}/*End for loop*/
printf(\"done!\ \");
}
/*Main function End*/
/************output**************/
gopal@gopal:~/Desktop/chegg$ gcc fork.c -o program2
gopal@gopal:~/Desktop/chegg$ ./program2 *.c
Filename: Calculator.c PID: 22742
Filename: char2dArray.c PID: 22743
Filename: client.c PID: 22744
Filename: commandLine.c PID: 22745
Filename: directory.c PID: 22746
Filename: dLinkedList.c PID: 22747
Filename: duplicateArrayRemove.c PID: 22748
Filename: fileReading.c PID: 22749
Filename: fork.c PID: 22750
Filename: hailstone.c PID: 22751
Filename: hello.c PID: 22752
Filename: interest.c PID: 22753
Filename: inventory.c PID: 22754
Filename: largeNumber.c PID: 22755
Filename: lscat.c PID: 22756
Filename: main.c PID: 22757
Filename: nestedLoop.c PID: 22758
Filena.
Similar to -- This is the shell-c Test- --shell -test sub #include -ctype-h- -- C.pdf (20)
[2007 CodeEngn Conference 01] seaofglass - Linux Virus Analysis
[2007 CodeEngn Conference 01] seaofglass - Linux Virus Analysis
#define ENABLE_COMMANDER#define ENABLE_REPORTER#include c.docx
#define ENABLE_COMMANDER#define ENABLE_REPORTER#include c.docx
various tricks for remote linux exploits by Seok-Ha Lee (wh1ant)
various tricks for remote linux exploits by Seok-Ha Lee (wh1ant)
Add a 3rd field help that contains a short help string for each of t.pdf
Add a 3rd field help that contains a short help string for each of t.pdf
ood evening people. Ive been working on this code that sends a bur.pdf
ood evening people. Ive been working on this code that sends a bur.pdf
Write a C++ program 1. Study the function process_text() in file.pdf
Write a C++ program 1. Study the function process_text() in file.pdf
Were writing code for a project that dynamically allocates an arra.pdf
Were writing code for a project that dynamically allocates an arra.pdf
Start with the inclusion of libraries#include iostream .docx
Start with the inclusion of libraries#include iostream .docx
assign4assign4_part1bonnie.c This is a file system ben.docx
assign4assign4_part1bonnie.c This is a file system ben.docx
Tested on ubuntu,Linux#include stdio.h #include string.h.pdf
Tested on ubuntu,Linux#include stdio.h #include string.h.pdf
More from AdrianEBJKingr
1- Answer the following characteristics for Chytridiomycota Fungi- A-.pdf
1. Answer the following characteristics for Chytridiomycota Fungi.
A. Color
B. Texture
C. Form
D. Size
E. Starch storage (where)
1. Answer the following characteristics for Chytridiomycota Fungi.
A. Color
B. Texture
C. Form
D. Size
E. Starch storage (where).
1- A TIPS has a coupon of 7-- paid semiannually- The current rate of i.pdf
1. A TIPS has a coupon of 7% , paid semiannually. The current rate of inflation is 6% . Calculate
the total dollar coupon interest that will be paid during the first 12 months..
1- A General Right to Privacy was written explicitly into the US Const.pdf
1. A General Right to Privacy was written explicitly into the US Constitution and Bill of Rights.
True or False?
2 .A tort is a wrongful act or an infringement of a right (other than under contract) leading to
civil legal liability. General categories of torts include:
A. Intentional torts
B. Strict Liability such as product liability
C. Negligence
D. All of these are correct
3. What must a plaintiff show in order to prove a defamation case?
A. The Burden of Proof
B. The damage to the plaintiff's business.
C. Harm to the reputation of plaintiff
D. All of these are correct.
1- A business has the following information for the year- Determine th.pdf
1. A business has the following information for the year: Determine the after-tax income this
business must achieve for the year to meet the 15% minimum required ROI..
1- -8 points- Write a MIPS code to compute the factorial of a positive.pdf
1. [8 points] Write a MIPS code to compute the factorial of a positive integer. Assume that the
integer is to be given as input by the user. You have to output the factorial of the number as The
factorial of the given integer xxx is xxx.
1- (Aggregates) Consider an economy that is in below full employment e.pdf
1. (Aggregates) Consider an economy that is in below full employment equilibrium due to an
decrease in spending confidence. Prices of productive resources have not changed. With the help
of a graph, discuss how the economy returns to the long run equilibrium, a. With no government
intervention? b. With government intervention, aiming to reduce unemployment in the short run?
c. Should the government interfere the economy?.
1- (3 polats) O Suppose that A add B are ladepedbet ewnts- Furthemore-.pdf
1. (3 polats) O Suppose that A add B are ladepedbet ewnts. Furthemore, mpoie that P ( A ) = 025
(n) 0 (b) 610 (c), 0.33 (dtili 4 P ( A atis A )? (a) 0 (b) 030 (c) 06 ) (d. 0.13.
-The following information applies to the questions displayed below- O.pdf
[The following information applies to the questions displayed below] On December 1, Jasmin
Emst organized Emst Consulting. On December 3, the owner contributed $84 , 000 in assets in
exchange for its common stock to launch the business. On December 31 , the company's records
show the following items and amounts. Ising the above information prepare a December
statement of retained earnings for Ernst Consulting. Hint Retained Earnings on iecember 1 was
$0 . \begin{tabular}{|l|l|} \hline \multicolumn{2}{|c|}{ ERNST CONSULTING } \\ \hline
Statement of Retained Earnings \\ \hline Retained earnings, December 1 & $ \\ \hline Add: Net
income \\ Add: Dividends \\ Add: Net income \\ Add: Net loss & \\ \hline \end{tabular}.
-NYP-- New York Paper Co-- is using its financial results for August 2.pdf
"NYP," New York Paper Co., is using its financial results for August 2019 (Table 1) as a base
for projecting the company's budget for the remaining four months of the year (September-
December).
-Java lang- Q3 (10)- A program creates a queue- The program takes arra.pdf
*Java lang*
Q3 (10): A program creates a queue. The program takes array of user names as String and then
performs following operations: - If the user name starts with A to S , it will add (enqueue) to the
queue - If the user name starts with T to Z , it will remove (dequeue) one element from the queue
and then add the user to the queue. What will the queue look like if the input array is as follows?
Please clearly label front and rear of the queue. ["Saeed", "Akram", "Jamal", "Tanveer",
"Usman", "Ahmed", "Dawood", "Waheed"].
-2-Cyanide is a highly fast-acting poison- In fact- it was developed a.pdf
.2.Cyanide is a highly fast-acting poison. In fact, it was developed as a suicide pill (called Lpill)
during World War II so that British and American spies could avoid being captured alive. Given
what you know about ATP and cellular respiration, explain why cyanide is so fast acting.
3. Given what you know about cyanide poisoning, do you think that giving a person oxygen
would be an effective treatment? Why or why not?
4.How can you reconcile this observation with the cause of death being hypoxia?.
-begin{tabular}{l-l} cHALlenge -- ACriviry -end{tabular} 4-3-1- Confid.pdf
\begin{tabular}{l|l} cHALlenge \\ ACriviry \end{tabular} 4.3.1: Confidence intervals for
population proportions. Critical values for quick reference during this activity. Jump to level 1 A
poll for a statewide election has a margin of error of 4.42 percentage points. How many voters
should be sampled for a 95% confidence interval? Round up to the nearest whole number. voters.
---BUS-- public class Bus { String busIdentifier- String driverName- d.pdf
---BUS--
public class Bus {
String busIdentifier;
String driverName;
double averageSpeed;
BusRoute route;
ArrayList<Passenger> passengers;
BusStop currentStop;
public Bus(String busIdentifier, String driverName, double averageSpeed, BusRoute route) {
this.busIdentifier = busIdentifier;
this.driverName = driverName;
this.averageSpeed = averageSpeed;
this.route = route;
this.passengers = new ArrayList<Passenger>();
this.currentStop = route.firstStop;
}
public String getBusIdentifier() {
return busIdentifier;
}
public int getPassengers() {
return passengers.size();
}
public void letPassengersOn() {
ArrayList<Passenger> waitingPassengers = currentStop.getPassengers();
for (Passenger passenger : waitingPassengers) {
if (passengers.size() < 50) {
passengers.add(passenger);
} else {
break;
}
}
}
public void letPassengersOff() {
ArrayList<Passenger> passengersToRemove = new ArrayList<Passenger>();
for (Passenger passenger : passengers) {
if (passenger.getDestination() == currentStop) {
passengersToRemove.add(passenger);
}
}
passengers.removeAll(passengersToRemove);
}
public int moveToNextStop() {
BusStop nextStop = route.getNextStop(currentStop);
int minutesToNextStop = (int) (60 * BusRoute.getDistance(currentStop, nextStop) /
averageSpeed);
currentStop = nextStop;
return minutesToNextStop;
}
public void thankTheDriver() {
System.out.println("Thank you, " + driverName + ", for driving bus " + busIdentifier + "
today!");
}
public String toString() {
String output = "Bus " + busIdentifier + " (driver: " + driverName + ")\n";
output += "Current stop: " + currentStop.getStopName() + "\n";
output += "Passengers on board:\n";
if (passengers.isEmpty()) {
output += "None\n";
} else {
for (Passenger passenger : passengers) {
output += "- " + passenger + "\n";
}
}
return output;
}
}
---METROROUTE--
package transit_manager;
public class MetroRoute {
int routeNumber;
String routeDescription;
MetroStation firstStop;
MetroStation lastStop;
public MetroRoute(int routeNumber, String routeDescription, MetroStation firstStop,
MetroStation lastStop) {
this.routeNumber = routeNumber;
this.routeDescription = routeDescription;
this.firstStop = firstStop;
this.lastStop = lastStop;
}
public double calculateDistance() {
return MetroStation.getDistance(firstStop, lastStop);
}
@Override
public String toString() {
return "Route " + routeNumber + ": " + routeDescription + " (" + firstStop.getName() + " - " +
lastStop.getName() + ")";
}
}
---TRANSITMANAGERRUNNER--
package transit_manager;
public class TransitManagerRunner
{
public static void main(String[] args)
{
System.out.println("BUS TESTING =============================\n");
TestBuses();
System.out.println("METRO TESTING =============================\n");
TestMetro();
}
public static void TestBuses()
{
// Create some bus stops
// Oakland stop, stop number 12342, at location (0,0)
BusStop stopA = new BusStop("Oakland", 12342, 0, 0);
BusStop stopB = new BusStop("Downtown", 87236, -2.3, 0.2);
BusStop stopC = new BusStop("Swissv.
-10 points- For each of the Regular Expression- draw FA recognizing th.pdf
[10 points] For each of the Regular Expression, draw FA recognizing the corresponding
language a. ( 0 + 1 ) ( 010 + 101 ) ( 0 + 1 ) b. ( 000 ) 1 + ( 00 ) 1 c. ( 0 1 ) 000 ( 0 1 ) d. 1 1 .010. (
11 ).
--What is wrong with this C++ program- -- # include iostream using nam.pdf
*/What is wrong with this C++ program? /*
# include iostream
using namespace std;
int main();
{
int number, half
Cout << "Enter a number: ";
cin >> number1;
half = / 2;
cout << fixedpoint << showpoint << half << ednl;
return 0;
}.
-10 points- Construct minimized DFA accepting language represented by.pdf
[10 points] Construct minimized DFA accepting language represented by RE 0 1 2 . Convert
given RE to NFA with arrows if needed and covert the NF A to DFA..
--INSTRUCTION- --It helps to first create if-then-else structure to fi.pdf
//INSTRUCTION:
//It helps to first create if-then-else structure to fill in later.
//- Make sure PURPOSE and PARAMETER comments are given in detail
// Add sufficient comments to your code body to describe what it does.
// - Make sure all if-then-else are commented describing which case it is
// - Make sure all local variables are described fully with their purposes
//Complete the TODO parts.
// ====================================================
//Complier: g++
//File type: linkedList.cpp implementation file
//=====================================================
#include<iostream>
#include"linkedlist.h"
using namespace std;
//cunstructor that initializes an empty list
LinkedList::LinkedList() {
front = nullptr ;
rear = nullptr ;
count = 0;
}
/**
* @brief Destructor to destroy all nodes and release memory
*/
LinkedList::~LinkedList() {
Node *p, *q;
p = front;
while (p != nullptr ) {
q = p->next;
delete p;
p = q;
}
}
/**
* @brief Purpose: Checks if the list is empty
* @return true if the list is empty, false otherwise
*/
bool LinkedList::isEmpty() const {
// TODO: Add code here
return count == 0;
}
/**
* @brief Get the number of nodes in the list
* @return int The number of nodes in the list
*/
int LinkedList::length() const {
return count;
}
/**
* @brief Convert the list to a string
*
*/
string LinkedList::toString() {
string str = "[";
Node *ptr = front;
if (ptr != nullptr ) {
// Head node is not preceded by separator
str += to_string(ptr->val);
ptr = ptr->next;
}
while (ptr != nullptr ) {
str += ", " + to_string(ptr->val);
ptr = ptr->next;
}
str += "]";
return str;
}
/**
* @brief Displays the contents of the list
*/
void LinkedList::displayAll() {
cout << toString() << endl;
}
//Add a node to the end of the list
void LinkedList::addRear(T val) {
Node *p = new Node;
p->val = val;
p->next = nullptr ;
if (isEmpty()) {
front = p;
}
else {
rear->next = p;
}
rear = p;
count++;
// consider the two cases of whether the list was empty
}
//Add a node to the front of the list
void LinkedList::addFront(T val) {
Node *p = new Node;
p->val = val;
p->next = front;
if (isEmpty()) {
rear = p;
}
front = p;
count++;
// consider the two cases of whether the list was empty
}
//Delete the first node of the list
bool LinkedList::deleteFront(T &OldNum) {
if (isEmpty()) {
return false ;
}
Node *p = front;
OldNum = p->val;
front = front->next;
if (front == nullptr ) {
rear = nullptr ;
}
delete p;
count--;
return true ;
// consider if the list was empty and return false if the list is empty
// consider the special case of deleting the only node in the list
}
//Delete the last node of the list
bool LinkedList::deleteRear(T &OldNum) {
if (isEmpty()) {
return false ;
}
Node *p = rear;
OldNum = p->val;
if (front == rear) {
front = rear = nullptr ;
}
else {
Node *q = front;
while (q->next != rear) {
q = q->next;
}
rear = q;
q->next = nullptr ;
}
delete p;
count--;
return true ;
// consider if the list was empty and return false if the list is empty
// consider the specia.
--kindly help---Explain what happens when the PUSHA instruction execut.pdf
//kindly help...
Explain what happens when the PUSHA instruction executes. Make sure to show the
physical addresses where data are stored. (Assume that SP = 0006H and SS = 0000H
before execution.) Show diagram of what happens after the excution and also show
base addresss , physical address and final address in that diagram
//kindly help....
1)What is the most important benefit you believe students get from the.pdf
1)What is the most important benefit you believe students get from the use of
multimedia/hypermedia in education?
2)List each step in the multimedia development process, and describe a learning benefit for each
step
3)Which of the multimedia/hypermedia formats do you think would be most useful for creating a
professional teaching portfolio: hypermedia software, presentation software, video production
software, hypermedia authoring, virtual reality systems?.
More from AdrianEBJKingr (20)
1- Answer the following characteristics for Chytridiomycota Fungi- A-.pdf
1- Answer the following characteristics for Chytridiomycota Fungi- A-.pdf
1- A TIPS has a coupon of 7-- paid semiannually- The current rate of i.pdf
1- A TIPS has a coupon of 7-- paid semiannually- The current rate of i.pdf
1- A General Right to Privacy was written explicitly into the US Const.pdf
1- A General Right to Privacy was written explicitly into the US Const.pdf
1- A business has the following information for the year- Determine th.pdf
1- A business has the following information for the year- Determine th.pdf
1- -8 points- Write a MIPS code to compute the factorial of a positive.pdf
1- -8 points- Write a MIPS code to compute the factorial of a positive.pdf
1- (Aggregates) Consider an economy that is in below full employment e.pdf
1- (Aggregates) Consider an economy that is in below full employment e.pdf
1- (3 polats) O Suppose that A add B are ladepedbet ewnts- Furthemore-.pdf
1- (3 polats) O Suppose that A add B are ladepedbet ewnts- Furthemore-.pdf
-The following information applies to the questions displayed below- O.pdf
-The following information applies to the questions displayed below- O.pdf
-NYP-- New York Paper Co-- is using its financial results for August 2.pdf
-NYP-- New York Paper Co-- is using its financial results for August 2.pdf
-Java lang- Q3 (10)- A program creates a queue- The program takes arra.pdf
-Java lang- Q3 (10)- A program creates a queue- The program takes arra.pdf
-2-Cyanide is a highly fast-acting poison- In fact- it was developed a.pdf
-2-Cyanide is a highly fast-acting poison- In fact- it was developed a.pdf
-begin{tabular}{l-l} cHALlenge -- ACriviry -end{tabular} 4-3-1- Confid.pdf
-begin{tabular}{l-l} cHALlenge -- ACriviry -end{tabular} 4-3-1- Confid.pdf
---BUS-- public class Bus { String busIdentifier- String driverName- d.pdf
---BUS-- public class Bus { String busIdentifier- String driverName- d.pdf
-10 points- For each of the Regular Expression- draw FA recognizing th.pdf
-10 points- For each of the Regular Expression- draw FA recognizing th.pdf
--What is wrong with this C++ program- -- # include iostream using nam.pdf
--What is wrong with this C++ program- -- # include iostream using nam.pdf
-10 points- Construct minimized DFA accepting language represented by.pdf
-10 points- Construct minimized DFA accepting language represented by.pdf
--INSTRUCTION- --It helps to first create if-then-else structure to fi.pdf
--INSTRUCTION- --It helps to first create if-then-else structure to fi.pdf
--kindly help---Explain what happens when the PUSHA instruction execut.pdf
--kindly help---Explain what happens when the PUSHA instruction execut.pdf
1)What is the most important benefit you believe students get from the.pdf
1)What is the most important benefit you believe students get from the.pdf
Recently uploaded
Synthetic Fiber Construction in lab .pptx
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Model Attribute Check Company Auto Property
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
The Roman Empire A Historical Colossus.pdf
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Template Jadual Bertugas Kelas (Boleh Edit)
Jadual Bertugas kelas dalam bentuk softcopy PowerPoint. Cikgu boleh download >> edit >> print >> laminate. Semoga bermanfaat.
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is prepared for master's students (MIFB & MIBS) UUM. May it be useful to all.ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdfFundacja Rozwoju Społeczeństwa Przedsiębiorczego
Wolontariat grupowyCambridge International AS A Level Biology Coursebook - EBook (MaryFosbery J...
for studentd in cabridge board
How to Create Map Views in the Odoo 17 ERP
The map views are useful for providing a geographical representation of data. They allow users to visualize and analyze the data in a more intuitive manner.
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
Polish students' mobility in the Czech Republic
Polish students mobility to the Czech Republic within eTwinning project "Medieval adventures with Marco Polo"
The Challenger.pdf DNHS Official Publication
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...
GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...Nguyen Thanh Tu Collection
https://app.box.com/s/4hfk1xwgxnova7f4dm37birdzflj806wThe approach at University of Liverpool.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
Supporting (UKRI) OA monographs at Salford.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
Palestine last event orientationfvgnh .pptx
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Recently uploaded (20)
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
Cambridge International AS A Level Biology Coursebook - EBook (MaryFosbery J...
Cambridge International AS A Level Biology Coursebook - EBook (MaryFosbery J...
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...
GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...
-- This is the shell-c Test- --shell -test sub #include -ctype-h- -- C.pdf
- 1. // This is the shell.c Test: ./shell -test sub #include <ctype.h> /* Character types */ #include <stdio.h> /* Standard buffered input/output */ #include <stdlib.h> /* Standard library functions */ #include <string.h> /* String operations */ #include <sys/types.h> /* Data types */ #include <sys/wait.h> /* Declarations for waiting */ #include <unistd.h> /* Standard symbolic constants and types */ #include "smp1_tests.h" /* Built-in test system */ /* DEFINE SECTION */ #define SHELL_BUFFER_SIZE 256 /* Size of the Shell input buffer */ #define SHELL_MAX_ARGS 8 /* Maximum number of arguments parsed */ #define SHELL_HISTORY_SIZE 10 /* VARIABLE SECTION */ enum { STATE_SPACE, STATE_NON_SPACE }; /* Parser states */ char shell_history[SHELL_HISTORY_SIZE][SHELL_BUFFER_SIZE]; int shell_history_next_index = 0; int imthechild(const char *path_to_exec, char *const args[]) { // TO-DO P5.1 return execvp(path_to_exec, args) ? -1 : 0; }
- 2. void imtheparent(pid_t child_pid, int run_in_background) { int child_return_val, child_error_code; /* fork returned a positive pid so we are the parent */ fprintf(stderr, " Parent says 'child process has been forked with pid=%d'n", child_pid); if (run_in_background) { fprintf(stderr, " Parent says 'run_in_background=1 ... so we're not waiting for the child'n"); return; } // TO-DO P5.4 wait(&child_return_val); /* Use the WEXITSTATUS to extract the status code from the return value */ child_error_code = WEXITSTATUS(child_return_val); fprintf(stderr, " Parent says 'wait() returned so the child with pid=%d is finished.'n", child_pid); if (child_error_code != 0) { fprintf(stderr, " Parent says 'Child process %d failed with code %d'n", child_pid, child_error_code);
- 3. } } int get_shell_command(char *buffer, int size) { int i = 0; char c; while (i < size - 1 && (c = getchar()) != EOF && c != 'n') { buffer[i++] = c; } buffer[i] = '0'; return i; } void parse_command(char *command, char **exec_args, int *exec_bg) { int argc = 0; *exec_bg = 0; while (*command != '0') { /* Strip whitespace. */ while (isspace(*command)) { ++command; } if (*command == '0') { break;
- 4. } /* Save the argument. */ if (argc < SHELL_MAX_ARGS) { exec_args[argc++] = command; } while (*command != '0' && !isspace(*command)) { ++command; } if (*command != '0') { *command++ = '0'; } } exec_args[argc] = NULL; /* Check for background execution request. */ if (argc > 0 && !strcmp(exec_args[argc - 1], "&")) { *exec_bg = 1; exec_args[--argc] = NULL; } } void run_shell_command; int main(int argc, char **argv) { pid_t shell_pid, pid_from_fork;
- 5. int n_read, i, exec_argc, parser_state, run_in_background; char buffer[SHELL_BUFFER_SIZE]; char *exec_argv[SHELL_MAX_ARGS + 1]; // TO-DO new variables for P5.2, P5.3, P5.6 if (argc > 1 && !strcmp(argv[1], "-test")) { return run_smp1_tests(argc - 1, argv + 1); } shell_pid = getpid(); int command_counter = 1; while (1) { /* The Shell runs in an infinite loop, processing input. */ if (exec_argc > 0) { command_counter++; } // TO-DO P5.2 fprintf(stdout, "Shell(pid=%d)%d> ", shell_pid, command_counter); fflush(stdout); if (fgets(buffer, SHELL_BUFFER_SIZE, stdin) == NULL) return EXIT_SUCCESS; n_read = strlen(buffer);
- 6. run_in_background = n_read > 2 && buffer[n_read - 2] == '&'; buffer[n_read - run_in_background - 1] = 'n'; // TO-DO P5.3 /* Parse the arguments: the first argument is the file or command * * we want to run. */ parser_state = STATE_SPACE; for (exec_argc = 0, i = 0; (buffer[i] != 'n') && (exec_argc < SHELL_MAX_ARGS); i++) { if (!isspace(buffer[i])) { if (parser_state == STATE_SPACE) exec_argv[exec_argc++] = &buffer[i]; parser_state = STATE_NON_SPACE; } else { buffer[i] = '0'; parser_state = STATE_SPACE; } } buffer[i] = '0'; /* Terminate input, overwriting the '&' if it exists */ if (!exec_argc)
- 7. continue; exec_argv[exec_argc] = NULL; if (!strcmp(exec_argv[0], "exit")) { printf("Exiting process %dn", shell_pid); return EXIT_SUCCESS; /* End Shell program */ } else if (!strcmp(exec_argv[0], "cd") && exec_argc > 1) { if (chdir(exec_argv[1])) fprintf(stderr, "cd: failed to chdir %sn", exec_argv[1]); } else { pid_from_fork = fork(); if (pid_from_fork < 0) { fprintf(stderr, "fork failedn"); continue; } if (pid_from_fork == 0) { // TO-DO P5.6 return imthechild(exec_argv[0], &exec_argv[0]);
- 8. /* Exit from main. */ } else { imtheparent(pid_from_fork, run_in_background); } } } return EXIT_SUCCESS; } /* end main() */ //This is the smp1._tests.c #define _GNU_SOURCE #include <stdio.h> #undef _GNU_SOURCE #include <stdlib.h> #include <string.h> #include <unistd.h> #include "testrunner.h" #include "smp1_tests.h" #define quit_if(cond) do {if (cond) exit(EXIT_FAILURE);} while(0) /* Prepare input, reroute file descriptors, and run the program. */ void run_test(const char *input, int argc, char **argv)
- 9. { FILE *in = fopen("smp1.in", "w"); fprintf(in, input); fclose(in); freopen("smp1.in", "r", stdin ); freopen("smp1.out", "w", stdout); freopen("smp1.err", "w", stderr); /* Run the program */ quit_if(main(argc, argv) != EXIT_SUCCESS); fclose(stdout); fclose(stderr); } /* P5.1: Test of executing commands in the path */ int test_path(int argc, char **argv) { char *args[] = { "./shell", NULL }; FILE *out, *err; int pid_tmp; /* Run the test */ run_test("lsn/bin/lsnexitn", 1, args); /* Check output */ err = fopen("smp1.err", "r"); quit_if(fscanf(err, " Parent says 'child process has been forked with pid=%d'n"
- 10. " Parent says 'wait() returned so the child with pid=%d is finished.'n" " Parent says 'child process has been forked with pid=%d'n" " Parent says 'wait() returned so the child with pid=%d is finished.'n", &pid_tmp, &pid_tmp, &pid_tmp, &pid_tmp) != 4); quit_if(!feof(err)); fclose(err); return EXIT_SUCCESS; } /* P5.2: Test of command line counter */ int test_counter(int argc, char **argv) { char *args[] = { "./shell", NULL }; FILE *out, *err; int pid_tmp; /* Run the test */ run_test("n/bin/truenexitn", 1, args); /* Check output */ out = fopen("smp1.out", "r"); quit_if(fscanf(out, "Shell(pid=%d)1> Shell(pid=%d)1> Shell(pid=%d)2> Exiting process %dn", &pid_tmp, &pid_tmp, &pid_tmp, &pid_tmp) != 4); quit_if(!feof(out)); fclose(out); return EXIT_SUCCESS; }
- 11. /* P5.3: Test of re-executing earlier commands */ int test_rerun(int argc, char **argv) { char *args[] = { "./shell", NULL }; FILE *out, *err; int pid_tmp; /* Run the test */ run_test("/bin/echo testn!1nexitn", 1, args); /* Check output */ out = fopen("smp1.out", "r"); quit_if(fscanf(out, "Shell(pid=%d)1> testnShell(pid=%d)2> testnShell(pid=%d)3> Exiting process %dn", &pid_tmp, &pid_tmp, &pid_tmp, &pid_tmp) != 4); quit_if(!feof(out)); fclose(out); return EXIT_SUCCESS; } /* P5.5: Test of depth-limited sub */ int test_sub(int argc, char **argv) { char *args[] = { "./shell", NULL }; FILE *out, *err; int pids[4], warned_too_deep; /* Run the test */ run_test("newsubnnewsubnnewsubnexitnexitnexitn", 1, args);
- 12. /* Check output */ out = fopen("smp1.out", "r"); err = fopen("smp1.err", "r"); /* First, check that the subshells were invoked. */ fscanf(out, "Shell(pid=%d)1> Shell(pid=%d)1> Shell(pid=%d)1> Shell(pid=%d)2> ", &pids[0], &pids[1], &pids[2], &pids[3]); quit_if(!((pids[0] != pids[1]) && (pids[1] != pids[2]) && (pids[0] != pids[2]) && (pids[2] == pids[3]))); /* Next, check for the "Too deep!" message: */ warned_too_deep = 0; /* Use a while loop because multiple processes write to stderr concurrently. */ while (!warned_too_deep && !feof(err)) { char too_deep[11]; fgets(too_deep, 11, err); if (!strncmp(too_deep, "Too deep!n", 10)) warned_too_deep = 1; } quit_if(!warned_too_deep); fclose(out); fclose(err); return EXIT_SUCCESS; } /* * Main entry point for SMP1 test harness
- 13. */ int run_smp1_tests(int argc, char **argv) { /* Tests can be invoked by matching their name or their suite name or 'all' */ testentry_t tests[] = { { "newsub", "smp1", test_sub }, { "rerun", "smp1", test_rerun }, { "counter", "smp1", test_counter }, { "path", "smp1", test_path } }; int result = run_testrunner(argc, argv, tests, sizeof(tests) / sizeof (testentry_t)); unlink("smp1.in"); unlink("smp1.out"); unlink("smp1.err"); return result; } 1. Modify this project so that you can use 'ls' instead of '/bin/ls'