logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

n-line code comments no fewer than every 5 lines of code which describe your algorithmic steps. Syntax transcriptions of the code are not considered in-line code comments!

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Need both assignments done and plz follow the instructions given in the programming document. If anyhting is needed plz let me know. The other two files with Proj are for Project 2.

 

Your project deliverables are to be posted to CUNY Blackboard using the Project 1 link.

1) Only one source code file as follows with filename as in the example where you will put

your own first initial and lastname and your

 own section number. I show the example for my own name with an example section 23:

JSvadlenka_prj1_sect23_src.c (or .cpp)

 a) At top of the file: your name in comments, for example: // First_Name Last_Name

 b) Next, the gcc or g++ code compilation and linkage command, for example: // gcc

JSvadlenka_prj1_sect23_src.c -o JSvadlenka_prj1_sect23_src.exe

 

 c) In-line code comments no fewer than every 5 lines of code which describe your algorithmic

steps. Syntax transcriptions of the code are

 not considered in-line code comments! (For example, I do not want to see the comment for

i++ which says "Increment i.")

2) An MS Word or PDF document with a write-up of your software design and an explanation of

the issues encountered and resolved. (1 page)

 Filename should be according to this example of my own name:

JSvadlenka_prj1_sect23_wrt.doc (or pdf)

Project Description

-------------------

In your first project you will create a program that, when executed, has both a parent

process and a child process. You use the fork()

system call to create a child process.

As in the cpfile.c program, your program takes two command line arguments for a source text

file name and a target filename

with the same semantics (source file exists in the same directory as the executable and the

target file does not already exist

in this same directory).

The parent process will read the source file contents in 128-character chunks (as in

cpfile.c) and write it to a pipe (instead of an output file).

The child process will read the contents of the pipe in 128-character chunks and write the

contents to both the target file and to the display screen in

128-character chunks. Obviously, the last chunk may be less than 128 characters based on the

size of the source file.

1) Your program accepts two command line arguments which are the name of the input file to be

read and the output file to be created.

2) Your program will make use of the POSIX system I/O calls discussed in lectures.

3) You are NOT permitted to use any C++ nor C standard I/O library functions nor cin nor

cout. Furthermore, you cannot use

 any C++ nor C standard library functions for string operations.

4) The parent and child processes may each use their own character buffer array of size 128.

5) I will test your code with source text files having 1 or more lines of text and each line

may have more than 128 characters.

6) This project essentially utilizes the code of cpfile.c for file copying and the code of

Fig 3.2.2 for pipes in the textbook.

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

912 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

747 Answers

Hire Me
expert
Husnain SaeedComputer science

681 Answers

Hire Me
expert
Atharva PatilComputer science

586 Answers

Hire Me
March
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
23
24
25
26
27
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30