Curriculum For This Course

Introduction to Algorithms

5Lectures

Time 00:13:34

Analysis of Algorithms

8Lectures

Time 00:26:55

Basic Sorting and Search Algorithms

12Lectures

Time 00:33:08

Linked Lists

10Lectures

Time 00:41:58

Stacks and Queues

7Lectures

Time 00:20:58

Recursion

9Lectures

Time 00:37:45

Binary Search Trees

17Lectures

Time 00:47:36

More Sorting Algorithms

8Lectures

Time 00:28:06

Heaps

7Lectures

Time 00:19:01

Hashtables

9Lectures

Time 00:27:30

Introduction to Algorithms
	1. Introduction	01:08
	2. Euclid's algorithm	04:49
	3. Bubble Sort algorithm	02:52
	4. Why study data structures & algorithms	03:10
	5. Correctness of an algorithm	01:35

Analysis of Algorithms
	1. Introduction	03:20
	2. How to calculate the time complexity	02:52
	3. The RAM model of computation	02:07
	4. Time complexity of Bubble sort algorithm	03:25
	5. Pseudo code : Bubble sort algorithm	03:02
	6. The Big O notation	03:26
	7. Using Big O notation : Examples	04:41
	8. Comparison of running times	04:02

Basic Sorting and Search Algorithms
	1. Selection Sort	02:48
	2. Selection Sort : Pseudocode	02:34
	3. Introduction to Insertion Sort	01:56
	4. Applying Insertion Sort algorithm to cue balls	02:08
	5. Insertion Sort: Pseudocode	02:38
	6. O(n²) sorting algorithms - Comparison	02:00
	7. Stable Vs Unstable Sorts	03:46
	8. Searching elements in an un ordered array	03:16
	9. Searching elements in an ORDERED array	02:33
	10. Searching elements in an ORDERED array - contd.	05:48
	11. Inserting and Deleting items in an ORDERED array	02:08
	12. Sorting any type of object	01:33

Linked Lists
	1. What is a Linked List?	03:21
	2. Implementing a Linked List in Java	00:56
	3. Inserting a new Node	05:25
	4. Length of a Linked List	02:11
	5. Deleting the head node	02:11
	6. Searching for an Item	03:11
	7. Doubly Ended Lists	03:06
	8. Inserting data in a sorted Linked List	04:38
	9. Doubly Linked List	06:28
	10. Insertion Sort revisited	10:32

Stacks and Queues
	1. Stacks	02:41
	2. Abstract Data Types	00:37
	3. Implementing Stacks using Arrays	03:21
	4. Queues	02:32
	5. Queues using Arrays	05:29
	6. Double Ended Queues	01:58
	7. Double Ended Queues using Arrays	04:20

Recursion
	1. Introduction	04:33
	2. Understanding Recursion	03:04
	3. Tail recursion	02:08
	4. Tower of Hanoi	08:25
	5. Tower of Hanoi - Implementation	02:58
	6. Merge Sort	04:09
	7. Merge Sort - Pseudocode	04:24
	8. Merge Step - Pseudocode	04:32
	9. Time Complexity of Merge Sort	02:52

Binary Search Trees
	1. The Tree Data structure	03:41
	2. Binary Trees	03:34
	3. Binary Search Trees	02:01
	4. Finding an item in a Binary Search Tree	02:24
	5. Implementing the find method	03:02
	6. Inserting an item in a Binary Search Tree	03:34
	7. Deleting an Item : Case 1	06:06
	8. Deleting an Item - Case 2	02:58
	9. Deleting an Item - Case 3	03:44
	10. Deleting an Item - Soft Delete	01:40
	11. Finding smallest & largest values	02:33
	12. Tree Traversal : In Order	03:19
	13. Tree Traversal : Pre Order	01:58
	14. Tree Traversal : Post Order	00:56
	15. Unbalanced Trees Vs Balanced Trees	02:16
	16. Height of a Binary Tree	01:34
	17. Time Complexity of Operations on Binary Search Trees	02:16

More Sorting Algorithms
	1. Introduction	01:27
	2. QuickSort	04:54
	3. QuickSort: The partition step	02:21
	4. Shell Sort	05:27
	5. Shell Sort: Example	03:28
	6. Counting Sort	04:50
	7. Radix Sort	02:27
	8. Bucket Sort	03:12

Heaps
	1. Introduction	04:06
	2. Deleting the root	01:54
	3. Inserting an item in a heap	01:59
	4. Heaps as Priority Queues	02:30
	5. Representing heaps using Arrays	01:55
	6. Heap Sort	02:30
	7. Building a heap	04:07

Hashtables
	1. Introduction	02:41
	2. Direct Access Tables	02:04
	3. Hashing	01:37
	4. Resolving collisions through chaining	04:16
	5. The Hash function	04:16
	6. Open Addressing to resolve collisions	02:58
	7. Strategies for Open Addressing	03:19
	8. Time Complexity: Open Addressing	03:20
	9. Conclusion	00:59

Pass Software Engineering Courses Fundamentals of Data Structures and Algorithms Exam in First Attempt Guaranteed!

Get 100% Latest Exam Questions, Accurate & Verified Answers!
30 Days Free Updates, Instant Download!

Student Feedback

4.5

Good

55%

45 %

Add Comments

Name:^*

E-mail:^*

Comment:^* Comment will be moderated and published within 1-4 hours

Verification:^*

Type the characters from the picture.

Rate Course:^*

Limited Time Discount Offer
10% Off - Ends in 02:00:00

Fundamentals of Data Structures and Algorithms: Fundamentals of Data Structures & Algorithms

Curriculum For This Course

Pass Software Engineering Courses Fundamentals of Data Structures and Algorithms Exam in First Attempt Guaranteed!

Get 100% Latest Exam Questions, Accurate & Verified Answers!
30 Days Free Updates, Instant Download!

Student Feedback

Add Comments

Limited Time Discount Offer 10% Off - Ends in 02:00:00

Fundamentals of Data Structures and Algorithms: Fundamentals of Data Structures & Algorithms

Curriculum For This Course

Pass Software Engineering Courses Fundamentals of Data Structures and Algorithms Exam in First Attempt Guaranteed!

Get 100% Latest Exam Questions, Accurate & Verified Answers!30 Days Free Updates, Instant Download!

Student Feedback

Add Comments

Get Premium Membership

Limited Time Discount Offer
10% Off - Ends in 02:00:00

Get 100% Latest Exam Questions, Accurate & Verified Answers!
30 Days Free Updates, Instant Download!