and will also analyse it in terms of the Divide and Conquer paradigm. 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. We will also be discussing basic sorting algorithms such as Bubble Sort, etc. Most programming languages and libraries indeed provide implementations for basic data structures and algorithms. 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. Algorithms are just the step you follow to solve a problem, while data structures are where you store the data for later manipulation. Post this, we will look at Linked List, Stack, and Queue along with their implementations, applications, advantages and disadvantages. The session begins with the discussion of linear data structure - Array, its implementation, application, advantages and disadvantages. CSTutor is a sketch-based interface designed to help students understand data structures, specifically Linked Lists, Binary Search Trees, AVL Trees, and Heaps, and the results indicate that students preferred CSTutor and were more engaged using it than a standard whiteboard lecture however, results were mixed in quiz and exam performance. In this session, we’ll be understanding the concept of data structures followed by understanding its different types. Great Learning brings you this live session on "Data Structures and Algorithms For Tech".
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |