Write a Java program called Numbers that reads a file containing a list of numbers and outputs, for each number in the list, the next bigger number. For example, if the list is

78, 22, 56, 99, 12, 14, 17, 15, 1, 144, 37, 23, 47, 88, 3, 19

the output should look like the following:

78: 88

22: 23

56: 78

99: 144

12: 14

14: 15

17: 19

15: 17

1: 3

144: 2147483647

37: 47

23: 37

47: 56

88: 99

3: 12

19: 22

NOTE: If there is no bigger number in the sequence, just display the value of Integer.MAX_VALUE .

The output should be shown on the screen and also saved in a file.

Program Design

• You should have a single class called Numbers.
• You should have a static method called nextLargest, which takes as input an array of integers called list and another single integer called value. It should return the number that is the next larger than the value in the list (as described above). You need to use this method to implement your program.
• The input file from which the list is read should be called "list.txt". Assume it's in the current directory.
• The output file to which the results should be saved should be called "nextlist.txt". Save it in the current directory (i.e. don't specify the path).

Additional Requirements

1. The name of your Java Class that contains the main method should be Numbers. All your code should be within a single file.
2. Your code should follow good coding practices, including good use of whitespace (indents and line breaks) and use of both inline and block comments.
3. You need to use meaningful identifier names that conform to standard Java naming conventions.
4. At the top of the file, you need to put in a block comment with the following information: your name, date, course name, semester, and assignment name.
5. If the input file contains something not in the proper format, your program should handle this gracefully by displaying an appropriate message to the user and closing the program (without letting it crash).

The output of your program should exactly match the sample program output given at the end

(10) Let L = { <D> | D is a DFA that accepts s^R whenever it accepts s } . Show that L is Turing-decidable.

Discussion Topics:
Assume that you have a Saudi league player database. In this database, you have a table containing players’ attributes such as (Name, age, position, etc.) and you decided to add information about players’ agents. Would you represent the agent information as attributes in the player table or would you create an entity set for players’ agents? Justify your answer.   

Note: Provide answers in your own words.

Consider a file with a large number of Person(id, name, birth-date) records. Assume that users frequently search this file based on a the field id to find the values of name or birthdate for people whose information is stored in the file. Moreover, assume that users rarely update current records or insert new records to the file. Which file structure, heap versus sorted, provides the fastest total running time for users’ queries over this file? Explain your answer.

In matlab:

Write a Bisection method with a while-loop that finds the root of the function f(x) = e^(−x) −x^2 + 2 between the values of [−5,5]. Write the function f(x) as a function file (a separate .m file). Use the error tolerance level of “tol = 1e-8.” Save the solved root value in the file A4.dat.

Write a program that prompts the user to enter five test scores and then print the average test score to the screen. (Assume that the test scores are decimal numbers). Use the following 5 numbers:     10.5      5.5        20.0      10.0      5.5.

I am having trouble understanding where the 5 values are entered in the program.

The program has been provided:

#include <iostream>
    #include <iomanip>
   
    using namespace std;
    
    int main()
    {
        double testScore1;
        double testScore2;
        double testScore3;
        double testScore4;
        double testScore5;
   
        cout << "Enter test score 1: ";
        cin >> testScore1;
        cout << endl;
   
        cout << "Enter test score 2: ";
        cin >> testScore2;
        cout << endl;
       
        cout << "Enter test score 3: ";
        cin >> testScore3;
        cout << endl;
       
        cout << "Enter test score 4: ";
        cin >> testScore4;
        cout << endl;
       
        cout << "Enter test score 5: ";
        cin >> testScore5;
        cout << endl;
       
        cout << "Average test score: " << (testScore1+testScore2+testScore3+testScore4+testScore5)/5 << endl;
        cout << endl;
   

        // when using Visual Studio, use the system/pause command to display the results of your program
        // system("pause");

        return 0;
    }

Book Review: How America Lost Its Secrets?

NOTE: Write your program in 8086 language. Preferably, I'd like you to use emu8086, but you can use any 8086 program and write and test them.

Program: Write a program to do the following.

(a) Scroll a window from row 5, column 10 to row 20, column 70, with a reverse video attribute.

(b) Locate the cursor at row 10, column 20.

(c) Display a line of text, such as,

THIS TEXT IS IN THE WINDOW

(d) After the line of text is displayed, wait for a key to be pressed.

(e) Scroll a window from row 7, column 12 to row 18, column 68, with a normal attribute.

(f) Write a character A with a blinking attribute in the middle of the window.

(g) Wait for a key stroke, and then clear entire screen with a normal attribute.

I want to take COMPTIA SECURITY+ EXAMS.

ANY RELIABLE DUMPS RESOURCE THAT GUARANTEE A 100% PASS ?

Use C++ for this program

   Define a Line Class.
   Constraint: Line must be in First Quadrant
               for X-Y Coordinate System.

   Create the following methods:
   1) Parameterized Constructor
   2) Horizontal Line Constructor
   3) Vertical Line Constructor
   4) Default Constructor  
   5) Compute Length of Line.

    TEST CASES: Find Length of Line

    (a) Point 1: (5,6) Point 2: (15,6)
  
    (b) Point 1: (7,8) Point 2: (7,20)

    (c) Point 1: (9,10) Point 2: (19,20)

    (d) Default Line of 10 units at (0,0).

