Data Structures Through C

Name: Video Courses
Author: Sumit Malhotra

Duration 18 h 57 m 43 s

Available 730 days

Price

₹ 45 Buy now

About Course

INSTRUCTOR - DR.YASHWANT KANETKAR.

The content is available in book format but why buy the book if you get video lessons at less price?

Watch the free video lessons to get an idea of the course.

Course Validity - 3 years of the purchase.

What you will learn?

Basics of Data Structure.
C language.

Payment link - Payment is through Razorpay.

Join this whatsapp group after payment https://chat.whatsapp.com/FeFvYqGUafi788iuoXJOnH

Course content

1. Reading - About the InstructorFree

2. Intro To Data Structures7 m 18 sFree

3. Control Instructions8 m 30 sFree

4.Operators9 m 11 sFree

5. Pointers16 m 49 sFree

6. Types of Pointers6 m 54 sFree

7. Reference - Book Notes for Professionals in Data Structure Start

8. Call By Value4 m 39 sFree

9. Call By Reference9 m 7 sFree

10. Recursion9 m 45 sFree

11. Storage Classes9 m 55 sFree

12. Preprocessor Directives6 m 16 sFree

13. Arrays and Strings8 m 14 sFree

14. Algorithms7 m 25 sFree

15. Analysis of Algorithms14 m 24 sFree

16. Asymptotic Analysis of Algorithms13 m 18 sFree

17. Time Complexity9 m 37 sFree

18. Time Complexity13 m 52 s Start

19. Growth Rate Exercise8 m 51 sFree

21. Analysis of Linear Search7 m 48 sFree

22. Binary Search7 m 29 sFree

23. Analysis of Binary Search4 m 43 sFree

24. Recursive Binary Search7 m 26 s Start

25. Selection Sort10 m 31 sFree

26. Bubble Sort8 m 45 sFree

27. Radix Sort12 m 35 sFree

28. Insertion Sort7 m 4 sFree

29. Merge Sort12 m 56 sFree

30. Reference - Sorting Start

31. Quick Sort Algorithm9 m 38 sFree

32. Quick Sort Implementation6 m 53 sFree

33. Quick Sort Exercise10 m 34 s Start

34. Summary of Sorting Algorithms4 m 47 s Start

35. Array (Part 1)17 m 35 sFree

35. Array (Part 2)27 mFree

36. Structure39 m 57 sFree

37. Array of Structures6 m 33 sFree

38. Passing Structure Elements3 m 57 sFree

39. Passing Structures6 m 16 sFree

40. Polynomials7 m 17 s Start

41. Polynomial Addition8 m 14 s Start

42. Polynomial Multiplication6 m 50 s Start

43. Two Dimensional Arrays7 m 20 sFree

44. Saddle Point6 m 14 s Start

45. Upper and Lower Triangular Matrices10 m 15 s Start

46. Sparse Matrices14 m 45 s Start

47. Transpose of a Sparse Matrix12 m 30 s Start

48. Storage of Arrays12 m 16 sFree

49. Problem on Storage of Arrays6 m 35 sFree

50. Dynamic Memory Allocation10 m 28 sFree

51. Linked List16 m 19 sFree

52. Linked List of Records5 m 23 sFree

53. Linked List Operations - I13 m 11 sFree

54. Linked List Operations - II15 m 6 s Start

55. Ascending Order Linked List11 m 9 s Start

56. Sorting A Linked List7 m 44 s Start

57. Reversing a Linked List8 m 32 s Start

58. Merging Linked Lists10 m 3 s Start

59. Concatenating Linked Lists7 m 8 s Start

60. Polynomial Addition Using Linked List12 m 51 s Start

61. Circular Linked List16 m 52 sFree

62. Doubly Linked List11 m 7 sFree

63. Sparse Matrix as a Linked List10 m 22 s Start

64. Recursive Count and Compare11 m 56 s Start

65. Recursive Copy and Append8 m 32 s Start

