Buying for a Team? Gift This Course
Wishlisted Wishlist

Please confirm that you want to add Data Structures and Algorithms in C# to your Wishlist.

Add to Wishlist

Data Structures and Algorithms in C#

The most detailed course with in-depth explanations of concepts and implementation
4.2 (126 ratings)
Instead of using a simple lifetime average, Udemy calculates a course's star rating by considering a number of different factors such as the number of ratings, the age of ratings, and the likelihood of fraudulent ratings.
832 students enrolled
Last updated 9/2016
English
$10 $95 89% off
5 days left at this price!
30-Day Money-Back Guarantee
Includes:
  • 10.5 hours on-demand video
  • 1 Supplemental Resource
  • Full lifetime access
  • Access on mobile and TV
  • Certificate of Completion
Have a coupon?
Description

This is a thoroughly detailed course that uses lots of animations to help you visualize the concepts.

This course will help you develop a strong background in Data Structures and Algorithms. The course is broken down into easy to assimilate short lectures, and after each topic there is a quiz that can help you to test your newly acquired knowledge. The examples are explained with animations to simplify the learning of this complex topic. Complete working programs are shown for each concept that is explained.

This course provides a comprehensive explanation of data structures like linked lists, stacks and queues, binary search trees, heap. Various sorting algorithms with implementation and analysis are included. Concept of recursion is very important for designing and understanding certain algorithms so the process of recursion is explained with the help of several examples.

Throughout the course, a step by step approach is followed to make you understand different Data Structures and Algorithms. Through this course you can build a strong foundation in Data Structures and Algorithms that can help you to crack coding interviews and work in the industry.

In this course, C# is used for implementing various Data Structures and Algorithms, but you can easily implement them in any other language like C++, Java or Python.

What students are saying about this course-

"I really like this course and am learning a lot, even though I studied Data Structures during my college days no one explained like this way. Very detail oriented and simply superb! Keep up the great work!"  

"This is an excellent course - very similar to the Intro to Data Structures and Algorithms course I took in college. The diagrams and pictures are very helpful. The examples are all written out in clear and simple C# code. If your goal is to be able to whiteboard coding algorithms this course is a good place to start."

"short and precise introduction, author is convincing as efficient instructor"

"Very informative and the visual style helped picture it better." 

"Nice explanation of Trees and Binary Tree" 

"Very clear and concise explanations and examples. I learned a lot of data structures." 

"the explanation is clear and easily understandable"  

"Concepts explained neatly !!"  

"The lectures are clear and precise." 
 

Who is the target audience?
  • Programmers looking for jobs
  • Programmers wanting to write efficient code
  • Computer Science students having Data Structures as part of their curriculum
  • Non Computer science students wanting to enter IT industry
Students Who Viewed This Course Also Viewed
What Will I Learn?
Over 100 Quiz questions
Ability to analyse algorithms
Knowledge of basic Data Structures and various sorting algorithms
Ability to write and trace recursive algorithms
Ability to write programs for different Data Structures and Algorithms
Confidence to face programming interviews
View Curriculum
Requirements
  • Basic knowledge of programming in C#
Curriculum For This Course
Expand All 146 Lectures Collapse All 146 Lectures 10:35:14
+
Introduction
1 Lecture 01:24
+
Introduction to Data Structures and Algorithms
12 Lectures 44:11
Data Structures and Algorithms
04:20

Measuring Running time of Algorithms
03:06

Asymptotic Analysis
03:14

Big O Notation
03:40

Finding Big O
04:24

Tight and Loose Upper Bounds
01:29

Introduction Quiz A
10 questions

Big O analysis of Algorithms
02:05

Finding Time complexity
02:57

Big O analysis of Algorithms: Examples
06:59

Worst case, Best case and Average Case Analysis
03:49

Common Complexities
03:03

Abstract Data Types
05:05

Introduction Quiz B
11 questions
+
Linked List
21 Lectures 01:50:06
Introduction
04:12

Traversing and Searching a Single Linked List
05:31

Finding references in a single linked list
05:22


Insertion in a Single Linked List ..contd
07:05

Deletion in a Single Linked List
03:46

Reversing a Single Linked List
02:45

Linked List Quiz A
9 questions

Sorting a Linked list using Bubble Sort
07:35

Merging of sorted Linked lists
11:51

Sorting a Linked list using Merge Sort
05:02

Finding and Removing a cycle in a Linked list
10:44

Doubly linked list
03:17

Insertion in a doubly linked List
06:15

Deletion from doubly linked list
05:12

Reversing a doubly linked list
02:49

Circular linked list
02:59

Insertion in a circular Linked List
03:58

Deletion in a circular linked list
03:40

Concatenation
03:22

Linked List with Header Node
04:48

Sorted linked list
05:27

