Computer Science - Data Structure Special

Duration 230 h 50 m 41 s

Available 360 days

Price

₹ 250 ~~₹ 750~~ Buy now

About Course

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 content

Drive Link0 s Start

Introduction0 sFree

1. Reading - About the Instructor0 sFree

2. Intro To Data Structures7 m 18 s Start

3. Control Instructions8 m 30 s Start

4.Operators9 m 11 s Start

5. Pointers16 m 49 s Start

6. Types of Pointers6 m 54 s Start

7. Reference - Book Notes for Professionals in Data Structure0 s Start

8. Call By Value4 m 39 s Start

9. Call By Reference9 m 7 s Start

10. Recursion9 m 45 s Start

11. Storage Classes9 m 55 s Start

12. Preprocessor Directives6 m 16 s Start

13. Arrays and Strings8 m 14 s Start

14. Algorithms7 m 25 s Start

15. Analysis of Algorithms14 m 24 s Start

16. Asymptotic Analysis of Algorithms13 m 18 s Start

17. Time Complexity9 m 37 s Start

18. Time Complexity13 m 52 s Start

19. Growth Rate Exercise8 m 51 s Start

21. Analysis of Linear Search7 m 48 s Start

22. Binary Search7 m 29 s Start

23. Analysis of Binary Search4 m 43 s Start

24. Recursive Binary Search7 m 26 s Start

25. Selection Sort10 m 31 s Start

26. Bubble Sort8 m 45 s Start

27. Radix Sort12 m 35 s Start

28. Insertion Sort7 m 4 s Start

29. Merge Sort12 m 56 s Start

30. Reference - Sorting0 s Start

31. Quick Sort Algorithm9 m 38 s Start

32. Quick Sort Implementation6 m 53 s Start

33. Quick Sort Exercise10 m 34 s Start

34. Summary of Sorting Algorithms4 m 47 s Start

35. Array (Part 1)17 m 35 s Start

35. Array (Part 2)27 m Start

36. Structure39 m 57 s Start

37. Array of Structures6 m 33 s Start

38. Passing Structure Elements3 m 57 s Start

39. Passing Structures6 m 16 s Start

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 s Start

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 s Start

49. Problem on Storage of Arrays6 m 35 s Start

50. Dynamic Memory Allocation10 m 28 s Start

51. Linked List16 m 19 sFree

52. Linked List of Records5 m 23 s Start

53. Linked List Operations - I13 m 11 s Start

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 s Start

62. Doubly Linked List11 m 7 s Start

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 s Start

72. Implementation of a Stack8 m 32 s Start

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 s Start

90. Tree Traversals5 m 52 s Start

91. Construction of Binary Trees15 m 34 s Start

92. Array Representation of a Binary Tree5 m 35 s Start

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

94. Binary Search Tree5 m 53 s Start

95. BST Implementation9 m 7 s Start

96. BST Traversals6 m 2 s Start

97. Comparison of Binary Trees5 m 45 s Start

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 s Start

105. Heap Sort12 m 40 s Start

106. AVL Tree20 m 59 s Start

107. Graph Data Structure6 m 37 sFree

108. Adjacency Matrix Representation6 m 1 s Start

109. Adjacency List Representation5 m 28 s Start

110. Adjacency Multilist Representation12 m 23 s Start

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 s Start

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

Notations0 s Start

Introduction0 sFree

Introduction33 m 3 s Start

Searching37 m 33 s Start

Stack and Queue22 m 53 s Start

InsertMax25 m 10 s Start

Merge Sort26 m 18 s Start

Tree 137 m 25 s Start

Tree 218 m 27 s Start

Tree 340 m 7 s Start

Tree 428 m 28 s Start

Tree 533 m 55 s Start

Tree 635 m 22 s Start

Hashing16 m 47 s Start

Union1 h 5 m 2 s Start

Suffix Tree41 m 10 s Start

Overview1 h 2 m 23 s Start

Merge Sort26 m 18 s Start

Divide and Conquer51 m 20 s Start

DP-11 h 16 m 13 s Start

DP -251 m 50 s Start

DP - 345 m 59 s Start

Graph 116 m 1 s Start

Graph21 h 5 m 53 s Start

Graph346 m 39 s Start

CC-137 m 38 s Start

CC-222 m 24 s Start

CC-31 h 5 m 27 s Start

CC-422 m 28 s Start

Introduction0 sFree

