What we’re about
About This Meetup :-
This meetup is for python developers :- \
Those who are a data scientist (or want to be ) writing custom machine learning based application. \
Those who are involved in any software automation product development using python,
1: We will be discussing on the analysis and design of fundamental Python data structures. \
2: Get a better understanding of advanced programming concepts such as big-o notation, dynamic programming, and functional data structures. \
3: Explore data structures and algorithms in a clear and visual manner.
Prerequisites :: Basic understanding of python is required.
What You Will Learn
Getting a solid understanding of Python data structures implementation. \
Understand the common programming patterns and algorithms used in Python data science, or while developing a test automation software product. \
Write efficient robust code.
This meetup will introduce you to different types of data structure in Python \
you will learn about critical data structures and topics such as linear, tree/graph data structures, hashing and different shorting , searching and graph algorithms
We are going to implement problems in Python. You will start by learning the basics of data structures, linked lists, and arrays in Python. You will be shown how to code tuples in Python followed by an example that shows how to program dictionaries and sets in Python. You will learn about the use of pointers in Python. You will then explore linear data structures in Python such as stacks, queues, and hash tables. In these you will learn how to implement a stack and code queues and deques. There will also be a demonstration on how to realize a hash table in Python. Following this you will learn how to use tree/graph data structures including binary trees, heaps and priority queues in Python. You will program priority queues and red-black trees in Python with examples. Finally, you will be shown how to apply different algorithms such as Graph traversal, Shortest Path, Minimum Spanning Tree, Maximum Flow tree, and DAG topological sorting.
