introduction and lists
play

Introduction and lists Jason Myers Instructor DataCamp Data Types - PowerPoint PPT Presentation

Mar 21, 2024 •40 likes •270 views

DataCamp Data Types for Data Science DATA TYPES FOR DATA SCIENCE Introduction and lists Jason Myers Instructor DataCamp Data Types for Data Science Data types Data type system sets the stage for the capabilities of the language

  1. DataCamp Data Types for Data Science DATA TYPES FOR DATA SCIENCE Introduction and lists Jason Myers Instructor

  2. DataCamp Data Types for Data Science Data types Data type system sets the stage for the capabilities of the language Understanding data types empowers you as a data scientist

  3. DataCamp Data Types for Data Science Container sequences Hold other types of data Used for aggregation, sorting, and more Can be mutable (list, set) or immutable (tuple) Iterable

  4. DataCamp Data Types for Data Science Lists Hold data in order it was added Mutable Index In [1]: cookies = ['chocolate chip', 'peanut butter', 'oatmeal', 'sugar'] In [2]: cookies.append('Tirggel') In [3]: print(cookies) ['chocolate chip', 'peanut butter', 'oatmeal', 'sugar', 'Tirggel'] In [4]: print(cookies[2]) oatmeal

  5. DataCamp Data Types for Data Science Combining Lists Using operators, you can combine two lists into a new one In [1]: cakes = ['strawberry', 'vanilla'] In [2]: desserts = cookies + cakes In [3]: print(desserts) ['chocolate chip', 'peanut butter', 'oatmeal', 'sugar', 'Tirggel', 'strawberry', 'vanilla'] .extend() method merges a list into another list at the end

  6. DataCamp Data Types for Data Science Finding and Removing Elements in a List .index() method locates the position of a data element in a list In [1]: position = cookies.index('sugar') In [2]: print(position) 3 In [3]: cookies[3] 'sugar' .pop() method removes an item from a list and allows you to save it In [1]: name = cookies.pop(position) In [2]: print(name) sugar In [3]: print(cookies) ['chocolate chip', 'peanut butter', 'oatmeal', 'Tirggel', 'Biscotti', 'digestive', 'fortune']

  7. DataCamp Data Types for Data Science Iterating and Sorting for loops are the most common way of interating over a list In [1]: for cookie in cookies: ...: print(cookie) chocolate chip peanut butter oatmeal Tirggel Biscotti digestive fortune sorted() function sorts data in numerical or alphabetical order and returns a new list In [1]: print(cookies) ['chocolate chip', 'oatmeal', 'Tirggel', 'Biscotti', 'digestive', 'fortune'] In [2]: sorted_cookies = sorted(cookies) In [3]: print(sorted_cookies) ['Biscotti', 'Tirggel', 'chocolate chip', 'digestive', 'fortune', 'oatmeal']

  8. DataCamp Data Types for Data Science DATA TYPES FOR DATA SCIENCE Let's practice!

  9. DataCamp Data Types for Data Science DATA TYPES FOR DATA SCIENCE Meet the Tuples Jason Myers Instructor

  10. DataCamp Data Types for Data Science Tuple, Tuple Hold data in order Index Immutable Pairing Unpackable

  11. DataCamp Data Types for Data Science Zipping and Unpacking Tuples are commonly created by zipping lists together with zip() Two lists: us_cookies , in_cookies In [1]: top_pairs = zip(us_cookies, in_cookies) In [2]: print(top_pairs) [('Chocolate Chip', 'Punjabi'), ('Brownies', 'Fruit Cake Rusk'), ('Peanut Butter', 'Marble Cookies'), ('Oreos', 'Kaju Pista Cookies'), ('Oatmeal Raisin', 'Almond Cookies')] Unpacking tuples is a very expressive way for working with data In [1]: us_num_1, in_num_1 = top_pairs[0] In [2]: print(us_num_1) Chocolate Chip In [3]: print(in_num_1) Punjabi

  12. DataCamp Data Types for Data Science More Unpacking in Loops Unpacking is especially powerful in loops In [1]: for us_cookie, in_cookie in top_pairs: ...: print(in_cookie) ...: print(us_cookie) Punjabi Chocolate Chip Fruit Cake Rusk Brownies # ..etc..

  13. DataCamp Data Types for Data Science Enumerating positions Another useful tuple creation method is the enumerate() function Enumeration is used in loops to return the position and the data in that position while looping In [1]: for idx, item in enumerate(top_pairs): ...: us_cookie, in_cookie = item ...: print(idx, us_cookie, in_cookie) (0, 'Chocolate Chip', 'Punjabi') (1, 'Brownies', 'Fruit Cake Rusk') # ..etc..

  14. DataCamp Data Types for Data Science Be careful when making tuples Use zip() , enumerate() , or () to make tuples In [1]: item = ('vanilla', 'chocolate') In [2]: print(item) ('vanilla', 'chocolate') Beware of tailing commas! In [1]: item2 = 'butter', In [2]: print(item2) ('butter',)

  15. DataCamp Data Types for Data Science DATA TYPES FOR DATA SCIENCE Let's practice!

  16. DataCamp Data Types for Data Science DATA TYPES FOR DATA SCIENCE Sets for unordered and unique data Jason Myers Instructor

  17. DataCamp Data Types for Data Science Set Unique Unordered Mutable Python's implementation of Set Theory from Mathematics

  18. DataCamp Data Types for Data Science Creating Sets Sets are created from a list In [1]: cookies_eaten_today = ['chocolate chip', 'peanut butter', ...: 'chocolate chip', 'oatmeal cream', 'chocolate chip'] In [2]: types_of_cookies_eaten = set(cookies_eaten_today) In [3]: print(types_of_cookies_eaten) set(['chocolate chip', 'oatmeal cream', 'peanut butter'])

  19. DataCamp Data Types for Data Science Modifying Sets .add() adds single elements .update() merges in another set or list In [1]: types_of_cookies_eaten.add('biscotti') In [2]: types_of_cookies_eaten.add('chocolate chip') In [3]: print(types_of_cookies_eaten) set(['chocolate chip', 'oatmeal cream', 'peanut butter', 'biscotti']) In [4]: cookies_hugo_ate = ['chocolate chip', 'anzac'] In [5]: types_of_cookies_eaten.update(cookies_hugo_ate) In [6]: print(types_of_cookies_eaten) set(['chocolate chip', 'anzac', 'oatmeal cream', 'peanut butter', 'biscotti'])

  20. DataCamp Data Types for Data Science Removing data from sets .discard() safely removes an element from the set by value .pop() removes and returns an arbitrary element from the set (KeyError when empty) In [1]: types_of_cookies_eaten.discard('biscotti') In [2]: print(types_of_cookies_eaten) set(['chocolate chip', 'anzac', 'oatmeal cream', 'peanut butter', 'biscotti']) In [3]: types_of_cookies_eaten.pop() 'chocolate chip' In [4]:types_of_cookies_eaten.pop() 'anzac'

  21. DataCamp Data Types for Data Science Set Operations - Similarities .union() set method returns a set of all the names ( or ) .intersection() method identifies overlapping data ( and ) In [1]: cookies_jason_ate = set(['chocolate chip', 'oatmeal cream', ...: 'peanut butter']) In [2]: cookies_hugo_ate = set(['chocolate chip', 'anzac']) In [3]: cookies_jason_ate.union(cookies_hugo_ate) set(['chocolate chip', 'anzac', 'oatmeal cream', 'peanut butter']) In [4]: cookies_jason_ate.intersection(cookies_hugo_ate) set(['chocolate chip'])

  22. DataCamp Data Types for Data Science Set Operations - Differences .difference() method identifies data present in the set on which the method was used that is not in the arguments ( - ) Target is important! In [1]: cookies_jason_ate.difference(cookies_hugo_ate) set(['oatmeal cream', 'peanut butter']) In [2]: cookies_hugo_ate.difference(cookies_jason_ate) set(['anzac'])

  23. DataCamp Data Types for Data Science DATA TYPES FOR DATA SCIENCE Let's practice!

Recommend

Introduction to Object-Oriented Programming Linked Lists Christopher Simpkins

Introduction to Object-Oriented Programming Linked Lists Christopher Simpkins

Introduction to Object-Oriented Programming Linked Lists Christopher Simpkins chris.simpkins@gatech.edu CS 1331 (Georgia Tech) 1 / 13 Linked Lists Linked Lists Dynamic data structures Singly linked lists Generic linked lists Doubly linked

179 views • 13 slides
Py Python Lists Similar to an array but some important differences: lists do not have a fixed

Py Python Lists Similar to an array but some important differences: lists do not have a fixed

2/5/20 Py Python Lists Similar to an array but some important differences: lists do not have a fixed size lists are heterogeneous can insert delete at arbitrary positions within list CS 224 Introduction to Python Spring 2020

400 views • 6 slides
More lists Readings: HtDP , sections 11, 12, 13 (Intermezzo 2). Topics: Sorting a list List

More lists Readings: HtDP , sections 11, 12, 13 (Intermezzo 2). Topics: Sorting a list List

More lists Readings: HtDP , sections 11, 12, 13 (Intermezzo 2). Topics: Sorting a list List abbreviations Lists containing lists Dictionaries and association lists Lists of lists as 2D data Processing two lists simultaneously Consuming a

