Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

PLEASE WRITE IN C LINUX: PLEASE DO NOT COPY CODE FROM INTERNET AS MENTIONED. THANK YOU. (20 pts) Problem 1.35. Run the program on your

PLEASE WRITE IN C

LINUX:

image text in transcribed

PLEASE DO NOT COPY CODE FROM INTERNET AS MENTIONED.

THANK YOU.

(20 pts) Problem 1.35. Run the program on your OWN laptop/desktop, and record the maximum number of child processes you see before your system crashes, as well as your machine's memory size. (For those who doesn't have this edition of the textbook, the problem is as follows: If you have a personal UNIX-like system available that you can safely crash and reboot, write a shell script that attempts to create an unlimited number of child processes and observe what happens. Before running the experiment, type sync to the shell to flush the file system buffers to disk to avoid ruining the file system. ) Again, do NOT run the experiment on any shared system. You can write a C/C++ program instead of shell script for this experiment. Do NOT search for solutions. ( There is one on internet, but I doubt you would understand it, otherwise you wouldn't need to take this course now.) (20 pts) Problem 1.35. Run the program on your OWN laptop/desktop, and record the maximum number of child processes you see before your system crashes, as well as your machine's memory size. (For those who doesn't have this edition of the textbook, the problem is as follows: If you have a personal UNIX-like system available that you can safely crash and reboot, write a shell script that attempts to create an unlimited number of child processes and observe what happens. Before running the experiment, type sync to the shell to flush the file system buffers to disk to avoid ruining the file system. ) Again, do NOT run the experiment on any shared system. You can write a C/C++ program instead of shell script for this experiment. Do NOT search for solutions. ( There is one on internet, but I doubt you would understand it, otherwise you wouldn't need to take this course now.)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Fundamentals Of Database Systems

Authors: Sham Navathe,Ramez Elmasri

5th Edition

B01FGJTE0Q, 978-0805317558

More Books

Students also viewed these Databases questions

Question

What are Decision Trees?

Answered: 1 week ago

Question

What is meant by the Term Glass Ceiling?

Answered: 1 week ago