Course Information
Course Overview
Hands-on course with exercises on arrays, stacks, queues, linked list, trees, graphs, internal sorting techniques, etc.
Noteworhy reviews :
Szu-Fan Wang: "I love the practice codes a lot. Thanks instructor!"
Alberto San Martin: "It is a very clear professor. Good explanations."
This course aims to teach the fundamental concepts of data structures in a step by step manner. As the first instalment of the course, the topics such as arrays, stacks and queues, linked lists, trees, graphs, and internal sorting techniques are covered. The remaining topics such as external sorting, symbol tables, and files will be included in the same course on a regular basis.
Programming is not just about learning a language and starting to write programs like stories. One has to learn certain concepts that are fundamental to computer science in general. That is why this course is a must for all the self-motivated wannabe code ninjas of future. The concepts here are explained slowly and clearly.
The highlight of the course is the meticulously planned coding exercises. Though the concepts are explained quite elaborately in the lectures, with ample illustrations and animations, the student will not be spoon-fed with coding solutions right on the screen. Instead, they will be required to complete pieces of code that are available for download, as part of each exercise. So, the lectures and coding exercises are inseparable. There are also quizzes interspersed with the lectures, some of which might help you think differently.
On the overall, the course aims to provide a heady mix of ease of listening to the lectures and the rigour of do-it-yourself coding exercises, hopefully making it a wholesome knowledge gaining experience.
If you didn't feel any change, please do remember that you can get your money back, as there is a 30-day money-back guarantee.
Course Content
- 26 section(s)
- 90 lecture(s)
- Section 1 Course Details
- Section 2 Introduction to Data Structures
- Section 3 Arrays : An Introduction
- Section 4 An application of arrays: Fast Transpose of a Sparse Matrix
- Section 5 Stacks and Queues: Introduction
- Section 6 Stack functionalities
- Section 7 An application of stacks: A Mazing Problem
- Section 8 Queue functionalities
- Section 9 Linked Lists
- Section 10 Trees : An Introduction
- Section 11 An application of Trees : "Set" representation
- Section 12 Binary Trees
- Section 13 Graphs : An Introduction
- Section 14 Graph Representation
- Section 15 Graph search: Depth First Search (DFS) and Breadth First Search (BFS)
- Section 16 Graph application : Finding Connected Components of a graph
- Section 17 Graph application : Minimum Spanning Tree algorithm
- Section 18 Implementation of the Minimum Spanning Tree Algorithm
- Section 19 Graph application: Dijkstra's Shortest Path Algorithm
- Section 20 Internal Sorting Techniques : Introduction
- Section 21 Internal Sorting: Insertion Sort
- Section 22 Internal sorting : Quicksort
- Section 23 Internal sorting : Mergesort
- Section 24 Internal Sorting : Heapsort
- Section 25 Internal sorting : Radix Sort
- Section 26 Supplementary Section
What You’ll Learn
- Understand the fundamentals of Data Structures thoroughly through hands-on coding, Learn to analyze programs, Learn to see a bigger picture of design of algorithms in general
Skills covered in this course
Reviews
-
RRamith B Nayak
good experience , simple ,to the point course , was in sync with my syllabus.
-
SShylaja Harinath
Slow and examples could have been better
-
ssona Haligera
So I have taken a Udemy course on learning data structures using C programming. How was my experience with the course? Was it helpful in understanding data structures?
-
SSakshi Hemant Pagare
it was amazing