OS 1. The one program running at alltimes on the computer is called*a) The heart of the OSO b) The kernelO c) The fork()O d) Non of the above2. When you apply a fork(), the parentand child *O a) Share memoryO b) Do not share memoryO c) Share a small part of the memoryO d) They can communicate via arrays

As per our company guidelines we are suppose to answer only one question. Kindly repost other…

Answered: 1. The one program running at all times…

1. The one program running at all times on the computer is called O a) The heart of the OS O b) The kernel O c) The fork() d) Non of the above

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter9: Completing The Basics

Section9.6: A Closer Look: Namespaces And Creating A Personal Library

Problem 3E: (For thought) a. What’s an advantage of namespaces? b. What’s a possible disadvantage of namespaces?

See similar textbooks

Similar questions

MemoryManagerFirstFit The MemoryManagerFirstFit class is derived from the MemoryManagerBase class. Based on the TODO entries in memory_manager_first_fit.h and memory_manager_first_fit.cpp, implement the functions as instructed. memory_manager_first_fit.cpp #include "memory_manager_first_fit.h" #include using namespace std; MemoryManagerFirstFit::MemoryManagerFirstFit(int size) { // Set up the list of memory blocks with the info for this initial // unallocated block. memory_block b; // TODO: Fill in the appropriate values here based on the data elements // you added in the header file. // Add the block to the list of blocks m_blocks.push_back(b); } // Allocate a block of memory of the given size // We will walk through our current list of blocks and // find the block with the first fit. int MemoryManagerFirstFit::allocate(int size, string name) { // TODO: Implement the allocate logic here // // Iterate through the current list of blocks // and find the first one that is big enough…
In C++build a program to read that data with the following promptsa-) Create a class “name” with two data members: one for the first name (String) and one for the surname (String). The last name must be a pointer to char, the first name construct it as you prefer.b-) Create a grade class to store a subject name (String) and a grade (floating).c-) Create a class "student" that inherits from the class "name" and by composition can store the student's grades (consider that the maximum possible grades will be 6).d-) Create a group class to store the data of several students (consider a maximum of 10 students)e-) Develop a method that returns the average of the group of students.f-) Develop a method that returns the average of a student given his name and surname.g-) Develop a method that returns a list of students who have failed a subject (less than 6.0 points) given the name of the subject.h-) Develop a method that returns the first and last name of the student with the lowest…
Write programs that will accomplish the desired tasks listed below, using as few lines of code as possible.Use only opcodes that have been covered in class. Comment on each line of code. i) Copy the data in internal RAM locations 12h to 15h to internal RAM locations 20h to 23h ; copy12h to 20h, 13h to 21h, etc. . .j) Set the SP register to 07h and PUSH the SP register on the stack ; predict what number is PUSHEDto address 08hk) Exchange the content of the B register and external RAM address 02CFhl) Rotate the bytes in registers R0 to R3 ; copy the data in R0 to R1, R1 to R2, R2 to R3 and R3 toR0m) Copy the external code byte at address 007Dh to the SPn) Copy the data in register R5 to external RAM address 032Fho) Copy the internal code byte at address 0300h to external RAM address 0300hp) Swap the bytes in TIMER 0 ; put TL0 in TH0 and TH0 in TL0q) Store DPTR in external RAM locations 0123h (DPL) and 02BCh (DPH)r) Exchange both low nibbles of registers R0 and R1 ; put the low nibble of…
Write program for hotel booking system using C++ Program Requirement: a) Create least one (1) base class. b) Create least two (2) derived classes that inherit from the base class created in 2(a). c) Create least one (1) object for each class and one (1) array of objects for one of the class. d) Create least one (1) default constructor for every classes. f) Apply dynamic memory allocation using keyword new and delete for any object or array of objects. g) Create least one (1) virtual function. h) Write sufficient comments to explain your program. (Note : Only a reasonable level of user input checking is needed. Assume that a user will input text and numbers in good faith. He/she will not purposely enter text into a number field and will not key in non-alphanumeric characters for all text fields.)
Instruction: Answer question 4 (a,b & c) only (1) Create a C++ project for your assignment 3, with the name format prescribed in the Information section. Add a source file and name it SwapCount. In this file, write the C++ program that will perform the tasks specified in question 2.(2) Declare and implement a function called sortSwapCount that passes three parameters, the array, the size and the reference of proportion, and returns the count. The functiondeclaration is int sortSwapCount(int data[], int size, double& proportion) (i) The function sorts the integers in data[] in ascending order using the bubble sort method. The purpose is to count or determine the number of exchanges (swaps) made by the bubble sort algorithm. (ii) The expected number of sorting swaps (expectedSwapCount) is size * (size - 1) if the array was unsorted. Calculate the proportion of the array status by first converting (or casting) the integers, swapCount and expectedSwapCount into floating-point,…
Please write in C++ and run in linux. This assignment is about fork(), exec(), and wait() system calls, and commandline arguments. Write two C++ programs, to be named parent.cc and child.cc and compiled into executable parent and child, respectively that, when run, will work as follows: parent takes in a list of gender-name pairs from the commandline arguments creates as many child processes as there are in the gender-name pairs and passes to each child process a child number and a gender-name pair waits for all child processes to terminate outputs “All child processes terminated. Parent exits.” And terminates. child receives a child number and one gender-name pair arguments from parent outputs “Child # x, a boy (or girl), name xxxxxx.” Note: content of output depends on data received from parent Sample run To invoke the execution: >parent girl Nancy boy Mark boy Joseph parent process does the following: outputs “I have 3 children.” -- Note: the number 3…
do some changes in code and make it unique #include <stdio.h>#include <stdlib.h>#include<string.h>//declaring functionsvoid firstFit(int [], int , int [],int );void bestFit(int [], int , int [],int );void worstFit(int [], int , int [],int );//starting programint main() {//declare partitions and processint partitions [] = {110, 450, 100, 250, 500};int processes [] = {212, 417, 112, 426};//getting their sizesint size_partitions = sizeof(partitions )/sizeof(partitions [0]);int size_processes = sizeof(processes )/sizeof(processes [0]);printf("Partitions size: ") ;for (int i=0; i<size_partitions; i++){printf("%d\t" ,partitions[i] );}//index partprintf("\nPartitions index: " );for (int i=0; i<size_partitions; i++){printf("%d\t" ,(i+1)) ;}printf( "\n" );// calling functionsfirstFit(partitions , size_partitions, processes , size_processes);bestFit(partitions , size_partitions, processes , size_processes);worstFit(partitions , size_partitions, processes ,…
Answer the given question with a proper explanation and step-by-step solution. PYTHON PLS!!!!!!!!!!!! In this lab you are asked to complete the recursive function populateDirectory(directory_dict). The function is input a dictionary containing data about the directory file structure and is to be used to populate a MyDirectory object. You are supplied with the classes: MyDirectory and MyFile. Note that file names always have the letter 'f' in the name (e.g. f0.txt). Any other names denote directories
Complete the attached template program “server.c” with the following functionalities: Parent process creates 5 children processes. Each child process has a pipe set up for sending a string to the parent. Parent is monitoring data availability in any of the pipes. If it finds available pipes, it will read strings from the pipes into memory locations pointed by buf[] array elements. Parent needs to store the bytes from pipe, pip[i], into a memory pointed by buf[i]. Once the parent finds out that all its children processes are terminated, it will convert each string (stored in memory pointed by buf[i]) into an integer and add them up to find the total sum into a variable, sum. Variable sum will be returned at the end of the parent(). Parent also monitors any keyboard stroke. If a user types in ‘q’ character in the keyboard, parent needs to print a message “Quit!” and return 0 immediately. Other characters will be simply ignored by the parent, and it will continue its execution. You may…
Write a program in C++ that contains code addressing the following: (New code and with detailed steps!) a. Create an integer array of 100,000 items (static binding – before compiling) b. Create the same large array on the run time stack (in a function) c. Create the same large array from the heap (dynamic memory – dynamic binding). Call each of the subprograms 1,000,000 times and output the time required by each to finish all 1,000,000 calls. Which was the fastest? Here is code for calling time. #include <time.h> //in main() clock_t start = 0, end = 0; //variables start = clock(); //calls time function stores result in start end = clock(); // calls time function stores result in end //display the time by subtracting the start from the end //displays in clock ticks.
Linux general memory layout includes stack, heap, data, and code. stack memory relations stores local variables heap: dynamic memory for programmer to allocate data: stores global variables, separated into initialized and uninitialized code: stores the code being executed Use the following code to answer the questions that follow #include <stdio.h> #include <stdlib.h> int x; int main(int argc, char *argv[]) { int y=3 printf(": %p\n", main); int* z = malloc(100e6); printf("location of stack: %p\n", &y); return 0; } Where are the possible memory addresses of the above variables? Address Location x y main z *z
(For thought) a. What’s an advantage of namespaces? b. What’s a possible disadvantage of namespaces?