Section 2: Essential C and C++ Concepts
Section 5: Recursion
Section 6: Arrays Representations
Section 7: Array ADT
Section 8: Strings
Section 9: Matrices
Section 10: Sparse Matrix and Polynomial Representation
Section 11: Linked List
Section 12: Sparse Matrix and Polynomial using Linked List
Section 13: Stack
Section 14: Queues
Section 15: Trees
Section 16: Binary Search Trees
Section 18: Search Trees
Section 20: Sorting Techniques
Section 22: Graphs
Section 23: Asymptotic Notations
Learn, Analyse and Implement Data Structure using C and C++. Learn Recursion and Sorting.
You may be new to Data Structure or you have already Studied and Implemented Data Structures but still you feel you need to learn more about Data Structure in detail so that it helps you solve challenging problems and used Data Structure efficiently.
This 53 hours of course covers each topic in greater details, every topic is covered on Whiteboard which will improve your Problem Solving and Analytical Skills. Every Data Structure is discussed, analysed and implemented with a Practical line-by-line coding.
Source code for all Programs is available for you to download
I am the Instructor of this course, I have been teaching this course to university students for a long period of time, I know the pulse of students very well, I know how to present the topic so that it’s easy to grasp for students.
I know how to use Whiteboard to explain the topic and also to make it memorable. Remembering the thing and using them in right place is more important than just understanding the topic.
After Completing Course
After completing this course you will be confident enough to take up any challenging problem in coding using Data Structures.
2. Arrays Representation
3. Array ADT
4. Linked List
8. Binary Search Tree
9. AVL Trees
11. Hashing Technique
Who this course is for: