13. Data Analytics - Prepare Data for Exploration - Week 4

Definitions:

File naming conventions // consistent guidelines that describe the content, data, or version of a file in its name

Data security // protecting data from unauthorized access or corruption by adopting safety measures

Encryption // uses a unique algorithm to alter data and make it unusable by users and applications that don't know the algorithm. Algorithm is then saved as a key to decrypt.

Tokenization // replaces data elements you want to protect with randomly generated data referred to as "token." User or app needs permission to use tokenized data and the token mapping to de-token data.


Spreadsheet security features:

        - Protect spreadsheets from being edited

        - Access control features


File Naming DO's:

        - Work out your conventions early

        - Align file naming with your team

        - Make sure your file names are meaningful

        - Keep file names short and sweet

        - Format dates yyyymmdd: SalesReport20201125

        - Lead revision numbers with 0: SalesReport20201125v02

        - Use hyphens, underscores, or capitalized letters: SalesReport_2020_11_25_v02

        - Create text file to list out the naming conventions you have used.


Benefits of organizing data:

        - Makes it easier to find and use 

        - Helps you avoid making mistakes during your analysis

        - Helps to protect your data


Best practices when organizing data:

        - Naming conventions

                    Consistent guidelines that describe the content, data, or version of a file in its name.

                    Use logical and descriptive names for your files to make them easier to find and use.

        - Foldering

                    Putting related files into one place (folder). Subfolders can also extend foldering.

                    Helps move old projects to a separate location to create an archive and cut down on clutter.

        - Archiving older files

        - Align your naming and storage practices with you team

                    Data are shared in a team, so its best to make sure others understand.

        - Develop metadata practices


Comments

Post a Comment

Popular posts from this blog

2. FreeCodeCamp - Dynamic Programming - Learn to Solve Algorithmic Problems & Coding Challenges

Dynamic Programming - Parts      PART 1 - Memoization     P ART 2 - Tabulation Dynamic Programming with Fibonacci Example Recursion: Slow because time complexity is O(2^n) func fibR (x int ) int {     if x <= 2 {         return 1     }     return fibR (x- 1 ) + fibR (x- 2 ) } Dynamic Way Example Recursion with Stored Value:  // Fast because it removes duplicate processes by checking map. // Tail recursion-ish // Results are hitchhiking each recursive call func fibR2 (x int , y map [ int ] int ) int {     if _ , ok := y[x]; ok {         return y[x]     }     if x <= 2 {         return 1     }     y[x] = fibR2 (x- 1 , y) + fibR2 (x- 2 , y)     return y[x] }
Read more

20. Data Analytics - Analyze Data to Answer Questions - Week 1

Goal of analysis is to identify trends and relationships within data so you can accurately answer the questions you're asking. Most data is organized in tables, always have data in the right format. Definition : Analysis // process used to make sense of the data collected Sorting // involves arranging data into a meaningful order to make it easier to understand, analyze, visualize Outliers // data points that are very different from similarly collected data and might not be reliable values Filtering // extracting specific data that meet certain criteria while hiding the rest Customized sort order // when you sort data in a spreadsheet using multiple conditions The 4 phases of analysis:          1. Organize data // getting the right data in the right size and order                     - Sorting : arrange data in meaningful order                     - Filtering : can help find errors or outliers          2. Format and adjust data // filtering or sorting or compiling data in a better
Read more

3. Algorithms - Selection Sort

Selection sort sorts an array by finding the lowest value element and appending it to an empty array. The algorithm will shrink the unsorted array and repeat the process recursively until all unsorted elements are used up. package main func selectionSort (list *[] int ) {     sorted := make ([] int , 0 , len (*list))     unSorted := *list     for i := 0 ; i < len (*list); i++ {         min := unSorted[ 0 ]         index := 0         for i , e := range unSorted {             if e <= min {                 min = e                 index = i             }         }         sorted = append (sorted, (unSorted)[index])         if index == 0 {             unSorted = unSorted[ 1 :]         } else if index == ( len (*list) - 1 ) {             unSorted = unSorted[:index]         } else {             unSorted = append (unSorted[ 0 :index], unSorted[index+ 1 :]...)         }     }     * list = sorted } /*func main() {     x := []int{4, 6, 3, 2, 9, 7, 3, 5}     fmt.Print
Read more