A quick question, would this be put in a header file and called into a source file?

Given an original message, determine the cipher that will produce the encoded string that comes earliest alphabetically. Return this encoded string. In the example below, the second cipher produces the alphabetically earliest encoded string ("abccd").

For example, if John's message is "hello" and his cipher maps 'h' to 'd', 'e' to 'i', 'l' to 'p' and 'o' to 'y', the encoded message will be "dippy". If the cipher maps 'h' to 'a', 'e' to 'b', 'l' to 'c' and 'o' to 'd', then the encoded message will be "abccd".

My code (bolded code is part of the question and cannot be changed):

string encrypt(string message){

// you write code here

string unEncryp;

for(int i = 0; i < message.length()){

char temp = message[i];

switch(temp){

default:

break;

}

}

return unEncryp;

}

For the past several weeks you have addressed several different areas of telecommunications and information technology in relation to different types of communication across the organizational footprint of Sunshine Health Corporation. Review the work you have done and formulate the Network Security Plan to be implemented across the network footprint. This is not to be an overly detailed report but to address different network concerns and recommendations for improving and securing organizational data, personnel records, intellectual property, and customer records.

Please address the narrative plan as well as a network diagram (no IP addresses, or circuit data required) and what is being done to secure the network at different levels of the OSI model and the organizational structure. Please make sure that you bring in a minimum of two external sources to strengthen and support your presentation.

The assignment should be 5-6 pages of content not counting title page, reference page or appendices (diagrams, budget sheet, equipment list, etc.). Please follow APA format.

Suppose your architectural/design style for the human resource management scenario is MVC, what would be the best architectural evaluation technique to ensure that your choice of the selected architectural/design style is correct? Describe your answer with justification.

Your goal for this assignment is to create a tool that manages an equivalence relation that can be changed in a specific way by the program while the program runs. The assignment will involve creating two files, equiv.h and equiv.cpp.

For this assignment, the equivalence relation is always over a set of integers {1, 2, 3, …, n} for some positive integer n.

This tool is not a complete program. It is intended to be part of a larger program. File equiv.cpp must not contain a 'main' function.

Equiv.h will contain function prototypes, but it must not contain any full function definitions. (There must be no function bodies.) Equiv.cpp must contain line

  #include "equiv.h"

before any function definitions.

Interface

The interface tells exactly what this module provides for other modules to use. Other modules must not use anything that is not described here. Briefly, the interface includes a type, ER, which is the type of an equivalence relation, and the following functions.

  ER   newER(const int n);
  void destroyER(ER R);
  bool equivalent(ER R, const int x, const int y);
  void merge(ER R, const int x, const int y);

Additionally, there is one function that is solely for debugging.

  void showER(const ER R, const int n);

There is one more function that is part of the implementation but not part of the interface. You can use it for debugging, though.

  int  leader(ER R, const int x);

A module that uses this tool can create an equivalence relation called R by saying

  ER R = newER(n);

where n is a positive integer. Initially, each number is in its own equivalence class; the equivalence classes are {1}, {2}, …, {n}. There are two operations that can be performed.

1. equivalent(R, x, y) returns a boolean value: true if x and y are currently in the same equivalence class in equivalence relation R, and false otherwise.

