develop a methodology for parallelized data wrangling, listing the appropriate techniques and the order they should be conducted.

1.Since all projects are different, how can you determine what should be included in the project concept and project plan?

minimum - 150-200 words please

The Open Systems Interconnection (OSI) Layer 3 (Network Layer) is one   of the layers that performs packet segmentation. The OSI Layer 3 is   roughly equivalent to the Internet Layer of the Transmission Control   Protocol/Internet Protocol (TCP/IP) model, and Layer 4 (Transport Layer) of the OSI model is roughly equivalent to the Host-to-Host layer of the TCP/IP model. The above two layers perform network segmentation. Based on the above information, answer the following questions:

• Describe in detail how packets are segmented by the Host-to-Host   Layer (Transport Layer) and Internet Layer of the TCP/IP model.
• Do all packets arrive at their destination in the order in which they were segmented and transmitted? Why or why not?
• Describe how segmented packets are rearranged or reassembled at   the packets' destination to ensure that received segmented packets   match the order in which they were segmented and transmitted.
• How are errors handled during transmission of segmented packets?
• What is the difference between a TCP segment and an IP packet?

Please answer the above questions to write your paper of 4–5 pages

5 How Many Stacks?

An NFA has no stack. It recognizes regular languages.

A PDA is defined as an NFA with one stack. It recognizes context-free languages.

Prove that a PDA with two stacks recognizes Turing-recognizable languages

Please Complete this C Code using the gcc compiler. Please include comments to explain each added line.

/*This program computes the Intersection over Union of two rectangles
as a percent:

IoU = [Area(Intersection of R1 and R2) * 100 ] / [Area(R1) + Area(R2) - Area(Intersection of R1 and R2)]

The answer will be specified as a percent: a number between 0 and 100.
For example, if the rectangles do not overlap, IoU = 0%. If they are
at the same location and are the same height and width, IoU = 100%.
If they are the same area 30 and their area of overlap is 10, IoU =
20%.

Input: two bounding boxes, each specified as {Tx, Ty, Bx, By), where
   (Tx, Ty) is the upper left corner point and
   (Bx, By) is the lower right corner point.
These are given in two global arrays R1 and R2.
Output: IoU (an integer, 0 <= IoU < 100).

In images, the origin (0,0) is located at the left uppermost pixel,
x increases to the right and y increases downward.
So in our bounding box representation, it will always be true that:
Tx < Bx and Ty < By.

Assume images are 640x480 and bounding boxes fit within these bounds and
are always of size at least 1x1.

IoU should be specified as an integer (only the whole part of the division),
i.e., round down to the nearest whole number between 0 and 100 inclusive.

FOR FULL CREDIT (on all assignments in this class), BE SURE TO TRY
MULTIPLE TEST CASES and DOCUMENT YOUR CODE.
*/

#include
#include

//DO NOT change the following declaration (you may change the initial value).
// Bounding box: {Tx, Ty, Bx, By}
int R1[] = {64, 51, 205, 410};
int R2[] = {64, 51, 205, 410};
int IoU;

/*
For the grading scripts to run correctly, the above declarations
must be the first lines of code in this file (for this homework
assignment only). Under penalty of grade point loss, do not change
these lines, except to replace the initial values while you are testing
your code.

Also, do not include any additional libraries.
*/

int main() {

// insert your code here

IoU = -999; // Remove this line. (It's only provided so that shell code compiles w/out warnings.)

printf("Intersection over Union: %d%%\n", IoU);
return 0;
}

IN PYTHON

1) Pig Latin

Write a function called igpay(word) that takes in a string word representing a word in English, and returns the word translated into Pig Latin. Pig Latin is a “language” in which English words are translated according to the following rules:

• For any word that begins with one or more consonants: move the consonants to the end of the word and append the string ‘ay’.

• For all other words, append the string ‘way’ to the end.

• For the above you can assume that ‘a’, ‘e’, ‘i’, ‘o’, and ‘u’ are vowels, and any other letter is a consonant. This does mean that ‘y’ is considered a consonant even in situations where it really shouldn’t be.

For this exercise, you can assume the following:

• There will be no punctuation.

• All letters will be lowercase

• Every word will have at least one vowel (so we won’t give you a word like “by”)

Write a helper function that finds the index of the first vowel in a given word, and use that in your main function.

Hints:

• To find the index of the first vowel in a given word, since you’re interested in the indexes, looping through the indexes of the string using range, or enumerate, or a while loop may work better than a direct for loop on the characters.

• Use slicing to break up the string into all of the letters before the vowel, and all of the letters from the vowel onwards.

Examples:

>>> igpay('can')

'ancay'

>>> igpay('answer')

'answerway'

>>> igpay('prepare')

