1 Name of the Course C Programming and Data Structures

2 Course Code 21EDE03

3 Course Type Theory Focus on-Skill
Development/Employability
4 Synopsis/Rationale of the This course has three credits dedicated to provide
Module the students a strong foundation on the basic
knowledge on C Programming and Data Structures
applications
5 Semester and Year Offered III /IVSemester; IIYear
6 Credit Value 3
7 Pre-requisite (if any) Fundamental concepts on computer programming
8 Assessment Strategy 50% External and 50% Internal

9 Course Learning Outcomes (write the statement of the course learning

outcomes)
At the end of the course the students will be able to:
CLO Statements Level of Teaching Mode of
Taxonomy Method Assessments
Describe thefundamental
concepts of procedure- C2 1.Quiz
Lecture/
oriented programming such (Cognitive) CIA &
Tutorial
as tokens, data types and Understand ESE
CLO 1 operators.
Apply the concept of 2.Problem
control statements, Arrays C3 Based
Lecture/
CLO 2 and Functions in simple (Cognitive) Learning-
Tutorial
applications for handling Apply Debugging
homogenous data . CIA & ESE

Adopt the concept of

Structures, Unions, A3
Group
CLO 3 Pointers and Files for (Affective) 3.Assignment
Discussion
workingwithheterogeneous Valuing CIA & ESE
data.
Describe the various types
ofdata structures and 4.Online
C2
CLO 4 understand the importance (Cognitive)
Lecture/
Tutorial Test
of its invariants Understand CIA & ESE

Demonstrate appropriate
data structure design Lecture/
method for a Tree concept, C3 Tutorial/ 5.Simulation
CLO 5 (Cognitive)
Problem
sorting and searching to Apply
CIA & ESE
obtain afeasiblesolution solving
using critical thinking.
 10 Mapping CLO’s with PLO’s (select the learning domain for each CLO’s and
map it with PLO’s;
for example, CLO 1- Knowledge- PLO 1; CLO 2- Communication skills; PLO 4
etc.,)
CLO PLO 1 PLO 2 PLO 3 PLO 4 PLO 5 PLO 6 PLO 7 PLO 8 PLO 9 PLO PLO 11
10
CLO 1 √

CLO 2 √

CLO 3 √

CLO 4 √

CLO 5 √

11 Transferable skills 1 Critical Thinking Skills

2 Numeracy Skills

12 Distribution of Student Learning Time-(*SLT-Students Learning Time; L-Lecture;

T-Tutorial; P-Practical (Lab & Demonstration); O-Others i.e., case study,
Problem based learning, Group discussion learning etc.,) ** F2F-Face to Face;
NF2F-Non-Face to Face
Course Content outline CLO Teaching-
Learning
Activities
Guided Learning Total Guided Inde
(F2F) Learni pen
L T P O ng dent SLT
Lear
E-
Learni ning
ng (NF
(NF2F) 2F)
Unit Overview of C: CLO1 6 2 - - 8 3 5 16
I  History of C
 Importance of C
 Basic Structure of
programs

Constant, Variables, and

Data Types:
 Character Set
 C Tokens
 Keywords and
Identifier Constants
  Variables
 Data Types
 Declaration of
Variables Assigning
Values to Variables

Operators and
Expressions:
 Arithmetic Operators
 Relational Operators
 Logical Operators
 Assignment
Operators
 Increment and
Decrement
Operators
 Conditional
Operators
 Bitwise Operators
Unit Decision Making and CLO1 7 2 - - 9 3 6 18
II
Branching:
 Decision Making with if
 Simple if
 The if ….. else
 Nesting of if ….. else
 The Else if Ladder
 Switch

Decision Making and

Looping:
 The While
Statement
 The do Statement
 The for Statement

Arrays:
 One-dimension
Arrays
 Declaration
 Initialization
 Two-dimension
Arrays
 Initializing

User-Defined Functions
 Need for User-
defined Functions
 Elements of User-
 defined Functions
 Definition of
Functions
 Return Values and
their types
 Function Calls
 Function
Declaration
 Category of
Functions
 Nesting of
Functions
 Recursion
Unit Structures and Unions: CLO2 5 - - 3 8 3 5 16
III  Defining a Structure
 Declaring
 Accessing Structure
Members Structure
Initialization
 Copying and
Comparing Structure
Variables
 Arrays of Structures
 Arrays within
Structures
 Structures within
Structures
 Structures and
Functions
 Union
 Union Declaration
 Initialization
 Comparison of
structure&union
Unit Introduction to Data CLO2 7 - - 3 10 3 7 20
IV Structures:
 Data and
Information
 Overview of Data
Structures
 Types of Data
Structures
 Data Structure
Operations

Stack:
 Stack
Implementation
 Operations on
Stack
Queues :
 Introduction
 Queue
Implementation
 Operations of
queues

Static List and Linked

List
 Implementation of
List
 Insertion
 Deletion
 Sorting
Unit Trees CLO3 6 - - 3 9 3 6 18
V  Basic Terms
 Binary Tree
 Binary Tree
Representation
 Traversal of a Binary
Tree
Sorting:
 Insertion Sort
 Selection Sort
 Bubble Sort
 Quick Sort
 Radix Sort
Total 31 4 - 9 44 15 29 88

13 Continuous Assessment Percentage F2F (hours) NF2F SLT

(%) (hours)
Quiz –CLO1 5% - 1 1
Problem Based Learning- 5% - 1 1
Debugging - CLO 2
Assignment - CLO 3 5% - 1 1
Online Test- CLO 4 5% - 1 1
Simulation - CLO 5 5% - 1 1
CIA 1 7.5% 2 6 8
CIA 2 7.5% 2 6 8
CIA 3 10% 3 9 12
14 Final/Summative 50% 3 9 12
Assessment/End
Semester Exam
Grand Total - SLT (12+13+14) 138
15 Identify special NIL
requirements to deliver the
course (Software,simulation
room, computer lab etc.,)

16 References
A. Balagurusamy. E; (2006).Programming in
ANSI,(2nded). Tata McGraw - Hill Publishing
CompanyLimited, New Delhi.
B.Balagurusamy.E;(2010). Object Oriented
Programming with C++, (4th ed.), Tata
McGraw – Hill Publishing Company Limited,
New Delhi.
 C. Ashok ,N .Kamthane; (2007).
Introduction toData Structures using C,
Pearson Education.
17 Additional References 1. Brian, W. Kernighan, Dennis M. Ritchie,
The C Programming Language, Prentice
Hall
2. S. Sahni, & E. Horowitz, Data Structures,
Galgotia Publications
3. Tanenbaum. Data Structures using C,
Pearson/PHI.

18 Course Content: 60% Theory and 40% Practical

19 Recommended by BOS Date:

20 Approved by Academic Council Resolution No: Date:

Course Coordinator: BOARD CHAIRMAN

Dr.S.Saraswathi (Seal & Signature)