Algorithms in C - Concepts, Examples, Code + Time Complexity

Algorithms in C : Concepts, Examples, Code + Time Complexity, available at $19.99, has an average rating of 3.85, with 34 lectures, 7 quizzes, based on 67 reviews, and has 2176 subscribers.

You will learn about Learn the concepts behind Most Popular Algorithms used in Computer Science Understand how algorithms work with the help of diagrams, examples and pseudocode Practise Algorithm Implementation with the help of included Programs in C language Understand how to use algorithms to implement most important logics in any programming. This course is ideal for individuals who are Computer Science Students who are taking Algorithms as an Academic Course or IT students and Developers who want to learn how to design and implement logic for any programs or Job aspirants who want to want to be successful at Developer Interviews or Non IT Students who wish to understand logic for writing efficient code or Anyone interested in learning most popular algorithms It is particularly useful for Computer Science Students who are taking Algorithms as an Academic Course or IT students and Developers who want to learn how to design and implement logic for any programs or Job aspirants who want to want to be successful at Developer Interviews or Non IT Students who wish to understand logic for writing efficient code or Anyone interested in learning most popular algorithms.

Enroll now: Algorithms in C : Concepts, Examples, Code + Time Complexity

Summary

Title: Algorithms in C : Concepts, Examples, Code + Time Complexity

Price: $19.99

Average Rating: 3.85

Number of Lectures: 34

Number of Quizzes: 7

Number of Published Lectures: 34

Number of Published Quizzes: 7

Number of Curriculum Items: 41

Number of Published Curriculum Objects: 41

Original Price: $89.99

Quality Status: approved

Status: Live

What You Will Learn

Learn the concepts behind Most Popular Algorithms used in Computer Science

Understand how algorithms work with the help of diagrams, examples and pseudocode

Practise Algorithm Implementation with the help of included Programs in C language

Understand how to use algorithms to implement most important logics in any programming.

Who Should Attend

Computer Science Students who are taking Algorithms as an Academic Course

IT students and Developers who want to learn how to design and implement logic for any programs

Job aspirants who want to want to be successful at Developer Interviews

Non IT Students who wish to understand logic for writing efficient code

Anyone interested in learning most popular algorithms

Target Audiences

Computer Science Students who are taking Algorithms as an Academic Course

IT students and Developers who want to learn how to design and implement logic for any programs

Job aspirants who want to want to be successful at Developer Interviews

Non IT Students who wish to understand logic for writing efficient code

Anyone interested in learning most popular algorithms

Algorithms in C : Concepts, Examples, Code + Time Complexity (Recently updated : January?14, 2017!)

What’s New: Time Complexity of Merge Sort,?Extended Euclidean Algorithm in Number Theory section,?New section on Transform and Conquer algorithms

Algorithms are very important for programmers to develop efficient software designing and programming skills. This Course introduces you to most important algorithms in computer science. Each video explains the concept/logic behind the algorithm, provides an example and explains pseudo-code. Each video also has working C programs of algorithm implementations with sample input & output. This course will help you crack those programming interviews on algorithms.

Why Take this Course?

Most of the companies in today’s world depend on software for their daily operations. How do these software take right decisions and keep these companies running in the right direction? Well, it’s all in their programming. Programmers over the decades have been writing code which perform right operations in right conditions. This is done using Algorithms.

Taking this algorithms course will help you to understand how to implement logic in the form of a code in an optimal way and also enables you to write the programs efficiently. In this course you will learn how the most important and most common algorithms used in programming are designed and implemented. This course will kick start your journey in the world of programming with algorithms.

How is this course designed?

This Course is structured into following sections:

Overview: This section introduces you to the course, provides information about the author, course structure and gives you answers to some of the frequently asked questions by students.

Brute Force:This section explains the brute force approach to problem solving. You will understand the how the algorithms selection sort, bubble sort, sequential search and string matching work.

