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
saul85 [17]
2 years ago
10

Arturo is a security professional. He is strengthening the security of an information system. His design ensures that if a field

should contain a number, the system checks the values that a user enters to make sure that the user actually entered numbers. The design also ensures that only authorized users have the ability to move or delete files. What is Arturo attempting to protect
Computers and Technology
1 answer:
Cloud [144]2 years ago
3 0

Arturo is attempting to protect the database (data) of an information system (IS).

<h3>What is an information system?</h3>

An information system (IS) can be defined as a set of computer systems, that is typically used to collect, store, and process data, as well as the dissemination of information, knowledge, and the distribution of digital products.

In Cybersecurity, there are two (2) main techniques that can be used to check data when inputted in an information system (IS) and these include:

  • Verification
  • Validation

Data validation is a type of check which is primarily performed by a software program (application) to make sure that the data which is entered into an information system (IS) is allowable and sensible.

This ultimately implies that, any data that is not allowed or sensible are rejected and discarded by the computer system.

In conclusion, we can deduce that Arturo is attempting to protect the database (data) of an information system (IS).

Read more on data here: brainly.com/question/25885448

You might be interested in
What are the major differences between searching and sorting in Java? What are some of the differences in the techniques used in
Studentka2010 [4]

Answer:  

  • Searching is a technique to look for an item or target value in a data structure like searching for a phone number in a directory.Data structure can be an array,List etc. Searching algorithms are used for searching. Most common examples are Linear Search and Binary Search. Lets take the example Linear Search in order to explain it using JAVA. Its the simplest searching algorithm. To search for a specific element, look at each element in the data structure sequentially and check if it matches with the element being searched for.
  • Sorting is a technique of arranging the elements in a specific order e.g. numerical sorting, ordering students according to their exam score. This order can be ascending or descending or alphabetical order. Contrary to search it returns the data structure e.g. an array in which the elements of array are sorted in a particular order. Sorting algorithms are used to sort elements in a data structure. Some common examples of sorting algorithms are Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, Heap Sort etc. JAVA uses Array.Sort() built-in function for sorting an array. By default it sorts the input array in ascending order.
  • Selection Sort: It is a sorting technique which divides an array into two subarrays. One subarray in the left is sorted and the other one at right is unsorted. This is an in-place algorithm. It is not a good option for large data. Initially the sorted part is empty and all elements are placed in unsorted array. First the element which is the smallest in the unsorted array is selected and swapped with the leftmost array element and becomes part of the sorted array. In each iteration the smallest element from the unsorted array is selected and moved to sorted part of the array.The worst case time complexity of this algorithm is O(n)^2 as we have to find the smallest for every element in the array.
  • Merge Sort: It is a comparison based algorithm. It works on divide and conquer technique. It uses recursion approach for sorting. This means it breaks the problem(lets say array list to be sorted) into sub problems (smaller parts) and then solves (in this case sorts) each sub problem in a recursive manner. At the end it merges the solutions (hence the merged sorted array). Although selection sort works faster when data set is small merge sort outperforms it for larger data sets. Merge sort is a stable algorithm and works best for linked lists. Its not an in place algorithm. Time complexity of merge sort is O(n*log n) for best, average and worst cases because it always divides the array in two parts and takes linear time to merge these part. O(n(logn)) time complexity makes it better,more efficient and faster to sort large data sets.
  •  Big Oh O notation is an asymptotic annotation written as O(n) which is a mathematical way to represent the upper bound of the running time of   algorithm (sorting algorithm in this case). It computes the worst case time complexity. Worst case time complexity means that the longest amount of time or maximum number of operations that will be required for a sorting algorithm to complete. The time complexity mostly gets affected as the size of the input varies.
  • For example lets find out the worst-case time complexity of Bubble Sort for a list of n elements. Worst case is when the array is reversed sorted. At first iteration it would make n-1 comparisons. At iteration 1, for n-2 times and so total comparison will be O(n^)2. So the time to run program is proportional to the square of the input size.
  • Searching algorithms are used when there is a need to find a specific data item from bulk of data item. Searching algorithms make this hectic process easier. For example you want to find phone number of person from directory. without searching algorithm looking for each phone number in the directory manually can be very time consuming. For example you have to find address of a customer number 254 from database to deliver a product. Instead  of manually looking for customer numbers you can simply use  linear search algorithm that will start from customer 1 and sequentially searches for specific customer 254 number and provides the address in a shorter time.
  • Sorting reduces complexity of problems e.g reducing the searching complexity. It is easier to locate data elements in a sorted list than unsorted. For example comparing two large data sets containing millions of records. If both the data sets are ordered, the comparison gets easier. Moreover every sorting algorithm has certain usage. Like merge sort is useful for linked lists,heap sort is good with arrays and uses less memory. If data is small with large values, selections sort is better for this. It doesn’t require any additional space. Databases use merge sort to arrange data that is too large to be loaded completely into memory.  Heap sort is used in reading bar codes on plastic cards. Quick sort is used to maintain sports score on the basis of win-loss ratio.
