Ratings 

A lot of beginners and experienced programmers avoid learning Data Structures because it’s complicated and they think that there is no use of data structure in real life But it is the key topic for programmers and computer science students to get a job and perform well in it.

2499
Last Updated

March 12, 2021

Students Enrolled

20

Posted by
Certification

Data Structure in C Language Offline Downloadable Certification Course in Hindi with Doubt Assistance - By Prateek Jain (IIT Roorkee).

Many beginners and experienced programmers avoid learning data structures because it is complex and they feel that data structure is of no use in real life. But this is a major issue for programmers and computer science students to get a job and perform well on it.

DS is much more important for any computer science student. It teaches you to be a better programmer and how to think better. It is a skill that will help you throughout your life and do not have to learn to pass a subject.

That's why I started a complete practical based data structure  in c program in Hindi with doubt assistance approach for those students who are not comfortable in the English language and really want to be a peak programmer.

  • Instant activation
  • Internet connection needed only for downloading the video, After that no internet connection needed
  • Content will be activated for 6 months

Want to learn the c-language in Hindi from scratch? -  Click here

Uses of Data Structure - 

According to wikipedia, Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Usually, efficient data structures are key to designing efficient algorithms. Read more

Course Curriculum

    • 2.1 What is an Array? Details 00:00:00
    • 2.2 creating and accessing 1-D array part – 1 Details 00:00:00
    • 2.3 creating and accessing 1-d array part – 2 Details 00:00:00
    • 2.4 initialization of 1-d array Details 00:00:00
    • 2.5 program to find maximum or minimum number in an array Details 00:00:00
    • 2.6 passing 1-d array to function Details 00:00:00
    • 2.7 creating and accessing 2-D array Details 00:00:00
    • 2.8 initialization of 2-d array Details 00:00:00
    • 2.9 3-d and multi-dimension arrays Details 00:00:00
    • 2.10 Program to reverse an array or string Details 00:00:00
    • 3.1 what is pointers? Details 00:00:00
    • 3.2 pointer variable Details 00:00:00
    • 3.3 dereferencing pointer variables Details 00:00:00
    • 3.4 using indirection operator Details 00:00:00
    • 3.5 pointer arithmetic Details 00:00:00
    • 3.6 precedence and associativity of dereferencing and increment and decrement operators Details 00:00:00
    • 3.7 pointers and array part – 1 Details 00:00:00
    • 3.8 pointers and array part – 2 Details 00:00:00
    • 3.9 summary of pointer and array Details 00:00:00
    • 3.10 difference between pointer and const array pointer Details 00:00:00
    • 3.11 pointer to an array Details 00:00:00
    • 3.12 pointer and 2-d array Details 00:00:00
    • 3.13 pointer to an 2-d array Details 00:00:00
    • 3.14 pointer and 3-d array Details 00:00:00
    • 3.15 call by value and call by reference Details 00:00:00
    • 3.16 returning more than one value from a function Details 00:00:00
    • 3.17 function returning pointer Details 00:00:00
    • 3.18 pointer to pointer Details 00:00:00
    • 3.19 void pointers Details 00:00:00
    • 3.20 dma (dynamic memory allocation) Details 00:00:00
    • 3.21 malloc function Details 00:00:00
    • 3.22 calloc function Details 00:00:00
    • 3.23 realloc and free function Details 00:00:00
    • 4.1 introduction to structure in c Details 00:00:00
    • 4.2 creating, initializing and accessing structure Details 00:00:00
    • 4.3 other ways to declare structure Details 00:00:00
    • 4.4 size of structure Details 00:00:00
    • 4.5 array of structure Details 00:00:00
    • 5.1 Recursion Details 00:00:00
    • 5.2 How Recursion works Details 00:00:00
    • 5.3 recursion example Details 00:00:00
    • 6.1 Linked list in hindi part – 1 Details 00:00:00
    • 6.2 Linked list in hindi part – 2 Details 00:00:00
    • 6.3 Linked list in hindi part – 3 Details 00:00:00
    • 6.4 Insertion at the end of linked list part – 1 Details 00:00:00
    • 6.5 Insertion at the end of linked list part – 2 Details 00:00:00
    • 6.6 Insertion at the start of linked list Details 00:00:00
    • 6.7 Insertion at the any place-middle of linked list Details 00:00:00
    • 6.8 search-traverse operation in a linked list Details 00:00:00
    • 6.9 delete operation on linked list Details 00:00:00
    • 6.10 searching in binary search tree Details 00:00:00
    • 6.11 double linked list part – 1 Details 00:00:00
    • 6.12 doubly linked list part – 2 Details 00:00:00
    • 6.13 insertion at the beginning and end in doubly linked list Details 00:00:00
    • 6.14 insertion at any specific location in doubly linked list Details 00:00:00
    • 6.15 deletion at the beginning and end of doubly linked list Details 00:00:00
    • 6.16 deletion at any specific location in doubly linked list Details 00:00:00
    • 6.17 search an item in doubly linked list Details 00:00:00
    • 6.18 insert at the beginning and end in the circular linked list Details 00:00:00
    • 6.19 delete at the beginning and end in the circular linked list Details 00:00:00
    • 6.20 search an item in circular linked list Details 00:00:00
    • 7.1 Introduction to stack part – 1 Details 00:00:00
    • 7.2 Introduction to stack part – 2 Details 00:00:00
    • 7.3 Application of stack (balanced parenthesis problem) Details 00:00:00
    • 7.4 introduction to queue part – 1 Details 00:00:00
    • 7.5 introduction to queue part – 2 Details 00:00:00
    • 7.6 double ended queue part – 1 Details 00:00:00
    • 7.7 double ended queue part – 2 Details 00:00:00
    • 7.8 circular queue part – 1 Details 00:00:00
    • 7.9 circular queue part – 2 Details 00:00:00
    • 8.1 introduction to tree Details 00:00:00
    • 8.2 definition of tree Details 00:00:00
    • 8.3 properties of binary tree Details 00:00:00
    • 8.4 types of binary tree Details 00:00:00
    • 8.5 complete binary tree and its properties Details 00:00:00
    • 8.6 array representation of binary tree Details 00:00:00
    • 8.7 linked list representation of binary tree Details 00:00:00
    • 8.8 traversal in binary tree Details 00:00:00
    • 8.9 introduction to inorder, preorder, and postorder traversal Details 00:00:00
    • 8.10 how to create a tree Details 00:00:00
    • 8.11 recursive preorder, inorder, and postorder traversal Details 00:00:00
    • 8.12 non-recurive preorder traversal Details 00:00:00
    • 8.13 non-recurive inorder traversal Details 00:00:00
    • 8.14 non-recurive postorder traversal Details 00:00:00
    • 8.15 level order traversal Details 00:00:00
    • 8.16 construction of binary tree using inorder, and preorder traversal Details 00:00:00
    • 8.17 construction of binary tree using inorder, and postorder traversal Details 00:00:00
    • 8.18 height of the binary tree Details 00:00:00
    • 8.19 expression tree from infix expression Details 00:00:00
    • 8.20 expression tree from postfix expression Details 00:00:00
    • 8.21 expression tree from prefix expression Details 00:00:00
    • 8.22 introduction to binary search tree Details 00:00:00
    • 8.23 searchin in binary search tree Details 00:00:00
    • 8.24 minimum and maximum element in BST (inorder sucessor and inorder predessor) Details 00:00:00
    • 8.25 creation of insertion in BST Details 00:00:00
    • 8.26 deletion in BST part – 1 Details 00:00:00
    • 8.27 deletion in bst part – 2 Details 00:00:00
    • 8.28 introduction to threaded binary tree Details 00:00:00
    • 8.29 insertion in threaded binary search tree part – 1 Details 00:00:00
    • 8.30 insertion, inorder, inorder successor in threaded binary search tree part – 2 Details 00:00:00
    • 8.31 deletion in threaded binary tree part – 1 Details 00:00:00
    • 8.32 deletion in threaded binary tree part – 2 Details 00:00:00
    • 8.33 deletion in threaded binary tree part – 3 Details 00:00:00
    • 8.34 height of tree Details 00:00:00
    • 8.35 introduction to AVL tree Details 00:00:00
    • 8.36 left rotation (RR rotation) Details 00:00:00
    • 8.37 right rotation (ll rotation) Details 00:00:00
    • 8.38 left right rotation Details 00:00:00
    • 8.39 right left rotation Details 00:00:00
    • 8.40 example of avl tree Details 00:00:00
    • 8.41 avl tree insertion code part – 1 Details 00:00:00
    • 8.42 avl tree insertion code part – 2 Details 00:00:00
    • 8.43 deletion in avl tree part – 1 Details 00:00:00
    • 8.44 deletion in avl tree part – 2 Details 00:00:00
    • 8.45 heap sort part – 1 Details 00:00:00
    • 8.46 heap sort part – 2 Details 00:00:00
    • 8.47 heap sort part – 3 Details 00:00:00
    • 8.48 m-way tree Details 00:00:00
    • 8.49 introduction to b-tree Details 00:00:00
    • 8.50 how to create b-tree Details 00:00:00
    • 8.51 searching in b-tree Details 00:00:00
    • 8.52 insertion in b-tree Details 00:00:00
    • 9.1 creation – insertion – deletion in AVL tree Details 00:00:00
    • 9.2 creation of tree using inorder and postorder Details 00:00:00
    • 9.3 creation of tree using inorder and preorder Details 00:00:00
    • 9.4 height of binary tree Details 00:00:00
    • 9.5 insertion and deletion in bst part – 1 Details 00:00:00
    • 9.6 insertion and deletion in bst part – 2 Details 00:00:00
    • 9.7 levelorder Details 00:00:00
    • 9.8 minimum and maximum element in BST Details 00:00:00
    • 9.9 searching in binary search tree Details 00:00:00
    • 9.10 threaded binary tree insertion, deletion, and traversal Details 00:00:00
    • 9.11 tree traversal Details 00:00:00
    • 10.1 introduction to graph and its terminology part – 1 Details 00:00:00
    • 10.2 introduction to graph and its terminology part – 2 Details 00:00:00
    • 10.3 maximum edges in a graph Details 00:00:00
    • 10.4 adjaceny matrix representation of graph part – 1 Details 00:00:00
    • 10.5 adjaceny matrix representation of graph part – 2 Details 00:00:00
    • 10.6 adjaceny list representation of graph part – 1 Details 00:00:00
    • 10.7 adjaceny list representation of graph part – 2 Details 00:00:00
    • 10.8 adjaceny list representation of graph [delete vertex] part – 3 Details 00:00:00
    • 10.9 adjaceny list representation of graph [delete edge] part – 4 Details 00:00:00
    • 10.10 depth first search (DFS) Details 00:00:00
    • 10.11 breath first search (bfs) Details 00:00:00
    • 10.12 dijkstra’s algorithm part – 1 Details 00:00:00
    • 10.13 dijkstra’s algorithm part – 2 Details 00:00:00
    • 10.14 bellman ford algorithm part – 1 Details 00:00:00
    • 10.15 bellman ford algorithm part – 2 Details 00:00:00
    • 10.16 floyd warshall algorithm part – 1 Details 00:00:00
    • 10.17 floyd warshall algorithm part – 2 Details 00:00:00
    • 10.18 minimum spanning tree (mst) Details 00:00:00
    • 10.19 prim’s algorithm Details 00:00:00
    • 11.1 Bellman ford algorithm Details 00:00:00
    • 11.2 BFS traversal using adjacency matrix Details 00:00:00
    • 11.3 create, insert, delete in graph using adjacency list Details 00:00:00
    • 11.4 create, insert, delete in graph using matrix Details 00:00:00
    • 11.5 DFS traversal using adjacency matrix Details 00:00:00
    • 11.6 Dijkstra’s algorithm Details 00:00:00
