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
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
Learn What are Data Structures.
Comparing
1. Data Structure
2. Database
3. Datawarehouse
4. Big Data
Learn How program uses Main Memory. How program uses sections of Memory
Learn How function uses Stack, how memory is allocated when the function is called.
Learn how Heap is used with the help of Pointers
Difference between Physical and Logical Data Structures
Physical : Array and Linked List
Logical : Stack,Queues, Trees, Graphs, Hashtables
Learn what does it mean by Abstract Datatypes
Learn How to Analyse Time and Space of any Algorithm on Data Structures, based on working of Algorithm
Learn How to Analyse based on Code of Algorithm
Learn how to trace a Recursion
General form of Recursion and its phases
1. Ascending Phase
2. Descending Phase
Learn how Recursion uses Stack
Learn how to find the Time complexity of Recursion using Recurrence Relation
Learn how Static and Global variables are used in Recursion
Learn What does it mean by Tail Recursion, a recursion processing at calling time
Learn what does it mean by Head Recursion, a recursion processing at returning time
Learn Tree Recursion, a Recursion calling itself more than one time
Learn Indirect Recursion. two or more functions calling each other recursively.
Learn Nested Recursion. a Function call is passed as parameter to itself.
Finding Sum of first n natural numbers using Recursion and Iteration
Finding Factorial using Recursion.
Finding Power using Recursion and computing using less number of multiplications
Recursive function for Taylor Series using Static variables
Apply Horner's Rule to reduce number of multiplications in Taylor Series.
Learn about Fibonacci Series.
1. Iterative method for Fibonacci Series.
2. Recursive Method.
3. Using Memoization
Learn how to devise a Recursive function for nCr formula using Pascals Triangle
Devising a Recursive function for Tower of Hanoi
1. What is an Array
2. Declaring and Initialising Array
3. Accessing Elements of an Array
Learn how to create Array in Stack and Heap.
How to change Size of an Array
Learn various methods of creating 2D Array
How Compiler manage Arrays, How compilers use Relative addresses
Learn how Compilers use Relative address for Representing 2D arrays
Learn how Compilers use Relative address for Representing nD arrays
Learn how Compilers use Relative address for Representing 3D arrays
OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.
Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.
Find this site helpful? Tell a friend about us.
We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.
Your purchases help us maintain our catalog and keep our servers humming without ads.
Thank you for supporting OpenCourser.