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 format to analyze

        3. Get input from others // get extra insights/input from different perspectives

        4. Transform data // identifying relationship and patterns between data and making calculations


SQL:

        - Filtering: use WHERE clause, use AND for more conditions

        - Sorting:

                - ORDER BY // This clause go under FROM/WHERE. Default sorts by ascending order.

                        Example: ORDER BY ColumnName DESC

Spreadsheet:

        - Sorting:

                Sort sheet // all of the data in spreadsheet is sorted by ranking of a specific sorted column -

                data across rows is kept together.

                Sort range // nothing else on the spreadsheet is rearranged beside the specified cells in a

                column.

                SORT function // =SORT(CELL:RANGE, COLUMNindex, TRUEORFALSE)


Additional Resources:

https://support.microsoft.com/en-us/office/sort-data-in-a-range-or-table-62d0b95d-2a90-4610-a6ae-2e545c4a4654

https://support.microsoft.com/en-us/office/video-sort-data-in-a-range-or-table-ffb9fcb0-b9cb-48bf-a15c-8bec9fd3a472#ID0EAABAAA=Transcript

https://www.youtube.com/watch?v=Ep5q1cUhQas

https://support.microsoft.com/en-us/office/sort-function-22f63bd0-ccc8-492f-953d-c20e8e44b86c

https://support.microsoft.com/en-us/office/sortby-function-cd2d7a62-1b93-435c-b561-d6a35134f28f

https://support.microsoft.com/en-us/office/filter-function-f4f7cb66-82eb-4767-8f7c-4877ad80c759



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

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