Data Structures and Algorithms

Data Structures and Algorithms, available at $44.99, has an average rating of 4.3, with 27 lectures, 5 quizzes, based on 172 reviews, and has 1076 subscribers.

You will learn about Learning about the different types of operations on Linear ADT Insight into the applications of linear ADT Able to analyse the performance of an algorithm design based on the appropriate data structures. Able to choose the data structure and algorithm for a given problem based on the evaluation This course is ideal for individuals who are Beginners in learning Computer Science Subjects It is particularly useful for Beginners in learning Computer Science Subjects.

Enroll now: Data Structures and Algorithms

Summary

Title: Data Structures and Algorithms

Price: $44.99

Average Rating: 4.3

Number of Lectures: 27

Number of Quizzes: 5

Number of Published Lectures: 27

Number of Published Quizzes: 5

Number of Curriculum Items: 32

Number of Published Curriculum Objects: 32

Original Price: ₹1,199

Quality Status: approved

Status: Live

What You Will Learn

Learning about the different types of operations on Linear ADT
Insight into the applications of linear ADT
Able to analyse the performance of an algorithm design based on the appropriate data structures.
Able to choose the data structure and algorithm for a given problem based on the evaluation

Who Should Attend

Beginners in learning Computer Science Subjects

Target Audiences

Beginners in learning Computer Science Subjects

This course is aimed at any undergraduate students who are at beginners 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 working. Each one discussed with applications and their Pros and Cons.

The second part of the course is to teach analysis of simple algorithms with appropriate example. The two algorithm design technique Iterative and Divide and Conquer are discussed in detail with reference to the sorting algorithms.

Each session is provided with practice example and quiz to know the level of understanding.

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction

Lecture 2: Course Curriculum

Lecture 3: Introduction to Data Structure

Chapter 2: Abstract Data Types, Arrays

Lecture 1: Abstract Data Type

Lecture 2: Abstract Data Type- Classification

Lecture 3: Arrays

Lecture 4: Arrays-Operations

Lecture 5: Arrays-Practice Problems

Chapter 3: Linked Lists

Lecture 1: Linked Lists

Lecture 2: Linked Lists-Searching -Traversal

Lecture 3: Linked Lists-Insertion-Deletion

Lecture 4: Linked Lists-Variations-Practice Example

Chapter 4: Stacks and Queue

Lecture 1: Stacks

Lecture 2: Stacks-Applications

Lecture 3: Queue

Lecture 4: Practice Example

Chapter 5: Algorithm Design Techniques

Lecture 1: Introduction to Algorithms

Lecture 2: Analysing Algorithms

Chapter 6: Sorting Algorithms- Iterative Design

Lecture 1: Introduction

Lecture 2: Insertion sort

Lecture 3: Selection and Bubble Sort

Lecture 4: Analysis of Sorting Algorithms

Lecture 5: Practice Example

Chapter 7: Divide and Conquer

Lecture 1: Introduction, Merge Sort

Lecture 2: Quick Sort

Lecture 3: Practice Example

Chapter 8: Conclusion

Lecture 1: Other Algorithm Design Techniques

Instructors

VENKATACHALAM MAHESWARI
Educator

Rating Distribution

1 stars: 0 votes
2 stars: 4 votes
3 stars: 27 votes
4 stars: 73 votes
5 stars: 68 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

Menu