Big Data

    Cards (36)

    • What is Big Data?
      Large and complex data sets that are used to identify patterns, trends and associations usually with humans
    • What are some concerns regarding Big Data?
      1. Breach and loss of personal information
      2. Copyright Rights for Digital property
      3. Keep up to date with cybersecurity
    • What is a list in programming? What may the have in them? Explain why this is important.
      List: A set of items that usually are related together
      Contain: any data type
    • How can we manipulate lists?
      Explain
    • When storing data from a ran simulation, what is it usually formed as?

      List
    • Does a function have to return a value? Or have an input?
      No
    • What is a linear search?
      A linear search is a method of finding a specific value in a list by checking each element one by one until a match is found or the end of the list is reached.
    • What is a binary search?
      looks for element in a list by starting in middle and halving the scanning space if it’s higher or lower until element is found or is not in the list
    • What do you need in order to swap the values of two variables?
      Same data type and three variables
    • What is an insertion sorting algorithm?
      Divides list into two lists(sorted and unsorted). Inserts elements form unsorted into correct position in sorted
    • What is a bubble sorting algorithm?
      Compares two consecutive elements. Smaller one goes into place and larger one goes to be compared to next element. Stops after no swaps
    • What is a selection sorting algorithm?
      Selects smallest element of list and swaps it with first element. Continues until last element
    • Why is knowing different algorithms important?
      Expalin
    • What is data compression? Why is it used?
      Data compression is the process of reducing the size of data to save storage space and transmission time. It is used to optimize storage capacity, and improve data transfer speeds.
    • What are the types of data compression?Their differences?
      1. Lossy- keeping all data isn’t necessary
      2. Lossless- must be returned to original state
    • What are the three different ways of performing a lossless data compression?
      Dictionary-based, same as earlier and run-length encoding.
    • What are two types of lossy compression?
      Every other value
      Rounding numbers
    • What does a Data Scientist typically do?
      1. Gather information
      2. Organize and make predictive models
      3. Graphically represent info for efficiency
    • What is more important than being able to scrape the data?
      Data analysis
    • What is a CSV file?
      “Comma separates Values”;
      Data separates by commas
    • What are different data extensions?
      1. CSV- Comma Separated Values
      2. XLS- Excel Spreadsheet
      3. JSON-JavaScript Object Notation
    • What is an intractable problem? Their solutions?
      Intractable problem: A problem that is difficult or impossible to solve. Solutions: Brute Force Method
    • What is Brute Force Method of solving? Used for?
      Brute Force Method: Exhaustive search through all possible solutions. Used for: Solving Intractable problems
    • What is Big O notation in Computer science?
      Number of tries to find solutions
    • What is the Big O of linear, binary, and sorting methods?
      Linear: O(n) Binary: O(log_n) Sorting: O(n^2)
    • Think of intractable problems
      Think
    • What is hashing?
      Transforming data values with hashing function; organizes data for quick retrieval; Big O = 1
    • What is P in Big O notation?
      P is for "Polynomial";
      Easiest problem that is solved in polynomial time(sorting methods)
    • What is NP?
      Non-deterministic polynomial time;
      Represents majority of computer issues. Difficult to solve but easy to verify solution
    • What is NP Complete?
      Like NP, long solve, quick verify,
      Most difficult problems that usually have not been solved
    • What is the relationship between NP and NP Complete?
      NP problems can be reduced into NP complete; meaning do you can find an algorithm to solve an NP complete problem, you can solve NP problems
    • What is an NP hard problem?
      NP problem with no rules
    • What are heuristic solutions?
      Approximate solutions with loose rules(“good enough answers
    • What is the meaning of cryptography? Actual definition?
      Name: “Secret Writing”
      Definition: practice of crating secure communication networks in presence of adversaries
    • What is the purpose of cryptography? How does one enact this?
      Purpose: Secure communication Enactment: Using algorithms and keys like intractable problems
    • What is the generic encryption method? Most secure method explained?
      Generic: Public Key Encryption
      Most secure: RSA; representing data between the user and website with intractable problems,(prime factorization and modulo operations)
    See similar decks