L T P C

21EC1403 FUNDAMENTALS OF DATA STRUCTURES IN C

3 0 0 3

OBJECTIVES:
• To understand the basic concepts of the C-programming language.
• To learn the different data types , Understand searching and sorting algorithms
• To identify different types of data structures and its operations for real-time programming applications.
• To know stack and queues in processing data for real-time applications.
• To understand tree data storage structure for real-time applications.
• To use algorithms to find shortest data search in graphs for real-time application development.
UNIT – I FUNDAMENTAL OF C PROGRAMMING 8
Structure of a C program, Compilation and linking processes, Constants, Variables, Data Types, Types of operators in C,
Managing Input and Output operations, Decision Making and Branching - Looping statements.
SUGGESTED ACTIVITIES:
• Implementing programs using data types, arithmetic operators and basic input/output operations.
• Developing programs using if-else, do-while, while, for, switch, break, continue, enum.
• Create an application that performs operations like String manipulation.
SUGGESTED EVALUATION METHODS:
• Assignment on conditionals and loops.
• Evaluation of the programs implemented.

UNIT – II ADVANCED - C PROGRAMMING 10

Functions - Pass by value - Pass by reference, Recursion, Pointers – Definition – Initialization - Pointer’s arithmetic.
Structures and unions – definition - Programs using structures and Unions, Dynamic Memory Allocation, Pre-processor
directives.
SUGGESTED ACTIVITIES:
• Demonstration of Function programs using Call by Value and Call by reference.
• Implementing applications using Structures and Unions
• Demonstration of C programs using Recursion and pointers.
• Demonstration of programs using dynamic memory.
SUGGESTED EVALUATION METHODS:
• Quizzes on structures & union.
• Assignments on C programs to implement concepts of pointers and functions.
• Quizzes on Dynamic Memory Allocation operations.

UNIT – III LINEAR DATA STRUCTURES 9

Array-Operations on Arrays–Insertion and Deletion-Applications on Arrays. Abstract Data Types (ADTs), List ADT,
Array Based Implementation - Stacks and Queues, Linked List - Linked list-based implementation of Stacks and Queues
– Applications of Stacks and Queues.
SUGGESTED ACTIVITIES:
• Converting an algorithm from recursive to non-recursive using stack.
• Demonstrating stack for Towers of Hanoi application.
• Developing any application using all the linear data structures.
SUGGESTED EVALUATION METHODS:
• Quizzes on abstract data types.
• Assignments linked list and stack.
• Quizzes on queue and applications.
UNIT – IV NON-LINEAR DATA STRUCTURES 9

32
Trees-General Trees-Tree Terminologies-Tree Representation - Binary Trees, Tree Traversals, Expression Trees, Binary
Search Tree, Applications of trees. Graphs - Representation of Graph – Types of graphs - Breadth-first traversal – Depth-
first traversal – Applications.
SUGGESTED ACTIVITIES:
• Implementing binary tree and tree traversals.
• Solving expressions using expression trees by determining infix,prefix and postfix expressions.
• Implementing graph traversals.
SUGGESTED EVALUATION METHODS:
• Quizzes on basic tree operations.
• Assignments on tree traversals and some sample expressions.
• Assignment on Graphs and applications.
UNIT – V SORTING AND SEARCHING TECHNIQUES 9
Algorithms – Sorting - Insertion Sort, Quick Sort, Merge Sort, Algorithms–Searching Techniques-Linear and Binary
Search.
SUGGESTED ACTIVITIES:
• Implementation of all sorting techniques.
• Demonstration of searching techniques under best- and worst-case inputs.
SUGGESTED EVALUATION METHODS:
• Quizzes on sorting and searching.
• Assignments on insertion sort and quick sort.
• Seminar and Quiz on searching methods.

TOTAL: 45 PERIODS
OUTCOMES:
1. Develops the use of the C programming language to implement various algorithms, and develops the basic
concepts and terminology of programming in general.
2. Identify linear and non-linear data structures. Create algorithms for searching and sorting.
3. Create the different types of linked lists and evaluate its operations
4. Construct stack and queue data structures and evaluate its operations
5. Create tree data structures and evaluate its types and operations
6. Create graph data structure, evaluate its operations, implement algorithms to identify shortest path.
TEXT BOOKS:
1.ReemaThareja, ``Programming in C’’, 2nd edition, OXFORD University Press, New Delhi, 2019. (Units 1 and
2)
2. ReemaThareja, ``Data Structures Using C’’, 2nd edition, OXFORD University Press, New Delhi, 2016. (Units
3,4 5)
REFERENCES:
1. E.Balagurusam,"Programming in ANSI C",8thedition,McGraw Hill Education India,2019.
2. Paul Deitel and Harvey Deitel, “C How to Program”, Seventh edition, Pearson Publication.
3. Aho, Hopcroft and Ullman,"Data Structures and Algorithms", Pearson Education,1983.
4. Stephen G. Kochan,"Programming in C", 3rd edition, Pearson Education.
5. Ellis Horowitz, SartajSahni, Susan Anderson-Freed, "Fundamentals of Data Structures in C", Second Edition,
University Press, 2008

33