COURSE INFORMATION

Course Code & Course Title : CS3353- C PROGRAMMING AND DATA STRUCTURES (R21)
Academic Year/Sem : 2023-2024 (ODD)
Offering Semester : III
Credits (L T P C) :3003
Course in-charge : Ms. Kiruba.N

ABOUT THE COURSE & CONTENTS

This course will provide a study of the basic C programming and Data Structures that forms the building
block of program development. Data Structure is a way to store and organize data so that it can be used
efficiently. The Data Structure lectures shall include all topics of basics of C program and Data Structure such as
Linked List, Stack, Queue, Graph, Searching, Sorting, hashing, etc.

Program Outcomes addressed

PO Program Outcomes
Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals,
1 and an engineering specialization to the
solution of complex engineering problems.
Problem analysis: Identify, formulate, research literature, and analyze complex engineering
2 problems reaching substantiated conclusions using first principles of mathematics, natural sciences,
and engineering
sciences.
Design/development of solutions: Design solutions for complex engineering problems and design system
components or processes that meet the specified needs with appropriate consideration for the public
3 health and safety, and the cultural, societal, and environmental considerations.

Conduct investigations of complex problems: Use research-based knowledge and research methods
4 including design of experiments, analysis and interpretation of data, and synthesis of the information
to provide valid
conclusions.

Life-long learning: Recognize the need for, and have the preparation
12 and ability to engage in independent and life-long learning in the broadest context of
technological change.

Program Specific Outcomes addressed

PSO Program Specific Outcome

Design Data Structures and Database Management Systems with the recurrent programming languages to
1 provide software solutions
 In the fields of Artificial Intelligence, Big data and Cloud Computing use problem solving
2 Techniques

Course Outcomes
At the end of the course students will have the ability to

Class
CO Course Outcomes POs CL Sessions
(approx.)
Develop C programs for any real PO1,PO2,PO3,PSO1
CO1 AP 9
world/technical application.

Apply advanced features of C in solving PO1,PO2,PO3,PSO1

CO2 problems. AP 9

Write functions to implement linear and non– PO1,PO2,PO3,PS

CO3 O1 AP 9
linear data structure operations.
Suggest and use appropriate linear/non– linear PO1,PO2,PO3,PO4,PO
CO4 data structure operations for solving a given 12,PSO1, PSO2 AP 9
problem.

Appropriately use sort and search algorithms PO1,PO2,PO3,PO4,PO

CO5 12, PSO1, PSO2 AN 6
for a given application.

Apply appropriate hash functions that result in a PO1,PO2,PO3,PO4,PO

CO6 collision free scenario for data storage and 12,PSO1, PSO2 AN 3
retrieval.

Total Hours of instruction 45

Strength to which POs and PSO are addressed by COs

No. of sessions Course Level PO

devoted (Maximum 45 % of classroom sessions are strength (3-
sessions) devoted Program Outcome strong, 2-
moderate, 1-
weak)*
45 100 PO1 3
45 100 PO2 3
45 100 PO3 3
18 40 PO4 1
18 40 PO12 1
45 100 PSO1 3
18 40 PSO2 1
*Above 70% - Strong (3); 51% to 70% - Moderate (2); 40% to 60% - Weak (1); LT 5% - NIL (0) Course – PO/PSO
Mapping

Course 1 2 3 4 12 PSO1 PSO2

CS3351 3 3 3 1 1 3 1

Competencies
At the end of the course the student should be able to

Sessions
Competency CO CL
(approx.)
C1 Understanding the fundamentals of Datatypes, Operations,
CO1 U
Expressions.
C2 Understanding and Learning the conditional statement,
CO1 U
different loopings.
C3 CO1 AP 5
Interpretation of functions and recursive functions.
C4 Implementation of one dimensional array, 2D array CO1 AP 4
C5 CO2 AP 3
Able to understand the need for structure and union.
Analyzing the working of File Handling, pre-processor directives
C6 concepts. CO2 AP 3
Able to understand the use of pointers and arrays in structure
C7 CO2 AP 3
and union.
C8 Describing and defining the general concept of linear data types. CO3 AP 9
C9 Implementing and using List, Stack, Queue. CO3 AP 6
C10 Describing and defining the general concept of Non linear Data CO4 AP 9
type.
C11 Implementing and using different types of tree, graph. CO4 AP 3
C12 Describing and defining the general concept of Sorting CO5 AP
C13 Implementing and using different types of internal and CO5 AP
externalSorting algorithms
C15 Describing and defining the general concept of Hash Functions. CO6 AP
C16 Implementing and using different Hash Functions. CO6 AP
C17 CO6 AP
Describing and implementing different methods used to
resolve hash collisions
Class Average Marks

