Quiz5

pdf

School

Southwestern University *

*We aren’t endorsed by this school

Course

4347

Subject

Computer Science

Date

Apr 3, 2024

Type

pdf

Pages

3

Uploaded by DukeMusicSeal30

Report
CS 4347-006 Quiz #5: Physical Layer 1 and Security November 16 th , 2023 1 Last Name: First Name: Cohort: Your task for this quiz is to answer the following theory questions. For this quiz, the topics are Security, Data Storage, Indexing, Query Optimization and Query Processing. You may work either individually or with members of your cohort. Your cohort may turn in a set of quizzes stapled, but each quiz must have the correct student’s name at the top, and the topmost quiz will be graded. Pace yourself carefully! Answers be in the appropriate spaces. Problem 1: Given the following table, and a budget of $1200.00, what is the maximum amount of data that can be stored? Solve for the cost per terabyte of each data storage first. Grader: 10 points for the costs per terabyte, 10 points for the 600 terabytes. Name Capacity Cost Cost per Terabyte Solid State Drive 128 Gigabyte $400 $3200 Magnetic Disk Drive 1 Terabyte $300 $300 Magnetic Tape Drive 10 Terabytes $20 $2 Maximum amount of data to be stored as Terabytes: ($1200/$2)=600 Terabytes Problem 2: Describe at least one method to prevent SQL Injection attacks. Grader: 15 points for at least one reasonable method. Use parameters-Have Independent views and variables for external access. Sanitize Inputs. /Filter inputs. All functions/operations has a security level.
CS 4347-006 Quiz #5: Physical Layer 1 and Security November 16 th , 2023 2 Problem 3: Define Privacy, which is not Security. If you define security instead of privacy , there will be no partial credit. Grader: 15 points for any version of the definition of privacy. Cannot mention encryption, multiple instantiation, user roles, or other security methods. If they do, full points off. Privacy is that the owner of the information has control of their information. Inform people about data being collected and how it is used. Privacy is about the policy and law about the information. Problem 4. Primary Indexing and Cluster Indexing are sparse indexing. Explain how these indexing schemes save on costs, either time or storage capacity. Grader: They need to say something about limiting the search space. Or working on a sub set. Or working on a smaller part of a file. Or perhaps mentioning starting the operation on the block anchor. 15 points. Primary Indexing and Cluster Indexing both have a file pointer that goes to a location within the main data file. Instead of searching the entire data file, search the index file first, then jump to the block anchor of the records in the main data file. This means searching for the data is an order of magnitude smaller. The search finds a subset first, and as a result , the search is much, much faster. Problem 5. Does a conjunctive operation grow or reduce the results of a query in size? Grader: 15 points. Must be reduce/smaller/shrink. Conjunction is intersection or the AND set operation. A conjunctive operation reduces the results of a query in size.
CS 4347-006 Quiz #5: Physical Layer 1 and Security November 16 th , 2023 3 Problem 6. Tables A, B, C, and D have 100 tuples each. When two tables are combined, the number of resulting tuples is *size of left branch*size of right branch. Mark the optimal path on the tree. Grader: 20 points. They should have chosen the second branch. If they chose a different branch, but showed work, allow 10 points. Otherwise, all points off. The second branch is 6122k operations, and is the shortest. They just need to mark the second branch in some fashion. Branch 1: 31,010k Branch 2: 6,122k Branch 3: 6,167k, Branch 4: 7,048K.
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help