Scribd
Upload
17 views2 pages

24BCC240 T - Programming in C

Uploaded by

No Body
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views2 pages

24BCC240 T - Programming in C

Uploaded by

No Body
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

BCA(Cloud Computing)

Semester-I
L-3 T-1 P-0 C-4
24BCC240 T: Programming in C
Course Objectives
● To know about the fundamentals of algorithms and flowcharts.

● To learn about different input/output techniques in C programs.

● To know the concepts of functions, arguments, and return values.

● To learn about dynamic memory allocation functions like malloc(), calloc(), and free()
for memory management.
● To know about membership operators, pointers to structures, and arrays within
structures.

Course Outcomes
Students will be able to
1. Understand algorithms and flowcharts for problem-solving.
2. Apply formatted and unformatted I/O operations in C programs.
3. Analyze the scope, visibility, and lifetime rules for variables in C.
4. Evaluate dynamic memory allocation functions like malloc(), calloc(), and free().
5. Create and implement complex data structures using structures and unions in C
programs.

Articulation Matrix
(Program Articulation Matrix is formed by the strength of correlation of COs with POs and PSOs. The strength of correlation is
indicated as 3 for substantial (high), 2 for moderate (medium) correlation, and 1 for slight (low) correlation)

CO/PO/PSO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 2 3 - 1 - - - - - -
CO2 - 2 1 - - - - - 3 - - -
CO3 - - - 2 - - - - 3 - - -
CO4 - - 3 - - - - - - 2 - -
CO5 - - - 1 2 3 - - - - - -
High-3 Medium-2 Low-1

Unit I Algorithms to Control Constructs 12 Hours


Algorithms & flowcharts; Rules/conventions of coding, documentation, naming variables;
History of C; Structure of a C program, Data types; Constant & Variable; Operators &
expressions; Control Constructs – if-else, for, while, do-while; Case statement.

Unit II Arrays, I/O, and Operators 12 Hours


Arrays; Formatted & unformatted I/O; Type modifiers & Storage classes; Ternary operator;
Type conversion & type casting; Priority & associativity of operators.

Unit III Parameters, Return Values, and Recursion 12 Hours


Functions; Arguments; Return value; Parameter passing – call by value, call by reference;
Return statement; Scope, visibility and life time rules for various types of variables, static
variable; Calling a function; Recursion – basics, comparison with iteration, tail recursion,
when to avoid recursion examples.

Unit IV Pointers, Dynamic Memory & Special Constructs 12 Hours


Special constructs – Break, continue, exit (), goto& labels; Pointers - &and * operators,
pointer expression, pointer arithmetic, dynamic memory management functions like malloc
(), calloc(), free(), String;

Unit V Structures & Unions 12 Hours


Structure – basic, declaration, membership operator, pointer to structure, referential operator,
self-referential structures, structure within structure, array in structure, array of structures;
Union – basic, declaration; Type of defn
Total Hours: 60

Reference Books:

1. Kerninghan& Richie: The C Programming language, PHI


2. Cooper Mullish: The Spirit of C, Jaico Publishing House, Delhi
3. Kanetkar Y: Let us C
4. Kanetkar Y: Pointers in C.

List of e-Learning Resources:


1. https://www.coursera.org/courses?query=c%20programming
2. https://www.udemy.com/topic/c-programming/
3. https://nptel.ac.in/courses/106104128
4. https://www.codecademy.com/catalog/language/c

Senior Faculty
Academic
Prepared By HOD nominated by
Coordinator
DOAA

You might also like