Day 1 -Recursion2 h 54 m 27 sFree

Day 22 h 33 m 35 sFree

Day 32 h 28 m 39 s Start

Day 43 h 8 m 39 s Start

Day 5 - DP2 h 29 m 48 sFree

Day 62 h 34 m 47 s Start

Day 72 h 41 m 37 s Start

Day 82 h 27 m 9 s Start

Day 92 h 22 m 2 s Start

Day 102 h 15 m 21 s Start

Day 112 h 31 m 16 s Start

Day 122 h 26 m 29 s Start

Day 13 - Tree2 h 28 m 58 sFree

Day 142 h 39 m 26 s Start

Day 152 h 18 m 26 s Start

Day 162 h 46 m 56 s Start

Day 17 - Graph2 h 22 m 8 sFree

Day 182 h 18 m 22 s Start

Day 192 h 11 m 44 s Start

Day 202 h 25 m 34 s Start

Introduction0 sFree

First Video2 h 13 m 30 s Start

Two Pointer2 h 13 m 28 sFree

Array - 12 h 10 m 14 s Start

Vector2 h 5 m 10 s Start

String - 12 h 4 m 34 s Start

String - 22 h 3 m 48 s Start

String - 32 h 14 m 38 s Start

Pointer - 12 h 1 m 52 s Start

Pointer - 21 h 58 m 58 s Start

Recursion - 12 h 21 m 52 sFree

Recursion - 22 h 13 m 58 sFree

Sorting - 12 h 7 m 50 sFree

Sorting - 22 h 2 m 36 sFree

Recursion - 32 h 52 s Start

Recursion - 41 h 56 m 54 s Start

Linked List - 12 h 6 m 36 s Start

Linked List - 21 h 55 m 40 s Start

Linked List - 31 h 55 m Start

Tree Introduction2 h 1 m 42 s Start

Tree Traversal - 12 h 6 m 54 s Start

Tree Traversal - 22 h 9 m 24 s Start

Tree Questions2 h 8 m 12 s Start

Tree Hard Questions2 h 3 m 36 s Start

BST -11 h 58 m 2 s Start

BST - 22 h 3 m 52 s Start

Balanced BST2 h 11 m 52 s Start

AVL1 h 55 m 32 s Start

Heap - 11 h 54 m 58 s Start

Heap - 22 h 4 m 38 s Start

Heap Hard - 12 h 3 m 8 s Start

Heap Hard - 21 h 55 m 20 s Start

Hashing - 12 h 6 m 2 s Start

Hashing - 22 h 1 m 20 s Start

Hashing - 32 h 14 m 16 s Start

Graph - 12 h 2 m 42 s Start

Graph - 22 h 11 m 40 s Start

Detect Cycle2 h 7 m 42 s Start

BFS2 h 30 s Start

DGC2 h 10 m 28 s Start

Shortest Distance2 h 1 m 26 sFree

Graph - Advanced2 h 11 m 14 s Start

Prims and Kruskal2 h 23 m 36 sFree

Strongly Connected2 h 14 m 2 s Start

Graph -Advance_Euler2 h 13 m 12 s Start

Articulation Point2 h 28 s Start

DP- 12 h 9 m 14 sFree

DP-22 h 12 m 2 s Start

Knapsack - 152 m 52 sFree

Knapsack - 22 h 25 m 6 s Start

LCS - 12 h 31 m 50 sFree

LCS - 22 h 21 m 46 s Start

Stock - 11 h 41 m 26 sFree

Stock - 22 h 18 m 52 s Start

Stock - 31 h 57 m 14 s Start

DP - Advanced2 h 3 m 10 s Start

Trie2 h 31 m 47 s Start

Segment Tree2 h 17 m 47 s Start

Introduction0 sFree

Introduction of Testing Softwares1 h 21 m 41 s Start

Core Java Introduction1 h 10 m 18 s Start

Selenium Introduction1 h 35 m Start

Assertion - 18 m 14 s Start

Assertion - 21 h 13 m 11 s Start

Page Object Model1 h 20 m 31 s Start

AI in Testing ( ChatGPT Special)1 h 34 m 54 s Start

Part 17 h 11 m 40 s Start

Part 27 h 31 m 6 s Start

Buy now

Course Instructor

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

Computer Science - Data Structure Special

About Course

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 content

Course Instructor

Yashwant Kanetkar

Director of KICIT, a training company, and KSET.

Uteach Academy

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