Divide and Conquer: This section deals with algorithms based on Divide and Conquer technique. Two sorting algorithms – quick sort and merge sort are explained.

Decrease and Conquer:In this section decrease and conquer approach and its variants are explained. Binary search and insertion sort algorithms are explained with an example.

Transform and Conquer: Significance of transform-and-conquer technique and algorithms like heap-sort will be explained here. Lectures on Heaps, heap construction and heapsort algorithm are added. Each algorithm is explained with an example in a lucid way.

Dynamic Programming: This section explains how to solve problems with overlapping sub-problems. Warshall’s algorithm and Floyd’s algorithm are explained.

Greedy Technique: This section explains algorithms based on Greedy technique. Section begins with explanation on minimum spanning tree concept. Two algorithms (Prim’s and Kruskal’s) to construct a minimum spanning tree of a given graph are explained step-by-step.

Number Theory : This section deals with the algorithms involving numerical computations. Euclid’s Algorithm, Extended-Euclidean Algorithm and?RSA algorithm are explained with example.

Time Complexity :This section explains the importance of time complexity analysis, the asymptotic notations to denote the time complexity of algorithms.

Also, each algorithm’s time complexity is explained in separate video lectures.

Students can benefit by learning about designing and implementing algorithms in C. Job Seekers can also benefit by using the information in preparing for their programming interviews.

Once you are enrolled, you get a life time access to all the resources and lectures in this course. This course is always evolving with new lectures, resources and quizzes to keep you up-to-date. So take this course now and learn how to design and implement algorithms.

Course Curriculum

Chapter 1: Introduction

Lecture 1: Course Introduction and Author Bio

Lecture 2: Course Curriculum & Upcoming lectures

Chapter 2: Brute Force Approach

Lecture 1: Selection Sort Algorithm

Lecture 2: Bubble Sort Algorithm

Lecture 3: Sequential Search Algorithm

Lecture 4: Brute Force String Matching Algorithm

Chapter 3: Divide and Conquer Approach

Lecture 1: Merge Sort Algorithm

Lecture 2: Quick Sort Algorithm

Chapter 4: Decrease and Conquer Approach

Lecture 1: Binary Search Algorithm

Lecture 2: Insertion Sort Algorithm

Lecture 3: Depth First Search Algorithm

Lecture 4: Breadth First Search Algorithm

Chapter 5: Transform and Conquer Approach

Lecture 1: Heaps

Lecture 2: Heap Construction [bottom-up approach]

Lecture 3: Heap Sort Algorithm

Chapter 6: Dynamic Programming

Lecture 1: Warshalls Algorithm

Lecture 2: Floyds Algorithm

Chapter 7: Greedy Technique

Lecture 1: Prims Algorithm

Lecture 2: Kruskals Algorithm

Chapter 8: Bonus Section : Time Complexity

Lecture 1: Introduction to Analysis of Algorithms

Lecture 2: Asymptotic Notations

Lecture 3: Time Complexity – Selection Sort Algorithm

Lecture 4: Time Complexity – Bubble Sort Algorithm

Lecture 5: Time Complexity – Sequential Search Algorithm

Lecture 6: Time Complexity – String Matching Algorithm

Lecture 7: Time Complexity – Insertion Sort Algorithm

Lecture 8: Time Complexity – Warshalls Algorithm

Lecture 9: Time Complexity – Floyds Algorithm

Lecture 10: Master Theorem

Lecture 11: Time Complexity – Merge Sort Algorithm

Chapter 9: Number Theoretic Algorithms

Lecture 1: Euclids Algorithm [GCD of two numbers]

Lecture 2: C Program on Euclids Algorithm

Lecture 3: Extended Euclidean Algorithm

Lecture 4: RSA Algorithm

Instructors

Engineering Mentor
Courses for IT students

Pratibha B.
IT Professional, Instructor

Rating Distribution

1 stars: 5 votes

2 stars: 7 votes

3 stars: 14 votes

4 stars: 19 votes

5 stars: 22 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!