'eparepray'

>>> igpay('synthesis')

'esissynthay'

upload cvs file dialog

it's sub menu bar and when I click this I want to popup file dialog and select cvs file

<a href="#" id="loadCSV">Load CSV file</a>

The human resources department for your company needs a program that will determine how much to deduct from an employee’s paycheck to cover healthcare costs. Health care deductions are based on several factors. All employees are charged at flat rate of $150 to be enrolled in the company healthcare system. If they are married there is an additional charge of $75 to cover their spouse/partner. If they have children, the cost is $50 per child. In addition, all employees are given a 10% deduction in the total cost if they have declared to be a “non-smoker”.

Your goal is to create a program that gathers the employee’s name, marital status, number of children and whether or not they smoke tobacco for a single employee. While gathering this information, if the user enters at least one invalid value, the program must display one error message telling the user they made a mistake and that they should re-run the program to try again. The program must then end at this point. However, if all valid values are entered, the program should calculate the total cost of the healthcare payroll deduction and then print a well-formatted report that shows the employee’s name, marital status, total number of children, and smoker designation, and total deduction amount.

Please write a pseudocode for the above problem. Don't forget to validate the inputs as necessary.

irst, you will complete a class called HazMath (in the HazMath.java file) that implements the interface Mathematical (in the Mathematical.java file). These should have the following definitions:

• public boolean isPrime(int n)

  You cannot change the signature for the method. This method is similar to the ones we've discussed in the lab and will return true or false depending on if the passed in integer values is prime or not, respectively. Return false if the invoker passes in a number less than 1. A prime number is one that is not evenly divisible by any other number. For example, if we have number 2, it should return True, and if we have number 55, it will return False. Some sample assertions (Note that for these assertions we've not added a. message, which is optional):

  assert isPrime(2);
  assert isPrime(53);
  assert !isPrime(55);
  assert !isPrime(24);
  assert !isPrime(-37337);
  

  Prime numbers form the basis of cryptography! Read into why this is a little bit. Really cool stuff.

• public int sumOfSums(int n)
  You cannot change the signature for the method. This method takes an integer, n, and computes the sum of each of the sums of each integer between 1 and n. For example, the sum of the sums of 3 is (1) + (1 + 2) + (1 + 2 + 3) = 10. Some sample assertions:

  assert sumOfSums(1) == 1;
  assert sumOfSums(3) == 10;
  assert sumOfSums(6) == 56;
  assert sumOfSums(25) == 2925;
  assert sumOfSums(-5) == 0;
  

This is first program:

public class HazMath implements Mathematical {

// Fill-in methods to implement the Mathematical interface
   public boolean isPrime(int n)
{

       return false;
   }

   public int sumOfSums(int n) {
      
       return 0;
   }

    public static void main(String[] args)
{
HazMath HM=new HazMath();
       assert HM.isPrime(3);
       assert !HM.isPrime(-37337);
       assert HM.sumOfSums(1) == 1;
       assert HM.sumOfSums(-5) == 0;
System.out.println("All tests passed. VICTORY!");

   }
}

This is the second program:

import java.lang.*;

public interface Mathematical
{
// Validate each Char
public boolean isPrime(int n);

// Validate each Char in row with size 3
public int sumOfSums(int n);

}

Given the following set of keys: {1, 2, 3} determine the number of distinct left-leaning red-black trees that can be constructed with those keys. Draw the tree for each possible key-insertion order, showing the transformations involved at each step.

Which of the following is TRUE about horizontal data merges using R? (Multiple answers can be selected)

a) Both data frames must have the same number of columns

b) Both data frames must have the same number of rows

c) The data frames must have at least one column with values in common

d) The data frames must have at least one column with the same name

e) Both data frames must have the same order of columns from left to right

i want Solution From Question Number 5 Solution Of questions 1-4 in Previou Post
Note (I Want ScreenShot For Solution)

Use Kali Linux Commands to show me the following:
1. Who are you?
2. Change directory to Downloads
3. Make a new directory
4. Make a new text file under your name (Ghada.txt)
5. Write a paragraph about Cyber security (4 to 5 sentences) >>simply open the file and write
inside it
6. Change the permission to be 764
7. Open the file but with a cyber security match Show me each and every step with figure
b. Enter into Portswagger lab (Username enumeration via subtly different responses)

https://portswigger.net/web-security/authentication/password-based/lab-username-enumerationvia-subtly-different-responses
Show me step-by-step how to use burp to get the username and password. Name the username list

with your name ex. Ghada_usename.txt and Ghada_password.txt
Use Seed Machine (the same SQL injection website)to conduct SQL Injection such that:
1. Update Boby nickname to be your name (by Alice)
2. Update Boby password to be (your name as a password) (by Alice).

