About Course
Data Structures and Algorithmic Analysis
This course is aimed at any undergraduate students who are at beginner’s level in learning Data Structure and Algorithm, This course focus on the fundamental concepts of Data structure, its analysis, and analysis of algorithms.
Basic ADT’s Arrays, Linked Lists, Stacks, and Queue are discussed in detail. The course is not aimed at writing the pseudo-code for operations, rather on their work. Each one discussed with applications and their Pros and Cons.
Who this course is for:
- Beginners in learning Computer Science Subjects
Course Content
Data Structures and Algorithmic Analysis
-
Algorithms Course Introduction
05:57 -
Algorithms Lecture 1 Part 1: Mathematical Preliminaries
00:00 -
Algorithms Lecture 1 Part 2: Mathematical Preliminaries
00:00 -
Algorithms Lecture 1 Part 3: Mathematical Preliminaries
00:00 -
Algorithms Lecture 2 Part 1 Bubble Sort
00:00 -
Algorithms Lecture 2 Part 1: Insertion Sort
00:00 -
Algorithms Lecture 2 Part 2: Merge Sort
00:00 -
Algorithms Lecture 2 Part 2: Merge Sort Complexity Analysis
00:00 -
Algorithms Lecture 2 Part 3: Quicksort
00:00 -
Algorithms: Recurrences and the “Master Theorem” Part 1 – Fundamental Concepts
00:00 -
Algorithms Lecture 3: Recurrences and the Master Theorem Part 2n
00:00 -
Algorithms Lecture 3: Recurrences and the Master Theorem Part 3
00:00 -
Binary Search Trees (BSTs): Part 1
00:00 -
Binary Search Trees (BSTs): Part 2
00:00 -
Binary Search Trees (BSTs): Part 3
00:00
Student Ratings & Reviews
No Review Yet