What happens if the stack and heap segments collide (i.e., one overwrites part of the other)? Why is this dangerous? How would you prevent it?

1. write a one-page paper that supports the claim that, in the future, computer criminals will become more sophisticated and that protecting personal information will become more difficult.

how would I be able to implement a hash table into a spell checker program while using a StringNode class in java that checks for spelling mistakes?

import java.util.Scanner;
public class test {
   public static void main(String args[]){
       char letter;
       int number = 0;
       Scanner in = new Scanner(System.in);
       System.out.print("Enter a letter: ");
       letter = in.next().charAt(0);
       if(letter == 'A' || letter == 'B' || letter == 'C') number = 2;
       if(letter == 'D' || letter == 'E' || letter == 'F') number = 3;
       if(letter == 'G' || letter == 'H' || letter == 'I') number = 4;
       if(letter == 'J' || letter == 'K' || letter == 'L') number = 5;
       if(letter == 'M' || letter == 'N' || letter == 'O') number = 6;
       if(letter == 'P' || letter == 'R' || letter == 'S') number = 7;
       if(letter == 'T' || letter == 'U' || letter == 'V') number = 8;
       if(letter == 'W' || letter == 'X' || letter == 'Y') number = 9;
       if(letter == 'Q' || letter == 'Z') number = -1;
       if(number > 0) System.out.println("Letter " + letter + " corresponds to digit " + number);
       else System.out.println("Letter " + letter + " is not used in a telephone");
   }
}

My question is how can I use Switch statement in this program?

Write a function named "replacement" that takes a string as a parameter and returns an identical string except with every instance of the character "w" replaced with the character "v"

My code:

function replacement(word){
var str=word;
var n=str.replace("w","v");
return n;
}

Syntax Error: function replacement incorrect on input

Not sure how to fix? Can't use a loop for answer

In Modern Infrastructure strategy there are 2 basic models to consider. Keep in mind choosing the best for the business is the right strategic decision.

Model 1-Traditional onsite of co-located data center facility. This houses your network, storage and compute technologies. You purchase and manage the equipment and your entire network/compute environment yourself.

Model 2-Newer Cloud or SAS model. In this model all the network, comput, storage lives in the cloud or at a service provider's datacenter. It's model 1 but your paying someone to host and maintain the environment for you.

Compare and contrast the 2. What is the right strategy fr a smaller start up firm? What about a larger more established firm. Support your arguments and create a strength and weakness argument for each small vs larger firm. Remember concerns like cost, scale, security etc-as discussed in class.

My add method is not working to add elements into an arrayList in java.

This is the error message I keep getting:

Exception in thread "main" java.lang.NullPointerException
   at assignment1.ArrayBag.add(ArrayBag.java:50)
   at assignment1.Main.main(Main.java:21)
BUILD FAILED (total time: 0 seconds)

The following are all the methods I've created.

/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
package assignment1;

/**
*
* @author Daniela Garcia Toranzo ; PID: 5674893
*/
public class ArrayBag implements Bag {

private int SIZE = 10;
private String[] bag;
private int length;

public void ArrayBag() {
bag = new String[10];
length = 0;
}

@Override
public boolean isEmpty() {

return length == 0;
}

@Override
public void print() {
for (int i = 0; i < bag.length; i++) {
if (bag[i] != null) {
System.out.print(bag[i] + " ");
}

}

}

@Override
public void add(String s) {

if (isFull() == true) {

System.out.println("Arraylist is full, cannot add anything else");;

} else {

bag[length] = s;

length++;

}
}

@Override
public void remove(String s) {
boolean found = false;
String x, y = "";

for (int i = 0; i < length; i++) {
x = bag[i].toString();

if (x.equals(y)) {
found = true;
bag[i] = bag[length - 1];
bag[length - 1] = null;
length--;
}

}

}

@Override
public int count(String s) {
int counter = 0;

for (int i = 0; i < length; i++) {

if (s.equals(bag[i])) {

counter++;
}

}

return counter;
}

private boolean isFull() {

if (length > SIZE) {
System.out.println("ArrayList is Full");
}

return length > SIZE;

}

}

(Using Matlab) Write a function to "smooth" a black-and-white image by replacing each pixel by the average of itself and its neighbors. In MATLAB a black-and-white image is just a matrix of 1s and 0s - 1 represents white, and 0 represents black.

To keep the algorithm simple, ignore the edges of the image - that is, do not change the first and last rows and columns.

function name = smooth_image()

input argument = input matrix

output argument = output matrix

The algorithm can be described as follows:

• Given an NxM input matrix
• make a copy of the matrix - this will be the output matrix
• loop over rows 2 to N-1 of the input matrix
• loop over columns 2 to M-1 of the input matrix
• take the average of the 3x3 submatrix centered on the current row & column
• set the corresponding element of the output matrix equal to this average

```please convert this code to make only using for loop not while loop

#include
#include
#define MAX_SIZE 500

int main()
{
char str[MAX_SIZE];
char tosearch[MAX_SIZE];
char part1[100];
char part2[100];
int cursor = 0, i, cnt1 = 0, cnt2 = 0, cnt = 0;
int j = 0;
int a = 0;
int b = 0;
int total = 0;
printf("Enter any string: ");
gets(str);
printf("Enter word to search occurrences: ");
gets(tosearch);

for (i = 0; i < strlen(tosearch); i++)
{
if (tosearch[i] == '*')
{
for (j = 0; j < i; j++)
{
part1[j] = tosearch[j];

}

a = j;
}

}

for (j = 0; j < strlen(tosearch) - a; j++)
{
part2[j] = tosearch[a + j + 1];
}

for (j = 0; j < a; j++)
{
printf("%c", part1[j]);

}
printf("\n");

for (j = 0; j < strlen(tosearch) - a - 1; j++)
{
printf("%c", part2[j]);
}

printf("\n");
b = strlen(part2);

while (cursor < strlen(str)) { // while the cursor is smaller than length of main string while loop goes on

while (cnt1 != a) { // if the cnt1 is smaller than the part1 length the while loop goes on
  
if (str[cursor] == part1[0]) { // if the str[cursor] is correspond to the first word of part1 go to for loop

for (i = 0; i < a; i++) {

if (str[cursor + i] == part1[i])
{
cnt1++; // count the number of matching letter of part1 and main string

}
else { // else the cnt1 goes to 0 again and cursor goes forward
cnt1 = 0;
cursor++;
break;
}
}
}
if (cursor > strlen(str) || cnt1 == a)
{
  
break;
}
cursor++; // cursor goes to the next letter
}

cursor += a; printf("the value of cursor %d ", cursor);
  

while (cnt2 != b) { // if cnt2 is less than the length of part2 the while loop goes on

if (str[cursor] == part2[0]) { // if the str[cursor] correspond with part2[0] for loop goes on

for (i = 0; i < b; i++) {

if (str[cursor + i] == part2[i])
{
cnt2++; // count the matching letter of str and part2
}

else {
cnt2 = 0; // else cnt2 goes to 0 and cursor move on break free from the for loop
cursor++;
break;
}
}
}
if (cursor > strlen(str) || cnt2 == b) // if the cursor is larger than the strlen or cnt2 == (the length of part2) break free
break;

cursor++; // move on to the next letter of the main string
  
}

if (cursor + b > strlen(str))
break;

cnt++;
cnt1 = 0;
cnt2 = 0;
}
printf("tot %d\n", cnt);
}

Define a class Fraction3YourName as follows,

/**
* Program Name: Fraction3YourName.java
* Discussion: Fraction3Yourname class
* written By:
* Date: 2019/09/19
*/
public class Fraction3YourName {
private int sign;
private int num;
private int denom;
public Fraction3YourName() {
//sign = ;
//denom = ;
}
public Fraction3YourName(int n) {
//sign = ;
//num = n;
//denom = ;
}
public Fraction3YourName(int s, int n, int d) {
//sign = s;
//num = n;
//denom = d;
}
}
You are asked to
 Complete the definitions for the given constructors; and
 Provide additional method members to allow the performance of four simple
arithmetic operations: (1) Addition, (2) Subtraction, (3) Multiplication, and (4)
Division; and
 Provide one method member print() to display the Fraction3YourName object.

/** REQUIRED PROGRAM OUTPUT

****************************************
* MENU – HW #3 *
* (1) Creating 2 Fraction3 Objects *
* (2) Performing Arithmetic Operations *
* (3) Displaying Fraction3 Objects *
* (4) Quit *
****************************************
Enter your option (1 through 4): 5
You are funny!

****************************************
* MENU – HW #3 *
* (1) Creating 2 Fraction3 Objects *
* (2) Performing Arithmetic Operations *
* (3) Displaying Fraction3 Objects *
* (4) Quit *
****************************************
Enter your option (1 through 4): 2
Creating 2 Fraction3 Objects –
// Your details

****************************************
* MENU – HW #3 *
* (1) Creating 2 Fraction3 Objects *
* (2) Performing Arithmetic Operations *
* (3) Displaying Fraction3 Objects *
* (4) Quit *
****************************************
Enter your option (1 through 4): 3
Displaying Fraction3 Objects –
// Your details

****************************************
* MENU – HW #3 *
* (1) Creating 2 Fraction3 Objects *
* (2) Performing Arithmetic Operations *
* (3) Displaying Fraction3 Objects *
* (4) Quit *
****************************************
Enter your option (1 through 4): 4
Performing Arithmetic Operations –
// Your details

****************************************
* MENU – HW #3 *
* (1) Creating 2 Fraction3 Objects *
* (2) Performing Arithmetic Operations *
* (3) Displaying Fraction3 Objects *
* (4) Quit *
****************************************
Enter your option (1 through 4): 4
Having fun!

by java programming

Problem 1: [10 Marks] Given a generic array with ‘n’ items (not only integers). Give a solution for checking whether there are any duplicate elements in the array or not? You just need to return a boolean (true or false). State the complexity of your solution. Can you come up with another solution that has O(n logn) complexity? Explain.

Problem 2: [10 Marks] Now consider the same problem as problem 1, but this time you only have positive integer numbers ranging from 0 to (n-1) in the array. Can you find a duplicate in O(n) complexity? Implement the solution.

Plz answer 2nd only

From 1977 to 1982, Internet Engineering Notes (IENs) were used to document and generate discussion about various topics related to the Internet and Internet protocols. One of the challenges facing the early Internet was inconsistent data representation, including byte ordering. IEN 137 addresses this challenge. Note the date of the IEN, which suggests that it is meant to be at least somewhat whimsical, although still addressing an important topic in computer and network systems.

1. What is the title of IEN 137?
2. Who is the author of IEN 137?
3. What is the title of the work of literature used to make several points in this IEN?

Problem 5: (10 pts) Modify the patient class with two overloaded methods to display a bill for astandard visit based on age. In the first method do not use any parameters to pass in data. If the patient is over 65, then a standard visit is $75. If the patient is under 65, then the standard doctors office visit is $125. Build a second method where you pass in a discount rate. If the patient is over 65, then apply the discount rate to a standard rate of $125. Create a main method that calls both of these methods and displays the results

Problem 6: (20 pts) Create two subclasses called outpatient and inpatient which inherit from the patient base class. The outpatient class has an additional data field called doctorOfficeID and the inpatient class has an additional data item called hospitalID. Write a main method that creates inpatient and outpatient objects. Sets data for these objects and display the data.