CO Course Outcomes Target

(Class Average
Marks)
CO1 Develop C programs for any real world/technical application. 65
CO2 Apply advanced features of C in solving problems 65
Write functions to implement linear and non–linear data structure 65
CO3
operations.
Suggest and use appropriate linear/non–linear data structure 65
CO4
operations for solving a given problem.
Appropriately use sort and search algorithms for a given 65
CO5
application.
Apply appropriate hash functions that result in a collision free 65
CO6
scenario for data storage and retrieval.

Assessment Pattern
 Assessment Instrument Percentage Weightage

Continuous Internal Assessment 40%

Semester End examination 60%

Continuous Internal Evaluation (20 marks)

Assessment Instrument Weightage

CIE test-1(CIA + Assignment) 25%

CIE test-2(CIA + Assignment) 25%

CIE test-3(CIA +Lab Models+ 25%

Assignment)
CIE test-4(CIA +Lab Models+ 25%
Assignment)
TOTAL = 200

THEORY COMPONENT
LECTURE PLAN
TEXTBOOKS
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition, Pearson
Education, 1997.
2. ReemaThareja, “Programming in C”, Second Edition, Oxford University Press, 2016

LECTURE PLAN
Text Contact
Modules Content Pages CO.X RBT
Book hours
Data Types 2 57-57 1 1 U
Variables 2 58-59 1 1 U
C Operations 2 59-64 1 1 U
PROGRAMMING Expressions and Statements 2 65-67 1 1 U
FUNDAMENTALS Conditional Statements 2 67-68 1 1 U
Functions – Recursive Functions 2 68-69 1 1 U
Arrays – Single and Multi-Dimensional 2 3 1 U
68-77
Arrays.
Structures 2 78-79 1 2 U
Union 2 87-90 1 2 AP
C
PROGRAMMING Enumerated Data Types 2 91-92 2 2 AP
- ADVANCED Pointers: Pointers to Variables 2 92-94 1 2 AP
FEATURES Arrays and Functions 2 95-95 1 2 U
File Handling 2 96-99 1 2 AP
Preprocessor Directives 2 100-101 1 2 AP
Tree ADT 1 105-106 1 3 U
Tree Traversals 2 107-111 2 3 AP
1 1 3 AP
LINEAR Binary Tree ADT 111-112
DATA
STRUCTURES Expression trees 1 112-113 1 3 AP
Binary Search Tree ADT 1 116-125 1 3 AP
Priority Queue (Heaps) 1 193-195 1 3 U
 Binary Heap 1 195-207 1 3 AP
B-Tree, B+ Tree 1 149-154 1 4 U
Graph Definition-Representation of 1 1 4 U
299-300
NONLINEAR Graph
DATA Types of Graph-BFS,DFS 1 301-305 1 4 AP
STRUCTURES Bi-connectivity 1 338-342 1 4 AP
Topological Sort 1 302-305
Hashing, Hash Functions 1 165-168 1 6 U
Separate Chaining 1 168-173 1 6 AP
Open Addressing 1 173-180 1 6 AP
Rehashing, Extendible Hashing 1 181-186 1 6 AP
SEARCHING, Searching - Linear Search 1 224-234 1 5 U
SORTING AND Binary Search 235-250 5 U
HASHING Selection sort ,Insertion sort, Shell sort, 1 1 5 AP
TECHNIQUES 235-236
Merge Sort

TOTAL LECTURE HOURS: 45

COURSE CO-ORDINATOR HoD IQAC coordinator PRINCIPAL