66. Unions9 m 55 s Start

67. Generalized Linked List for Multi-variable Polynomials14 m 33 s Start

68. Copying a Generalized List8 m 42 s Start

69. Depth of a Generalized List2 m 34 s Start

70. Comparison of Generalized Lists5 m 27 s Start

71. Stack Data Structure6 m 17 sFree

72. Implementation of a Stack8 m 32 sFree

73. Stack as a Linked List14 m 12 s Start

74. Types of Expressions3 m 31 s Start

75. Infix to Postfix Conversion11 m 26 s Start

76. Infix to Prefix Conversion8 m 54 s Start

77. Prefix to Postfix Conversion5 m 23 s Start

78. Conversion Summary7 m 46 s Start

79. Implementation of Infix to Postfix11 m 38 s Start

80. Implementation of Prefix to Postfix5 m 20 s Start

81. Evaluation of Postfix Expression5 m 14 s Start

82. Implementation of Postfix Evaluation7 m 18 s Start

83. Queue Data Structure2 m 21 s Start

84. Implementation of Queue8 m 54 s Start

85. Deque and its Implementation17 m 31 s Start

86. Priority Queue2 m 8 s Start

87. Circular Queue2 m 8 s Start

88. Tree Data Structure5 m 35 sFree

89. Tree Terminology6 m 42 sFree

90. Tree Traversals5 m 52 sFree

91. Construction of Binary Trees15 m 34 s Start

92. Array Representation of a Binary Tree5 m 35 sFree

93. Linked Representation of a Binary Tree4 m 2 s Start

94. Binary Search Tree5 m 53 sFree

95. BST Implementation9 m 7 sFree

96. BST Traversals6 m 2 sFree

97. Comparison of Binary Trees5 m 45 sFree

98. Insertion in a BST13 m 29 s Start

99. Deletion in a BST17 m 21 s Start

100. Searching a BST6 m 39 s Start

101. Threaded Binary Tree11 m 11 s Start

102. Implementation of Threaded Binary Tree12 m 25 s Start

103. Inorder Traversal of Threaded Binary Tree7 m 20 s Start

104. Binary Heap15 m 24 sFree

105. Heap Sort12 m 40 s Start

106. AVL Tree20 m 59 sFree

107. Graph Data Structure6 m 37 sFree

108. Adjacency Matrix Representation6 m 1 sFree

109. Adjacency List Representation5 m 28 sFree

110. Adjacency Multilist Representation12 m 23 sFree

111. Orthogonal Representation of a Graph8 m 42 s Start

112. Depth First Search Traversal4 m 56 s Start

113. Implementation of DFS10 m 5 s Start

114. Breadth First Search Traversal8 m 10 s Start

115. BFS Implementation7 m 11 s Start

116. Spanning Tree8 m 29 sFree

117. Kruskal's Algorithm7 m 2 s Start

118. Prim's Algorithm10 m 22 s Start

119. Dijkstra's Algorithm15 m 11 s Start

120. Hashing9 m 10 s Start

Repeated - Linked List Operations - II15 m 6 s Start

Notations Start

Yashwant Kanetkar
Director of KICIT, a training company, and KSET.

Course Instructor

For author profile visit :-

https://en.wikipedia.org/wiki/Yashavant_Kanetkar

Sumit Malhotra

Assistant Professor at Chandigarh University, Gharuan, Mohali.

Course Instructor

Sumit Malhotra is currently working as an Assistant Professor at Chandigarh University, Gharuan, Mohali.

For author profile visit:-

https://www.linkedin.com/in/sumit-malhotra-383007181/

https://www.researchgate.net/profile/Sumit-Malhotra-4

Data Structures Through C

About Course

Yashwant Kanetkar

Director of KICIT, a training company, and KSET.

Course Instructor

Sumit Malhotra

Assistant Professor at Chandigarh University, Gharuan, Mohali.

Course Instructor