Syllabus — Programming for Problem Solving using C Lab (AR151)
Official GGSIPU syllabus for the B.Tech Artificial Intelligence and Data Science 2026-30 batch (first year, under USAR), applicable from the academic session 2026-27.
P 2 C 1
Internal Evaluation: as per university examination norms. End Term Practical Examination: as per university examination norms.
Practical component of Programming for Problem Solving using C (AR103). The document publishes no separate unit-wise syllabus for this lab; the practical list is notified by the teacher, and the units below are the theory paper's.
Course outcomes (same as AR103)
- Understand the basic structure of C programming, number systems, and the compilation process of a C program. [K1]
- Apply programming constructs like operators, loops, conditionals, and arrays in C to solve problems. [K2]
- Analyze and implement advanced programming constructs such as functions, recursion, strings, and pointers. [K1,K2]
- Develop and implement programs involving structures, unions, and file handling. [K2]
Unit I
Introduction to Programming: Computer languages, creating and running programs, Preprocessor, Compilation process, role of linker, idea of invocation and execution of a programme. Algorithms: Representation using flowcharts, pseudocode. Introduction to C language: Basic structure of C programs, process of compiling and running a C program, tokens, keywords, identifiers, constants, strings, special symbols, variables, data types, I/0 statements. Interconversion of variables.
Unit II
Basics of Number Systems: Introduction to Number Systems, Types of Number Systems (Binary, Decimal, Octal, Hexadecimal), Conversion Between Number Systems, Signed and Unsigned Numbers: Representation of negative numbers (Sign-magnitude, 1’s complement, 2’s complement) Operators and expressions: Operators, arithmetic, relational and logical, assignment operators, increment and decrement operators, bitwise and conditional operators, special operators, operator precedence and associativity, evaluation of expressions, type conversions in expressions. Control structures: Decision statements; if and switch statement; Loop control statements: while, for and do while loops, jump statements, break, continue, goto statements.
Unit III
Arrays: One dimensional array, declaration and initialization of one dimensional arrays, two dimensional arrays, initialization and accessing, multi dimensional arrays. Functions: User defined and built-in Functions, storage classes, Parameter passing in functions, call by value, Passing arrays to functions: idea of call by reference, Recursion. Strings: Arrays of characters, variable length character strings, inputting character strings, character library functions, string handling functions.
Unit IV
Pointers: Pointer basics, pointer arithmetic, pointers to pointers, generic pointers, array of pointers/ returning pointers, Dynamic memory allocation. Pointers to functions. Pointers and Strings. Structures and unions: Structure definition, initialization, accessing structures, nested structures, arrays of structures, structures and functions, self referential structures, unions, typedef, enumerations.