Great Learning brings you this live session on “Data Structures and Algorithms For Tech”. In this session, we’ll be understanding the concept of data structures followed by understanding its different types. The session begins with the discussion of linear data structure - Array, its implementation, application, advantages and disadvantages. Post this, we will look at Linked List, Stack, and Queue along with their implementations, applications, advantages and disadvantages. In this session, you will also learn about a couple of Searching Algorithms such as Linear Search and Binary Search, along with their algorithms, implementation and analysis based on time & space complexity. We will also be discussing basic sorting algorithms such as Bubble Sort, etc. Finally, we will take you through the Divide and Conquer approach wherein you will learn about Merge Sort, its algorithm along with a demonstration, its implementation and analysis based on time complexity, space complexity, number of comparisons, etc. and will also analyse it in terms of the Divide and Conquer paradigm. This session will be an interactive one where you can ask relevant questions throughout the live stream!
#algorithms #java #data-structures
