Lecture notes:
http://www.iitk.ac.in/esc101/2010Jan/lectures-notes.html
My observations:
Names a memory location
int num1;
int num2;
variable declaration reserve memory location and give name to the memory locations.
A good theme of introducing to concepts in C. Very useful material to tech C programming and Data Structures like Linked List and Trees.
// stack and queue are easier to implement, concepts can be skipped.
The Tree is drawn in the right direction, liked it. Once they understand the concept, it will be obvious to understand the inverted tree diagram used.
Principle: Minimize the new concepts as much as possible and cover the whole details. Like no HED for memory. No mentioning of call stack, but explaind the concepts of function structure and pointer inside the memory deallocation and associated problems.
The course is clean and simple to the core concepts that needs to be explained.
Too good presentation of the course in Simple, minimum set of concepts overall. But to the core of the problem.
Introducing large number adding and then to strings, looked obvious. Reading numbers ascii OS, scanf, printf.
All are so intervined and clarity of the system is bought with minimal set of concepts.
Final note:
Covers maximum depth with minimal set of examples and minimal set of concepts, using the vocabulary of the compilers.