Cuzzzzzzzzzzzzzzzz iiiiiiiiiiiiiiiii remember everytimeeeeeeeeee on these days that i feel like you and meeeeeeeeeeeeeee

svlad2 [7]

Answer:

The perimeter is the length of the outline of a shape. To find the perimeter of a rectangle or square you have to add the lengths of all the four sides. x is in this case the length of the rectangle while y is the width of the rectangle. The perimeter, P, is: P=x+x+y+y.

Explanation:

6 0

2 years ago

You have configured your firewall to authenticate a group of 100 users who are in your company. You set up the database of users

svetlana [45]

Answer:

Explanation:

Network Access Control is needed to make sure that only set of verified users access the network.

It makes sure that the users are authenticated and only set of some verified users have access to network.

Set of NAC solutions like Impulse SafeConnect, Extreme Networks, ExtremeControl, Auconet BICS, ForeScout CounterACT, Pulse Policy Secure could be installed in the system which along with basic profiling will make sure authenticated access to the network.

Other than this basic encryption-decryption algorithm can be used in this regard. Network components could use encryption algorithms like RSA and DES. These algorithms will make sure that the information from database side is well encrypted. Once that information goes to the network component. They can decrypt the encryption by generating relevant key using the same algorithm.

This will only allow authentic users to access information and also it will stop the leakage of information in between the transmission because of encryption.

4 0

2 years ago

Due to the shift from host-based networks to microcomputer based networks, more than _____ percent of most organizations' total

DanielleElmas [232]

This is ninety percent

8 0

2 years ago

write a program to evaluate the following postfix expression. the value of each variable must be asked from the user during the

ikadub [295]

In this exercise we have to use the knowledge of computational language in C++ to write a code that program to evaluate the following postfix expression. the value of each variable must be asked from the user during the execution time.

<h3>Writting the code:</h3>

#include <bits/stdc++.h>

using namespace std;

// CREATED A CLASS STACK

class Stack

{

public:

int top;

unsigned sz;

int* ar;

};

// VARIOUS STACK FUNCTIONS

Stack* makeStack( unsigned sz )

{

Stack* stack = new Stack();

// BASE CONDITION

if (!stack) return NULL;

stack->top = -1;

stack->sz = sz;

stack->ar = new int[(stack->sz * sizeof(int))];

if (!stack->ar) return NULL;

// RETURNING THE STACK

return stack;

}

// CHECKING IF THE STACK IS EMPTY

int isEmpty(Stack* stack)

{

return stack->top == -1 ;

}

// CHECKING THE TOP OF THE STACK

int whatAtTop(Stack* stack)

{

return stack->ar[stack->top];

}

// POPPING OUT OF A STACK

int pop(Stack* stack)

{

if (!isEmpty(stack))

return stack->ar[stack->top--] ;

return '$';

}

// PUSHING IN THE STACK

void push(Stack* stack, int op)

{

stack->ar[++stack->top] = op;

}

// EVALUATING POSTFIX STARTS HERE

int postfixEvaluator(string res)