712 views • 25 slides
Lists A list is a popular data structure to store data in sequential order. For example, a list

Lists A list is a popular data structure to store data in sequential order. For example, a list

Chapter 24 Implementing Lists, Stacks, Queues, and Priority Queues Liang, Introduction to Java Programming, Tenth Edition, (c) 2013 Pearson Education, Inc. All 1 rights reserved. Objectives To design common features of lists in an

204 views • 8 slides
Red Lists and Red Books in Poland Main characteristics: 1. Red Lists lists of species with

Red Lists and Red Books in Poland Main characteristics: 1. Red Lists lists of species with

Red Lists and Red Books in Poland Main characteristics: 1. Red Lists lists of species with threat category 2. Red Books list of species with much more information on the species (distribution, habitat, morphology, ecology, maps etc.) 3.

294 views • 4 slides
Nested Lists Nested Lists Lists can hold any object Lists are themselves objects

Nested Lists Nested Lists Lists can hold any object Lists are themselves objects

Mini-Lecture 16 Nested Lists Nested Lists Lists can hold any object Lists are themselves objects Therefore lists can hold other lists! x[2] a = [2, 1] x[1] x[2][2] b = [3, 1] x = [1, [2, 1], [1, 4, [3, 1]], 5] c = [1, 4, b]

586 views • 14 slides
13-1 Exercise Implementing Lists with Linked Lists First, lets augment our node class

13-1 Exercise Implementing Lists with Linked Lists First, lets augment our node class

Overview Topics Nodes and Links List implementation using linked lists CSE 143 Java Autumn 2001 Reading: Textbook: Ch. 23 Linked Lists 11/19/2001 (c) 2001, University of Washington 13-1 11/19/2001 (c) 2001,

333 views • 4 slides
Nested Lists Motivating this Course Module In previous video series, introduced lists All

Nested Lists Motivating this Course Module In previous video series, introduced lists All

Module 18 Nested Lists Motivating this Course Module In previous video series, introduced lists All our examples had primitives in the lists So we only showed one folder in visualization Demo: x = [5,6,5,9] But lists can contain

607 views • 24 slides
Using Lists and Tables Student Web Presence Guidelines Summary 1. Purpose of lists 2. Using

Using Lists and Tables Student Web Presence Guidelines Summary 1. Purpose of lists 2. Using

Using Lists and Tables Student Web Presence Guidelines Summary 1. Purpose of lists 2. Using lists 3. Using bulleted list 4. Using ordered lists 5. Purpose of tables 6. Using tables The Purpose of Lists Take up less space Improve

238 views • 9 slides
csci 210: Data Structures Linked lists Summary Today linked lists single-linked

csci 210: Data Structures Linked lists Summary Today linked lists single-linked

csci 210: Data Structures Linked lists Summary Today linked lists single-linked lists double-linked lists circular lists READING: LC chapter 4.1, 4.2, 4.3 Arrays vs. Linked Lists We ve seen arrays:

617 views • 34 slides
Linked lists Insert Delete Lookup Doubly-linked lists Lecture 6: Linked Lists Object

Linked lists Insert Delete Lookup Doubly-linked lists Lecture 6: Linked Lists Object

Linked lists Insert Delete Lookup Doubly-linked lists Lecture 6: Linked Lists Object References When you declare a variable of a non-primitive type you are really declaring a reference to that object String foo; Complex c; new

634 views • 19 slides
Can We Represent Infinite Lists? Lazy Evaluation Amtoft Motivation Lazy Lists Conversions

Can We Represent Infinite Lists? Lazy Evaluation Amtoft Motivation Lazy Lists Conversions

Can We Represent Infinite Lists? Lazy Evaluation Amtoft Motivation Lazy Lists Conversions to/from Certain collections are infinite, like the set of all natural Standard Lists Higher-Order Functions numbers. We may try Merging Lazy Lists

556 views • 13 slides
Blockly Lists & Iteration CT @ VT Things we are seeing Using lists to represent a data

Blockly Lists & Iteration CT @ VT Things we are seeing Using lists to represent a data

Introduction to Computational Thinking Blockly Lists & Iteration CT @ VT Things we are seeing Using lists to represent a data stream Blockly blocks for iteration Using iteration to process a data stream (i.e., a list)

275 views • 10 slides
These lists are for non-commercial use only. WORD LISTS FROM MOTIVATING MASTERY OF MORPHEMES

These lists are for non-commercial use only. WORD LISTS FROM MOTIVATING MASTERY OF MORPHEMES

These lists are for non-commercial use only. WORD LISTS FROM MOTIVATING MASTERY OF MORPHEMES Presenter: Lois E. Huffman, Ph.D. Contact: loishuffman@gmail.com These contemporary words contain roots and affixes that were explored in the

