In C++, write a member method delete() that deletes a node from a linked list at a random position. (It should first randomly generate that position. and then delete that node).

What is interference? Explain co-channel and adjacent channel interference and how do you combat them.

Calculate the frequency re-use distance and the co-channel re-use ratio if the cell radius 2, i=3 and j=2.

Write a program that draws a fixed circle centered at (100, 60) with radius 50. Whenever the mouse is moved, display a message indicating whether the mouse point is inside the circle at the mouse point or outside of it. Write in Java please.

All of the remaining questions involve the following toy encryption scheme. It encrypts plaintexts that consist of only uppercase letters and the underscore character (27 characters total):

ABCDEFGHIJKLMNOPQRSTUVWXYZ_

Note that the underscore character is part of the alphabet and will also be encrypted. A key in this scheme consists of 4 digits, each from 0 to 9. Each digit tells how much to shift one character, that is, change it to the character that many positions later in the alphabet. If the shift goes past '_', then we wrap around to the beginning.

The key is applied separately to each group of 4 letters in the message. For example, if the message HI_SALLY is encrypted with the key 2407, the H would be shifted by 2, the I by 4, the underscore by 0, and the S by 7. Then we would start over with the first digit of the key, shifting A by 2, L by 4, and so on. So the ciphertext would be: JM_ZCPLE

1. (3 pts) Give the decryption of the following messages that have been encrypted with the key 4127.
   
   1. WFNSDNUMX

2. NVFEDJUGTMCUX

3. _JVOHSCCDUTVSQU

Describe two advantages of using dynamically linked libraries in assembling executable program files.

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).

Question 1

Download the files Book.java and BookInfo.txt from Content->Chapter 12 Quiz Files. Create a BookDriver.java class with a main method. In the main method, create an ArrayList of Book objects, read in the information from BookInfo.txt and create Book objects to populate the ArrayList. After all data from the file is read in and the Book objects added to the ArrayList- print the contents of the ArrayList. Paste your BookDriver.java text (CtrlC to copy, CtrlV to paste) into the open space before. You should not change Book.java or BookInfo.txt.  

Given info below :

/**
*
* Book
*
* @author bbrown25
*
* A class to represent information about a Book
*
**/
public class Book
{
   private String title;
   private String author;
  
  
   /**
   * No arg constructor
   */
   public Book()
   {
       title = "not set";
       author = "not set";
   }
  
   /**
   * @param title
   * @param author
   */
   public Book(String title, String author)
   {
       super();
       setTitle( title);
       setAuthor(author);
   }

   /**
   * @return the title
   */
   public String getTitle()
   {
       return title;
   }

   /**
   * @param title the title to set
   */
   public void setTitle(String title)
   {
       if (title.length() > 0)
       {
           this.title = title;
       }
       else
       {
           this.title = "not set";
       }
   }

   /**
   * @return the author
   */
   public String getAuthor()
   {
       return author;
   }

   /**
   * @param author the author to set
   */
   public void setAuthor(String author)
   {
       if (author.length() > 0)
       {
           this.author = author;
  
       }
       else
       {
           this.author = "not set";
       }
   }

   @Override
   public String toString()
   {
       return "Book [title=" + title + ", author=" + author + "]";
   }

  
}

BookInfo.txt

War and Peace
Leo Tolstoy
Pride and Prejudice
Jane Austen
Gone With the Wind
Margaret Mitchell

Assembly Language HW

For this program you will find the largest common factor for 2 numbers, a and b.

The largest common factor is the largest positive number that divides the two numbers.

The C++ code for doing this is:

int LCF (int a, int b)

{

if (a == 0 && b == 0)

     b = 1;

else

     if (b == 0)

          b = a;

     else

          if (a != 0)

               while (a != b)

                    if (a < b)

                         b -= a;

                    else

                         a -= b;

return b;

}

In your code, you should follow this C++ code as closely as possible.

Read in a and b.

Put a in eax, and b in ebx.

Do not use any loop instructions directly.

Do use compare and jump instructions.

Do not use any procedures except MyProgram.

(the return of an integer from LCF is NOT coded, but replaced with a write of the result

as shown below)

You code should be your work alone.

