- Fundamentals with hands on coding sessions , Learn about Data Structures, Containers , NTL , Algorithms
- Free tutorial
- Rating: 4.0 out of 54.0 (84 ratings)
- 5,524 students
- 1hr 17min of on-demand video
- Created by Abhinav Raj
English
What you’ll learn
- Data Structures
- Algorithms
- NTL
- Containers
Requirements
- Basic Programming Experience in C or C ++
Description
This course lets you dive into designing data structures and algorithms with the use of containers and libraries such as STL and NTL. It also introduces you to dynamic programming and advanced arithmetic and polynomial calculation using C++.
About
After trying out various other names, Stroustrup began work on an upgrade for C with Classes in 1982 and gave it the name “C++” (++ is the increment operator in C). Virtual functions, function name and operator overloading, references, constants, type-safe free-store memory allocation (new/delete), better type checking, and single-line comments in the BCPL style with two forward slashes (//) were among the new features added. Additionally, Stroustrup created Cfront, a brand-new C++ standalone compiler.
Stroustrup introduced the first stream input/output library in 1984. Doug McIlroy[1] proposed the idea of supplying an output operator rather than a specific output function (who had previously suggested Unix pipes). The ideas listed below have served as the foundation for C++’s development and progress over the years:
- Its features must be instantly applicable to real-world programs and must be motivated by realistic challenges.
- Every function ought to be implementable (with a reasonably obvious way to do so).
- Programmers should be allowed to choose their preferred programming approach, and C++ should fully support that approach.
- It should offer tools for segmenting programs into distinct, well-defined components and tools for joining independently created parts.
- User-created types require the same level of support.
Who this course is for:
- Object Oriented Programmers and Developers
Show less
Course content
3 sections • 15 lectures • 1h 16m total lengthCollapse all sections
Introduction1 lecture • 6min
- Data Structures and Algorithms in C++ : Introduction05:55
Data Structures9 lectures • 53min
- Data Structures and Algorithms in C++: Stack and Queue06:12
- Data Structures and Algorithms in C++ : Stack and Queue00:37
- Data Structures and Algorithms in C++ : Deque07:27
- Data Structures and Algorithms in C++ : Polymorphism02:00
- Data Structures and Algorithms in C++ : Polymorphism01:36
- Data Structures and Algorithms in C++ : Binary Tree13:28
- Data Structures and Algorithms in C++ : Binary Tree07:01
- Data Structures and Algorithms in C++ : Heap13:54
- Data Structures and Algorithms in C++ : Heap01:05
Algorithms5 lectures • 18min
- Data Structures and Algorithms in C++ : Searching and Sorting Algorithms03:05
- Data Structures and Algorithms in C++ : Searching and Sorting Algorithms00:39
- Data Structures and Algorithms in C++ : Searching and Sorting07:46
- Data Structures and Algorithms in C++NTL : Polynomials and Arithmatic Operations02:42
- Data Structures and Algorithms in C++ : Greedy Algorithms03:22
