Name of the B.

Tech Semester : 1 Level: UG/PG

Program:
Course Name Procedural Course Code/Course
Programming Type /PCC
Course Pattern 2024 Version 1.0
Teaching Scheme Assessment Scheme
Theory Practical Tutorial Total Hours CIA ESA (End Practical/
Credits (Continuous Semester Oral
Internal Assessment )
Assessment)
2 1 -- 3 4 40 60 --
Pre-Requisite: Basic knowledge of Computer
Course Objectives (CO): The objectives of Procedural Programming are:
1. Explain algorithms, flowcharts and different
programming constructs of C to be used for
development of applications.
2. To familiarize students with Data types and the
use of Operators.
3. Illustrate the use of iterative statements and
conditional Statements for solving the real-world
problems.
4. Demonstrate the use of all derived data types in C.
5. Develop simple C programs to illustrate the
applications of Arrays, pointers, functions and
structures.

Course Learning Outcomes (CLO): Students would be able to:

1. Demonstrate knowledge on C programming
constructs to develop programs.
2. Use and Apply of branching and looping
statements for solving the real world problems.
3. Apply Arrays and strings to enhance reusability
and data manipulation.
4. Develop C programs to solve simple engineering
problems using Pointers and functions
5. Implement C programs to demonstrate the
applications of structures and files.

COURSE CURRICULUM
Course Contents/Syllabus:

Descriptors/Topics CLO Hours

UNIT I
Introduction to Computing: Introduction to program, algorithm, CLO 1 6
flowcharts, and pseudo codes.

School of Engineering and Technology/2024 pattern/ Procedural programming Page | 1

 Introduction to C Programming: Features of C, basic concepts, structure
of C program, Editing, compiling / interpreting / running programs, Errors,
declarations, variables, data types, expressions, types of operators,
precedence of operators, type conversions, scanf and printf functions.

UNIT II
Decision Control Structures in C: if-else, nested if-else, cascaded if-else CLO 2 6
and switch statement.
Loop Controls Structures in C:
Conditional control structures: for, while, do-while.
Unconditional control structures: break, continue, goto statement.
UNIT III
Arrays: Declaration and Initialization of one-dimensional and two- CLO3 6
dimensional Array, accessing array elements.
Character Arrays and Strings: Declaration and Initialization of String
Variables, Reading Strings from Terminal, Writing Strings to Screen,
String-handling Functions.
UNIT IV
User-defined Functions: Need for user defined functions, Definition of CLO4 6
function, function calls, function declaration, Category of functions,
different types of user defined function, recursion.
UNITV
Pointers: Introduction to Pointers, Array of Pointers, Functions returning CLO5 6
pointers, Dynamic Memory allocation.
Structures: Introduction, Defining a structure, declaring structure
variables, accessing structure members, structure initialization, array of
structures.
Total Hours 30

Practical Plan

Assignm Assignmen Week Details CLO Hour

ent/Pract t/Practical/ Number/ s
ical/Acti Activity Turn
vity Title
Number
1 Practical 1: Week 1/ a. To implement flowchart for problem CLO1 4
Different Week 2 solving using smart draw/ E-draw.
data types b. To write an algorithm and pseudo code for
simple and complex problems.

2 Practical 2: Week 3/ a. C Program to input from user for different CLO1 4

Different Week 4 data types available in C language.
operators
b. C Program to calculate area and perimeter of
School of Engineering and Technology/2024 pattern/ Procedural programming Page | 2
 square, rectangle and triangle. Take sides
input from the user.
3 Practical 3: Week 5/ a. C program to input basic salary of an CLO2 4
control Week 6 employee and calculate gross salary
statements according to given conditions. Formula =
Basic salary + Allowances
Basic Salary <= 10000 : HRA = 20%, DA
= 80%
Basic Salary is between 10001 to 20000 :
HRA = 25%, DA = 90%
Basic Salary >= 20001 : HRA = 30%, DA
= 95%.
b. C program to find the sum of individual
digits of a given number/ Sequencing of
numbers. Ex: consider 123 as input. Sum of
digits is 1+2+3 and output is 6.

4 Practical 4: Week 7/ CLO3 4

Concept of Week 8 a. C program to accept n number of element
Arrays from user (where, n is specified by user)
and store data in an array and display the
largest/smallest element of that array using
loops.

b. C Program to multiply two matrices

(MxN) and print the result. Accept details
of two matrices as input

5 Practical 5: Week 9 a. Write a program in C to compare two CLO3 2

Concept of strings without using string library
Strings functions. Justify whether it is palindrome
or not.

6 Practical 6: Week 10/ a. Write a program in C to check whether a CLO4 4

concept of Week 11 number is a prime number or not using the
functions function.
b. Write a program generate Fibonacci series
with and without using recursive function.

7 Practical 7: Week 12/ a. Write a program in C to store n elements in CLO5 4

concept of Week 13 an array and print the elements using a
Pointers pointer.
b. Write a C program to find sum of n
elements in an array entered by user. To
perform this program, allocate memory
dynamically using malloc( )/ calloc( )
function.

School of Engineering and Technology/2024 pattern/ Procedural programming Page | 3

8 Practical 8: Week 14/ A class teacher wants to keep record of 10 CLO5 4
concept of Week 15 students in the class along with the names and
Structures marks obtained in 5 subjects. Write a C
program with function that displays :
a) Name of the student with highest marks in
a particular subject.
b) Overall percentage result of the class
c) Total number of passing students in the class
d) Total number of students failing in one
subject
e) Total number of distinctions in the class.
Total Hours 30

Learning resources

Text Books:
1. Brian W Kernighan, Dennis M Ritchie, “C Programming Language”, 2 nd Edition, Pearson, 1988.
2. E. Balagurusamy, “Programming in ANSI C”, 8 th Edition, McGraw Hill, 2019.
3. Maureen Sprankle, “Problem Solving and Programming Concepts”, 7th Edition, Prentice Hall,
1989.

Reference Book:
1. Yashavant Kanetkar, “Let Us C”, 16th edition, BPB publications,2018.
2. Herbert Schildt, “C: The Complete Reference”, 4th Edition, McGraw Hill,2000
3. R. G. Dromey, “How to Solve it by Computer”, 1 st Edition, Prentice-Hall International, 1982.

URLs - List of Online Courses

1. https://www.w3schools.com/c/index.php
2. https://www.programiz.com/c-programming

School of Engineering and Technology/2024 pattern/ Procedural programming Page | 4