Syllabus — Programming for Problem Solving Lab (ICT-101P)
Official GGSIPU syllabus for the B.Tech 2026-30 batch (first year, under USICT), applicable from the academic session 2026-27.
- The course objectives and course outcomes are identical to that of ICT-101 as this is the practical component of the corresponding theory paper.
- The practical list shall be notified by the teacher in the first week of the class commencement.
- There should be at least 4 practicals from each Unit (Minimum 16 practicals)
P 2 C 1
Teachers Continuous Evaluation: 40 marks. Term-End Semester Examination: 60 marks.
Practical component of Programming for Problem Solving (ICT-101T).
Instructions
Course outcomes (same as ICT-101T)
- Develop structured C programs using fundamental programming constructs, data types, operators, expressions, control structures, and standard input/output techniques to solve computational problems.
- Design modular C programs using functions, arrays, strings, storage classes, header files, recursion, and standard library functions for implementing searching, sorting, and numerical algorithms.
- Develop efficient C programs employing structures, unions, enumerations, pointers, dynamic memory allocation, file handling, and command-line arguments for solving engineering applications involving complex data.
- Design and implement Abstract Data Types (ADTs) and fundamental data structures using C, including linked lists, stacks, queues, and trees, while applying function pointers, generic programming concepts, and modern C programming practices for robust software development.