Under indirect communication process P wants to communicate with process Q using mailbox X.Which of the following primitives are required. a. send (X,Message), receive(X,Message) b. send (P,Message), receive (X,Message) c. send (X,Message),receive(Q,Message) d. send (P,Message), receive (Q,Message)
Q: Defanging an IP Address • Given a valid (IPv4) IP address, a defanged IP address replaces every…
A: A shorter way to solve the problem- class Defanging { public String defangIPad(String address) {…
Q: int x1=200; int y1=300; int z1, z2, 23, z4; int d1, d2, d3; _asm{ mov EAX, x1; 200 mov EBX, y1; 300…
A: (Answer):-
Q: 1. Consider machines which accept a stream of 1 or more bits (the alphabet is limited to l's and…
A: - We will use the 'or', 'and' and 'xor' operators for this problem.
Q: A. Function main: 1. Creates two pipes and makes them global. 2. Creates two processes. Each process…
A: Inter-process communication (IPC) is a general term that describes how two processes can exchange…
Q: you should achieve O(n) time)When Bob wants to send Alice a message M on the Internet, he breaks M…
A: Answer: When Alice receives the packets, every packet is associated with a sequence number. The…
Q: Translate the following specifications into English where F(p) is“Printer p is out of service”,…
A: According to the Bartelby guideline we are suppose to answer only first 3 sub part of the question…
Q: Write a pseudocode and draw a timeline diagram for the sliding window algorithm with SWA = RWS = 4…
A: Hey there, I am writing the required solution of the above stated question.Please do find the…
Q: Consider the following concurrent program. Initially a, b and c are 0. a:=1 ; print (b) ; print (c);…
A: According to question above of concurrent program refer below: Initially for P1: a=1,b=0,c=0 thus…
Q: Define the following connective t using only -, , and V a BY t(a, B, 7) TTT TTF TFT TFF FTT FTF FFT…
A: The Answer is
Q: 8. Little's Law with multiple servers. Assume one application sends packets to a network switch at…
A: Little's Law is a hypothesis that decides the normal number of things in a fixed lining framework,…
Q: Let H = Span{V1, V2, V3} be a subspace of R4, where 8 -4 3 6 V1 = V2 = V3 = -3 -2 -5 9 8 -18 Write a…
A: %{for w to belong to H, w should be able to be expressed as a linear combination of v1,v2 and v3this…
Q: Problem Solving. Consider the code below: Shared var X: integer; {initialized to 5} Process A…
A: Defined the given problem
Q: Write a C/C++ code to Implement the following scenario:
A: C is a compiled language that follows the concept of oops to make projects. It is used to build…
Q: Define the following connective † using only ¬, ^, and V. a By t(a, B,Y) TTT TTF TFT TF F FTT FTF…
A: Given: Connective T using only ¬,A, and V.
Q: Write a program that consists in three processes to print the message "ping-pong" two times on…
A: ANSWER:-
Q: What is the critical path of sw and j? Would sw have the same ciritical path as lw which is…
A: Critical path critical: The critical path is the longest sequence tasks that completed to…
Q: Write a system program in C that implements the client server communication using named pipes. A…
A: Two-way communication Using Named pipe In case of named pipe using library function mkfifo()) with…
Q: Construct a network corresponding to this compound statement. {P A [(Q ^~ R) V(~ Q ^ R)]} V [(~ P ^~…
A: We will first minimize this propositional expression and then we will make the network/ circuit for…
Q: Consider f : X Y, with domain X = {l,a, z,0, 8, m, c, e, g, d, u, v} and codomain Y = {44,35,67, 45,…
A: Hey there, I am writing the required solution based on the above given question. Please do find the…
Q: xy(x2 - y?) x2 + y? -3 <a < 3, -3<yS3 by computing the values of z over a 50 x 50 grid on the…
A: Requirements :- Approach :- Firstly handle all the x and y cordinatesUsing linspace create vectors…
Q: There are 4 sites in a distributed system, S1, S2, S3 and S4. Currently S1 possesses the idle token.…
A: Check response down below Explanation: The steps of the Suzuki-Kasami's broadcast algorithm are as…
Q: When Bob wants to send Alice a message M on the Internet, he breaks M into n data packets, numbers…
A: Alice can use the fragmentation scheme as in computer networks. Let's say the message size is…
Q: suppose r0 = 0x20000000 and r1 = 0x01234567. what is the content of r0 and r1 after the following…
A: LDRH is Load Register Halfword it actually reads half-word from memory location r0 + #4 as offset…
Q: Consider the code C={00010, 01100,01011,11010,01010}. What is the minimum distance of C? For what k…
A: In distance calculation, we find which codeword is closest to a received word. It is not a practical…
Q: b. suppose that machine a and machine b possession of the same secret key. machine a wishes to…
A: Alice wants to send a message to Bob. Both Alice and Bob share the same secret key. To encrypt…
Q: Q2: There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initially empty. Using…
A: In program first we get three values from user x y z. x<=y<=z so we check what is difference…
Q: The Feistel cipher is a symmetric block cipher encryption framework which is the basis of many…
A: There is a part of the question pending and you have uploaded the same question twice. I will try…
Q: Exercise 14.1 Tabulate the functions y = (x² + 3) sin x² and =sin? nx/(z~2+3) for x = 0,0.2,..., 10.…
A: The question has been answered in step2
Q: A path P is known as a closed path if the path has the same end points, that is, if v0 = vn
A: Answer : - True it is true that A path P is known as a closed path if the path has the same end…
Q: You are a spy, and, conveniently, have a library with an infinite number of books at your disposal.…
A: DescriptionOne-time pad is also known as the "perfect cipher". It is basically a cryptographic…
Q: 2. Define the following connective † using only ¬, ^, and V. y | t(a, B, y) TTT TTF T FT TFF FTT FTF…
A: Here we need to use KMap to find the boolean function
Q: Describe in words the function and the output of the following subroutine. SUBROUTINE GCD (IJ,K) IF…
A: The program is written to find the greatest common divisor K of two positive integers I and J.…
Q: As discussed in Class 05, cryptography is the area of mathematics intended for the study of…
A: The above question is solved in step 2 :-
Q: A paint company is trying to recycle unpopular paint colours by mixing them together to create…
A: MATLAB is a programming platform designed specifically for engineers and scientists to analyze and…
Q: 3. Suppose Alice, with a Web-based e-mail account (such as Hotmail or gmail), sends a message to…
A: Given: Suppose Alice, with a Web-based e-mail account (such as Hotmail or Gmail), sends a message to…
Q: Q1/ Implement a network consists of two different networks one of them is of 3 PCs the second is of…
A: Given: Implement a network consists of two different networks one of them is of 3 PCs the second is…
Q: 1) Let A = {xEN:x² – 16 = 0}. Rewrité A In Poster Hotation. |A| = 2) Let B = {x E Z : x² – 16 = 0}.…
A: Roaster notation is used to represent elements within {}
Q: In direct communication when each process P and Q that wants to communicate must explicitly name the…
A: in direct communication, when each process P and Q that wants to communicate must explicitly name…
Q: Q2-Consider the following code fragment. i=m-1; j-n; v=a[n]; while (true) { do i=i+1; while( a[i]…
A: Answer a) Convert code into three address code:…
Q: write a sender and receiver side bit stuffing program in which a frame is to be simulated with…
A: Bit-stuffing: Each frame begins and ends with a special bit pattern called a flag. To avoid such…
Q: sing HebbNet train and update the weights; a-)compute the latest weights and b ; b-)compute yin…
A: Hebbian Learning Rule, also known as Hebb Learning Rule, was proposed by Donald O Hebb. It is one of…
Q: Q1/ Implement a network consists of two different networks one of them is of 3 PCs the second is of…
A: Given Network Id's are: 172.16.10.0/16 172.16.20.0/16 For given networks, 16 bits are network ID and…
Q: An input string S of length N is transferred through the network using a special protocol. The…
A: Algorithm The first line of input will contain a single integer T, denoting the number of test…
Q: 3. Consider the M/M/1 queue discussed in class. Assume that packets arrive to a queue with average…
A: As per guidlines we are allowed to answer only first question.For more answer please post them…
Q: Suppose we have four machines that are using the Berkeley algorithm for clock synchronization. The…
A: Solution:-- 1)The given question is an type of the multiple choice question as 4 options have been…
Q: int x1-2003; int y1-300, Int z1, z2. z3, z4, int d1, d2, d3; asm mov EAX, x1, 200 mov EBX, y1: 300…
A: Answer is given below .
Q: Answer in python , java c++ only. Correct code and output screenshot required. Else i would…
A: Here have to determine about c++ programming language code for urban communities orchestrated…
Q: Produce a complete C++ program for the following Scenario 1. Excel Network is a telecommunication…
A: #include <iostream>#include <iomanip>using namespace std;int channel_count(){ int…
Q: Suppose process A blocks SIGINT using sigprocmask. While it's blocked, process B sends SIGINT to…
A: Choosen correct for the given statement
Under indirect communication process P wants to communicate with process Q using mailbox X.Which of the following primitives are required.
send (X,Message), receive(X,Message)
send (P,Message), receive (X,Message)
send (X,Message),receive(Q,Message)
send (P,Message), receive (Q,Message)
Step by step
Solved in 2 steps
- Computer Science Implement RSA encryption and decryption functions in Java. Note you should not use any existing security modules to perform the encryption/decryption tasks. Just write a program to compute the answers. Your program should ask user’s input for a public key (n, e), and for Q1 ask for m and display c; and ask for c and display private key d and original message m.Write a C program, called msg.c, that reads messages from an input file (or stdin) and verifies whether the messages are valid or not. We developed a protocol for reading messages from a device. There are different length messages. Each message has rules, described below. Messages are separated by a newline.. Each message is followed by a description, some examples, and a Deterministic Finite State Automaton (DFA) which recognizes the message. Before input is read, we are in state 1. We transition states on each character read. If, at the end of input, we are in an accepting state (double circle), then the message is valid. foo: Starts with an E followed by a string of digits 0 1 or 2 followed by an F . E.g.: E201022011101F eep: Starts with a P, followed by arbitrary number of BC (including none). E.g.: PPBCBCBC op: Starts with a Q . Followed by a string of 6 and 7 , where the number of 7 s must be odd. E.g.: Q7Q66666676666Q76767 ork: Starts with an M, followed by…Write a C program, called msg.c, that reads messages from an input file (or stdin) and verifies whether the messages are valid or not. We developed a protocol for reading messages from a device. There are different length messages. Each message has rules, described below. Messages are separated by a newline.. Each message is followed by a description, some examples, and a Deterministic Finite State Automaton (DFA) which recognizes the message. Before input is read, we are in state 1. We transition states on each character read. If, at the end of input, we are in an accepting state (double circle), then the message is valid. foo: Starts with an E followed by a string of digits 0 1 or 2 followed by an F . E.g.: E201022011101F eep: Starts with a P, followed by arbitrary number of BC (including none). E.g.: P PBCBCBC op: Starts with a Q . Followed by a string of 6 and 7 , where the number of 7 s must be odd. E.g.: Q7 Q66666676666 Q76767 ork: Starts with an M, followed…
- Write a C program, called msg.c, that reads messages from an input file (or stdin) and verifies whether the messages are valid or not. We developed a protocol for reading messages from a device. There are different length messages. Each message has rules, described below. Messages are separated by a newline.. Each message is followed by a description, some examples, and a Deterministic Finite State Automaton (DFA) which recognizes the message. Before input is read, we are in state 1. We transition states on each character read. If, at the end of input, we are in an accepting state (double circle), then the message is valid. foo: Starts with an E followed by a string of digits 0 1 or 2 followed by an F . E.g.: E201022011101F eep: Starts with a P, followed by arbitrary number of BC (including none). E.g.: PPBCBCBC op: Starts with a Q . Followed by a string of 6 and 7 , where the number of 7 s must be odd. E.g.: Q7Q66666676666Q76767 ork: Starts with an M, followed by…Abstract: the main purpose of this experiment is build real time system using PPI 8255 to control devices connected to. Problem description: assume that there are two devices are connected to port A and two sensors are connected to port B of PPI 8255. They work according to the following table Devices (DID2) 01 10 Sensors (S1S2) 00 01 10 11 11 00 Write a program to control these two devices according to the values of sensors. Each group should submit a zip file which contains the following files Code file: (assembly language code) - Simulation file Report (pdf file) (details of every single step in the code, also what have you learned from this experiment)Implement in C programming language Question 1 Write a program in c to detect if the system will face any deadlock in the future. If a deadlock is detected then print “Deadlock Ahead” otherwise print “Safe here”. The situation is given below. (Allowed to use Banker’s Algorithm). Note: The code can be implemented in several different ways, but make sure the parameter remains the same as shown below. n = 5; // Number of processes m = 4; // Number of resources int alloc[5][4] = { { 0, 1, 0, 3 }, // P0 // Allocation Matrix { 2, 0, 0, 0 }, // P1 { 3, 0, 2, 0 }, // P2 { 2, 1, 1, 5 }, // P3 { 0, 0, 2, 2 } }; // P4 int max[5][4] = { { 6, 4, 3, 4 }, // P0 // MAX Matrix { 3, 2, 2, 1 }, // P1 { 9, 1, 2, 6 }, // P2 { 2, 2, 2, 8 }, // P3 { 4, 3, 3, 7 } }; // P4 int avail[4] = { 3,…
- Please, solve this problem in Java code. Problem 1.Write computer programs for the Substitution Cipher based on Z29 which is corresponding to 26 alphabetic characters (0 - 25), space (26), and “, ” (27) “.”(28).The key is a random permutation π on Z29. Write down encryption and decryptionprograms. For the encryption, the plaintext and the key need to be input. To inputthe key, use the permutation of 0, 1, . . . , 28. The plaintext should be input as Englishletters. The out put will be the ciphertext which is also English letters. Select aparagraph of text which contains more than 25 words (I don’t think any two peoplewill choose a same paragraph if they choose independently) and encrypt it using yourencryption algorithm. Then use your decryption program to check the correctness.You can use Java. Record your plaintext, ciphertext and the key π in your answer sheet.Write a program in C that can convert a bit stream of a message into a frame by using Hamming coding. The bit stream is the input parameter of the program. For example, given an input parameter as 1001000, the correct output of the frame is 00110010000. Input bit stream will have 1 to 64 bits. Some self-testing examples are:Input 1001000; output 00110010000Input 1101001100110101; output 011110110011001110101Input 1010101; output 11110100101Input 11111111; output 111011101111 Write a program in C that can convert a bit stream of a message into a frame by using CRC. The bit stream is the first input parameter of the program, which will have 8 to 128 bits. The generator function is the second input parameter of the program, which will have 4 to 16 bits. For example, if the generator function is x^4 + x + 1, the second input will be 10011. The output should be the transmitted bit stream with its CRC checksum bits; see example in Figure 3-9 in the textbook. Some self-testing examples…IN HASKELL PROGRAMMING LANGUAGE PLEASE In case you do not know it: the game is played on a 3x3 grid that is initially empty. Two players are playing, by alternatingly making moves. A move by a player places their token (an X for player 1, an O for player 2) into a cell that was empty. We are using algebraic notations for indexing the positions in the board, with A,B,C indexing the columns and 1,2,3 the rows. Specifically, these coordinates would be used in the implementation for moves made by a human player. If the X X O Figure 1: Sample board position same token appears 3 times in any of the three columns, three rows or two main diagonals the game is over and that player wins. If the grid is filled without that happening the game is a draw. For the depicted board, we have Xs in positions C3 and A2, and an O in position B1. It would be O’s turn to make a move; a legal move would be C2, but it is not a good move, because X can force a win by responding A1. O cannot force a win, but…
- Develop a crawler that collects the email addresses in the visited web pages. You can write a function emails() that takes a document (as a string) as input and returns the distinct email addresses appearing in it [remove duplicate email addresses]. You should use a regular expression to find the email addresses in the document. Use your WebCrawler to check email links in html <html><body><h4>Absolute HTTP link</h4><a href="http://www.google.com">Absolute link to Google</a><h4>Relative HTTP link</h4><a href="test.html">Relative link to test.html.</a><h4>mailto scheme</h4><a href="mailto:somebody@example.net">Click here to email somebody. </a><br><a href="mailto:somebody@example.net">Click here to email somebody.</a><br><a href="mailto:nobody@example.net">Click here to email nobody.</a><br><a href="mailto:nobody@example.net">Click here to email…Write a script using PHP that takes a link from the user and parses through its associated web page to print a list of every link embedded on that site. This program must work recursively, so for each link that gets printed, the program should automatically take each of those links as a new input and do the same for them until there are no more links left. If the same link exists twice on the same page, or if it exists on more than one page, the program should ignore all duplicate instances of the link.2. Implement the frame replacement algorithm for virtual memory In Java For this task, you need to perform the simulation of page replacement algorithms. Create a Java program which allows the user to specify: • the total of frames currently exist in memory (F), the total of page requests (N) to be processed, • the list or sequence of N page requests involved, For example, if N is 10, user must input a list of 10 values (ranging between 0 to TP-1) as the request sequence. Optionally you may also get additional input, the total of pages (TP) This input is optional for your program/work. It only be used to verify that each of the page number given in the request list is valid or invalid. Valid page number should be within the range 0, .. , TP-1. Page number outside the range is invalid. Then use the input data to calculate the number of page faults produced by each of the following page replacement algorithms: • First-in-first-out (FIFO) - the candidate that is the first one that entered…