Information Technology
Hands on Training icon
Hands On Training
Hands on Training icon

Learning Data Structures and Algorithms

Course Cover
compare button icon

Course Features

icon

Duration

7.32 hours

icon

Delivery Method

Online

icon

Available on

Limited Access

icon

Accessibility

Desktop, Laptop

icon

Language

English

icon

Subtitles

English

icon

Level

Intermediate

icon

Teaching Type

Self Paced

icon

Video Content

7.32 hours

Course Description

Rod Stephens will show you how to implement common algorithms in data processing with this video training course Learning Data Structures and Algorithms. This course is for absolute beginners, so no programming experience is necessary.
The complexity theory will be covered first, followed by the introduction to numerical algorithms. These include randomizing arrays and prime factorization. Finally, you will learn about numerical integration. Rod will then teach you about linked list, including singly linked, sorted, or doubly linked lists. This tutorial also covers stacks, queues, sorting, and arrays. You will also learn about searching and hash tables, recursion and backtracking algorithms. You will also learn about trees, balanced trees and decision trees as well as network algorithms.

After completing this video training course you will be able to analyze and implement algorithms and be able select the best algorithm for different situations. You can follow along with the author through the lessons by downloading working files.

Course Overview

projects-img

International Faculty

projects-img

Post Course Interactions

projects-img

Instructor-Moderated Discussions

Skills You Will Gain

What You Will Learn

Learn about searching, hash tables, recursion, and backtracking algorithms

Will teach you about linked lists, such as singly linked lists, sorted, and doubly linked lists

Will teach you how to analyze and implement common algorithms used in data processing

Course Cover