Embedding Maps in Looker BI

⚪️ Turn on Development mode Toggle

qwiklabs-flights-maps.model File

Replace this content with your file

connection: "bigquery_public_data_looker"
# include all views in this project
include: "*.view"
include: "/z_tests/*.lkml"

map_layer: data_area {
  file: "maps/US_West_Midwest.topojson"
}

explore: airports {
  group_label: "FAA"
}

explore: flights {
  group_label: "FAA"
  description: "Start here for information about flights!"
  join: carriers {
    type: left_outer
    sql_on: ${flights.carrier} = ${carriers.code} ;;
    relationship: many_to_one
  }

  join: aircraft {
    type: left_outer
    sql_on: ${flights.tail_num} = ${aircraft.tail_num} ;;
    relationship: many_to_one
  }

  join: aircraft_origin {
    from: airports
    type: left_outer
    sql_on: ${flights.origin} = ${aircraft_origin.code} ;;
    relationship: many_to_one
    fields: [full_name, city, state, code, map_location]
  }

  join: aircraft_destination {
    from: airports
    type: left_outer
    sql_on: ${flights.destination} = ${aircraft_destination.code} ;;
    relationship: many_to_one
    fields: [full_name, city, state, code, map_location]
  }

  join: aircraft_models {
    sql_on: ${aircraft.aircraft_model_code} = ${aircraft_models.aircraft_model_code} ;;
    relationship: many_to_one
  }
}


# Place in `qwiklabs-flights-maps` model

explore: +flights {
  
    query: quicklab_task_1{
      dimensions: [aircraft_origin.state]
      measures: [carriers.count]
    }
  }


# Place in `qwiklabs-flights-maps` model
explore: +flights {
    query: quicklab_task_2{
      dimensions: [aircraft_destination.map_location, aircraft_origin.map_location]
      measures: [count]
      filters: [
        aircraft_destination.state: "CA,WA,CO,NV,UT,AK,HI,OR,LA,ID,WY",
        aircraft_origin.city: "ATLANTA^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ",
        flights.arrival_year: "2004"
      ]
  }
}

# Place in `qwiklabs-flights-maps` model

explore: +flights {
    query: quicklab_task_3 {
      dimensions: [aircraft.region]
      measures: [aircraft.count]
    }
  }

aircraft.view File

Replace this content with your file

view: aircraft {
  sql_table_name: `cloud-training-demos.looker_flights.aircraft` ;;

  dimension: tail_num {
    type: string
    primary_key: yes
    sql: rtrim(${TABLE}.tail_num) ;;
  }

  dimension: address1 {
    type: string
    sql: ${TABLE}.address1 ;;
  }

  dimension: address2 {
    type: string
    sql: ${TABLE}.address2 ;;
  }

  dimension_group: air_worth {
    type: time
    timeframes: [time, date, week, month, year, raw]
    convert_tz: no
    datatype: date
    sql: ${TABLE}.air_worth_date ;;
  }

  dimension: aircraft_engine_code {
    type: string
    sql: ${TABLE}.aircraft_engine_code ;;
  }

  dimension: aircraft_engine_type_id {
    type: number
    sql: ${TABLE}.aircraft_engine_type_id ;;
  }

  dimension: aircraft_model_code {
    type: string
    sql: ${TABLE}.aircraft_model_code ;;
  }

  dimension: aircraft_serial {
    type: string
    sql: ${TABLE}.aircraft_serial ;;
  }

  dimension: aircraft_type_id {
    type: number
    sql: ${TABLE}.aircraft_type_id ;;
  }

  dimension_group: cert_issue {
    type: time
    timeframes: [time, date, week, month, year, raw]
    convert_tz: no
    datatype: date
    sql: ${TABLE}.cert_issue_date ;;
  }

  dimension: certification {
    type: string
    sql: ${TABLE}.certification ;;
  }

  dimension: city {
    type: string
    sql: ${TABLE}.city ;;
  }

  dimension: country {
    type: string
    map_layer_name: countries
    sql: ${TABLE}.country ;;
  }

  dimension: county {
    type: string
    sql: ${TABLE}.county ;;
  }

  dimension: fract_owner {
    type: string
    sql: ${TABLE}.fract_owner ;;
  }

  # Don't use this one. It complicates the custom measure exercise.
  # Can't just hide it because hidden fields still show up as suggestions in custom fields.
  # dimension_group: last_action {
  #   hidden: yes
  #   type: time
  #   timeframes: [time, date, week, month, raw]
  #   convert_tz: no
  #   datatype: date
  #   sql: ${TABLE}.last_action_date ;;
  # }

  dimension: last_action_year {
    type: number
    sql: EXTRACT(YEAR FROM ${TABLE}.last_action_date) ;;
  }

  dimension: mode_s_code {
    type: string
    sql: ${TABLE}.mode_s_code ;;
  }

  dimension: name {
    type: string
    sql: ${TABLE}.name ;;
  }

  dimension: region {
    type: string
    case: {
      when: {
        sql: ${state} in ('WA','OR','CA','NV','UT','WY','ID','MT','CO','AK','HI') ;;
        label: "West"
      }
      when: {
        sql: ${state} in ('AZ','NM','TX','OK') ;;
        label: "Southwest"
      }
      when: {
        sql: ${state} in ('ND','SD','MN','IA','WI','MN','OH','IN','MO','NE','KS','MI','IL') ;;
        label: "Midwest"
      }
      when: {
        sql: ${state} in ('MD','DE','NJ','CT','RI','MA','NH','PA','NY','VT','ME','DC') ;;
        label: "Northeast"
      }
      when: {
        sql: ${state} in ('AR','LA','MS','AL','GA','FL','SC','NC','VA','TN','KY','WV') ;;
        label: "Southeast"
      }
      else: "Unknown"
    }
    map_layer_name: data_area
    drill_fields: [state]
  }


  dimension: registrant_type_id {
    type: number
    sql: ${TABLE}.registrant_type_id ;;
  }

  dimension: state {
    type: string
    sql: ${TABLE}.state ;;
  }

  dimension: status_code {
    type: string
    sql: ${TABLE}.status_code ;;
  }

  dimension: year_built {
    # type: date_year
    # sql: DATE(nullif(${TABLE}.year_built,0), 01, 01) ;;   # makes the SQL too clunky

    type: number
    sql: nullif(${TABLE}.year_built,0) ;;
    value_format_name: id
  }

  dimension: zip {
    type: zipcode
    sql: ${TABLE}.zip ;;
  }

  measure: count {
    type: count
    drill_fields: [name]
  }
}