2. merge(R, x, y) modifies equivalence relation R by making x and y equivalent. It combines the equivalence class that contains x with the equivalence class that contains y. The merge function does not return an answer.

Example

For example, suppose that n = 7. The following shows a sequence of operations and shows the equivalence classes after each merge operation.

As you can see from the last step, it is allowed to merge two values that are already equivalent. That should cause no change.

An Algorithm for Managing an Equivalence Relation

You will not store the equivalence classes directly. Instead, you will store them implicitly, using the following ideas.  You are required to implement an equivalence manager in this way. You will receive no credit for a module that does not follow this algorithm.

1. Each equivalence class has a leader, which is one of the members of that equivalence class. You will create a function leader(R, x) that returns the current leader of the equivalence class that contains x in equivalence relation R.

   Two values are equivalent if they have the same leader.

2. There is another idea that is similar to a leader, but not exactly the same. Each value has a boss, which is a value in its equivalence class. For the purposes of describing the idea, let's write boss[x] for x's boss.

   1. If x is the leader of its equivalence class then boss[x] = 0, indicating that x has no boss.

   2. If x is not the leader of its equivalence class then boss[x] ≠ 0 and boss[x] is closer to the leader, in the following sense. If you look at the values x, boss[x], boss[boss[x]], boss[boss[boss[x]]], … then you will eventually encounter x's leader (just before you encounter 0).

Details on the algorithm

Use an array to store the bosses. Declaration

  typedef int* ER;

defines type ER to be the same as int*. Write the following functions.

1. newER(n) returns an equivalence relation as an array of n+1 integers. Allocate the array in the heap. This array will be used to store the bosses. If R has type ER then R[x] is x's boss.

   In C++, arrays start at index 0. You will use indices 1, … n, so you need to allocate n+1 slots. (Index 0 will not be used.)

   Initialize the array so that each value is a leader of its own equivalence class. That is, R[x] = 0 for x = 1, …, n.

2. leader(R, x) returns the leader of x in equivalence relation R. To compute x's leader, just follow the bosses up to the leader. Here is a sketch of a loop that finds the leader of x.

     y = x
     while(boss[y] != 0)
       y = boss[y]
     return y
   

   You can use a loop or recursion the leader function. Any function that wants to compute a leader must use the leader function to do that.

3. equivalent(R, x, y) returns true if x and y have the same leader in R. Notice that is not the same as saying that they have the same boss.

4. merge(R, x, y) merges the equivalence classes of x and y in R as follows. First, it finds the leaders x′ and y′ of x and y. If x′ and y′ are different (so x and y are not already in the same equivalence class) then y′ becomes the new boss of x′ and y′ becomes the leader of the combined equivalence class.

5. destroyER(R) deallocates R.

6. showER(R, n) prints the entire contents of array R (of size n) in a readable form for debugging. Be sure that showER shows both k and k's boss, for each k.

   Do not try to be too fancy here. Do not try to show the equivalence classes. ShowER is a debugging tool, and it should show the bosses.

Additional Requirements

It is important for you to follow the algorithms and design described here. Do not make up your own algorithm. Implement exactly the functions that are indicated. Keep the parameter order as shown here. If you change the parameter order, your module will not compile correctly with my tester. Do not add extra responsibilities to functions.

The definition of ER must only be in equiv.h. Do not duplicate that definition in equiv.cpp.

A Refinement Plan

#include "equiv.h"

// CSCI 2530
// Assignment: 3
// Author:     ***
// File:       equiv.h
// Tab stops:  none

// These #ifndef and #define lines make it so that, if this file is
// read more than once by the compiler, its body is skipped on all
// but the first time it is read.

#ifndef EQUIV_H
#define EQUIV_H

// An equivalence relation is an array of integers.
// So ER abbreviates int*.  

typedef int* ER;

// Public function prototypes

ER   newER      (const int n);
void destroyER  (ER R);
bool equivalent (ER R, const int x, const int y);
void merge      (ER R, const int x, const int y);

// The following is advertised here solely for debugging.  These must
// only be used for debugging.

void showER(const ER R, const int n);
int  leader(ER R, const int x);

#endif

#include "equiv.h"

  g++ -Wall -o test1 test1.cpp equiv.cpp

  ./test1