TRISHA ACADEMY · Patia, Bhubaneswar
BPUT CS Syllabus — Programming in C (CSPC2101)
A dedicated 3-month BPUT university syllabus program at ₹2,999 (actual ₹4,999) for BPUT, OUT, and Odisha CSE/IT students — typically 1st or 2nd semester. Covers all CSPC2101 Programming in C modules with university exam support, lab assignments, viva preparation, and BPUT-style program practice.
University syllabus covered: All 5 BPUT modules — C fundamentals, control structures, functions, pointers, structures, unions, file handling, dynamic memory, and linked lists.
Also see our separate Core Java BPUT course (CSPC2003) at the same ₹2,999 offer, and Java placement training for job-ready Spring Boot skills.
BPUT Computer Science Syllabus (CSPC2101)
Module I — Introduction to C & Basic Programming (BPUT · 10 hrs)
- History of C, structure of a C program, compilation & execution process
- Tokens, keywords, identifiers, data types, constants, and variables
- Operators — arithmetic, relational, logical, bitwise, assignment, increment/decrement
printf, scanf, format specifiers, and basic input/output
- Type conversion, expression evaluation, and operator precedence
Module II — Control Structures & Arrays (BPUT · 8 hrs)
- Decision making —
if, if-else, nested if, and switch-case
- Loops —
for, while, do-while, nested loops
break, continue, and goto statements
- One-dimensional and two-dimensional arrays
- Strings as character arrays, string library functions (
strlen, strcpy, strcmp, etc.)
Module III — Functions & Pointers (BPUT · 10 hrs)
- Function definition, declaration, call by value and call by reference
- Recursion — factorial, Fibonacci, and tower of Hanoi programs
- Pointer basics, pointer arithmetic, pointers and arrays
- Pointer to pointer, pointers with functions, and array of pointers
- Dynamic memory introduction and pointer errors (dangling, null pointer)
Module IV — Structures, Unions & File Handling (BPUT · 8 hrs)
- Structures — declaration, nested structures, array of structures
- Structure pointers and passing structures to functions
- Unions,
typedef, and enum types
- File handling —
fopen, fclose, fgetc, fputc, fgets, fputs
- Sequential and random file access; reading/writing records
Module V — Dynamic Memory & Linked Lists (BPUT · 9 hrs)
- Dynamic memory —
malloc, calloc, realloc, and free
- Singly linked list — create, insert, delete, and traverse operations
- Doubly linked list overview for university lab
- Stack and queue implementation using linked lists (lab programs)
- BPUT-style viva questions, output tracing, and internal exam prep