Linked List Quiz B
8 questions
+
Stack and Queue
16 Lectures 01:20:07
Introduction
02:09

Stack
01:29

Array Implementation of Stack
05:18

Linked List Implementation of Stack
04:29

Queue
01:13

Array Implementation of Queue
06:56

Linked List implementation of Queue
04:32

Queue through Circular Linked List
03:19

Circular Queue
09:29

Deque
07:44

Priority Queue
03:13

Checking validity of an expression containing nested parentheses
06:19

Evaluating Arithmetc Expressions
03:22

Polish Notations
05:56

Converting infix expression to postfix expression
11:01

Evaluation of postfix expression
03:38

Stack and Queue Quiz
9 questions
+
Recursion
13 Lectures 35:06
Introduction
02:43

Flow of control in Recursive functions
02:10

Winding and unwinding phase
01:17

Factorial
02:42

Printing numbers from 1 to n
02:25

Sum of digits of an integer
03:36

Base conversion
02:13

Finding nth power of a number
01:55

Euclids Algorithm
03:12

Fibonacci Series
02:41

Tower of Hanoi
06:56

Tail recursion
01:50

Recursion vs. Iteration
01:26

Recursion Quiz
10 questions
+
Binary Tree
16 Lectures 01:02:48
Intoduction to trees
06:01

Binary Tree
06:48

Strictly Binary Tree and Extended Binary Tree
05:15

Full binary tree and Complete Binary Tree
04:58

Array Representation of Binary trees
03:26

Linked Representation of Binary Trees
01:18

Binary Tree Quiz A
10 questions

Binary Tree in C#
02:12

Traversal in Binary Tree
02:06


Inorder Traversal
04:55

Postorder Traversal
04:35

Level order traversal
03:17

Finding height of a Binary tree
03:00

Constructing Binary tree from Traversals
01:35

Constructing binary tree from inorder and preorder traversals
04:23

Constructing binary tree from inorder and postorder traversals
03:49

Binary Tree Quiz B
10 questions
+
Binary Search Tree
6 Lectures 36:08
Introduction
04:42

Traversal in Binary Search Tree
01:55

Searching in a Binary Search Tree
06:24

Nodes with Minimum and Maximum key
02:59

Insertion in a Binary Search Tree
07:38

Deletion in a Binary Search Tree
12:30

Binary Search Tree Quiz
9 questions
+
Heap
6 Lectures 25:57
Introduction
02:40

Heap Representation
02:12

Insertion in Heap
07:21

Deletion
08:05

Building a heap
04:33

Heap Applications
01:06

Heap Tree Quiz
7 questions
+
Sorting
38 Lectures 02:05:36
Introduction
05:02

Sort Stability
02:25

Selection Sort
01:49

Selection Sort : Example
01:18

Selection Sort in C#
02:58

Analysis of Selection Sort
02:20

Bubble Sort
02:24


Bubble Sort in C#
04:37

Improvement in Bubble Sort
02:19

Analysis of Bubble Sort
02:04

Sorting Quiz A
10 questions

Insertion Sort
02:37

Insertion Sort : Example
02:22

Insertion Sort in C#
03:52

Analysis of Insertion sort
04:40

Shell Sort
02:24

Shell Sort : Example
02:07

Shell Sort in C#
03:49

Analysis of Shell Sort
03:29

Merging two Sorted Arrays
07:06

Recursive Merge Sort
02:29

Recursive Merge Sort in C#
04:11

Analysis of Merge Sort
00:36

Iterative Merge Sort
01:31

Iterative Merge Sort in C#
03:11

Quick Sort
06:56

Quick Sort in C#
07:24

Analysis of Quick Sort
03:00

Binary tree sort
03:05

Binary Tree Sort in C#
01:51

Analysis of Binary Tree Sort
01:14

Heap Sort
07:02

Heap Sort : C# implementation and Analysis
02:11

Radix Sort
04:17

Radix Sort : C# implementation and Analysis
06:18

Address Calculation Sort
04:50

Address Calculation Sort in C#
02:35

Analysis of Address Calculation Sort
01:02

Sorting Quiz B
10 questions
+
Searching
5 Lectures 35:44
Linear Search
05:16

Variations of Linear Search
07:10

Binary Search
06:04

Implementation of Binary Search
14:19

Analysis of Binary Search
02:55
2 More Sections
About the Instructor
4.2 Average rating
315 Reviews
2,021 Students
6 Courses

Deepali Srivastava has a Master's degree in Mathematics and is the author of books "C in Depth" and "Data Structures Through C in Depth". She loves programming and is passionate about teaching. Whether writing a book or making a course, she always tries to present the concepts in a simplified way which helps students develop interest in the topic being taught. Her books have been appreciated by students and she hopes that her online courses will also prove to be helpful.

Report Abuse