9. Data Analytics - Ask Questions to Make Data-Driven Decisions - Week 4

Definitions:

Stakeholders // people that have invested time, interest, and resources into the projects you'll be working on as a data analyst.

Turnover rate // a rate at which employees leave the company

Project Managers // in charge of planning and executing a project


Conflicts:

    - Stay objective and on top of goals

    - Reframe the problem (how can I help you reach your goal?) Creates an opportunity for teamwork.

    - DISCUSSION IS KEY TO CONFLICT RESOLUTION

    - Understand the context


Fast answers aren't the most accurate.

Redirection questions to balance speed and accuracy:

    - Reframe the questions

    - Outline the problems

    - Outline the challenges

    - Outline potential solutions

    - Show timeframes


Clear communication is key. Before communicating, think about:

    - Who the audience is

    - What they already know

    - What they need to know

    - How you can communicate that effectively to them


Answering emails in timely manners.

Set realistic timeline.

Flag problems early for stakeholders.


Three Common Stakeholders:

    - Executive Team:

            - Provides strategic and operational leadership to company by creating goals, strategies, and

                make sure everything is executed effectively.

            - Wants headline news, not small details.

    - Customer-Facing Team

            - Anyone who have interactions with customers or potential customers.

            - They compile information, set expectations, and communicate customer feedback to other

                parts of internal organization.

    - Data Science Team

            - Data experts who use data to create new strategies or ideas.


Working with Stakeholders:

    - Discuss goals

    - Feel empowered to say no

    - Plan for the unexpected

    - Know your project

    - Start with words and visuals

    - Communicate often


Three things to focus on to stay on task:

    - Who are the primary and secondary stakeholders

    - Who is managing the data

    - Where can you go for help


Limitations of Data:

    - Incomplete (or nonexistent) Data:

            Some data are incomplete, be sure to consider this in the analysis.

    - Don't misaligned data

            Data is collected and handled differently between departments. Make sure data is aligned with                 similar metrics.

    - Deal with dirty data

            Dirty data are error prone data. Cleaning data is the best approach to deal with dirty data.

    - Tell a clear story

            1. Compare same types of data

            2. Visualize with care

            3. Leave out needless graphs

            4. Test for statistical significance

            5. Pay attention to sample size

    - Be the judge

            Make judgement calls on the data analysis.


Things to do before meetings:

    - Come prepared; bring materials, read meeting agenda, prepare presentation and ready to answer

    - Be on time; 

    - Pay attention; staying focus and attentive, asking questions for clarifications

    - Ask questions; reach out

Things not to do before meetings:

    - Don't show up unprepared.

    - Don't come late

    - Don't be distracted

    - Don't dominate the conversation


Leading Great Meetings:

    Before Meeting: 

        - Identify objective, goals, outcomes of meeting. 

        - Acknowledge participants and keep them involved.

        - Organize data to be presented.

        - Prepare an agenda.

    Crafting an Agenda:

        - Meeting start and end time

        - Meeting location

        - Objectives

        - Background material or data the participants should review beforehand

    During Meeting:

        - Make introductions, present data, discuss observations, take notes, determine and summarize                 next steps.

    After Meeting:

        - Distribute notes or data, confirm next steps and timeline for actions, ask for feedback

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