NATIONAL INSTITUTE OF TECHNOLOGY TIRUCHIRAPPALLI
DEPARTMENT OF Computer Science and Engineering
COURSE PLAN – PART I
Name of the
programme and B.Tech Computer Science and Engineering
specialization
Course Title Introduction to Computer Programming
Course Code CSIR11 No. of Credits 3
Course Code of Pre-
requisite subject(s)
Session July 2023 Section A&B
J. Pavan Kumar &
Name of Faculty Madhusmita Department CSE
Priyadarsini Sahoo
pavan@nitt.edu
Official Email Telephone No.
Name of Course
-
Coordinator(s)
Official E-mail - Telephone No. -
Course Type (please Core course Elective course
tick appropriately)
Syllabus (approved in BoS)
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- C character set- Identifiers and Keywords- Data types- Constants- Variables
Declarations- Expressions- Statements- Symbolic Constants- Operators- Library Functions Data input and
output: Single character input and output- Entering input data- Writing output 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.
NATIONAL INSTITUTE OF TECHNOLOGY TIRUCHIRAPPALLI
Text Books
1. Byron Gotfried, “Programming with C”, third edition, Tata McGraw hill
Education, 2010.
2. R.G. Dromey, “How to solve it by computer”, Prentice Hall, 2001.
3. Brian W Kernighan and Dennis Ritchie, The C Programming language, 2nd
Edition, Prentice Hall, 1988.
COURSE OBJECTIVES
To learn the fundamentals of computers
To learn the problem-solving techniques, writing algorithms and procedures
To learn the syntax and semantics of C programming language
To develop C code for simple logic
To understand the constructs of structures programming including conditionals and
iterations
MAPPING OF COs with POs
Programme
Course Outcomes Outcomes (PO)
(Enter Numbers only)
1- Ability to write algorithms for problems. PO1, PO4
2- Knowledge of the syntax and semantics of C programming PO1, PO3, PO4, PO5
language.
PO1, PO3, PO4
3- Ability to code a given logic in C language.
4- Knowledge in using C language for solving problems PO1, PO3, PO4
COURSE PLAN – PART II
COURSE OVERVIEW
COURSE TEACHING AND LEARNING ACTIVITIES
S.No. Week/Contact Topic Mode of Delivery
Hours
Introduction to computers, Lecture
Programming languages types, Power point presentation
Structured programming
Week-1 languages
1
2T+2L Lab component – compilation Practical
process, basic commands
Algorithm- algorithm Lecture
characteristics, algorithm as Chalk and Talk
pseudo code – need and Power point presentation
Week-2
2 sample. Flow chart – sample
2T+2L
flow chart for some problems,
Developing a program, Input
and output statements in C,
NATIONAL INSTITUTE OF TECHNOLOGY TIRUCHIRAPPALLI
character sets, keywords,
variables, constants,
identifiers
Basic program as discussed Practical
Operators, Control Lecture
statements- if, if-else, if-else-if, Chalk and Talk
library functions Coding
Week-3
3
2T+2L Simple programs using Practical
getchar(), putchar(c), format
specifier, and operators
More on control statements- Lecture
while, do-while, for, more on Chalk and Talk
Week-4 input and output – gets(), Coding
4 2T+2L puts(), expressions
Sample programs using Practical
control statements,
expressions
More on control statements- Lecture
nested for, for-while Chalk and Talk
Week-5 combinations, go-to, break, Coding
2T+2L continue statements. Use of
5 operators in nested control
structures
Cycle Test 1 Written
Programming Test 1 Practical
Week-6
6
2L Sample programs based on Practical
nested control structures,
more on input and output –
gets(), puts()
Functions and procedures – Lecture
theory, parameter passing Chalk and Talk
methods, examples, Coding
Week-7 recursion-its advantages,
7 2T+2L disadvantages, examples
Sample programs based on Practical
nested control structures, use
of different operators in
nested control
NATIONAL INSTITUTE OF TECHNOLOGY TIRUCHIRAPPALLI
Arrays and Sample programs Lecture
– single dimensional and Chalk and Talk
multi-dimensional arrays for Coding
Week-8 integers
8
2T+2L Programs based on functions- Practical
parameter passing methods,
recursions
Pointers, pointer operators, Lecture
Week-9 pointer arithmetic Chalk and Talk
2T+2L Coding
9
Cycle Test 2 Written
Programming Test 2 Practical
Pointers and arrays –
relationship, programs,
Week-10
10
2T+2L Sample programs - Arrays for Practical
strings, Pointers, pointer
operators, pointer arithmetic
Arrays of strings, examples Lecture
Chalk and Talk
Coding
Week-11
11
2T+2L Sample programs based on Practical
arrays – single dimensional
and multi-dimensional
pointers and functions, Lecture
Passing arguments to Chalk and Talk
functions, pointers as Coding
arguments
Week-12
12 Sample programs based on Practical
2T+2L
Pointers and arrays –
relationship, pointers and
functions, passing pointer
arguments in functions
Memory allocation- malloc, Lecture
calloc, realloc, Structure Chalk and Talk
declarations, structures and Coding
Week-13 functions
13
2T+2L Sample programs based on Practical
memory allocation and
structure functions
Arrays of structures, pointer Lecture
Week-14
14 to structures, Typedef, Unions Chalk and Talk
2T+2L
Files-introduction Coding
NATIONAL INSTITUTE OF TECHNOLOGY TIRUCHIRAPPALLI
Sample programs using Practical
structure array, structure
pointers
input/output using files, file Lecture
Week-15
15 access methods, argc, argv Chalk and Talk
2T
Coding
COURSE ASSESSMENT METHODS
The assessment in this course has two components, viz., Theory and Practical. The assessment in
Theory component has cycle test and final assessment whose details are given in the below table.
The assessment in Theory will be done for a total of 70 marks. The assessment in Practical
component has periodical record / observation evaluation and final assessment whose details are
given in the below table. The assessment in Practical will be done for a total of 30 marks. The
total marks for this course is 100.
COURSE ASSESSMENT METHODS-THEORY
S.No. Mode of Assessment Week/Date Duration % Weightage
1 Cycle Test 1 1 hour 15
2 Cycle Test 2 As per schedule 1 hour 15
CPA Compensation Assessment 1 hour 15
3 Final Assessment 3 hours 40
TOTAL THEORY MARKS 70
COURSE ASSESSMENT METHODS-PRACTICAL
Continuous Assessment
4 -- -- 10
(Weekly lab)
--
5 Programming Assessment 1 3 hours 10
--
6 Programming Assessment 2 3 hours 10
TOTAL PRACTICAL MARKS 30
TOTAL MARKS (70+30) 100
TECHNOLOGY TIRUCHIRAPPALLI
NATIONAL INSTITUTE OF
COURSE EXIT SURVEY
1. Studcnts ccdback through class committce mectingsthrough MIS or any other standard
Fecdbacks are collocted belore (inal cxamination
fomat followed by the institute
may give their feedback at any time to thc
3. Students, through their Class Represcntatives,
course làculty which will bc duly addresscd.
students, compensation assessIment
COURSE POLICY (prefrred mode of correspondencc with
poliey to be speeificd)
in-pcrson
MODE QF CORRESPONDENCE:Email/ Phonc,
COMPENSATION ASSESSMENT POLICY
I and 2 for
be given after completion of Cycle Test
1. One compensation asscssment will assessment duc to genuinc rcason.
the students thosc who are abscnt for any
cover the syllabus of Cycle tests 1& 2.
2. Compensatory assessmcnts would documents must be submitted for absence.
3. The prior permission and required
as specified below shall be followcd)
ATTENDANCE POLICY (A uniform attendance policy
course is mandatory.
> At least 75% attendance in each
under On Duty (OD) category.
A maximun of 10% shall be allowed
ACADEMIC DISHONESTY & PLAGIARISM
copying from
Possessing a mobile phone, carrying bits of paper, talking to other students,
>
treated as punishable dishonesty.
others during an assess1ment willbe
students
For copying from another student, both
Zero mark to be awarded for the offenders.
nark.
get the same penalty of zero
departmental disciplinary committee including the course faculty member, PAC
The
the facts of the malpractice and award
chairperson and the HoD, as members shall verify Academic
guilty. The report shall be submitted to thc
the punishment if the student is found
office.
applicable for all the programmes.
The above policy against academic dishonesty shall be
ADDITIONAL INFORMATION, IF ANY
consultation during the time intimated to the
1. The Course Coordinator is available for
students then and there.
office of the Dean (Acadcmic) will
2. Relative grading adhering to the instructions from the
be adopted for the coursc.
FOR APPROVAL
Course Faculty HOD
Chairperson
RoyauSsila )
