n modern operating systems, kernel processes messages are communicated securely via different encryption mechanisms such as Zig-Zag cipher which divides the message into two parts: the first part contains the odd-positions characters, while the second part contains the even-positions characters. Eventually, the cipher is constructed by concatenating the first part with second part. Using anonymous pipes, write a program to produce a full duplex communication in which both child and parent processes can send/receive user data encrypted with Zig-Zag cipher. - Assume the child initiate the communication by sending the first encrypted message When receiving an encrypted message, the message should be decrypted before displaying it - The communication should cease if either process sends the message "bye" The parent and child should close the unused ends of their pipes Assume that the maximum input size is 1024 characters - Use the fgets(...) function for the user input Q2 Program: Q2 Sample compile and run session:

n modern operating systems, kernel processes messages are communicated securely via different encryption mechanisms such as Zig-Zag cipher which divides the message into two parts: the first part contains the odd-positions characters, while the second part contains the even-positions characters. Eventually, the cipher is constructed by concatenating the first part with second part. Using anonymous pipes, write a program to produce a full duplex communication in which both child and parent processes can send/receive user data encrypted with Zig-Zag cipher. - Assume the child initiate the communication by sending the first encrypted message When receiving an encrypted message, the message should be decrypted before displaying it - The communication should cease if either process sends the message "bye" The parent and child should close the unused ends of their pipes Assume that the maximum input size is 1024 characters - Use the fgets(...) function for the user input Q2 Program: Q2 Sample compile and run session:

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Java Program ASAP ************This program must work in hypergrade and pass all the test cases.********** Please give me a new program because the program down below des not work in hypergrade. Please look closely at the underlined parts of the correct test case as shown in the screenshot. Observe the underline parts. It must print out that exact same output. I have provided the failed as well as a screenshot. import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.regex.Pattern;import java.util.regex.Matcher;public class WordSeparator { public static void main(String[] args) { try (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) { String inputFileName; boolean fileNotFound; System.out.print("Please enter the file name or type QUIT to exit:\n"); do { fileNotFound = false; // Reset fileNotFound flag for…
Computer Science Answer the following questions using CloudSim: Part A: Write a Java program that performs the following steps: Initialize the CloudSim package. Create a datacenter with four virtual machines with one CPU each. Bind the 4 virtual machines to four cloudlets. Run the simulation and print simulation results.
MIME supports multiple representations of the same content using the multipart/alternative syntax; for example, text could be sent as text/plain, text/richtext, and application/postscript. Why do you think plaintext is supposed to be the first format, even though implementations might find it easier to place plaintext after their native format?
Create a java program which contains three threads and demonstrate how they can be prioritised.
My task from the teacher is to create a program that solves the three problems using threads in Python: 2 files: reader.py and writer.py In the readers-writers problem there is a common resource where a group of actors called readers want to read from the resource and another group of actors called writers want to write to the resource. The basic synchronization problem that needs to be solved is:1. Mutual exclusion of the resource, where:• only one writer may print at a time, and• no writer may write while a reader is reading.An ordinary mutex lock that is applied equally to all actors can solve this but will lead to only one actor being able to enter its critical section at a time. This is a problem as we normally want several readers to be able to read at the same time. The next problem that needs to be solved is therefore the following: 2. Several readers should be able to read the resource at the same time.In a solution where several readers can read simultaneously and lock out…
Hello im looking for some direction as to how to approach a homework question. At the moment im stuck because im trying to use scanf() with execlp in order to solve the question. Here is the question: Write a special simple command interpreter that takes a command and its arguments. This interpreter is a program where the main process creates a child process to execute the command using exec() family functions. After executing the command, it asks for a new command input ( parent waits for child). The interpreter program will get terminated when the user enters quit. I'm just looking for direction, not to have someone solve it.
Exercise 1: Write a program "mywait.c" that creates two child processes and by using "waitpid". The first child will exit with a value 1 and the second with a value 3. The father must wait the second son.
Produce a computer code that shows a program that is subjected to variable attack (one of the attacks of buffer overflow). Any programming language works. Can also use pseudo code and the program does not need to compile (extra credit if works).
Given the string of numbers below: {23, 4, 8, 33, 25, 7, 12, 6, 49, 50, 11, 20, 21, 24, 35} Create a child process with fork(); Let the parent process printout the odd numbers. Whereas the child process printout the even numbers.
The initialization for a timer is shown. Assume that it uses a system clock of 16 MHz. Which describes the behavior best? /************************************************* / void init_TimerA (void) { TimerA_PRESCALE = 8; TimerA_MOD = 4000; TimerA_Control|=interruptEnableBit; //Turns it on /*************************************************/ /************************ ************/ void TimerA_Handler (void) { TimA++; TimerA_Control|=clrFlag; /*************************************************/ Initialization and handling of the interrupt flag does not appear to be correct. Nothing happens. Increments variable TimA at a frequency of 500 Hz Increments variable TimA at a frequency of 1000 Hz o Increments variable TimA at a frequency of 250 Hz
Deduce a Java program for the concept of Mutual Exclusion by using the following options. ▪ Synchronized method. ▪ Synchronized block. ▪ Static Synchronization
Write a C program called threadcircuit to run on ocelot which will provide a multithreaded solution to the circuit-satisfiability problem which will compute for what combinations of input values will the circuit output the value 1. This is the sequential solution, which is also attached. You should create 8 threads and divide the 65,536 test cases among them. For example, if p=8, each thread would be responsible for roughly 65,536/8 number of iterations (if it's not divisible, some threads can end up with one more iteration than the others). #include <stdio.h>#include <sys/time.h> /* Return 1 if 'i'th bit of 'n' is 1; 0 otherwise */#define EXTRACT_BIT(n,i) ((n&(1<<i))?1:0) int check_circuit (int z) {int v[16]; /* Each element is a bit of z */int i; for (i = 0; i < 16; i++) v[i] = EXTRACT_BIT(z,i);if ((v[0] || v[1]) && (!v[1] || !v[3]) && (v[2] || v[3])&& (!v[3] || !v[4]) && (v[4] || !v[5])&& (v[5] || !v[6]) &&…