325ECT06 – C PROGRAMMING AND DATA STRUCTURES
Programme&
BE – Electronics and Communication Engineering Sem. Category L T P Credit
Branch
Prerequisites Programming in C III PC 3 0 0 3
Course Understand the fundamentals of C programming.
Objectives(s): Develop programs using arrays, functions, pointers and structures.
Learn basic linear and non-linear data structures.
Apply suitable searching and sorting techniques.
Develop problem-solving skills for engineering applications using C language
and data structures..
Unit –I Basics of C Programming 9
Structure of a C program - compilation and linking processes - Constants, Variables – Data Types -
Expressions using operators in C - Managing Input and Output operations - Decision Making and Branching -
Looping statements. Arrays - Initialization - Declaration - One dimensional and Two-dimensional arrays.
Strings - String operations - String Arrays.
Unit –II Functions, Pointers, Structures And Unions 9
Functions - Pass by value - Pass by reference - Recursion - Pointers - Initialization - Pointers arithmetic.
Structures and unions - Structure within a structure - Union - Files- Operations on Files- Memory
Management
Unit –III Linear Data Structures 9
Abstract Data Types - Linked list Implementation of List- polynomial addition- Linked List Implementation of
Stack- Balancing Symbols - Postfix Expressions - Infix to Postfix Conversion - Linked list Implementation of
Queues- Circular Queue.
Unit –IV Non Linear Data Structures 9
Preliminaries -Binary Trees -Tree Traversals - Binary Search Tree -Operations on Binary Search Tree - Heaps - Binary
Heaps - Operations of Heaps - Graph and its representations -Graph Traversals -Shortest Path Algorithm: Dijkstra’s
Algorithm-AVL Tree.
Unit –V Searching, Sorting and Hashing 9
Searching Techniques – Linear Search – Binary Search – Sorting Techniques: Bubble Sort, Selection Sort, Insertion Sort,
Merge Sort and Quick Sort – Introduction to Hashing – Hash Functions – Collision Handling using Separate Chaining.
Total Hours:45
TEXT BOOK:
1 ReemaThareja, Data Structures using C, 3rd Edition, Oxford University Press, 2022.
2 NarasimhaKarumanchi, Data Structures and Algorithms Made Easy, 5th Edition, Career Monk Publications,
2023.
REFERENCES:
Seymour Lipschutz, Data Structures with C, Schaum’s Outline Series, McGraw Hill, 2020.
1.
YedidyahLangsam, Moshe J. Augenstein and Aaron M. Tenenbaum, Data Structures using C and C++, Pearson
2.
Education, 2019.
COURSE OUTCOMES (COs)
On completion of the course, students will be able to:
CO1: Develop C programs using arrays, functions and pointers.
CO2: Apply linked list concepts for dynamic data storage
CO3: Demonstrate stack and queue operations and applications
CO4: Apply tree and graph traversal techniques.
CO5: Apply searching, sorting and hashing techniques for data organization.
Mapping of COs with POs and PSOs
325ECT06 – C PROGRAMMING AND DATA STRUCTURES
COs / POs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2 PSO3
CO1 3 2 1 - - - - - 1 1 1 3 1 1
CO2 3 2 1 - - - - - 1 1 1 3 1 1
CO3 3 2 2 - - - - - 1 1 1 3 1 1
CO4 3 2 2 - - - - - 1 1 1 3 1 1
CO5 3 2 2 - - - - - 1 1 1 3 1 1
AVG 3 2 2 - - - - - 1 1 1 3 1 1
1 – Low, 2 – Moderate, 3 –High,”- “– No Correlation