Introduction to Data Structures in Tamil | Learn Applications of Data Structures

Programming Essentials: Introduction to Data Structures (Tamil)

Take up this course on Fundamentals of Data Structures and gain comprehensive knowledge of data structure concepts in Tamil.

FREE

Level
Beginner
# Learners
93
Duration
3 hrs 3 mins
Rating
(4)

About Course

Today’s world is a reflection of massive advancements in the field of computer science and technology. Every field in the present day scenario benefits from the vast applications of this domain. One of the most interesting and vital concepts in this domain is undoubtedly the algorithms of data structures. As the name suggests it deals with organizing data in a synchronized manner, such that maximum efficiency can be achieved.

This course gives a complete insight into all the important aspects which govern data structures. To make proceeding simple and easier for beginners, course is split into sub-divisions which would give clarity of thought step by step. An introduction about every new concept is followed by an in-depth analysis of its scopes of application. Apart from video lectures which serve to be the heart of the curriculum, the course also includes an assignment problem which can enable self-analysis. These assignments are solved towards the concluding stages of the course which makes this course a perfect option for beginners.

Knowledge of data structures is highly instrumental in the growing field of software design. Upon course completion the learner can attain some confidence in building efficient algorithms for data structures and acquire detailed knowledge about memory storage elements.

Curriculum

Section 1 : Stacks
1.1
Introduction to Stacks
05:08
1.2
Application of Stacks 1
06:10
1.3
Application of Stacks 2
09:20
1.4
Implementation of Stacks
04:58

Section 2 : Queues
2.1
Introduction to Queues and Link List Implementation
12:11
2.2
Array Implementation of Queues
06:56
2.3
Circularly Linked List Implementation of Queues
01:42

Section 3 : Trees
3.1
Introduction to Trees
03:56
3.2
Representation of a Tree
08:23
3.3
Introduction to Binary Trees
06:38
3.4
Constructing an Expression Tree from a Postorder Expression
02:56
3.5
Constructing an Binary Tree from an Expression
05:22
3.6
Types of Tree Traversals
07:42
3.7
Constructing a Unique Binary Tree
10:29

Section 4 : Binary Search Tree
4.1
Introduction to Binary Search Tree
06:02
4.2
Applications of Binary Search Tree
09:56

Section 5 : Heaps
5.1
Introduction to Heaps
12:34
5.2
Implementation of Heaps
06:28

Section 6 : Graphs
6.1
Introduction to Graphs
08:11
6.2
Problem Solving using Graphs and Representation of Graphs
06:29

Section 7 : Supplementary Video
7.1
Supplementary video 1
05:19
7.2
Supplementary video 2
13:57
7.3
Supplementary Video 3
03:41

Section 8 : Solution to Assignments
8.1
Solution to Assignments 1
08:13
8.2
Solution to Assignments 2
10:32

About the Author

Prof. Hema A Murthy
Professor, IIT Madras

Professor Hema A Murthy has proficiency in research in the domains of Speech Processing, Speech synthesis and recognition, Network transfer analysis and Modelling. She has vast experience in teaching Data Structures and Advanced Data Structures and Algorithms, and is an eminent resource person in this field. Her social interests include women empowerment, global warming and school education. Apart from being a socially active figure, she is also a member of IEEE society and Indian Scientists against Nuclear weapons.

Review and Ratings