You example of your console window should look as follows:

Please provide an integer for b: 8

Please provide an integer for a: 4

The largest common factor of a and b is: +4

Pascal’s triangle looks as follows:

1

1 1

1 2 1

1 3 3 1

1 4 6 4 1

...

The first entry in a row is 1 and the last entry is 1 (except for the first row which contains only 1), and every other entry in Pascal’s triangle is equal to the sum of the following two entries: the entry that is in the previous row and the same column, and the entry that is in the previous row and previous column.

Use dynamic programming to design an O(n²) time algorithm that computes the first n rows in Pascal’s triangle.

1. Write a program to determine if the student has passed the test or not. Please use two if statements to display the results.

For example, if the user has entered ‘true’, display ‘the student has passed the test’, and if the user has entered ‘false’, display ‘the student has failed the test’.

1. Use the scanner class to get the Boolean datatype answer from the user if the student has passed the test or not.
2. Use two if statements to determine if the student has passed or not.
   1. First if statement should use the conditional operator (== operator) to determine if the Boolean entry is ‘true’ and display saying that ‘the student has passed the test’.
   2. First if statement should use the conditional operator ( != operator) to determine if the Boolean entry is ‘ not true’ and display saying that ‘the student has failed the test

Using ECLIPSE IDE

Write a Java Program to play your version of the Texas Pick 3 Lottery. You will need to include the provided code given below in your program.

Task:The program will prompt for a number between 0 and 999. Your program will display the number of attempts it took for the entered number to match a randomly generated number.

1. In the main() method, declare an int named myPick3choice.
2. Create a prompt for myPick3choice as "Enter your Pick 3 choice:0-999".
3. Create a void method named playPick3 that has an int parameter named myPick3.
4. In the playPick3 method, do the following:
   1. Create an int variable called playCounter and initialize it to 0.
   2. Create an int variable called myPick3Result.
   3. Create a loop that calls the method officialPlayPick3 (Provided below) and store the result in myPick3Result.
      1. If myPick3Result matches the variable myPick3, then display the result of playcounter as "PlayCounter = ...." and exit the loop.
      2. If myPick3Result does not match, increment the variable playCounter and continue the loop.

Enter your Pick 3 choice 0-999: 554

PlayCounter = 1343   ( This result will vary )

Include the code below in your program. The code also requires the following import line:

import java.util.concurrent.ThreadLocalRandom;

/**
* officialPlayPick3()
* Returns a random number from 0 to 999
* @return int
*/

public static int officialPlayPick3() {

final int MIN_RANGE_VALUE = 0;

final int MAX_RANGE_VALUE = 999;

       return ThreadLocalRandom.current().nextInt(MIN_RANGE_VALUE,MAX_RANGE_VALUE + 1);
}

In Python

Suppose there is a movie theater who charges ticket based on ages. Less than 3 years old, free; between 3 to 12, $10; more than 12 years old, $15. Please design a program with loop to,

1) Ask the name then age of the audience,

2) Based on audience's input, tell the audience (with the person's name) how much is the ticket,

3) Stop the program when type in 'quit' in your program.

1/

a) What determines whether you should use a loop or recursion when you are writing an algorithm for a tree, and why does it matter?

b) Why did we put Head and Tail nodes in our List class?

PLEASE do the following problem in C++ with the screenshot of the output. THANKS!

Assuming that a text file named FIRST.TXT contains some text written into it, write a class and a method named vowelwords(), that reads the file FIRST.TXT and creates a new file named SECOND.TXT, to contain only those words from the file FIRST.TXT which start with a lowercase vowel (i.e., with 'a', 'e', 'i', 'o', 'u'). For example, if the file FIRST.TXT contains Carry umbrella and overcoat when it rains Then the file SECOND.TXT shall contain umbrella and overcoat it.

Consider the function computational as implemented below.
(a) Describe what the function does.
(b) What is the output of this function.
(c) Explain the recursive action. (While describing the recursive action define what recursion is and how does recursion work.)

int computational(int n){
if (n < 10) && (n > -10))
return 1;
else
return 1 + computational(n/10);
}
A good variant expression is “the number of digits in n,” with the threshold of 1.