(1) a. sentence generation

The sentence you need to generate is shown below:

Sentence: John fed a bear in the park.

In this question, you should start from the target structure, a sentence (= S). Then you expand S by applying the rule S --> S PP. There is another rule that can expand S, namely S --> NP VP. However, if you apply S --> NP VP before S --> S PP, you will not be able to include PP. Therefore, S --> S PP is the correct rule to apply first, as has been given in the table below (together with two other steps). Remember to insert the lexical items when you get to a leaf node like D or N where no rule can be further applied. If your answers are correct, then all the 14 blanks should be filled.

The rules and lexicon that you need to generate the sentence are given as below:

Rules:

S --> NP VP
NP --> D NP
VP --> V PP
VP --> V NP
S --> S PP
PP --> P NP
AdjP --> Adv Adj
NP --> N
CP --> C S
Lexicon:

V --> saw, kicked, fed

P --> in, at

D --> a, the

N --> John, bear, park

You will need only a subset of the rules for this question.

Step

Sentence generating process

0 S

1 S --> S PP

2 S --> NP VP

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

Done!

(1)   b. Expand the rules and lexicon

What do you need to add to the previous rules and lexicon if you want to generate the following sentence:

The boy saw a brown bear in the park.

New rule(s) that needs to be added:

____________________

New lexical item(s) that needs to be added:
_____________________
______________________

6. Describe the motivation for the IP Security (IPsec) to become Internet standards.

C++ Pig Latin Lab

This assignment uses pointers to perform something done often in computer applications: the parsing of text to find “words” (i.e., strings delineated by some delimiter).

Write a program that encodes English language phrases into Pig Latin. Pig Latin is a form of coded language often used for amusement. Many variations exist in the methods used to form Pig Latin phrases. Use the following algorithm: to form a Pig Latin phrase from an English language phrase, tokenize the phrase into words with the C++ function strtok_s(). To translate each English word into a Pig Latin word, place the first letter of the English word at the end of the English word and add the letters “ay” after it. Thus, the word “jump” becomes “umpjay,” the word “the” becomes “hetay,” and the word “computer” becomes “omputercay.” Blanks between words remain as blanks. Assume that the English phrase input from the keyboard consists of words separated by blanks, there are no punctuations marks, all words have 2 or more letters, and the input phrase is less than 200 characters. Function printLatinWord() should display each word. Hint: Each time a token is found in a call to strtok_s(), pass the token pointer to function printLatinWord() and print the Pig Latin word.

Your program should allow the user to enter phrases until he or she selects an exit option to quit.

In summary: Create a Pig Latin program to implement this functionality: Prompt the user to enter a sentence. Print out the sentence, and then print out the same sentence in Pig Latin. Repeat this sequence until the user elects to quit.

Sol'n so far: (errors in lines 83 and 92)

#include <iostream>
#include <string>

using namespace std;

//class that hold strings of PigLatin
class PigLatin
{
   //variable to Piglatin form word
private:
   char *latin;

public:
   //constructor that converts word into PigLatin form
   PigLatin(char *word)
   {
       //get the string length
       int i, j = 0, len = strlen(word);

       //allocating space
       latin = new char[len + 3];

       //forming word
       for (i = 1; i < len; i++)
       {
           latin[j] = word[i];
           j++;
       }

       //Adding last characters
       latin[j] = word[0];
       j++;
       latin[j] = 'a';

       j++;
       latin[j] = 'y';

       j++;
       latin[j] = '\0';
   }

   //Function that returns the word in PigLatin form
   string getLatin()
   {
       string str(latin);
       return str;
   }

   //Destructor to deallocate memory
   ~PigLatin()
   {
       delete[]latin;
   }
};

//Function that receives the char * variable as parameter and prints its PigLatin form

void PrintLatinWord(char *str)
{
   //creating an object of PigLatin class
   PigLatin obj(str);

   //Printing word in PigLatin form
   cout << obj.getLatin() << " ";
}

//Main function
int main()
{
   int i;
   char str[200];
   char *pch;
   char option;

   //Loop till user wants to quit
   do
   {
       //Reading a phrase
       cout << "\n\n Enter a sentence to translated:";
       cin.getline(str, 200);

       //splitting words to tokens
       pch = strtok_s(str, " ");

       cout << "\n\t";

       //split enter phrase completes
       while (pch != NULL)
       {
           //Passing token
           PrintLatinWord(pch);
           pch = strtok_s(NULL, " ");
       }

       //Reading user option
       cout << "\n\n Do you want to enter another sentence? (Y - continue, N - Exit):";

       cin.ignore();
   } while (option != 'N' && option != 'n');

   cout << endl;
   system ("pause");
   return 0;
}