8 Learners
Data structures serve as the basis for abstract data types (ADT). The ADT defines the logical form of the data type. The data structure implements the physical form of the data type.[5] Different types of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, relational databases commonly use B-tree indexes for data retrieval,[6] while compiler implementations usually use hash tables to look up identifiers.Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Usually, efficient data structures are key to designing efficient algorithms. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design. Data structures can be used to organize the storage and retrieval of information stored in both main memory and secondary memory.
Lecture 1: Algorithms and programming: simple gcd
21mLecture 2: Improving naive gcd
21mLecture 3: Euclid's algorithm for gcd
21mLecture 4: Downloading and installing Python
21mLecture 6: Examples
11mLecture 5: Functions
11mLecture 4: Control Flow
11mLecture 3: Lists
11mLecture 2: Strings
11mLecture 1: Assignment statement, basic types - int, float, bool
11mLecture 8: Recursion
17mLecture 7: Insertion Sort
17mLecture 6: Selection Sort
17mLecture 5: Efficiency
17mLecture 4: Arrays vs lists, binary search
17mLecture 3: Breaking out of a loop
17mLecture 2: Manipulating lists
17mLecture 1: More about range()
17mLecture 7: List Comprehension
18mLecture 6: Function definitions
18mLecture 5: Tuples and dictionaries
18mLecture 4: Quicksort analysis
18mLecture 3: Quicksort
18mLecture 2: Mergesort, analysis
18mLecture 1: Mergesort
18mLecture 6: pass, del() and None
7mLecture 5:Formatting printed output
7mLecture 4: String functions
7mLecture 3: Handling files
7mLecture 2:Standard input and output
7mLecture 1: Exception Handling
7mLecture 6: pass, del() and None
7mLecture 5:Formatting printed output
7mLecture 4: String functions
7mLecture 3: Handling files
7mLecture 2:Standard input and output
7mLecture 1: Exception Handling
7mLecture 5: Priority queues and heaps
21mLecture 4: Sets, stacks, queues
21mLecture 3: Generating permutations
21mLecture 2: Global scope, nested functions
21mLecture 1: Backtracking, N queens
21mLecture 4: Search trees
23mLecture 3: User defined lists
23mLecture 2: Classes and objects in Python
23mLecture 1: Abstract datatypes, classes and objects
23mLecture 5: Wrap-up, Python vs other languages
27mLecture 4: Matrix multiplication
27mLesson 3: Longest common subsequence
27mLecture 2: Grid paths
27mLecture 1: Memoization and dynamic programming
27m