課程資料
課程簡介
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
About Instructor
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 White board 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.
Course Contents
1. Recursion
2. Arrays Representation
3. Array ADT
4. Linked List
5. Stack
6. Queues
7. Trees
8. Binary Search Tree
9. AVL Trees
10. Graphs
11. Hashing Technique
課程章節
- 28 個章節
- 449 堂課
- 第 1 章 Before we Start
- 第 2 章 Essential C and C++ Concepts
- 第 3 章 Required Setup for Programming
- 第 4 章 Introduction
- 第 5 章 Recursion
- 第 6 章 Arrays Representations
- 第 7 章 Array ADT
- 第 8 章 Strings
- 第 9 章 Matrices
- 第 10 章 Sparse Matrix and Polynomial Representation
- 第 11 章 Linked List
- 第 12 章 Sparse Matrix and Polynomial using Linked List
- 第 13 章 Stack
- 第 14 章 Queues
- 第 15 章 Trees
- 第 16 章 Binary Search Trees
- 第 17 章 AVL Trees
- 第 18 章 Search Trees
- 第 19 章 Heap
- 第 20 章 Sorting Techniques
- 第 21 章 Hashing Technique
- 第 22 章 Graphs
- 第 23 章 Recurrence Relations (RR)
- 第 24 章 Asymptotic Notations
- 第 25 章 Divide and Conquer
- 第 26 章 Greedy Method
- 第 27 章 Dynamic Programming
- 第 28 章 Backtracking
課程內容
- Learn various Popular Data Structures and their Algorithms., Develop your Analytical skills on Data Structure and use then efficiently., Learn Recursive Algorithms on Data Structures, Learn about various Sorting Algorithms, Implementation of Data Structures using C and C++
此課程所涵蓋的技能
評價
-
UUdemy User
feels like not explaining much...concepts are very clean but can't write code?
-
SSarif Nawaz
Needs some more detailed explanation for basic foundations like the time complexity calculation and all
-
RRodrigo T. Fontes
Thanks for sharing your knowledge, you are a great professor!
-
AAlex Buzgan
The course is excellent, the explanations are very detailed and the topics are useful for professionals.