Curiasity | Data structure types for beginners

Course / Course Details

Data structure types for beginners

Programming

By - Sasikala
0 students
N/A
(0)

Course Description

This beginner-friendly course introduces the fundamental types of data structures used in computer programming and software development. Students will learn how data is organized, stored, and managed efficiently using common data structures such as Arrays, Linked Lists, Stacks, Queues, Trees, Graphs, and Hash Tables. Through practical examples and hands-on exercises, learners will understand when and why each data structure is used in real-world applications.

This course is designed for students, aspiring programmers, and software developers who want to build a strong foundation in computer science and improve their problem-solving skills.

Course Outcomes

By the end of this course, learners will be able to:

✅ Understand the purpose and importance of data structures.

✅ Differentiate between linear and non-linear data structures.

✅ Explain the characteristics of Arrays, Linked Lists, Stacks, and Queues.

✅ Understand Trees, Graphs, and Hash Tables and their applications.

✅ Perform basic operations such as insertion, deletion, searching, and traversal.

✅ Analyze the advantages and limitations of different data structures.

✅ Choose appropriate data structures for specific programming problems.

✅ Build a strong foundation for advanced algorithms and software development.

✅ Improve coding efficiency and problem-solving abilities.

✅ Apply data structure concepts in real-world programming projects.

Course Curriculum

1 chapters
105 lectures
0 quizzes
N/A total length

Toggle all chapters

1 Definition of data structure what is data structure

7.28 Min

2 Types of data structure

5.14 Min

3 abstract data type ADT

4.26 Min

4 List ADT list adt using array

6.29 Min

5 Array Operations

4.24 Min

6 C Program to insert an element into the array at begin position

13.53 Min

7 C Program to insert an element into the array at specified position

13.04 Min

8 C Program to insert an element into the array at end position

6.03 Min

9 C Program to delete an element from the array at begin position

9.39 Min

10 C Program to delete an element from the array at specified position

8.58 Min

11 C Program to delete an element from the array at end position

6.19 Min

12 C Program to update an array element at specified position

6.54 Min

13 Limitations of arrays in C or Limitations of Static memory allocation

7.41 Min

14 performance analysis of an algorithm Data Structures Design and analysis of Algorithms DAA

8.13 Min

15 frequency count method to calculate Time Complexity of an Algorithm step count method DS DAA

15.19 Min

16 asymptotic notations in data structure with example Design and analysis of Algorithms DAA

19.39 Min

17 Types of computing times data structures Design and analysis of Algorithms DAA

6.52 Min

18 General rules or norms for calculating time complexity Data Structures DAA

10.27 Min

19 Space Complexity of an Algorithm in Data Structures Design and analysis of Algorithms DAA

9.44 Min

20 LINKED LIST CREATION AND DISPLAY DATA STRUCTURES

36.46 Min

21 LINKED LIST INSERTION AT BEGINNING ENDING SPECIFIED POSITION DATA STRUCTURES

24.47 Min

22 LINKED LIST DELETION FROM BEGINNING ENDING AND SPECIFIED POSITION DATA STRUCTURES

14.01 Min

23 counting number of nodes in a single linked list

5.53 Min

24 searching a node in singly linked list

10.05 Min

25 sorting a singly linked list

14.02 Min

26 reversing a singly linked list in c

14.36 Min

27 advantages and disadvantages of linked list differences between array and linked list

9.09 Min

28 CIRCULAR LINKED LIST CREATE AND DISPLAY DATA STRUCTURES

21.14 Min

29 CIRCULAR LINKED LIST INSERTION AT BEGINNING ENDING SPECIFIED POSITION DATA STRUCTURES

18.1 Min

30 CIRCULAR LINKED LIST DELETION FROM BEGINNING ENDING AND SPECIFIED POSITION DATA STRUCTURES

19.53 Min

31 advantages and disadvantages of circular linked list

4.26 Min

32 DOUBLE LINKED LIST CREATE AND DISPLAY DATA STRUCTURES

22.21 Min

33 DOUBLE LINKED LIST INSERTION AT BEGINNING ENDING SPECIFIED POSITION DATA STRUCTURES

18.33 Min

34 DOUBLE LINKED LIST DELETION FROM BEGINNING ENDING AND SPECIFIED POSITION DATA STRUCTURES

10.11 Min

35 Reversing Double Linked List

10.43 Min

36 advantages and disadvantages of doubly linked list

6.17 Min

37 Circular Double Linked List Create and Display

23.22 Min

38 Circular Double Linked List Insertion Begin end and Specified Position

26.3 Min

39 Circular Double Linked List Deletion Begin end and Specified Position

22.41 Min

40 Applications of Linked List data structure

5.09 Min

41 polynomial adt polynomial addition in data structure

29.35 Min

42 stacks using arrays

26.54 Min

43 Stacks using linked list

19.22 Min

44 arithmetic expression in data structure applications of stacks

5.41 Min

45 postfix expression evaluation algorithm example program

23.55 Min

46 infix to postfix conversion algorithm examples program

40.49 Min

47 balancing symbols using stack algorithm example program delimiter matching using stack

20.46 Min

48 queues using arrays

25.06 Min

49 Queues using linked list

15.35 Min

50 circular queues in data structures

29.53 Min

51 double ended queue using array

21 Min

52 double ended queue using linked list

27.44 Min

53 Linear Search

25.41 Min

