Principles of Programming using C
(Effective from the Academic Year 2024 - 2025)
SEMESTER – I/II
Course Code 24CSG103C1/24CSG203C1 CIA Marks 50
Number of Contact Hours/Week (L: T: P: S) 3:0:2:0 SEE Marks 50
Total Hours of Pedagogy 40L + 10P Exam Hours 03
CREDITS – 4
COURSE PREREQUISITES:
• Basic understanding of Computer Programming terminologies.
COURSE OBJECTIVES:
In this course, you will learn about:
• Programming basics and the fundamentals of C
• Data types in C
• Mathematical and logical operations
• Using if statement and loops
• Arranging data in arrays
• Implementing pointers
• File management and dynamic memory allocation
TEACHING - LEARNING STRATEGY:
Following are some sample strategies that can be incorporate for the Course Delivery
• Chalk and Talk Method/Blended Mode Method
• Power Point Presentation
• Expert Talk/Webinar/Seminar
• Video Streaming/Self-Study/Simulations
• Peer-to-Peer Activities
• Activity/Problem Based Learning
• Case Studies
• MOOC/NPTEL Courses
• Any other innovative initiatives with respect to the Course contents
COURSE CONTENTS
MODULE - I
Overview of C: Basic structure of C program, executing a C program. Constant, variable and data types, 10 Hours
Type conversion and typecasting.
Operators – Arithmetic operator, Assignment operator, Relational operator, logical operators, Bit wise
operators, Misc. operator and expressions.
Conditional Branching – if, if-else, cascade if, nested if and switch statements. Simple calculator, finding
roots of a quadratic equation, Grade of a student.
MODULE - II
Loops & Storage classes. Iterative statements - While, Do-while and for loop statement. Example 10 Hours
programs, Pascal’s triangle, Taylor series, Reverse a number, Binary to Decimal. Unconditional statements
- break and continue statements, go-to statement.
MODULE – III
Arrays & Strings: Arrays (1-D, 2-D), Multi-dimensional arrays and matrices, Character arrays and 10 Hours
Strings, Basic Algorithms: Searching and Sorting techniques - Linear search, Binary search, Bubble sort,
Insertion sort and Selection sort
User Defined Functions and Recursion – Introduction, key elements, categories of User-defined function.
Passing parameters – Call-by-value and Call-by-reference, Recursion – Introduction, factorial of number
and
Fibonacci series
MODULE - IV
Structures: Defining structures, Accessing Structure Members, Structure as Function Arguments, Arrays 10 Hours
of Structures, typedef.
Pointers: Pointers: Introduction to pointers, declaring pointer variables, Types of pointers, Example
programs Pre-processor Directives: Predefined macros, Pre-processor operators and Example Programs.
Introduction to dynamic memory allocation: malloc, calloc, realloc, free.
Introduction to Files: Opening Files, Closing Files, Writing Files, Reading a File.
COURSE OUTCOMES
Upon completion of this course, the students will be able to:
CO No. Course Outcome Description Bloom’s
Taxono
my
Level
CO1 Develop proficiency in C programming, including understanding of program structure, CL3
data types, operators, conditional branching, and solving basic computational problems.
CO2 Apply knowledge of loops, storage classes, and iterative and unconditional statements in CL3
C
CO3 Implement arrays, strings, basic algorithms, user-defined functions, and recursion in C CL3
for problem-solving.
CO4 Utilize structures, pointers, pre-processor directives, dynamic memory allocation, and CL3
file handling in C
LABORATORY COMPONENTS
Exp. No. Experiment Description CO No. Bloom’s
Taxono
my
Level
1. Design and implementation of if -else if- ladder to arrive at a CO1 CL3
solution. Sample programs: Student grading system, Electricity
Bill generation.
2. Design and implementation of computational problems using CO1 CL3
switch. Sample programs: Simple calculator, No. of days in a
month.
3. Design and Implementation of looping constructs CO2 CL3
Sample Programs: Reverse a number, Taylor series expansion
4. Design and implementation of Matrix operations CO3 CL3
Sample programs: Creation of identity matrix, Matrix Multiplication
5. Design and development of string manipulation function CO3 CL3
Sample program: String concatenation, Length of string
6. Develop a program to display the specified pattern. CO2 CL3
Sample program: Square/triangle using specified character
7. Design and development of searching algorithms: binary search, linear CO3 CL3
search. Sample program: Search for sales records
8. Design and development of sorting algorithms: Bubble sort, Selection CO3 CL3
sort Sample programs: Sort by weight of items
9. Application of structure/pointer Sample programs: Read and retrieve CO4 CL3
employee details, obtain statistical information (sum, mean, std dev).
10. Design and implementation of recursive functions. CO3 CL3
Sample Programs: Generation of Fibonacci series, factorial of a number.
CO-PO-PSO MAPPING
CO Programme Outcomes (PO) Programme
No. Specific
Outcome (PSO)
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 3 1 1 3
CO2 3 3 3 1 2 1 1 2
CO3 3 3 3 1 2 1 1 2
CO4 3 3 3 1 2 1 1 2
3: Substantial (High) 2: Moderate (Medium) 1: Po
(Low
ASSESSMENT STRATEGY
Assessment will be both CIA and SEE. Students learning will be assessed using Direct and Indirect methods:
Sl. No. Assessment Description Weightage (%) Max. Marks
1 Continuous Internal Assessment 100 % 50
(CIA)
Continuous Internal Evaluation (CIE) 60 % 30
Practical Session (Laboratory 40 % 20
Component)
2 Semester End Examination (SEE) 100 % 50
ASSESSMENT DETAILS
Course Outcomes Continuous Internal Assessment (CIA) (50%) Semester End Exam
(SEE) (50%)
Continuous Internal Practical Sessions (40%)
Evaluation (CIE) (60%)
I II III
Syllabus Coverage Syllabus Coverage Syllabus Coverage
40% 30% 30% 100% 100%
MI MI x MI
MII MII MII x MII
MIII MIII x MIII
MIV MIV x MIV
NOTE
● Assessment will be both CIA and SEE.
● The practical sessions of the IPCC shall be for CIE only.
● The Theory component of the IPCC shall be for both CIA and SEE respectively.
● The questions from the practical sessions shall be included in Theory SEE.
Note: For Examinations (both CIE and SEE), the question papers shall contain the questions mapped to the
appropriate Bloom’s Level. Any COs mapped with higher cognitive Bloom’s Level may also be assessed through the
assignments.
SEE QUESTION PAPER PATTERN:
● The question paper will have SEVEN full questions from FOUR Modules
TEXT BOOKS:
1. Reema Thereja, Programming in C , Cengage publication,
2. Brian W. Kernighan and Dennis M. Ritchie, The ‘C’ Programming Language, Prentice Hall ofIndia.
REFERENCE BOOKS:
th
1. Yashavanth Kanetkar, Let us C, Authentic Guide to C Programming Langauge, bpb publisher,17 Edition, 2020.
th
2. Herbert Schildt, C: The complete reference, McGraw Hill, 4 Edition, 2017.
REFERENCE WEB LINKS AND VIDEO LECTURES (E - RESOURCES):
1. https://www.youtube.com/watch?v=KJgsSFOSQv0
2. https://www.youtube.com/watch?v=-CpG3oATGIs
