What will you need to know or do before starting the course?
1 The full training program is divided into few courses. It is recommended to finish all previous courses of this training programme. There may be some references which are taken from the previous courses.
2 If you wish to take all the courses, I recommend to take the courses in sequence to get WHOLE of this training programme.
3 A spare working computer with gcc compiler(preferably) or virtualization software like VMWare Fusion or Virtual Box.
4 This course assumes that the students have some background in mathematical concepts and formal reasoning.
Who should take this course? Who should not?
1 Job seekers who are preparing for interview in Product MNC/e-commerce/service companies. Anyone who has deep desire to learn Data Structures And Algorithms,Competitive Programming.
2 Undergraduates, Graduates and Post-Graduates
3 Software developers, computer science engineers and students who wish to strengthen their software problem-solving ability.
4 Experienced software engineers who are looking to refresh important fundamental concepts
5 If you're fed up with academia centric courses on Data Structures & Algorithms and want to intuitively & practically understand how to implement and the most popular algorithms and data structures in software, then this course is for you.
6 If you want to learn popular data structures and algorithms at a deep level, then this course is for you.
7 If you are a software developer with a good grasp of the fundamentals of Programming, and you are confident with the essentials but want to delve deeper and understand data structures and algorithms, then this course is for you.
8 This course is meant for everyone from scientists to software developers who want to get closer to algorithmic thinking.
9 This is a course for professionals and students in occupational group in any organization or academics to help them to understand the basics of Algorithms and data structures that they should know well.
10 For college going students, this course will help in improving grades in college curriculum.
What Will I Learn?
1 SW Problem Solving
2 Algorithm Complexity
3 Bit Operations
4 Number Bases
5 Floating Point Numbers
6 O(Big-Oh)-Notation, (Big-Omega)-Notation, (Theta)-Notation
7 Endianness
8 Exhaustive Search Method
9 Combinatorial Problem
10 Baby Gin Problem
11 Brute-Force
12 Permutation
13 Lexicographic–Order
14 Johonson-Trotter
15 Combination
16 Minimum-exchange Requirement
17 Subset
18 Knapsack Problem and Fractional Knapsack Method
19 Greedy Algorithm and Application of Greedy Approach
20 Recursive Algorithm Applying Greedy Method
21 Comparison of Greedy Method and Dynamic Programming
22 Representative Algorithms of Greedy Methods
23 Huffman coding
24 Change Reducing Problem
25 Meeting Room Scheduling
26 Divide and Conquer
27 Merge Sort
28 Quick sort
29 Hoare Partition
30 Lomuto Partition
31 Binary Search
32 Power Set
33 Backtracking
34 Maze Finding
35 State Space Tree
36 8-Queens Problem
37 Subset
38 Power Set
39 Permutation
40 Graphs
41 Search
42 Disjoint Sets
43 Expression of Linked List
44 Minimum Spanning Tree
45 Prim Algorithm
46 Kruskal Algorithm
47 Shortest Path
48 Dijkstra Algorithm
49 Bellman-Ford Algorithm
50 Floyd-Warshall Algorithm
51 The full training program is divided into few courses. If you wish to take more courses, I recommend to take the courses in sequence to get WHOLE of this training programme.
52 To receive certification that you have completed the course, you must attend the course in full.
53 When you complete this course, you will be able to understand the terminologies and concepts of Algorithms for software development.
54 You will be able to apply the roles of Algorithms in products and various components of the software product.
55 This course is designed to improve the software developer’s implementation capabilities by covering the algorithms and data structures to improve implementation ability.
56 This course will allow developers to build the concepts in algorithms and learn how to apply them in real world tasks.
57 Job seekers who are preparing for interview in Product MNC/e-commerce/service companies. Anyone who has deep desire to learn Data Structures And Algorithms,Competitive Programming.
58 For college going students, this course will help in improving grades in college curriculum.
What is the course about?
For me, the biggest difference is that you cannot look up algorithms like you can look up syntax or documentation.
Generally software development involves learning new technologies on a daily basis. You get to learn most of these technologies while using them in one of your projects. However, it is not the case with algorithms.
If you don't know algorithms well, you won't be able to identify if you can optimize the code you are writing right now. You are expected to know them in advance and apply them wherever possible and critical.
This is the third part of the Training programme on Algorithms and Data Structures which covers the essential information that every serious programmer needs to know about algorithms and data structures. This course will cover SW Problem Solving, Algorithm Complexity, Bit Operations, Number Bases, Floating Point Numbers, O(Big-Oh)-Notation, (Big-Omega)-Notation, (Theta)-Notation, Endianness, Exhaustive Search Method, Combinatorial Problem, Baby, Gin Problem, Brute-Force, Permutation, Lexicographic–Order, Johonson-Trotter, Combination, Minimum-exchange Requirement, Subset, Knapsack Problem and Fractional Knapsack Method, Greedy Algorithm and Application of Greedy, Approach, Recursive Algorithm Applying Greedy Method, Comparison of Greedy Method and Dynamic Programming, Representative Algorithms of Greedy Methods, Huffman coding, Change Reducing Problem, Meeting Room Scheduling, Divide and Conquer, Merge Sort, Quick sort, Hoare Partition, Lomuto Partition, Binary Search and Power Set,Backtracking, Maze Finding, State Space Tree, 8-Queens Problem, Subset, Power Set, Permutation, Graphs, Search, Disjoint Sets, Expression of Linked List, Minimum Spanning Tree, Prim Algorithm, Kruskal Algorithm, Shortest, Path, Dijkstra Algorithm, Bellman-Ford Algorithm and Floyd-Warshall Algorithm. This comprehensive course will give you enough understanding on algorithms and data structures from where you can take yourself to higher level of expertise.
The optimisation is always a tradeoff between CPU and memory. The more memory the less CPU and conversely. The way they are affected is described using the Big O notation. Both the CPU and memory have their Big O notation behaviour. Take a look here Big-O Algorithm Complexity Cheat Sheet. The complexity gives a clue about the scalability of the algorithm. Will the algorithm run 2 times slower if there is 2 more elements or it will be the same ? On the memory side, the same rules apply. Will the algorithm require 2 times more memory for processing an array with 2 times more elements ? or is this a fixed amount of memory (in place processing). Choosing the right algorithm should rely on understanding how it will cost in term of CPU and memory.
You basically won't ever get an interview that won't require you to have some foundational knowledge in computer science, and such interviews will often ask you about complexity of various algorithms.
You will be taught all the skills needed for Algorithms and data structures from the basic fundamentals to the very complicated level of details and tricks related to the languages.
This course will benefit you to perform your programming jobs better and also help you to get to better positions, with confidence, in case you are looking out for jobs.This course will help you to to handle Algorithm based interview with more confidence.
This course is not based on any one programming language. Its a concept based training program which deals with psuedo code. This can be applied to any language viz C, C++, Java, Python etc
Please remember that this is a serious course on algorithms. I believe that subjects like algorithms and data structures cannot be learned in few hours or days. It required continuous practice. Students may have to put a lot of efforts in order to become expert in programming and make the best use of this course. This course covers the essential information that every programmer needs to know about algorithms and data structures.
If you are:
1. Tired of finding good learning resources on Algorithms ?
2. Do you want to become a expert level Programmer ?
3. Are you ready to learn how Big-Oh,Brute-Force,Combinatorial,BabyGin,Lexicographic–Order,Johonson-Trotter,Combination,Knapsack,Huffman and Partitions works ?
4. As a Bonus, get a complimentary consultation about Linux OS and Linux Kernel Internals, Algorithms, Data Structures, HTML, C and Java Programming languages.
5. So if you’re looking for knowledge, a rewarding adventure, and the advantage a future perspective can offer, I’m excited to tell you more about my step-by-step training program for Algorithms and Data Structures.
What kind of material is included?
1. This course consists of high quality training content using quality videos with industry oriented hands-on examples.
2. I have tried to include the juice of my 10 years of experience in this course.
3. The focus is on giving real life essential tricks and skills.
4. I suggest students to take this course with pen and paper handy. Note the important points and take part in discussions. The exercise is the most important part in learning any subject. I advise students to take the problems after each section.
How long will the course take to complete?
1. This is the comprehensive course covering almost all the topics of algorithms and data structures.
2. I advise students to cover not more than one lesson/section per day and do not move to the next lesson/section without doing the exercise.
How is the course structured?
1. A perfect blend of theory and programming.
Why take this course?
0. Algorithms is the hot subject for interviewers. This course will surely help.
1. This is the comprehensive course covering almost all the topics of algorithms and data structures.
2. This course will tends to replace text books ie it will be a complete reference of algorithms and data structures.
3. For the college going students, this course helps in improving grades in college curriculum and increases the chances at the final Campus Interview.
4. Algorithms is a difficult subject, I have tried hard to make my delivery easy and effective.
When does the course start and finish?
The course starts now and never ends! It is a completely self-paced online course - you decide when you start and when you finish.
How long do I have access to the course?
How does lifetime access sound? After enrolling, you have unlimited access to this course for as long as you like - across any and all devices you own.
Join worldwide learners who uses Algorithms and DS as part of their curriculum and Job.