TUTE

DEPARTMENT OF COMPUTER APPLICATIONS

NATIONAL INSTITUTE OF TECHNOLOGY
TIRUCHIRAPPALLI - 620 015, TAMIL NADU, INDIA
COURSE PLAN (PART I)
Name of the programme and specialization [Link]-Electronics and Communication Engineering
Course Title Introduction to Computer Programming (Theory &Lab)
Course Code CSIR11 No. of Credits 3
Course Code of Pre-reguisites
Session July 2025 Section (if, applicable) B
Name of the Faculty Supratim Basu Department Computer Applications
E-mail 405322001@[Link] Telephone No. 9836785590
Course Coordinator(s) (if, applicable) [Link]
E-mail of Course Coordinator (s) deiva@[Link] Telephone No.
Course Type (tick) IR Core
Programme Open Minor Honours Laboratory
Elective Elective

COURSE CONTENT (as in latest curriculum)

Introduction to computers Types of programming languages- Developing a program - Algorithms
Characteristics- Flow Charts- Principles of structured programming- Sequential selecting structures- Repetitive
Structures-Bounded, Unbounded and Infinite iterations.

Introduction to C- Ccharacter set- Identifiers and Keywords- Data types- Constants- Variables Declarations
Expressions- Statements- Symbolic Constants- Operators- Library Functions Data input and output: Single
character input andoutput- Entering input data- Writingoutput data- gets and puts functions -Control Statements
Branching: if-else-looping: while- do
While; for; Nested control Structures- switch statements- Break statements- Continue Statements Comma
operator- goto statements.

Modular Programming- Functions and Procedures - Examples- Parameters passing methods - Arrays- Defining
an array- Processing an array- Multi dimensional arrays- Pointers-Variables definitions and initializations- Pointer
operators- Pointer expressions and arithmetic- Pointers and one dimensional arrays - String operations.

Functions- Defining function- Accessing a function- Function prototypes- Passing arguments to a functions
Passing arrays to a function- Passing Pointers to function- Recursion - Dynamic memory allocation - malloc,
calloc, realloc - Structures - Declaration - Structures and Functions - Arrays of Structures - Pointers to
structures-Typedef- Unions - Bit-fields.
Files - Input / Output using files - fread, fwrite, fprintf, fscanf - Formatted input - File access - argc, argv
List of Programs
1 Programs using Operators
2 Programs using Branching
3 Programs using Looping
4 Programs using nested control structures
5 Programs using Switch, Break, Continue, Goto statements
6 Programs using Functions
7 Programs using Arrays and Pointers
8 Programs using Strings
9 Programs using Dynamic memory allocation
10. Programs using Files
References
1. Byron Gottfried, Programming with C, 3rd Edition, Tata McGraw Hill Education, 2010.
2. R.G. Dromey, Howtosolve it by Computers? Prentice Hall, 2011.
3. Brian W Kernighan and Dennis Ritchie, The C Programminglanguage, 2nd Edition, Prentice Hall, 1988.
4. [Link] and E.B. Koffmann, Problem Solving and Program design in C, 6th Edition, Pearson Education, 2009.
5. Paul Deital and Harvey Deital, C How to Program? 7th Edition, Prentice Hall, 2012.
6. Yashvant Kanetkar, Let Us C, 12th Edition, BPB Publications, 2012.

COURSE LEARING OBJECTIVES

To learn the fundamentals of computers.
To learn the problem-solving technigques, writing algorithms &procedures
To develop the Ccode for simple logic by learning the syntax and semantics in C
To understand the construct of structured program including conditionals and iterations
To learn function and file handling techniques.

COURSE OUTCOMES (CO)

Course Outcomes Aligned Programme Outcomes (PO) (Assign level -1 or 2or 3or blank)
After successfulcompletion of the course, 1 2 3 4 5 6 7 8 9 10 11 12
the students should be able to: CO1 1 1 2
CO2 1 2 2
CLO1 To learn the fundamentals of CO3 2 2 3 3
CO4 2 3 3
Computers. CO5
CLO2 Knowledge of the syntax and 1 |3 2

semantics of C programming
Language.
CLO3 Ability to code a given logic in C
Language.
CLO4 Knowledge in using C language
for solving problems.
CLO5 To handle the file structure.

COURSE PLAN (PART II)

COURSE OVERVIEW
This laboratory-integrated course provides a comprehensive introduction to the fundamentals of C programming. It offers
valuable insights into problem-solving techniques by illustrating various examples through algorithms andflowcharts. The
course acquaints students with key language constructs, including fundamental data types, control structures, and standard
library functions. Additionally, extensive hands-on exercises are incorporated throughout the curriculum to reinforce
conceptuai understandingand foster practical competency.
COURSETEACHING AND LEARNING ACTIVITIES
S. Week Topic Mode of Delivery
No.
1. Week 1
Theory: Introduction to computers - Types of C&Tand/or PPT
(2 hrs Theory)
programming languages, Developing a program -
Algorithms- Characteristics
2
Week 2 Theory: Flow Charts- Principles of structured
programming- Sequential selecting structures C&Tand/or PPT
(2 hrs Theory + 2 hrs Lab)
Repetitive Structures-Bounded, Unbounded, and
Infinite iterations.
Lab: Programs using sequential Structures
3.
Week 3 Theory: Introduction to C- C character set
Identifiers and Keywords- Data types-Constants C&Tand/or PPT
(2hrs Theory + 2 hrs Lab)
Variables- Declarations- Expressions- Statements
Symbolic Constants
Lab: Programs using Selective Structures
4
Week 4 Theory: Operators- Library Functions- Data input
and output: Single character input and output C&Tand/or PPT
(2 hrs Theory + 2 hrs Lab)
Entering input data- Writing output data- gets and
puts functions
Lab: Programs usig Operators, Characters
 Week 5 Theory: Control Statements- Branching: if-else