Now watch the video carefully...

Week 3 The Joy of Computing using Python Assignment 3 Programming ANSWERS

 Week3

Question1: # Sort the marks in ascending order for i in range(len(marks)): for j in range(len(marks) - 1): if marks[j] > marks[j + 1]: marks[j], marks[j + 1] = marks[j + 1], marks[j] # Calculate the median n = len(marks) if n % 2 == 1: median = marks[n // 2] else: median = (marks[n // 2 - 1] + marks[n // 2]) / 2 return median Question2: def sort_string(input_string): # Convert the input string to lowercase input_string = input_string.lower() # Sort the string in alphabetical order sorted_string = ''.join(sorted(input_string)) # Return the sorted string return sorted_string # Example usage input_string = input().rstrip() # Removes any trailing newline character print(sort_string(input_string))

Week 3 - Programming, Data Structures And Algorithms Using Python Assignment 3 ANSWERS

 

def remdup(l): result = [] seen = set() for num in l: if num not in seen: result.append(num) seen.add(num) return result def sumsquare(l): odd_sum = sum(x ** 2 for x in l if x % 2 != 0) even_sum = sum(x ** 2 for x in l if x % 2 == 0) return [odd_sum, even_sum] def transpose(m): return [list(row) for row in zip(*m)]

Week 3 - Introduction to programming in C Assignment 3 Q1 ,Q2, Q3 ANSWERS

 Question1:

#include <stdio.h> int main() { int num1, num2; scanf("%d", &num1); scanf("%d", &num2); while (num1 != -1 && num2 != -1) { double average = (num1 + num2) / 2.0; printf("%.1f ", average); num1 = num2; scanf("%d", &num2); } return 0; } Question2: #include <stdio.h> // Function to check if a number is prime int is_prime(int n) { if (n <= 1) { return 0; // Not prime } for (int i = 2; i * i <= n; i++) { if (n % i == 0) { return 0; // Not prime } } return 1; // Prime } int main() { // Read the number of elements int N; scanf("%d", &N); // Read the list of numbers int ki; int prime_count = 0; // To keep track of the number of prime elements for (int i = 0; i < N; i++) { scanf("%d", &ki); // Check if the number is prime and print if it is if (is_prime(ki)) { if (prime_count > 0) { printf(" "); } printf("%d", ki); prime_count++; } } printf("\n"); // Add a newline at the end return 0; } Question3: #include <stdio.h> int findKthOdd(int k) { int num, count = 0; while (scanf("%d", &num) != EOF && num != -1) { if (num % 2 != 0) { count++; if (count == k) { return num; } } } return -1; // Less than k odd numbers in the sequence } int main() { int k; scanf("%d", &k); int result = findKthOdd(k); printf("%d", result); return 0; }