Share with friendslinkedin

Computer Science - Data Structure Special

Authors

Yashwant Kanetkar

Yashwant Kanetkar

Director of KICIT, a training company, and KSET.

For author profile visit :-

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

 

Uteach Academy

Uteach Academy

UTeach Academy

 

Course Instructor

Dr. Yashwant Kanetkar and Team



⏳ Course access validity - 1 year.

 

 

Support

 

Refund available within 3 days of purchase

📱 Refund help?
Join our WhatsApp Support Group:  https://chat.whatsapp.com/FeFvYqGUafi788iuoXJOnH
📞 Or call: +91-7009247270

 

Downloads:-

 

Notes available for GeeksforGeeks  Section

Notes available for Software Testing  Section

Free copy of  Data Structure book from  Dr.Yashwant Kanetkar

*Under Course Download Files

 

*Course has multiple independent sections that can be skipped as per user expertise and choice.

Course program

Duration 230 h 50 m 41 s

videoDrive Link0 s
videoIntroduction0 sFree
video1. Reading - About the Instructor0 sFreevideo2. Intro To Data Structures7 m 18 svideo3. Control Instructions8 m 30 svideo4.Operators9 m 11 svideo5. Pointers16 m 49 svideo6. Types of Pointers6 m 54 s
video7. Reference - Book Notes for Professionals in Data Structure0 svideo8. Call By Value4 m 39 svideo9. Call By Reference9 m 7 svideo10. Recursion9 m 45 svideo11. Storage Classes9 m 55 svideo12. Preprocessor Directives6 m 16 svideo13. Arrays and Strings8 m 14 svideo14. Algorithms7 m 25 svideo15. Analysis of Algorithms14 m 24 svideo16. Asymptotic Analysis of Algorithms13 m 18 svideo17. Time Complexity9 m 37 svideo18. Time Complexity13 m 52 svideo19. Growth Rate Exercise8 m 51 svideo21. Analysis of Linear Search7 m 48 svideo22. Binary Search7 m 29 svideo23. Analysis of Binary Search4 m 43 svideo24. Recursive Binary Search7 m 26 svideo25. Selection Sort10 m 31 svideo26. Bubble Sort8 m 45 svideo27. Radix Sort12 m 35 svideo28. Insertion Sort7 m 4 svideo29. Merge Sort12 m 56 svideo30. Reference - Sorting0 svideo31. Quick Sort Algorithm9 m 38 svideo32. Quick Sort Implementation6 m 53 svideo33. Quick Sort Exercise10 m 34 svideo34. Summary of Sorting Algorithms4 m 47 svideo35. Array (Part 1)17 m 35 svideo35. Array (Part 2)27 mvideo36. Structure39 m 57 svideo37. Array of Structures6 m 33 svideo38. Passing Structure Elements3 m 57 svideo39. Passing Structures6 m 16 svideo40. Polynomials7 m 17 svideo41. Polynomial Addition8 m 14 svideo42. Polynomial Multiplication6 m 50 svideo43. Two Dimensional Arrays7 m 20 svideo44. Saddle Point6 m 14 svideo45. Upper and Lower Triangular Matrices10 m 15 svideo46. Sparse Matrices14 m 45 svideo47. Transpose of a Sparse Matrix12 m 30 svideo48. Storage of Arrays12 m 16 svideo49. Problem on Storage of Arrays6 m 35 svideo50. Dynamic Memory Allocation10 m 28 svideo51. Linked List16 m 19 sFreevideo52. Linked List of Records5 m 23 svideo53. Linked List Operations - I13 m 11 svideo54. Linked List Operations - II15 m 6 svideo55. Ascending Order Linked List11 m 9 svideo56. Sorting A Linked List7 m 44 svideo57. Reversing a Linked List8 m 32 svideo58. Merging Linked Lists10 m 3 svideo59. Concatenating Linked Lists7 m 8 svideo60. Polynomial Addition Using Linked List12 m 51 svideo61. Circular Linked List16 m 52 svideo62. Doubly Linked List11 m 7 svideo63. Sparse Matrix as a Linked List10 m 22 svideo64. Recursive Count and Compare11 m 56 svideo65. Recursive Copy and Append8 m 32 svideo66. Unions9 m 55 svideo67. Generalized Linked List for Multi-variable Polynomials14 m 33 svideo68. Copying a Generalized List8 m 42 svideo69. Depth of a Generalized List2 m 34 svideo70. Comparison of Generalized Lists5 m 27 svideo71. Stack Data Structure6 m 17 svideo72. Implementation of a Stack8 m 32 svideo73. Stack as a Linked List14 m 12 svideo74. Types of Expressions3 m 31 svideo75. Infix to Postfix Conversion11 m 26 svideo76. Infix to Prefix Conversion8 m 54 svideo77. Prefix to Postfix Conversion5 m 23 svideo78. Conversion Summary7 m 46 svideo79. Implementation of Infix to Postfix11 m 38 svideo80. Implementation of Prefix to Postfix5 m 20 svideo81. Evaluation of Postfix Expression5 m 14 svideo82. Implementation of Postfix Evaluation7 m 18 svideo83. Queue Data Structure2 m 21 svideo84. Implementation of Queue8 m 54 svideo85. Deque and its Implementation17 m 31 svideo86. Priority Queue2 m 8 svideo87. Circular Queue2 m 8 svideo88. Tree Data Structure5 m 35 sFreevideo89. Tree Terminology6 m 42 svideo90. Tree Traversals5 m 52 svideo91. Construction of Binary Trees15 m 34 svideo92. Array Representation of a Binary Tree5 m 35 svideo93. Linked Representation of a Binary Tree4 m 2 svideo94. Binary Search Tree5 m 53 svideo95. BST Implementation9 m 7 svideo96. BST Traversals6 m 2 svideo97. Comparison of Binary Trees5 m 45 svideo98. Insertion in a BST13 m 29 svideo99. Deletion in a BST17 m 21 svideo100. Searching a BST6 m 39 svideo101. Threaded Binary Tree11 m 11 svideo102. Implementation of Threaded Binary Tree12 m 25 svideo103. Inorder Traversal of Threaded Binary Tree7 m 20 svideo104. Binary Heap15 m 24 svideo105. Heap Sort12 m 40 svideo106. AVL Tree20 m 59 svideo107. Graph Data Structure6 m 37 sFreevideo108. Adjacency Matrix Representation6 m 1 svideo109. Adjacency List Representation5 m 28 svideo110. Adjacency Multilist Representation12 m 23 svideo111. Orthogonal Representation of a Graph8 m 42 svideo112. Depth First Search Traversal4 m 56 svideo113. Implementation of DFS10 m 5 svideo114. Breadth First Search Traversal8 m 10 svideo115. BFS Implementation7 m 11 svideo116. Spanning Tree8 m 29 svideo117. Kruskal's Algorithm7 m 2 svideo118. Prim's Algorithm10 m 22 svideo119. Dijkstra's Algorithm15 m 11 svideo120. Hashing9 m 10 svideoRepeated - Linked List Operations - II15 m 6 s
videoNotations0 s
videoIntroduction0 sFree
videoIntroduction33 m 3 svideoSearching37 m 33 svideoStack and Queue22 m 53 svideoInsertMax25 m 10 svideoMerge Sort26 m 18 s
videoTree 137 m 25 svideoTree 218 m 27 svideoTree 340 m 7 svideoTree 428 m 28 svideoTree 533 m 55 svideoTree 635 m 22 svideoHashing16 m 47 svideoUnion1 h 5 m 2 svideoSuffix Tree41 m 10 svideoOverview1 h 2 m 23 s
videoOverview1 h 2 m 23 svideoMerge Sort26 m 18 svideoDivide and Conquer51 m 20 s
videoDP-11 h 16 m 13 svideoDP -251 m 50 svideoDP - 345 m 59 s
videoGraph 116 m 1 svideoGraph21 h 5 m 53 svideoGraph346 m 39 s
videoCC-137 m 38 svideoCC-222 m 24 svideoCC-31 h 5 m 27 svideoCC-422 m 28 s
videoIntroduction0 sFree
videoDay 1 -Recursion2 h 54 m 27 sFreevideoDay 22 h 33 m 35 sFreevideoDay 32 h 28 m 39 svideoDay 43 h 8 m 39 svideoDay 5 - DP2 h 29 m 48 sFreevideoDay 62 h 34 m 47 svideoDay 72 h 41 m 37 svideoDay 82 h 27 m 9 svideoDay 92 h 22 m 2 svideoDay 102 h 15 m 21 svideoDay 112 h 31 m 16 svideoDay 122 h 26 m 29 svideoDay 13 - Tree2 h 28 m 58 sFreevideoDay 142 h 39 m 26 svideoDay 152 h 18 m 26 svideoDay 162 h 46 m 56 svideoDay 17 - Graph2 h 22 m 8 sFreevideoDay 182 h 18 m 22 svideoDay 192 h 11 m 44 svideoDay 202 h 25 m 34 s
videoIntroduction0 sFree
videoFirst Video2 h 13 m 30 svideoTwo Pointer2 h 13 m 28 sFreevideoArray - 12 h 10 m 14 svideoVector2 h 5 m 10 svideoString - 12 h 4 m 34 svideoString - 22 h 3 m 48 svideoString - 32 h 14 m 38 svideoPointer - 12 h 1 m 52 svideoPointer - 21 h 58 m 58 svideoRecursion - 12 h 21 m 52 sFreevideoRecursion - 22 h 13 m 58 sFreevideoSorting - 12 h 7 m 50 sFreevideoSorting - 22 h 2 m 36 sFreevideoRecursion - 32 h 52 svideoRecursion - 41 h 56 m 54 svideoLinked List - 12 h 6 m 36 svideoLinked List - 21 h 55 m 40 svideoLinked List - 31 h 55 mvideoTree Introduction2 h 1 m 42 svideoTree Traversal - 12 h 6 m 54 svideoTree Traversal - 22 h 9 m 24 svideoTree Questions2 h 8 m 12 svideoTree Hard Questions2 h 3 m 36 svideoBST -11 h 58 m 2 svideoBST - 22 h 3 m 52 svideoBalanced BST2 h 11 m 52 svideoAVL1 h 55 m 32 s
videoHeap - 11 h 54 m 58 svideoHeap - 22 h 4 m 38 svideoHeap Hard - 12 h 3 m 8 svideoHeap Hard - 21 h 55 m 20 s
videoHashing - 12 h 6 m 2 svideoHashing - 22 h 1 m 20 svideoHashing - 32 h 14 m 16 s
videoGraph - 12 h 2 m 42 svideoGraph - 22 h 11 m 40 svideoDetect Cycle2 h 7 m 42 svideoBFS2 h 30 svideoDGC2 h 10 m 28 svideoShortest Distance2 h 1 m 26 sFreevideoGraph - Advanced2 h 11 m 14 svideoPrims and Kruskal2 h 23 m 36 sFreevideoStrongly Connected2 h 14 m 2 svideoGraph -Advance_Euler2 h 13 m 12 svideoArticulation Point2 h 28 s
videoDP- 12 h 9 m 14 sFreevideoDP-22 h 12 m 2 svideoKnapsack - 152 m 52 sFreevideoKnapsack - 22 h 25 m 6 svideoLCS - 12 h 31 m 50 sFreevideoLCS - 22 h 21 m 46 svideoStock - 11 h 41 m 26 sFreevideoStock - 22 h 18 m 52 svideoStock - 31 h 57 m 14 svideoDP - Advanced2 h 3 m 10 svideoTrie2 h 31 m 47 svideoSegment Tree2 h 17 m 47 s
videoIntroduction0 sFree
videoIntroduction of Testing Softwares1 h 21 m 41 svideoCore Java Introduction1 h 10 m 18 svideoSelenium Introduction1 h 35 mvideoAssertion - 18 m 14 svideoAssertion - 21 h 13 m 11 svideoPage Object Model1 h 20 m 31 svideoAI in Testing ( ChatGPT Special)1 h 34 m 54 s
videoPart 17 h 11 m 40 svideoPart 27 h 31 m 6 s
Computer Science - Data Structure Special

The course will be available 360 Day

Computer Science - Data Structure Special

Authors

Yashwant Kanetkar

Yashwant Kanetkar

Director of KICIT, a training company, and KSET.

For author profile visit :-

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

 

Uteach Academy

Uteach Academy

UTeach Academy

₹ 180₹ 500-64%
Buy now ₹ 180