Algorithms in C : Concepts, Examples, Code + Time Complexity Udemy CourseDownload Course
Algorithms in C : Concepts, Examples, Code + Time Complexity Course Created by Engineering Mentor, Pratibha B..
Algorithms in C : Concepts, Examples, Code + Time Complexity has 4.0 rating out of 5 based on 67 students. Currently this course has 2,170 students. Course langwage is English.
Algorithms in C : Concepts, Examples, Code + Time Complexity Course Description
C Algorithm: Concepts, Examples, Code + Time Complexity (Recently Updated: January 14, 2017!)
New features: Time complexity of merge sort, extension of number theory section New section of Euclidean algorithm, transformation and conquest algorithm
Algorithms are very important for programmers to develop efficient software design and programming skills. This course introduces you to the most important algorithms in computer science. Each video explains the concepts / logic behind the algorithm, gives examples, and explains pseudocode. Each video also has a working C program with an algorithm implementation with sample inputs and outputs. This course will help you crack programming interviews about algorithms.
Reasons for taking this course
Most companies in the world today rely on software for their day-to-day operations. How do these software make the right decisions and keep these companies moving in the right direction? Well, it's all in their programming. Programmers have been writing code for decades to perform the right operations under the right conditions. This is done using an algorithm.
This algorithm course will help you understand how to best implement logic in code format and program efficiently. In this course, you will learn how the most important and most common algorithms used in programming are designed and implemented. This course begins your journey into the world of algorithmic programming.
How is this course designed?
This course consists of the following sections:
Overview: This section introduces you to the course, provides information about its creator, course structure, and provides answers to frequently asked questions from students.
Brute Force: This section describes a brute force approach to problem solving. Understand how the algorithms selection sort, bubble sort, sequential search, and string collation work.
Divide and Conquer: This section describes algorithms based on Divide and Conquer. Describes two sorting algorithms, quicksort and merge sort.
Decrease and Conquest: This section describes the reduction and conquest approach and its variants. The algorithm of binary search and insertion sort is explained with an example.
Transformation and Conquest: We'll discuss transformation and conquest techniques and the importance of algorithms such as heapsort. Lectures on heaps, heapbuilding, and heapsort algorithms have been added. Each algorithm is explained in an easy-to-understand manner using examples.
Dynamic programming: This section describes how to solve the problem of duplicate sub-problems. Describes the Worshall algorithm and the Floyd algorithm.
Greedy algorithm: This section describes algorithms based on the greedy algorithm. The section begins with an explanation of the concept of a minimal spanning tree. Two algorithms (Prim's and Kruskal's methods) for constructing the minimum spanning tree of a given graph are explained step by step.
Number Theory: This section describes algorithms that include numerical calculations. The Euclidean algorithm, the extended Euclidean algorithm, and the RSA algorithm are explained with examples.
Time Complexity: This section describes the importance of time complexity analysis and the asymptotic notation that indicates the time complexity of the algorithm.
Also, the time complexity of each algorithm is explained in a separate video lecture.
Students can benefit from learning about algorithm design and implementation in C. Job seekers can also benefit from using the information to prepare for a programming interview.
Register for lifetime access to all resources and lectures in this course. This course is evolving with new lectures, resources, and quizzes to keep you up to date. Therefore, take this course now to learn how to design and implement algorithms.
Engineering Mentor is an online education startup that provides educational resources for IT and non-IT students. Engineering mentors create high quality resources in a clear and easy-to-understand way.
We have a team of qualified engineers, creating resources to guide students through the most difficult aspects of technical and non-technical education.
Pratibha holds a master's degree in computer science and has been in the IT industry since 2010.
Pratibha has worked with Infosys Company for clients such as Cisco. She is a CCNA certified engineer with experience in automation and manual testing. Pratibha has been in an expert teacher group of engineering mentors for over a year and is actively involved in online and offline education on software testing.
Algorithms in C : Concepts, Examples, Code + Time Complexity Course for
- 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
Download Algorithms in C : Concepts, Examples, Code + Time Complexity course from UdemyDownload Course