In this course you’ll learn in a practical way, with a combination of slides and demo code, the basic aspects of the C programming language and tools, so that you can start being productive with the C language.
Starting from this course page, you can freely play the course overview, and read a more detailed course description and the table of content.
Some of the major topics include: understanding the role of the C compiler, and compiling from both the command line and using an IDE; learning about common basic types and basic I/O; learning the syntax for decision making in C (e.g. the if-else and switch statements) and how to write loops (e.g. for, while and do-while); the basics of working with strings; learning how to write your own functions. Pointers will be introduced, as well.
I’ll also show some subtle C beginner’s bugs, I will analyze them and discuss how to fix them.
Inspecting the content of a C string.Discussing the memory layout of strings in C.Analyzing a subtle bug.Introducing pointers in C.
These are some feedback notes frommy reviewers:
The content is presented with great clarity and is organized effectively. Great module. [Peer Review]
I really like that your demos are very concise and tightly focused on the syntax and concepts you’re explaining. There’s nothing extra to cause confusion. Well done! [Peer Review]
Your code slides are well-designed and easy to read. [Peer Review]
I REALLY like that you explained the potential problem with […]. I wish more people would heed the advice you present here. [Peer Review]
Very clean module with clear explanations and demos. Great job! [Peer Review]
Just a heads up to let you know that Pluralsight is offering 33% off Annual and Personal Premium subscriptions for a limited time: offer valid Aug 17th – Aug 28th.
In this course, you’ll learn with a combination of slides and demo code, how to use associative containers like std::set, std::map, and std::unordered_map.
This is a follow up course of my previous course, which I encourage you to watch before this one.
Starting from this course page, you can freely play the course overview, and read a more detailed course description and the table of content.
Comparing the performance of std::unordered_map vs. std::map.Analyzing a subtle bug when working with std::map.
These are some feedback notes frommy reviewers:
Nice use of the PowerPoint slides and Camtasia callouts to keep the learners focused and engaged. [Peer Review]
Enjoyable clip of std::map string to string dictionary translation. [Peer Review]
Overall, a strong module that’s well-explained, approachable and professionally polished. Looking forward to more! [Peer Review]
The content is logically sequenced, building on concepts as we go. The clips are nice and short, which makes it easy to move through and absorb the content. You also do a great job transitioning across the clips; there’s a cohesive flow to the module. [Peer Review]
I’m glad you showed this error, explained why it’s happening, and how to fix it. It’s a good opportunity to reiterate learnings from earlier in the module, and also seems like a common gotcha. [Peer Review]
In this course, you’ll learn how to use some important containers implemented in the C++ Standard Library, with a combination of theoretical introduction using slides, and practical C++ implementation code, including analyzing and fixing some common bugs.
Comparing the memory layout of std::list vs. std::vector.
C++ Standard Library implementations offer high-quality well-tested and highly-optimized standard containers, that are very powerful tools when developing software written in C++.
In particular, I’ll discuss std::vector (which is a Standard Library workhorse), std::array, and std::list, including how to use them, discussing their pros and cons, and giving some guidance on picking one or the other, based on the problem at hand. Other containers (e.g. std::map) will be the topic of follow-up courses.
No prior knowledge of C++ Standard Library containers is required. You only need a basic knowledge of C++ language features.
Working on the implementation of a case-insensitive string search.
Containers and algorithms are kind of like “bread and butter”, so in this course you’ll also learn about the C++ Standard Library design based on the teamwork between containers, iterators and algorithms, and you’ll see how to perform important operations on containers leveraging some useful algorithms already implemented in the C++ Standard Library.
Explaining the erase-remove idiom.
Note that this course is boththeory and practice! In fact, I’ll show practical demo code, and I’ll also discuss some bugs that are especially common for those who are just starting to learn the C++ Standard Library’s containers.
Analyzing a subtle bug when working with std::list.
These are some feedback notes from my reviewers:
The narration is clear, animated, and engaging. The visuals are particularly helpful. [Peer Review]
You do a particularly good job clearly stating the problem here (and elsewhere) so that the solution, when it comes, makes sense and fits nicely. [Peer Review]
Great simple example of undefined behavior to reinforce the concepts you’ve introduced as well as a bonus of uncovering a security issue. [Peer Review]
Very nice module with good examples. Also excellent visuals when describing list, vectors and the various operations. [Peer Review]
Very nice discussion of the trade-offs between a linked list and a vector [Peer Review]
Nice use of a bug to teach a key concept [Peer Review]
Starting from this course page, you can freely play the course overview, and read a more detailed course description and the table of content.
Let me also express my gratitude to all the Pluralsight persons involved in the production of this course: It’s always a pleasure to work with you all!