{

// CREATING STACK

Stack* stack = makeStack(res.length());

int i;

// BASE CONDITION

if (!stack) return -1;

for (i = 0; res[i]; ++i)

{

// CHECK FOR SPACES

if (res[i] == ' ')continue;

// CHECK FOR THE DIGIT

else if (isdigit(res[i]))

{

int N = 0;

// EXTRACT THE NUMBER OUT OF STACK

while (isdigit(res[i]))

{

N = N * 10 + (int)(res[i] - '0');

i++;

}

i--;

// PUSH THE NUMBER IN STACK

push(stack, N);

}

// POPPING AND ARITHMETIC OPERATIONS

else

{

int pos1 = pop(stack);

int pos2 = pop(stack);

switch (res[i])

{

case '+': push(stack, pos2 + pos1); break;

case '-': push(stack, pos2 - pos1); break;

case '*': push(stack, pos2 * pos1); break;

case '/': push(stack, pos2 / pos1); break;

}

return pop(stack);

}

// MAIN CODE

int main()

{

string tes;

getline(cin, tes);

string tmp = "";

string res = "";

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

if (tes[i] <= 'z' and tes[i] >= 'a') {

tmp += tes[i];

} else if (tes[i] == ' ' and (tes[i - 1] <= 'z' and tes[i - 1] >= 'a')) {

cout << "Enter the value of " << tmp << ": ";

int x; cin >> x;

res += (to_string(x));

res += ' ';

tmp = "";

} else {

res += tes[i];

}

cout << "\nThe postfix expression is : " << res;

cout << "\nThe result is : " << postfixEvaluator(res);

return 0;

}

See more about C++ at brainly.com/question/19705654

#SPJ1

8 0

6 months ago

Dr. Watson has been kidnaped! Sherlock Holmes was contacted by the kidnapper for ransom. Moments later he received a message fro

adelina 88 [10]

Answer:

please mark me brainlist

Explanation:

This algorithm works for n number of strings in python3

Input:

83217

8213897

683147

Output:

837

from itertools import product

import pdb

import numpy as np

def neigh(index):

N = len(index)

for ri in product((0, -1), repeat=N):

if not all(i == 0 for i in ri):

yield tuple(i + i_rel for i, i_rel in zip(index, ri))

def longestCommonSubSequenceOfN(sqs):

numberOfSequences = len(sqs); # to know number of sequences

lengths = np.array([len(sequence) for sequence in sqs]); # to know length of each sequences placed in # array

incrLengths = lengths + 1; # here we are taking no .of sequences +1

lengths = tuple(lengths); # making lengths into tuple to make it mutable

inverseDistances = np.zeros(incrLengths);

ranges = [tuple(range(1, length+1)) for length in lengths[::-1]]; # finding ranges from 1 to each lengths

for tupleIndex in product(*ranges):

tupleIndex = tupleIndex[::-1];

neighborIndexes = list(neigh(tupleIndex)); # finding neighbours for each tupled index value and # store them in list

operationsWithMisMatch = np.array([]); # creating array which are miss matched

for neighborIndex in neighborIndexes:

operationsWithMisMatch = np.append(operationsWithMisMatch, inverseDistances[neighborIndex]);

#appending newly created array with operations miss match and inverseDistances

operationsWithMatch = np.copy(operationsWithMisMatch);

# copying newly generated missmatch indexs

operationsWithMatch[-1] = operationsWithMatch[-1] + 1;

# incrementing last indexed value

chars = [sqs[i][neighborIndexes[-1][i]] for i in range(numberOfSequences)];

# finding a string(chars) with neighbour indexes and checking with other sequences

if(all(elem == chars[0] for elem in chars)):

inverseDistances[tupleIndex] = max(operationsWithMatch);

else:

inverseDistances[tupleIndex] = max(operationsWithMisMatch);

subString = ""; # resulted string

mainTupleIndex = lengths; # copying lengths list to mainTupleIndex

while(all(ind > 0 for ind in mainTupleIndex)):

neighborsIndexes = list(neigh(mainTupleIndex));

#generating neighbour indexes with main tuple index in form of list

anyOperation = False;

for tupleIndex in neighborsIndexes:

current = inverseDistances[mainTupleIndex];

if(current == inverseDistances[tupleIndex]): # comparing indexes in main tuple index and inverse #distance tuple index

mainTupleIndex = tupleIndex;

anyOperation = True;

break;

if(not anyOperation): # if anyoperation is False then we are generating sunString

subString += str(sqs[0][mainTupleIndex[0] - 1]);

mainTupleIndex = neighborsIndexes[-1];

return subString[::-1]; # reversing resulted string

sequences = ["83217", "8213897", "683147"]

print(longestCommonSubSequenceOfN(sequences)); #837

8 0

2 years ago