(2 hrs Theory + 2 Ihrs Lab) C&Tand/or PPT
looping while- do-while- for; Nested control
Structures- switch statements
Lab: Programs using Repetitive Structures
6. Week 6
(1 hr Theory) Theory: Break statements- Continue Statements
C&Tand/or PPT
Comma operator- goto statements. Modular
Assessment I Programming- Functions and Procedures
Examples- Parameters passing methods
7
Theory: Arrays- Defining an array- Processing an
Week 7 array- Multi dimensional arrays Pointers- Variables
definitions and initializations- Pointer operators C&Tand/or PPT
(2 hrs Theory + 2 hrs Lab)
Pointer expressions and arithmetic- Pointers and
one dimensional arrays
Lab: Programs using Repetitive structures and
arrays
8 Week 8
(2 hrs Theory) Theory: String operations Functions- Defining
+ function- Accessing a function- Function C&Tand/or PPT
Internal Lab AsSessment prototypes- Passing arguments to a functions
Passing arrays to a function- Passing Pointers to
function
9 Week 9 Theory: Recursion - Dynamic memory allocation C&Tand/or PPT
(2 hrs Theory + 2 hrs Lab) - malloc, calloc,realloc
Lab: Programs using pointers, Functions,
Recursion
10. Week 10
Second Assessment
Assessment I
11. Week 11 Theory: Structures - Declaration - Structures and
(2 hrs Theory + 2 hrs Lab) Functions - Arrays of Structures - Pointers to structures
C&Tand/or PPT
Typedef- Unions - Bit-fields.
Lab: Programs using Structures & Unions
12. Week 12 Theory: Files - Input / Output sing files - fread, C&T and/or PPT
(2 hrs Theory + 2 hrs Lab) fwrite, fprintf, fscanf Formatted input - File
access - argc, argv.
Lab: Programs using Files
13. Week 13
(2 hrs Theory) Revision + Final Lab Asessment
+ C&Tand/or PPT
Final Lab Assessment
COURSE ASSESSMENT METHODS
S. Mode of Assessment Week / Date Duration
No.
% Weightage
1. Cycle Test 1 Asper the academic schedule 1hr 15

2 Cycle Test 2 Asper the academic schedule 1hr 15

3 Continuous Assess1ment
Every Week 10

4 Internal Lab Assessment Week 8 2 hrs 10

5 Final Lab Assessment Week 13 3 hrs 10

Compensation Assessment* As per tlhe acadennic schedule 1hr

 7 As per the academic schedule 3 hrs 40
Final Assessment *

COURSE EXIT SURVEY (mention the ways in which the feedback about the course is assessed and indicate the
attainment also)
1 Students' feedback through class committee meetings
2 Feedbacks are collected before final examination through MIS or any other standard format followed
by the institute
3 Students, through their Class Representatives, may give their feedback at any time to the course faculty which will
be duly addressed.
COMPENSATION POLICY
Only one instance of absence is acceptable in continuous assessment, and a compensation assessment for
such cases will be conducted only once.

Compensation assessments are restricted to genuine reasons, like severe illness, and require valid proof in
the form of a medical certificate issued by the NITT hospital medical officer.
In situations where students anticipate missingassessments due to unavoidable reasons, prior intimation to
the faculty is essential. fa student is unable to provide advance notice duetosudden illness or emergencies,
they must communicate the reason and submit valid proof of the absence within one week of the assessment.
ATTENDANCE POLICY
At least 75% attendance in each course is mandatory.
Amaximum of 10% shall be allowed under On Duty (OD) category.
Students with less than 65% of attendance shall be prevented from writing the final assessment and shall be
awarded V grade. Students awarded V' grade must compulsorily redo the course.
ACADEMIC DISHONESTY AND PLAGIARISM
Academic Dishonesty
a) Possessing a mobile phone,carrying bits of paper, talking to other students, copying from others during an
assessment will be treated as punishable dishonesty
b) Zero mask to be awarded for the offenders. For copying from another student, both students get the same
penalty of zero mark.
c) The department disciplinary committee constituted with the faculty member, PAC Chairperson, and the HoD,
as members shallverify the facts of the malpractice and award the punishment if the student found guilty.
ADDITIONAL COURSE INFORMATION

The students can get their doubts clarified at any time with their faculty member with prior appointment
FOR APPROVAL
|Sopratin Boun 12-09-25 12-09-2025
Course Faculty Chairperson(Class Committee) HoD
12-09-2025 (Dr. M. Bhaskar)
(Supratim Basu) (Dr. S. Deivalakshmi)