Profile Photo
Prateek Jain
0
1031

Students

About Instructor

We are dedicated to give you the very best of GATE , NET and Computer Science classes, with a focus on thorough understanding, learning and uniqueness. Prateek Jain Academy aims at providing clear and simple sessions of GATE and CS topics which helps in easy grasping of the subject. Founded in 2017 by Prateek Jain, has come a long way. He has done Master of Computer Applications from IIT Roorkee in 2014. To get into the premier institute of India, he has got All India Rank 23rd in IIT-JAM MCA entrance exam in 2011.When Prateek first started out, his passion drove him to do intense research and gave him the impetus to turn hard work and inspiration into to a booming online Computer Science classes. He now serve customers all over in Hindi language. We hope you enjoy our classes as much as we enjoy offering them to you. If you have any questions or comments, please don’t hesitate to contact us @ 9555031137 “The Objective of Education Is Learning, Not Teaching“. India needs to embrace internet and technology if it has to teach all of its huge population, the majority of which is located in remote villages. Now that we have computers and internet, it makes sense to invest in technological infrastructure that will make access to knowledge easier than ever. Prateek Jain academy helps in building the Indian education society with online learning in their own language – Hindi".

More Courses by Insturctor

Course Reviews

Copyright 2020-21 © Cademyk Technology LLP. All rights reserved.