Python Data Structures and Algorithms.pptx

Python Data Structures and Algorithms.pptx

• 1.
  Python Data Structures and Algorithms Presentedby- Shreyas Lawand PRN-2143110072
• 2.
  Agenda • Inbuilt DataStructures • List • Dictionary • Tuple • Set • User Defined Data Structures • Linked List • Stack • Queue • Tree • Hash Map • Algorithms
• 3.
  Inbuilt Data Structures List s •Lists are used to store multiple items in a single variable. • List items are ordered, changeable, and allow duplicate values. • List items are indexed, the first item has index [0], the second item has index [1] etc. • Eg.
• 4.
  Dictionary • Dictionaries arewritten with curly brackets, and have keys and values. • Eg. • Dictionaries are used to store data values in key:value pairs. • A dictionary is a collection which is ordered*, changeable and do not allow duplicates.
• 5.
  Tuple • Tuples areused to store multiple items in a single variable. • Tuple items are ordered, unchangeable, and allow duplicate values. • Tuple items are indexed, the first item has index [0], the second item has index [1] etc. • A tuple is a collection which is ordered and unchangeable. • Tuples are written with round brackets. • Eg.
• 6.
  Sets • Sets areused to store multiple items in a single variable. • A set is a collection which is unordered, unchangeable*, and unindexed. • Sets are written with curly brackets. • Eg.
• 7.
  User Defined DataStructures Linked List Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at a contiguous location; the elements are linked using pointers. They include a series of connected nodes. Here, each node stores the data and the address of the next node.
• 8.
  Stack A stack isa linear data structure that stores items in a Last-In/First-Out (LIFO) or First-In/Last-Out (FILO) manner. In stack, a new element is added at one end and an element is removed from that end only. The insert and delete operations are often called push and pop.
• 9.
  Queue Like stack, queueis a linear data structure that stores items in First In First Out (FIFO) manner. With a queue the least recently added item is removed first. A good example of queue is any queue of consumers for a resource where the consumer that came first is served first.
• 10.
  Tree Tree represents thenodes connected by edges. It is a non-linear data structure. It has the following properties − • One node is marked as Root node. • Every node other than the root is associated with one parent node. • Each node can have an arbiatry number of chid node.
• 11.
  Hash Map Hash mapsare indexed data structures. A hash map makes use of a hash function to compute an index with a key into an array of buckets or slots. Its value is mapped to the bucket with the corresponding index. The key is unique and immutable. Think of a hash map as a cabinet having drawers with labels for the things stored in them. For example, storing user information- consider email as the key, and we can map values corresponding to that user such as the first name, last name etc to a bucket.
• 12.
  • Algorithm isa step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output. Algorithms are generally created independent of underlying languages, i.e. an algorithm can be implemented in more than one programming language. • From the data structure point of view, following are some important categories of algorithms − • Search − Algorithm to search an item in a data structure. • Sort − Algorithm to sort items in a certain order. • Insert − Algorithm to insert item in a data structure. • Update − Algorithm to update an existing item in a data structure. • Delete − Algorithm to delete an existing item from a data structure. Algorithm s
• 13.
  Certificate