C++, Short and Sweet, Part 1
4.3 (604 ratings)
Instead of using a simple lifetime average, Udemy calculates a course's star rating by considering a number of different factors such as the number of ratings, the age of ratings, and the likelihood of fraudulent ratings.
61,555 students enrolled
Wishlisted Wishlist

Please confirm that you want to add C++, Short and Sweet, Part 1 to your Wishlist.

Add to Wishlist

C++, Short and Sweet, Part 1

A first course on C++ based on the book Accelerated C++.
4.3 (604 ratings)
Instead of using a simple lifetime average, Udemy calculates a course's star rating by considering a number of different factors such as the number of ratings, the age of ratings, and the likelihood of fraudulent ratings.
61,555 students enrolled
Created by Jeremy Siek
Published 5/2012
English
English [Auto-generated]
Price: Free
Includes:
  • 5.5 hours on-demand video
  • 1 Article
  • Full lifetime access
  • Access on mobile and TV
  • Certificate of Completion
Description

This course is for beginners who want to get started writing programs in C++, taught by Jeremy Siek, a professor at the University of Colorado. No prior knowledge of C++ is assumed. The course is based on the excellent textbook Accelerated C++ by Andrew Koenig and Barbara E. Moo. Like the textbook, the course quickly dives into problem solving and making use of the C++ standard library, including strings, vectors, and lists. The emphasis is on teaching you the parts of C++ that you will most likely need in your day-to-day programming. This course is Part 1 of a planned two-part sequence. Part 1 covers the first seven chapters of Accelerated C++, in particular, Chapters 0 through 6. The course consists of six videos of 50-60 minutes each.

Part 2 of the course, forthcoming, will cover the second half of Accelerated C++, including how to write your own classes and generic functions.

Students Who Viewed This Course Also Viewed
Curriculum For This Course
7 Lectures
05:27:29
+
Part 1
7 Lectures 05:27:17

This first lecture covers Chapter 0 of the textbook Accelerated C++ by Koenig and Moo.

The topics covered in this lecture are

  1. the basic syntactic structure of C++ programs,
  2. how to define and call functions,
  3. how to create local variables,
  4. character-based output to a terminal,
  5. and the basics of namespaces.
Getting started
50:25

This lecture covers Chapters 1 and part of Chapter 2 of Accelerated C++.

The topics of the lecture are:

  1. rounding of floating-point numbers,
  2. character-based input from the keyboard,
  3. using the standard string class,
  4. and if statements for conditionally executing different statements.
Working with strings and if statements
54:51

This lecture covers Chapters 2 and 3 of Accelerated C++.

The topics  discussed in this lecture are:

  1. while and for statements for executing some statements many times,
  2. more operations on the string class,
  3. arithmetic and assignment operators for integers and floating-point numbers,
  4. and using the standard vector class.
Looping and working with batches of data
52:15

This lecture covers Chapter 4 of Accelerated C++.

The topics discussed in this lecture are:

  1. when to create a function and how to choose a good name,
  2. how to carefully refactor a program to better organize it using functions,
  3. parameter passing with references and const references,
  4. how to use the standard sort function,
  5. and exception handling.
Organizing programs
57:23

This lecture covers Chapter 5 of Accelerated C++.

The topics discussed in this lecture are:

  1. grouping related data into a struct,
  2. defining functions that work on structs,
  3. efficiency considerations when using the vector class,
  4. and how to use the list class.
Organizing data and using sequential containers
50:34

This lecture covers Chapter 6 of Accelerated C++. The theme of this lecture is learning to use the standard algorithms on sequences.

The lecture discusses the following topics:

  1. the ideas of iterators and adaptors,
  2. how to use the copy, find_if, and equal algorithms,
  3. how to use the transform, accumulate, remove_copy, and stable_partition algorithms,
  4. and how to apply these algorithms in the setting of computing medians and averages of student grades.
Using library algorithms
01:01:45

Code Examples Download
00:04
About the Instructor
Jeremy Siek
4.3 Average rating
600 Reviews
61,555 Students
1 Course
Professor at Indiana University

Jeremy Siek is an Associate Professor at Indiana University Bloomington. Jeremy teaches courses on programming, algorithms, compilers, logic, and mathematics. Jeremy's interests include generic programming, programming language design, type systems, and high-performance programming. Jeremy's Ph.D. thesis laid the foundation for constrained templates, aka the "concepts" proposal for C++. Prior to that, Jeremy developed the Boost Graph Library, a C++ generic library for graph algorithms and data structures. Jeremy post-doc'd at Rice University where he developed the idea of gradual typing: a type system that integrates both dynamic and static typing in the same programming language. Jeremy is currently working on a gradually-typed version of Python, a language for reflective meta-programming, a version of concepts for Chapel, and a domain-specific compiler for generating memory-efficient linear algebra kernels. In 2009 Jeremy received the NSF CAREER award to fund his project: "Bridging the Gap Between Prototyping and Production". In 2010 Jeremy was awarded a Distinguished Visiting Fellowship from the Scottish Informatics & Computer Science Alliance.