Problem Solving using C — Notes, PYQs & Video Lectures

Unit 1: Outline of Course (3 hours)

S. No. Topic Minimum number of hours 1 Introduction to Programming 03 2 Algorithm/ Flowchart for Problem Solving 06 3 Introduction to ‘C’ Language 02 4 Conditional Statements and Loops 05 5 Arrays 05 6 Functions 04 7 Storage Classes 02 8 Structures and Unions 05 9 Pointers 05 10 Self-Referential Structures and Linked Lists 04 11 File Processing 02 12 Organizing C Projects 02 Lectures = 45 Practical/tutorials = 30, Total = 75 Detailed Syllabus Description Teaching hours Introduction to Programming The Basic Model of Computation, Algorithms, Flow-charts, Programming Languages, Compiler, Interpreter, Assembler, Linker and Loader, Testing and Debugging, Documentation.

Unit 2: Algorithms/ Flowchart for Problem Solving (6 hours)

Exchanging values of two variables, summation of a set of numbers, decimal base to binary base conversion, reversing digits of an integer, GCD (Greatest Common Division) of two numbers, test whether a number is prime, organize numbers in ascending order using bubble sort, find integer square root of a number, factorial computation, Fibonacci sequence, evaluate ‘sin x’ as sum of a series, reverse order of elements of an array, find largest number in an array, print elements of upper triangular matrix, multiplication of two matrices, evaluate a Polynomial.

Unit 3: Introduction to ‘C’ Language (2 hours)

Character set, variables, identifiers and their nomenclature, built-in data types, variable declaration, arithmetic operators and expressions, constants and literals, simple assignment statement, basic input/output statement, simple ‘C’ programs.

Unit 4: Conditional Statements and Loops (5 hours)

Decision making within a program, conditions, relational operators, logical connectives, if statement, if-else statement, Loops: while loop, do while, for loop, nested structure, infinite loops, switch-case, break, continue statement, structured programming.

Unit 5: Arrays (5 hours)

Array manipulation; Searching, Insertion, deletion of an element from an array; finding the largest/smallest element in an array; two dimensional arrays, addition/multiplication of two matrices, Transpose of a square matrix; null terminated strings as array of characters, standard library string functions.

Unit 6: Functions (4 hours)

Top-down approach of problem solving, modular programming and functions, standard library of C functions, Prototype of a function: Formal parameter list, return type, function call, block structure, passing arguments to a function: call by reference, call by value, Recursive functions, arrays as function arguments.

Unit 7: Storage Classes (2 hours)

Scope and extent, Storage Classes in a single source file: auto, extern and static, register, Storage Classes in a multiple source files: extern and static

Unit 8: Structures and Unions (5 hours)

Structure variables, initialization, structure assignment, nested structure, structures and functions, structures and arrays: arrays of structures, structures containing arrays, unions

Unit 9: Pointers (5 hours)

Address operators, pointer type declaration, pointer assignment, pointer initialization, pointer arithmetic, functions and pointers, Array of Pointers, pointer to an array, pointers and structures, dynamic memory allocation.

Unit 10: Self-Referential Structures and Linked Lists (4 hours)

Creation of a singly connected linked list, Traversing a linked list, Insertion into a linked list, Deletion from a linked list

Unit 11: File Processing (2 hours)

Concept of Files, File opening in various modes and closing of a file, Reading from a file, Writing onto a file, Appending to a file.

Unit 12: Organizing C projects (2 hours)

Organizing C projects, working with multiple source directories, makefiles.

Source: official document