558 views • 4 slides
Lists more versatile sequences l Lists are another sequential data type l But unlike strings,

Lists more versatile sequences l Lists are another sequential data type l But unlike strings,

Starting chapter 4 Lists more versatile sequences l Lists are another sequential data type l But unlike strings, lists can hold any type of data (not just characters) are mutable legal to change list elements l Use square

532 views • 19 slides
3.1. Lists Chapter 3 Linear Structures: Lists Definition A list is an element collection with

3.1. Lists Chapter 3 Linear Structures: Lists Definition A list is an element collection with

Ch.3: Linear Structures: Lists Ch.3: Linear Structures: Lists Plan 3.1. Lists 3.1. Lists Chapter 3 Linear Structures: Lists Definition A list is an element collection with the following properties: Homogeneity: all elements are of the

165 views • 5 slides
Event Lists Refs: Sections 2.2 and 2.8 in Law, Section 5.3 in Leemis and Park Peter J. Haas CS

Event Lists Refs: Sections 2.2 and 2.8 in Law, Section 5.3 in Leemis and Park Peter J. Haas CS

Event Lists Refs: Sections 2.2 and 2.8 in Law, Section 5.3 in Leemis and Park Peter J. Haas CS 590M: Simulation Spring Semester 2020 1 / 9 Event Lists Overview Linked Lists Heaps Hybrid Data Structures 2 / 9 Event Lists (aka Pending

139 views • 9 slides
Lists Revisited: Cache Conscious STL lists Leonor Frias, Jordi Petit, Salvador Roura Departament

Lists Revisited: Cache Conscious STL lists Leonor Frias, Jordi Petit, Salvador Roura Departament

Lists Revisited: Cache Conscious STL lists Leonor Frias, Jordi Petit, Salvador Roura Departament de Llenguatges i Sistemes Inform` atics. Universitat Polit` ecnica de Catalunya. Overview Goal: Improve STL lists perfomance in most common

708 views • 35 slides
Pattern avoidance in double lists Lara Pudwell Introduction Length 4 Patterns 1342 2143 Lara

Pattern avoidance in double lists Lara Pudwell Introduction Length 4 Patterns 1342 2143 Lara

Pattern avoidance in double lists Pattern avoidance in double lists Lara Pudwell Introduction Length 4 Patterns 1342 2143 Lara Pudwell 1423, 1432, 1243 1234 faculty.valpo.edu/lpudwell 2413 1324 Summary joint work with Charles Cratty

631 views • 28 slides
Lists Readings: HtDP , sections 9 and 10. Avoid 10.3 (uses draw.ss ). The textbook introduces

Lists Readings: HtDP , sections 9 and 10. Avoid 10.3 (uses draw.ss ). The textbook introduces

Lists Readings: HtDP , sections 9 and 10. Avoid 10.3 (uses draw.ss ). The textbook introduces structures before lists. The discussion of lists makes a few references to structures that can be ignored. Intro Formalities Processing lists

240 views • 22 slides
Lists Readings: HtDP , sections 9 and 10. Avoid 10.3 (uses draw.ss ). The textbook introduces

Lists Readings: HtDP , sections 9 and 10. Avoid 10.3 (uses draw.ss ). The textbook introduces

Lists Readings: HtDP , sections 9 and 10. Avoid 10.3 (uses draw.ss ). The textbook introduces structures before lists. The discussion of lists makes a few references to structures that can be ignored. Intro Formalities Processing lists

933 views • 64 slides
Overview Access control lists Capability lists Locks and keys Rings-based

Overview Access control lists Capability lists Locks and keys Rings-based

Overview Access control lists Capability lists Locks and keys Rings-based access control Propagated access control lists May 31, 2005 ECS 235, Computer and Information Slide #1 Security Access Control Lists Columns

1.24k views • 80 slides
Online Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Self Adjusting Lists Linked lists

Online Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Self Adjusting Lists Linked lists

Chapter 8 Online Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Self Adjusting Lists Linked lists are often inefficient Cost of accessing an item at position is linear in But, linked lists are extremely simple And

387 views • 9 slides
Skip Lists + S 3 S 2 + 15 S 1 + 15 23 S 0 + 10 15

Skip Lists + S 3 S 2 + 15 S 1 + 15 23 S 0 + 10 15

Skip Lists + S 3 S 2 + 15 S 1 + 15 23 S 0 + 10 15 23 36 6/16/2003 5:18 PM Skip Lists 1 Outline and Reading What is a skip list (8.4) Operations Search (8.4.1) Insertion (8.4.2)

575 views • 12 slides

More recommend