1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
lidiya [134]
3 years ago
8

A file is currently compressed in its local file system. For security reasons, the file is required to be encrypted. The file ca

n be both compressed and encrypted. True or False
Computers and Technology
1 answer:
skelet666 [1.2K]3 years ago
3 0
True. An encryption scheme doesn't care what it is encrypting, be it compressed or uncompressed.

Note that an encrypted file will look like random data to most compression algorithms, so it makes sense to first compress, then encrypt, to get the maximum efficiency from the compression.
You might be interested in
Are sql injections legal?
natima [27]

Essentially, if you are seen to be someone who knows what you are doing, then even typing in a single-quote to a web form has been enough to be arrested and charged over in the past.

But lets say i'm writing a pen test tool that will be doing sqli testing and let it loose on sites that are 'out in the wild'. I'm not going to be doing dumps of any information. But is just the vulnerability scan itself illegal?



8 0
3 years ago
The term ____ refers to a series of storage devices, such as tapes, hard drives, and cds, that are networked together to provide
Setler [38]

Answer:

SAN

Please Mark Brainliest If This Helped!

5 0
2 years ago
You are asked to simulate a binary search algorithm on an array of random values.An array is the list of similar type of element
Alex Ar [27]

Answer:

Explanation:

Problem statement:

to simulate a binary search algorithm on an array of random values.

Binary Search: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.

Input/output description

Input:

Size of array: 4

Enter array:10  20 30 40

Enter element to be searched:40

The Output will look like this:

Element is present at index 3

Algorithm and Flowchart:

We basically ignore half of the elements just after one comparison.

Compare x with the middle element.

If x matches with middle element, we return the mid index.

Else If x is greater than the mid element, then x can only lie in right half subarray after the mid element. So we recur for right half.

Else (x is smaller) recur for the left half.

The Flowchart can be seen in the first attached image below:

Program listing:

// C++ program to implement recursive Binary Search

#include <bits/stdc++.h>

using namespace std;

// A recursive binary search function. It returns

// location of x in given array arr[l..r] is present,

// otherwise -1

int binarySearch(int arr[], int l, int r, int x)

{

   if (r >= l) {

       int mid = l + (r - l) / 2;

       // If the element is present at the middle

       // itself

       if (arr[mid] == x)

           return mid;

       // If element is smaller than mid, then

       // it can only be present in left subarray

       if (arr[mid] > x)

           return binarySearch(arr, l, mid - 1, x);

       // Else the element can only be present

       // in right subarray

       return binarySearch(arr, mid + 1, r, x);

   }

   // We reach here when element is not

   // present in array

   return -1;

}

int main(void)

{ int n,x;

cout<<"Size of array:\n";

cin >> n;

int arr[n];

cout<<"Enter array:\n";

for (int i = 0; i < n; ++i)

{ cin >> arr[i]; }

cout<<"Enter element to be searched:\n";

cin>>x;

int result = binarySearch(arr, 0, n - 1, x);

   (result == -1) ? cout << "Element is not present in array"

                  : cout << "Element is present at index " << result;

   return 0;

}

The Sample test run of the program can be seen in the second attached image below.

Time(sec) :

0

Memory(MB) :

3.3752604177856

The Output:

Size of array:4

Enter array:10  20 30 40

Enter element to be searched:40

Element is present at index 3

Conclusions:

Time Complexity:

The time complexity of Binary Search can be written as

T(n) = T(n/2) + c  

The above recurrence can be solved either using Recurrence T ree method or Master method. It falls in case II of Master Method and solution of the recurrence is Theta(Logn).

Auxiliary Space: O(1) in case of iterative implementation. In case of recursive implementation, O(Logn) recursion call stack space.

8 0
2 years ago
Suppose Client A initiates a Telnet session with Server S. At about the same time, Client B also initiates a Telnet session with
poizon [28]

Answer:

An answer to this question is given below in explanation section.

Explanation:

The given question is incomplete. First, we write the complete question that is:

Suppose Client A initiates a Telnet session with Server S. At about the same time, Client B also initiates a Telnet session with Server S. Run telnet in a terminal and capture the traffic on Wireshark. For example, open a telnet session using this command: "telnet cs537.cs.csusm.edu". What are the source and destination port numbers for the following items?

  1. the segment sent from A to S.
  2. the segment sent from B to S.
  3. the segment sent from S to A.
  4. the segment sent from S to B.
  5. if A and B are different hosts, is it possible that the source port number in the segments from A to S is the same as that from B to S?
  6. how about if they are the same host?

Answers

                           Source Port Numbers               Destination Port Number

  1. A -> S                      1467                                               23
  2. B -> S                       1513                                               23
  3. S->A                         23                                                  1467
  4. S->B                         23                                                  1513
  5. Yes, it is that the source port number in the segement from A to S is the same as that from B to S. In short, there is no relationship between port numbers on different hosts
  6. no, a port number identify UNIVOCALLY a process.

5 0
3 years ago
The animal shelter requires that people who volunteer there affirm that they are not allergic to dogs or cats. How would you mod
shepuryov [24]

Answer: Through the use of close-ended questions, for example a question with a YES/NO answer.

Explanation:

Close ended questions are questions in which a participant has already been provided with options to a question, and so the participants must choose from the options and cannot give an answer outside the options given.

Using this kind of question to modify the database schema would be helpful.

Therefore, in order to affirm that the volunteers are not allergic to dogs or cats, the close ended question "are you allergic to dogs or cats" can be used. The volunteers would be provided with a yes or no answer which they must choose from.

This would help in modifying the database schema while affirming whether the volunteers are allergic to dogs or cats.

5 0
3 years ago
Read 2 more answers
Other questions:
  • Let's assume that the smallest possible message is 64 bytes (including the 33-byte overhead). if we use 100base-t, how long (in
    10·1 answer
  • 3. Which of the following phase types will make a sound louder? In-phase, inverted phase, or partial phase angle waves?
    7·2 answers
  • HURRY
    5·1 answer
  • What is the fastest way to move data over long distances using the internet, for instance across countries or continents to your
    13·1 answer
  • What is drop shipping and how it works on amazon?
    12·1 answer
  • Your enterprise LAN uses a VPN so that users working from home can access shared Windows folders in the office, but it doesn't w
    12·1 answer
  • Write a method named printGPA that takes in as a parameter a Scanner to read in user input, and calculates a student's grade poi
    8·1 answer
  • Adassadad saflalfaklfajfklajfalkfjalkfjalkfalkf
    6·2 answers
  • Write a 5 – 7+ sentence paragraph about Thanksgiving that DOES NOT use the letter “t.”
    10·1 answer
  • What is system software?
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!