First Year Engineering is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

First Year Engineering

Programming in C

Problem solving, control flow, arrays, functions, pointers, structures, files.

Interview questions
Your progress in this subject0 of 16 · 0%
  1. 1Algorithms, flowcharts and problem solvingAlgorithms, pseudocode, flowcharts, and problem-solving steps with C programs that implement them, including examples (sum of N numbers, Euclid’s GCD, linear search), syntax to remember, exam-focused definitions, diagrams to draw, and common mistakes.
  2. 2Structure of a C programStructure of a C program: its parts (comments, headers, macros, global declarations, main, local declarations, statements, functions), the compilation model, and how to write, compile, and run small programs correctly.
  3. 3Data types, variables and constantsPrecise meaning, syntax, sizes/ranges, literals, const vs #define, and safe type conversions for C data types, variables, and constants.
  4. 4Storage classesStorage classes in C: auto, register, static, extern; their scope, storage duration, linkage, defaults, initialization, and typical exam programs.
  5. 5Operators and expressionsOperators, expressions, precedence, associativity, conversions, and side effects in C, with syntax, rules, examples, pitfalls, and exam pointers.
  6. 6Decision making: if and switchDecision making in C using if, if–else, nested/else-if ladder, and switch with case/default/break, including syntax, rules, flow ideas, worked programs, and exam-focused guidance.
  7. 7LoopsLoops in C: while, do-while, for, loop control (break, continue), nested loops, flow of control, and common patterns.
  8. 8StringsStrings in C: char arrays with null terminator, literals, input/output, standard library functions, memory layout, and safe handling.
  9. 9FunctionsFunctions in C: prototypes, definitions, calling, parameters and arguments, return values, scope and linkage, pass-by-value vs pointers, arrays as parameters, recursion reference, function pointers (intro), and best practices.
  10. 10RecursionRecursion in C: definitions, stack behavior, base/recursive cases, direct/indirect and tail recursion, recursion trees and recurrences, complexity of classic problems, with complete C programs (factorial, sum of digits, Tower of Hanoi).
  11. 11PointersPointers in C: what they are, how to declare, initialize, dereference, do pointer arithmetic, use NULL/void/const, pointer-to-pointer and function pointers, plus safe practices and exam-ready examples.
  12. 12Pointers with arrays and stringsPointers with arrays and strings: array–pointer relation, pointer arithmetic, strings as char arrays, passing arrays to functions (1D and 2D), and safe string handling.
  13. 13Structures and unionsC structures model real-world records with multiple fields; unions let different fields share the same memory for efficient storage.
  14. 14Dynamic memory allocationDynamic memory allocation in C: heap vs stack, malloc/calloc/realloc/free, pointers, size_t, sizeof, dynamic arrays (1D/2D), error handling, leaks and dangling pointers, with runnable programs and exam-focused notes.
  15. 15File handlingC file handling: files, streams, modes, standard I/O library functions (fopen, fclose, fgetc/fputc, fgets/fputs, fscanf/printf, fread/fwrite, fseek/ftell/rewind, feof/ferror), text vs binary, buffering, error handling, and example programs.
  16. 16Preprocessor and macrosPreprocessor directives, macros, conditional compilation, header inclusion, macro operators (# and ##), predefined macros, multi-line and variadic macros, include guards, and best practices.

Coming next in Programming in C

  1. Input and output· notes coming
  2. Arrays· notes coming