
I would suggest watch each lecture you will understand the concept undoubtedly, even in the each lecture i have explained well and executed the each program, once you are done with lecture please practice each program 10 times, take book and pen write it 10 times each program, that way each program will be added to you mind, your mind feel relaxed with this practice, that way upcoming topics you will understand very quick with quality, this practice makes you to write great programs/algorithms/code
You will definitely see wonders writing each program 10 times,
Don't be hurry to complete the course, practice more times.....practice..practice... practice, write it on book each program.......
Remember if you are using book and pen it is not a big deal....
Learn to implement linear search in c#.net by creating a data structures project, building a console app, and coding a linear search that scans array and returns index or -1.
Linear Search Source Code to Practice 10 times, that enables your mind habituating to algorithms
Explore binary search with recursion by implementing a self-calling function that uses low, high, and mid to locate a key in an array, returning the index or -1.
Demonstrates coding a selection sort in a C#.net console project: set up folders, create program structure, implement the sort with i and j loops, and swap the minimum.
Explore insertion sort using two arrays, copying from a to b and shifting elements with i and j, until every key lands in its correct position for a sorted result.
Build a practical merge sort in c#.net by creating a console app, implementing the divide-and-conquer merge process with low, mid, and high indices, and printing the sorted results.
Learn to implement a stack with a linked list in C#.Net, using a top pointer to perform push, pop, peek, and display operations in last in, first out order.
In this course you will learn all the Data Structures concepts using C#.net
I have spent more than 100 hours to create this course and explained with execution of each concept in detailed, you can download all the source code and Power point presentations, can post any questions and get answered quickly.
Searchings
Linear Search
Binary Search
Binary Search With Recursion
Sorting,
Bubble Sort
Selection Sort
Insertion Sort
Quick Sort
Merge Sort
Stacks
Stack Push, Pop, Peek, Display operations.
Queues,
Queue Insert, Delete, Display operations
Circular Queue
Circular Queue Insert, Delete, Display operations
Double Ended Queue
Double ended Queue Insert front, insert rear, Delete front, Delete rear, Display front to rear, Display rear to front operations
Linked List
Linked List Insert, Delete, Display, Search Element operations.
Stack Using Linked List
Stack Linked List Push, Pop, Display operations
Queue using Linked List
Queue Linked List Insert, Delete, Display operations.
Circular Linked List
Circular Linked List Insert, Delete, Display operations.
Double Linked List
Double Linked List Insert, Delete, Display, Search Element operations.
Trees,
Binary Trees
Binary Search Tress
PreOrder
InOrder
PostOrder
Insert Element
Delete Element
AVL Trees
Height of the Element
Balancing Factor
LL Rotation
RR Rotation
LR Rotation
RL Rotation
Graphs
Breadth For Search (BST)
Depth For Search (DFS)