Programming in C Handwritten Notes PDF

Key takeaways

• Pointers, storage classes, structures vs unions and find-the-output questions carry most marks.
• Learn operator precedence and associativity; many output questions depend on it.
• Each section has exam tips and formula boxes, and the last page lists the most asked practice questions.
• These are original Uncodemy revision notes, not official university notes; check your own syllabus.

About these C Programming handwritten notes

This page offers Uncodemy's Programming in C notes as a free handwritten-style PDF. Programming in C is the usual first programming subject: it teaches variables, control flow, functions, arrays, pointers and memory in a language close to the hardware. The notes are written in short points with neat tables, labelled diagrams, boxed formulas and exam tips, so you can revise a full unit in one sitting instead of reading a long textbook chapter.

Please note: these are original Uncodemy revision notes. They follow the common syllabus that most Indian universities share for this subject, but they are not official university notes. Check your own university syllabus and add anything it lists that is missing here.

What's inside the C Programming notes

The PDF is arranged in 8 sections plus a final page of most asked practice questions. The sections follow the usual unit order of a Programming in C syllabus, so you can map them to your own units quickly. Here is what each section covers.

Introduction

History and features of C, the structure of a C program, and how source code becomes output through preprocessing, compiling, linking and loading.

Data types, variables and operators

Basic data types and typical sizes, constants, all operator types and a short precedence table.

Control statements

if, if-else, switch, for, while and do-while loops, and break, continue and goto.

Functions and storage classes

Declaring and calling functions, call by value and call by reference, recursion, and auto, static, extern and register storage classes.

Arrays and strings

One and two-dimensional arrays, address calculation, strings and the common string library functions.

Pointers

Pointer basics, pointer arithmetic, reading complex declarations, NULL and dangling pointers, and malloc, calloc, realloc and free.

Structures, unions and enums

Defining structures, arrays of structures, structure padding and size, unions and enumerations.

File handling and preprocessor

File modes and functions such as fopen, fprintf and fscanf, macros and conditional compilation, and command-line arguments.

Most asked questions (practice)

Ten exam-style questions, from call by value vs reference to macro pitfalls.

How to use handwritten notes to revise C Programming

C is learnt by writing and predicting code. Use the notes to revise the rules, then test each rule with a tiny program.

• Write the swap function with call by value and call by reference and explain the difference in output.
• Make a table of storage classes with scope, lifetime and default value from memory.
• Predict the output of five short pointer and static variable programs before running them.
• Calculate the size of two structures with padding, then check with sizeof.

A simple three-pass method works well with handwritten notes. In the first pass, read one section and underline only what you do not already know. In the second pass, close the notes and write the definitions, diagrams and steps for that section on a blank sheet, then compare and correct in a different colour. In the third pass, a day or two later, answer two or three exam-style C Programming questions in timed conditions using only memory. Add your own examples and doubts in the margins so the PDF becomes your personal revision copy.

Formulas, diagrams and definitions to memorise

• Typical sizes on a 64-bit system: char 1 byte, int 4 bytes, float 4 bytes, double 8 bytes, pointer 8 bytes.
• Storage classes table: auto, register, static and extern with scope, lifetime and default value.
• Row-major address: base + ((i x number of columns) + j) x size of element.
• Pointer arithmetic: p + 1 moves by the size of the pointed type, not by one byte.
• malloc leaves memory uninitialised; calloc sets it to zero; always free what you allocate.

Common mistakes that cost marks

• Using = instead of == in an if condition.
• Returning the address of a local variable from a function, which leaves a dangling pointer.
• Forgetting the null character when sizing a string array.
• Writing macros without brackets, so #define SQ(x) x*x gives the wrong result for SQ(a+1).

Exam focus: C Programming topics that carry the most marks

These C topics carry the most marks in university papers and in GATE programming questions.

• Operators, precedence and find-the-output questions.
• Functions, recursion and storage classes.
• Arrays, strings and 2-D array address calculation.
• Pointers, dynamic memory, structures vs unions and file handling.

Typical long questions

1. Differentiate call by value and call by reference with a swap example.
2. Explain all storage classes with scope, lifetime and default value.
3. Compare structure and union and find the size of a given structure.
4. Explain pointers, pointer arithmetic, NULL and dangling pointers.
5. Compare malloc and calloc and explain memory leaks.
6. Find the address of an element in a 2-D array in row-major and column-major order.
7. Write recursive programs for factorial and Fibonacci.

Marks per question change between universities and years, so confirm the pattern on a recent official paper. In long answers, start with a definition, add a labelled diagram or table, explain the steps and finish with an example or comparison. Underline the key term in each answer and leave a line between steps, because examiners mark faster when the structure is easy to see.

A 7-day revision plan for C Programming

1. Day 1: Introduction, Data types, variables and operators.
2. Day 2: Control statements, Functions and storage classes.
3. Day 3: Arrays and strings, Pointers.
4. Day 4: Structures, unions and enums.
5. Day 5: File handling and preprocessor.
6. Day 6: redo the programs: swap, recursion, your own strlen, a structure size problem and five find-the-output questions.
7. Day 7: answer the most asked practice questions at the end of the notes from memory, then solve one official previous year paper in three hours and mark the units that cost you time.

Keep a single sheet of formulas, definitions and diagrams from the notes for the last hour before the exam, and do not start new topics on the final day.

Who these notes are for

• B.Tech first-year students preparing for Programming for Problem Solving (C).
• BCA and MCA students with a C programming paper.
• GATE CS aspirants revising C programming and pointers.
• Freshers revising C before campus coding tests and interviews.

The notes are a revision aid, not a first textbook. If a C Programming topic is new to you, learn it from your prescribed book or class lectures first, then come back to the notes to compress and revise it. For practice, pair them with the C Programming (PPS) Important Questions PDF page and your university's official previous year papers. If your syllabus has a topic that is not covered here, you can ask for it through the handwritten notes request page linked below.

Download Programming in C Handwritten Notes PDF

Sources and further reading

• The GNU C Reference Manual
• cppreference: C language reference
• AKTU: old question papers (official archive)