5 0
3 years ago
Before u can open and edit a file, you need to zip it, T/F
koban [17]

Answer

False, it is not necessary that you need to zip a file always when you are opening and editing a file

<u><em>PLS MARK BRAINLIEST</em></u>

5 0
3 years ago
You approach a railroad crossing with a cross buck sign that has no lights or gates. What should you do?
dalvyx [7]
You should or must stop 50 feet away from it.
8 0
3 years ago
Read 2 more answers
Browsers often store the cookies in individual files, each named for the server that owns the cookie. Whenever the browser visit
Anna11 [10]

Answer:

The answer is TRUE.

Explanation:

Cookies in browsers are like identification criteria. It contains unique data to a specific user. The use of this is to ensure that servers or websites that you have visited previously will recognize you as the same user who has been there before. This will cause the data and website information to load faster that before.  

Think of it as your school's gate. The security guard is the browser. He will let you inside the campus without question since he has seen your school ID or has recognize you as a student of the school.  

Cookies come in various types such as:

  • Authentication cookies - most common type of cookies that websites used to recognize you as the user who has been there or logged in before.
  • Persistent cookies - cookies that can be used for long term. Sometimes, you will encounter websites that allows the user to remember his log in credentials, this is the type of cookies that these websites used. Often, these cookies are willingly enabled by users.
  • Session cookies - cookies with expiration or being stored temporarily. These cookies will be terminated once the browser is closed.
  • Third-party cookies - These are additional cookies being added by the website you are using. But these cookies are not owned by the website itself, but is being used by other websites to track down your activities to make you see and experience advertisements that are catered to you. These are mostly exposing threats.
8 0
3 years ago
Read 2 more answers
Does anyone know the answer to this question??
Ket [755]
The type of letter they are looking for is an Inquiry Letter. 
An Inquiry letter asks questions or elicits info from the recipient. They would include what they are looking for or what they need to know about. They should include any info to reach back to them. 
6 0
3 years ago
Other questions:
  • Doe's anyone know how to access developer mode on a Chromebook laptop if enterprise enrollment blocks it?
    14·2 answers
  • ________ enables advertisers to display more relevant ads based on user's search and browsing history. FIP NORA A Web bug An int
    10·1 answer
  • ossless compression tools generally use either Huffman coding or Lempel-Ziv-Welch (LZW) coding. Discuss the advantages and disad
    8·1 answer
  • Company-wide systems that connect one or more local area networks (LANs) or wide area networks (WANs) are called _____. a) legac
    15·1 answer
  • Relation between training and occupation with examples in points . Plz tell fast<br> ​
    5·1 answer
  • How do you debug an Xcode project?
    10·1 answer
  • 200 points and brianlist if. done correctly... When working in Scratch, after clicking on the Choose Backdropicon and making you
    8·1 answer
  • Lots of data can be transferred in short time, when we have,
    10·2 answers
  • Xercise 1<br>1.<br>What is system? Explain the components of system in brief.​
    12·1 answer
  • Find the double word-length 2's complement representation of each of the following decimal numbers:a. 3874
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!