2 days DSA Workshop - Covers basic to advanced concepts

In this workshop, we'll try to gain a decent level understanding of following topics using a hands-on approach where possible. Concept of a topic will be discussed followed by impl. details, interesting demos and code walkthrough. Time and space complexity for all the Data Structure and Algorithm being covered will be discussed. This workshop will help achieve a decent level mastery in problem-solving .

Topics Covered:

• Roadmap to DSA mastery
• Brief discussion of Algorithmic complexity(Time and Space complexity, Big 'O' notation)
• Linked List (where it is particularly useful)
• ArrayList (Dynamic or Expandable Arrays)
• Heaps (Priority Queues)
• Heap Sort Algorithm (works in O(n log n) log-linear TC )
• Linear search Vs Binary search Vs Hash based lookups
• Hash Table / Hash Map / Hash Set /Dictionary
• Non-Polynomial(NP) Time Complexity Problems(eg. 8-Queens, Sudoku puzzle). Brute-force Backtracking Sudoku Puzzle solver will be discussed here.

Session presented by Sridhar.G
About the Instructor: Has 10+ years experience working in top tier IT firm. Areas of interest include Functional Programming, Web Development, Design Patterns, Data Structures & Algorithms. Has organized several DSA meetups in this platform. Believes in continuous learning and constantly challenging the status quo.

Things to bring:

1. Laptop with a decent code editor/compiler installed.
2. Notebook and a pen

Prerequisite: Basic knowledge of arrays, linked list, strings and functions and decent level proficiency in any one programming language.

Event fee: Rs.300/-
GPay to Sridhar G(98841 47550) to confirm your participation to the event. Event fee will not be refunded in case the participant doesn't turn up for the event.