About this course: The final course in the specialization Introduction to Programming in C will teach you powerful new programming techniques for interacting with the user and the system and dynamically allocating memory. You will learn more sophisticated uses for pointers, such as strings and multidimensional arrays, as well as how to write programs that read and write files and take input from the user. Learning about dynamic memory allocation will allow your programs to perform complex tasks that will be applied in the final part of the specialization project: a Monte Carlo simulation for calculating poker hand probabilities.
Who is this class for: This course is for learners who have an interest in learning how to program, for people with no programming experience or for people with some experience who would like to gain solid fundamentals and a deeper understanding of how to program effectively.
Created by: Duke University
Taught by: Andrew D. Hilton, Assistant Professor of the Practice
Electrical and Computer Engineering
Taught by: Anne Bracy, Senior Lecturer
Computer Science, Cornell University
Taught by: Genevieve M. Lipp, Adjunct Professor
Electrical and Computer Engineering/Mechanical Engineering
| Basic Info | Course 4 of 4 in the Introduction to Programming in C Specialization |
| Level | Beginner |
| Commitment | 4 weeks of study, 6–8 hours/week |
| Language | English |
| How To Pass | Pass all graded assignments to complete the course. |
| User Ratings |
Syllabus
WEEK 1
Module 1: Interacting with the user and system
So far, our programs have had a rather limited interaction with the user or rest of the system, printing some results to standard output (typically to the terminal). Now that we have learned about topics such as strings and arrays, we are ready to learn how to write a program that takes input from the user, takes arguments on the command line, accesses files, and does many other things we typically think of real programs as doing.
5 videos, 16 readings, 5 practice quizzes
- Lecture: Assignment 24_read_arr3
- Lecture: Introduction to the Operating System
- Lecture: Errors from System Calls
- Quiz pour s'exercer: The Operating System
- Lecture: Command Line Arguments
- Lecture: Complex Option Processing
- Lecture: The Environment Pointer
- Lecture: Process Creation
- Quiz pour s'exercer: Command Line Arguments and Process Creation
- Lecture: Opening a File
- Lecture: Reading a File
- Video: Reading a File with fgetc
- Quiz pour s'exercer: Opening Files and fgetc
- Lecture: Reading a File with fgets
- Video: Reading a File with fgets
- Lecture: Reading a File with fread
- Quiz pour s'exercer: Reading encryption.c
- Lecture: Assignment 25_break_encr
- Lecture: Writing to Files
- Video: Writing to a File
- Lecture: Closing Files
- Video: Closing a File
- Lecture: Other Interactions
- Quiz pour s'exercer: Writing and Closing Files
- Lecture: Assignments 26_tests_matrix_input and 27_matrix_input
WEEK 2
Module 2: Dynamic allocation
So far, most of the memory we have used has been located on the stack. Dynamic memory allocation gives a programmer much more flexibility, in that it allows you to request a specific amount memory to be allocated on the heap, so that it will not disappear with the stack frame of the calling function.
7 videos, 19 readings, 5 practice quizzes
- Lecture: Motivation for Dynamic Allocation
- Lecture: malloc
- Lecture: Fixing initArray
- Lecture: More Complex Structures
- Lecture: Shallow vs. Deep Copying
- Quiz pour s'exercer: malloc
- Lecture: free
- Video: Mechanics of free
- Lecture: Memory Leaks
- Video: Code with a Memory Leak
- Lecture: A Dynamic Memory Allocation Analogy
- Lecture: Common Problems with free
- Video: Three Common Problems When Using free
- Quiz pour s'exercer: free
- Lecture: realloc
- Video: Call to realloc
- Quiz pour s'exercer: realloc
- Lecture: getline
- Video: Reading a File with getline
- Video: Combining getline and realloc
- Quiz pour s'exercer: getline
- Lecture: Valgrind's Memcheck
- Lecture: Uninitialized Values
- Lecture: Invalid Reads and Writes
- Lecture: Valgrind with GDB
- Lecture: Dynamic Allocation Issues
- Lecture: memcheck.h
- Lecture: Other Valgrind Tools
- Quiz pour s'exercer: Valgrind's Memcheck
- Lecture: Assignments 28_fix_vg_encr, 29_outname, 30_sort_lines, and 31_minesweeper
WEEK 3
Module 3: Programming in the Large
So far, we have focused exclusively on programming in the small—designing the algorithm for a small-sized task, implementing it, testing it, and debugging it. This module discusses three main differences that "real" programs exhibit. 1) They tend to be much larger than those we have written. 2) More than one person works on them, sometimes teams of hundreds to thousands. 3) Real software has a long life-span during which it must be maintained. Now that you have an understanding of the basics of programming in the small, we are ready to begin learning about programming in the large!
2 videos, 21 readings, 2 practice quizzes
- Lecture: Analogy to Writing
- Lecture: Abstraction
- Lecture: The Seven-Item Limit
- Lecture: Hierarchical Abstraction
- Quiz pour s'exercer: Abstraction
- Lecture: Readability
- Lecture: Function Size
- Lecture: Naming
- Lecture: Formatting
- Lecture: Commenting and Documentation
- Quiz pour s'exercer: Readability
- Lecture: Team Considerations
- Lecture: Git
- Lecture: Past Versions
- Lecture: Collaboration
- Lecture: Multiple Versions of the Present
- Lecture: Read More
- Lecture: Problem Description
- Video: Roster Planning
- Lecture: Planning the High-Level Algorithm
- Lecture: Writing and Testing readInput
- Lecture: Finishing the Program
- Lecture: Even Larger Programs
- Lecture: Assignments 32_kvs, 33_counts, and 34_put_together
WEEK 4
Module 4: Poker Project
In this module, you will complete the Poker Project! Now that you know about dynamic memory allocation, user input, and how to program in the large, you can write the final parts of the program. You will write code to read in a file with a hand of cards and code to choose unknown cards from a shuffled deck. As you program with more sophisticated data structures, the importance of drawing good pictures will increase. Happy programming!
1 video, 1 reading
- Lecture: Poker Project: Final Part
Graded: Practice Programming Environment
FAQs
How It Works
Travail en cours
Chaque cours fonctionne comme un manuel interactif en proposant des vidéos préenregistrées, des quiz et des projets.
Aide de la part de vos pairs
Connectez-vous à des milliers d'autres étudiants et débattez sur des idées, discutez le contenu du cours et obtenez de l'aide pour en maîtriser les concepts.
Certificats
Obtenez une reconnaissance officielle pour votre travail et partagez votre réussite avec vos amis, vos collègues et vos employeurs.
Creators
Duke University
Duke University has about 13,000 undergraduate and graduate students and a world-class faculty helping to expand the frontiers of knowledge. The university has a strong commitment to applying knowledge in service to society, both near its North Carolina campus and around the world.
Pricing
| Purchase Course | |
|---|---|
| Access to course materials | Available |
| Access to graded materials | Available |
| Receive a final grade | Available |
| Earn a shareable Course Certificate | Available |
Ratings and Reviews
Coursera provides universal access to the world’s best education,
partnering with top universities and organizations to offer courses online.
© 2018 Coursera Inc. All rights reserved.
