Course name Software Engineering Courses Fundamentals of Data Structures and Algorithms: Fundamentals of Data Structures & Algorithms
![Software Engineering Courses Fundamentals of Data Structures and Algorithms Questions & Answers](/design/images/excomplete.png)
Fundamentals of Data Structures and Algorithms Video Course
![Fundamentals of Data Structures and Algorithms Video Course](/design/images/excomplete.png)
Fundamentals of Data Structures and Algorithms Video Course is developed by Software Engineering Courses Professionals to help you pass the Fundamentals of Data Structures and Algorithms exam.
You Will Learn:
Description
This course will improve your knowledge and skills required to pass Fundamentals of Data Structures & Algorithms exam.
Curriculum For This Course
-
1. Introduction to Algorithms 5 Videos 00:13:34
-
Introduction 01:08
-
Euclid's algorithm 04:49
-
Bubble Sort algorithm 02:52
-
Why study data structures & algorithms 03:10
-
Correctness of an algorithm 01:35
-
-
2. Analysis of Algorithms 8 Videos 00:26:55
-
Introduction 03:20
-
How to calculate the time complexity 02:52
-
The RAM model of computation 02:07
-
Time complexity of Bubble sort algorithm 03:25
-
Pseudo code : Bubble sort algorithm 03:02
-
The Big O notation 03:26
-
Using Big O notation : Examples 04:41
-
Comparison of running times 04:02
-
-
3. Basic Sorting and Search Algorithms 12 Videos 00:33:08
-
Selection Sort 02:48
-
Selection Sort : Pseudocode 02:34
-
Introduction to Insertion Sort 01:56
-
Applying Insertion Sort algorithm to cue balls 02:08
-
Insertion Sort: Pseudocode 02:38
-
O(n²) sorting algorithms - Comparison 02:00
-
Stable Vs Unstable Sorts 03:46
-
Searching elements in an un ordered array 03:16
-
Searching elements in an ORDERED array 02:33
-
Searching elements in an ORDERED array - contd. 05:48
-
Inserting and Deleting items in an ORDERED array 02:08
-
Sorting any type of object 01:33
-
-
4. Linked Lists 10 Videos 00:41:58
-
What is a Linked List? 03:21
-
Implementing a Linked List in Java 00:56
-
Inserting a new Node 05:25
-
Length of a Linked List 02:11
-
Deleting the head node 02:11
-
Searching for an Item 03:11
-
Doubly Ended Lists 03:06
-
Inserting data in a sorted Linked List 04:38
-
Doubly Linked List 06:28
-
Insertion Sort revisited 10:32
-
-
5. Stacks and Queues 7 Videos 00:20:58
-
Stacks 02:41
-
Abstract Data Types 00:37
-
Implementing Stacks using Arrays 03:21
-
Queues 02:32
-
Queues using Arrays 05:29
-
Double Ended Queues 01:58
-
Double Ended Queues using Arrays 04:20
-
-
6. Recursion 9 Videos 00:37:45
-
Introduction 04:33
-
Understanding Recursion 03:04
-
Tail recursion 02:08
-
Tower of Hanoi 08:25
-
Tower of Hanoi - Implementation 02:58
-
Merge Sort 04:09
-
Merge Sort - Pseudocode 04:24
-
Merge Step - Pseudocode 04:32
-
Time Complexity of Merge Sort 02:52
-
-
7. Binary Search Trees 17 Videos 00:47:36
-
The Tree Data structure 03:41
-
Binary Trees 03:34
-
Binary Search Trees 02:01
-
Finding an item in a Binary Search Tree 02:24
-
Implementing the find method 03:02
-
Inserting an item in a Binary Search Tree 03:34
-
Deleting an Item : Case 1 06:06
-
Deleting an Item - Case 2 02:58
-
Deleting an Item - Case 3 03:44
-
Deleting an Item - Soft Delete 01:40
-
Finding smallest & largest values 02:33
-
Tree Traversal : In Order 03:19
-
Tree Traversal : Pre Order 01:58
-
Tree Traversal : Post Order 00:56
-
Unbalanced Trees Vs Balanced Trees 02:16
-
Height of a Binary Tree 01:34
-
Time Complexity of Operations on Binary Search Trees 02:16
-
-
8. More Sorting Algorithms 8 Videos 00:28:06
-
Introduction 01:27
-
QuickSort 04:54
-
QuickSort: The partition step 02:21
-
Shell Sort 05:27
-
Shell Sort: Example 03:28
-
Counting Sort 04:50
-
Radix Sort 02:27
-
Bucket Sort 03:12
-
-
9. Heaps 7 Videos 00:19:01
-
Introduction 04:06
-
Deleting the root 01:54
-
Inserting an item in a heap 01:59
-
Heaps as Priority Queues 02:30
-
Representing heaps using Arrays 01:55
-
Heap Sort 02:30
-
Building a heap 04:07
-
-
10. Hashtables 9 Videos 00:27:30
-
Introduction 02:41
-
Direct Access Tables 02:04
-
Hashing 01:37
-
Resolving collisions through chaining 04:16
-
The Hash function 04:16
-
Open Addressing to resolve collisions 02:58
-
Strategies for Open Addressing 03:19
-
Time Complexity: Open Addressing 03:20
-
Conclusion 00:59
-
Download Free Software Engineering Courses Fundamentals of Data Structures and Algorithms Testing Engine Demo
Experience Testking Software Engineering Courses Fundamentals of Data Structures and Algorithms exam Q&A testing engine for yourself.
Simply submit your e-mail address below to get started with our interactive software demo of your Software Engineering Courses Fundamentals of Data Structures and Algorithms exam.
- Customizable, interactive testing engine
- Simulates real exam environment
- Instant download
* Our demo shows only a few questions from Software Engineering Courses Fundamentals of Data Structures and Algorithms exam for evaluating purposes