8. Data Analytics - Ask Questions to Make Data-Driven Decisions - Week 3

Definitions:

Formula // a set of instructions that performs a specific calculation

Operators // a symbol that names the type of operation or calculation to be performed

Cell reference // a cell or a range of cells in a worksheet that can be used in a formula

Range // a collection of two or more cells

Function // a preset command that automatically performs a specific process or task using the data

Problem domain // specific area of analysis that encompasses every activity affecting or affected by the problem.

Structured thinking // process of recognizing the current problem or situation, organizing available information, revealing gaps and opportunities, and identifying the options.

Context // condition in which something exists or happens

Scope of work (SOW) // an agreed-upon outline of the work you're going to perform on a project

    - Deliverables // items or tasks need to complete before finishing project
            What work is being done, and what things are being created as a result of this project? When the             project is complete, what are you expected to deliver to the stakeholders? Be specific here. Will             you collect data for this project? How much, or for how long?  
 
    - Timeline // due dates when deliverables, milestones, or reports due
            Your timeline will be closely tied to the milestones you create for your project. The timeline is a             way of mapping expectations for how long each step of the process should take.

    - Milestones // significant tasks you confirm along your timeline to help show project is on track
            What work is being done, and what things are being created as a result of this project? When the             project is complete, what are you expected to deliver to the stakeholders? Be specific here. Will             you collect data for this project? How much, or for how long?   

    - Reports
             Good SOWs also set boundaries for how and when you’ll give status updates to stakeholders.                 How will you communicate progress with stakeholders and sponsors, and how often? Will                     progress be reported weekly? Monthly? When milestones are completed? What information                 will status reports contain?

Spreadsheet Errors:

    #DIV/0! // a formula is trying to divide a value in a cell by 0 or by an empty cell
    
    #ERROR! (GOOGLE SHEETS) // formula can't be interpreted as input, known as parsing error
    
    #N/A // data in formula can't be found by spreadsheet

    #NAME? // formula or function name isn't understood

    #NUM! // formula or function calculation can't be performed as specified

    #VALUE! // general error that could indicate a problem with a formula or referenced cell

    #REF! // a formula is referencing a cell that is no longer valid or has been deleted

Spreadsheet Tasks:

    - Organize your data: pivot table, filtering,

    - Calculate your data: formulas and functions



Data Lifecycle:

    - Plan // format cells, headers, etc

    - Capture // connect spreadsheet to other data sources

    - Manage // storing, organizing, filtering, updating

    - Analyze // pivot tables, formulas

    - Archive // store for use later

    - Destroy // backups or destroy data properly


Understanding Data Context by Asking: who, what, when, where, how


Additional Resources:

https://support.google.com/docs/answer/181110

https://support.microsoft.com/en-us/office/keyboard-shortcuts-in-excel-1798d9d5-842a-42b8-9c99-9b7213f0040f

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