Course Information
Course Overview
Data Structures operations and Analysing Algorithms
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 Content
- 8 section(s)
- 27 lecture(s)
- Section 1 Introduction
- Section 2 Abstract Data Types, Arrays
- Section 3 Linked Lists
- Section 4 Stacks and Queue
- Section 5 Algorithm Design Techniques
- Section 6 Sorting Algorithms- Iterative Design
- Section 7 Divide and Conquer
- Section 8 Conclusion
What You’ll 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
Reviews
-
RRama anne
Good explanation and helps the students thank you
-
AAruna Sri. S
Gained additional knowledge on Data structures
-
AAnagha Pradeep
Kindly explain each step and meaning of the algorithm if possible. Since people with 0 background like me would not be able to make sense of it.
-
MMuthuKumar
Content and explanation are precise and clear