54 Binary Search

36.25 Min

55 bubble sort with example

6.43 Min

56 Bubble Sort algorithm bubble sort program bubble sort example

35.5 Min

57 selection sort with example

8.42 Min

58 Selection Sort algorithm selection sort example selection sort program

28.46 Min

59 insertion sort with example

5.21 Min

60 Insertion Sort algorithm insertion sort program insertion sort example

41.48 Min

61 merge sort algorithm merge sort algorithm with example merge sort program

32.06 Min

62 MERGE SORT WITH EXAMPLE

11.36 Min

63 analysis of merge sort merge sort time complexity analysis

6.23 Min

64 quicksort algorithm quicksort program quicksort example step by step

34.13 Min

65 quicksort example step by step quick sort example solved

10.21 Min

66 analysis of quicksort algorithm quicksort time complexity analysis

8.56 Min

67 radix sort algorithm bucket sort algorithm program example step by step

24.45 Min

68 radix sort example step by step bucket sort example step by step

17.15 Min

69 shell sort example step by step shell sort example in data structure

16.53 Min

70 shell sort algorithm shell sort program in c shell sort with example

18.43 Min

71 tree terminology in data structure

12.59 Min

72 what is binary tree types of binary tree

10.33 Min

73 representation of binary tree

12.33 Min

74 binary tree traversals

10 Min

75 C program to implement Binary Tree Traversals Data Structures

27.54 Min

76 construct binary tree from inorder and preorder traversal examples

9.09 Min

77 construct binary tree from inorder and postorder traversal examples

7.11 Min

78 heap sort algorithm with example heap sort example step by step

20.04 Min

79 Heap Sort Program explanation with an example

22.03 Min

80 construction of expression tree using postfix expression Data Structures

7.18 Min

81 what is binary search tree list of binary search tree operations

5.37 Min

82 construction of binary search tree with example binary search tree example step by step

5.24 Min

83 insertion of a node in binary search tree binary search tree insertion

14.5 Min

84 deletion of a node in binary search tree binary search tree node deletion

19.42 Min

85 searching a node in binary search tree binary search tree search operation

9.59 Min

86 find smallest element in binary search tree Find min element in a binary search tree

6 Min

87 find largest node in binary search tree

7.01 Min

88 what is an avl tree avl tree rotations

21.29 Min

89 Construct AVL tree for the elements 1 2 3 4 5 6 7 8 AVL Tree Insertion with example

10.51 Min

90 construct AVL tree for 20 11 5 32 40 2 4 27 23 28 50 avl tree insertion with example

21.54 Min

91 Construct AVL Tree for 7 14 2 5 10 33 56 30 15 25 66 70 4 AVL Tree insertion with example

23.43 Min

92 graph terminology in data structure

14.25 Min

93 representation of graph in data structure

10.17 Min

94 Graph Traversals Breadth First Search BFS

12.14 Min

95 Graph traversal Depth first search DFS

12.41 Min

96 what is minimum cost spanning tree

5.5 Min

97 Prim s Algorithm for Minimum Cost Spanning Tree

9.4 Min

98 Kruskal s Algorithm for Minimum Cost Spanning Tree

8.53 Min

99 Hashing Hash Table Hash Function Types of hash functions Characteristics of a good hash function

16.15 Min

100 collision resolution techniques Separate Chaining open addressing linear probing Quadratic Double

20.07 Min

101 Sorting Techniques Algorithm Program Example Tracing Analysis Time Complexity

5 Hours 8.19 Min

102 Algorithm Analysis Linked List Single Circular Double Circular Double Operations DS

8 Hours 54.42 Min

103 Stacks and Queues Tutorial

4 Hours 16.45 Min

104 Trees Graphs and Hashing in Data Structures

6 Hours 8.47 Min

105 Rehashing in Data Structures Collision Resolution Technique

10.07 Min

Instructor

Sasikala

0 Rating

0 Reviews

0 Students

85 Courses

Course Full Rating

0

Course Rating

(0)

No Review found

Student Feedback

You must be enrolled to ask a question

Enrol

Duration N/A
Lectures 105 lessons
Enrolled 0 students
Category: Programming
0 Quizzes
Language: English
Skill Level Beginner
Certificate of Completion
Full lifetime access

Shopping Cart

We collect and use cookies to give you the best and most relevant website experience. Kindly accept the cookies. Privacy Policy

When you visit any of our websites, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized web experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and manage your preferences. Please note, that blocking some types of cookies may impact your experience of the site and the services we are able to offer

Strictly Necessary

These cookies are necessary for our website to function properly and cannot be switched off in our systems. They are usually only set in response to actions made by you that amount to a request for services, such as setting your privacy preferences, logging in or filling in forms, or where they’re essential to providing you with a service you have requested. You cannot opt out of these cookies. You can set your browser to block or alert you about these cookies, but if you do, some parts of the site will not then work. These cookies do not store any personally identifiable information
Performance Cookies

These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site, which helps us optimize your experience. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not be able to use your data in this way.
Functional Cookies

These cookies enable the website to provide enhanced functionality and personalization. They may be set by us or by third-party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Targeting Cookies

These cookies may be set through our site by our advertising partners. They may be used by those companies to build a profile of your interests and show you relevant adverts on other sites. They do not store directly personal information but are based on uniquely identifying your browser and internet device. If you do not allow these cookies, you will experience less targeted advertising.