Syllabus

BIT · Semester I

C Programming syllabus

Official TU syllabus for C Programming (BIT102): 10 units, 81 topics. Every unit links to its notes and solved questions.

1

Fundamentals of C Programming

9 Q
  • Basic structure of C program
  • Compilation and execution process
  • Comments and escape sequences
  • Tokens and statements
  • Identifiers and keywords
  • Rules for naming valid identifiers
2

Data Types and Constants

6 Q
  • Basic data types and their ranges
  • Constants and constant declaration
  • Type conversion and casting
  • Sizeof operator
  • Conversion specifiers
3

Operators and Expressions

6 Q
  • Arithmetic operators
  • Relational operators
  • Logical operators
  • Assignment operators
  • Conditional operators
  • Operator precedence and associativity
  • Comma operator
  • Expressions and expression evaluation
4

Control Structures

9 Q
  • If else statement
  • If else ladder
  • Nested if else
  • Switch case statement
  • Comparison of switch and if else ladder
  • Break and continue statements
  • Goto statement and labels
  • Flowchart design
5

Loops and Iteration

6 Q
  • For loop structure and syntax
  • While loop
  • Do while loop
  • Comparison of while and do while
  • Nested loops
  • Loop control statements
  • Odd loops
6

Arrays and Strings

13 Q
  • One-dimensional arrays
  • Two-dimensional arrays
  • Multi-dimensional arrays
  • Array initialization and access
  • String definition and declaration
  • String functions from string.h
  • String manipulation and palindrome checking
  • Pattern generation using arrays
7

Functions and Recursion

6 Q
  • Function declaration definition and calling
  • Function advantages
  • Pass by value
  • Pass by reference
  • Call by reference for swapping
  • Recursive functions
  • Factorial using recursion
  • External functions
  • Arrays as function arguments
  • Functions returning values
8

Pointers and Dynamic Memory

7 Q
  • Pointer concept and declaration
  • Pointer arithmetic
  • Double pointers
  • Null pointers
  • Similarity between arrays and pointers
  • Pointers as function arguments
  • Dynamic memory allocation
  • Sizeof in DMA
  • Finding smallest element using pointers
9

Structures and Unions

8 Q
  • Structure definition and initialization
  • Structure members and access
  • Nested structures
  • Union definition and initialization
  • Differences between structure and union
  • Typedef keyword
  • Storing and displaying structure data
  • Filtering structure records
10

File Input Output and Preprocessor

14 Q
  • File handling and file operations
  • File opening modes
  • Fwrite and fread functions
  • Fgets and fgetc functions
  • Formatted input output
  • Unformatted input output
  • File creation and copying
  • Merging files
  • Reading and writing numbers to files
  • Preprocessor directives
  • Macros and macro vs function
  • File inclusion

Study BIT102 the smart way

Solved questions, flashcards & practice