With effect from the academic year 2022-2023
PCC102 Data Structures using C
Credits : 4
Instruction 4L hrs per week Duration of SEE 3 hours
CIE 30 marks SEE 70 marks
Course Objectives
1. To learn the features of C
2. To learn the linear and non-linear data structures
3. To explore the applications of linear and non-linear data structures
4. To learn to represent data using graph data structure
5. To learn the basic sorting and searching algorithms
Course Outcomes - Upon completion of the course, students will be able to:
1. Implement linear and non-linear data structure operations using C
2. Suggest appropriate linear / non-linear data structure for any given data set.
3. Apply hashing concepts for a given problem
4. Modify or suggest new data structure for an application
5. Appropriately choose the sorting algorithm for an application
UNIT I - C PROGRAMMING BASICS
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.
Simple programs- sorting- searching – matrix operations.
UNIT II - FUNCTIONS, POINTERS, STRUCTURES AND UNIONS
Functions – Pass by value – Pass by reference – Recursion – Pointers – Definition –
Initialization – Pointers arithmetic. Structures and unions – definition – Structure within a
structure – Union – Programs using structures and Unions – Storage classes, Pre-processor
directives.
UNIT III - LINEAR DATA STRUCTURES
Arrays and its representations
Stacks and Queues – Applications
Linked lists – Single, circular and doubly Linked list-Application
UNIT IV - NON-LINEAR DATA STRUCTURES
Trees – Binary Trees – Binary tree representation and traversals , – Applications of trees.
Binary Search Trees , AVL trees.
Graph and its representations – Graph Traversals.
UNIT V - SEARCHING AND SORTING ALGORITHMS
Linear Search – Binary Search.
Sorting: Selection Sort, Bubble Sort, Insertion sort , Merge sort , Quick Sort
Hashing, Types of Hashing. Collision resolution techniques
10
With effect from the academic year 2022-2023
Suggested Readings:
1. Brian W. Kernighan / Dennis Ritchie ,The C Programming Language ,Second
Edition , Pearson 2015
2. Pradip Dey and Manas Ghosh, ―Programming in C, Second Edition, Oxford
University Press, 2011.
3. Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, ―Fundamentals of Data
Structures in C, Second Edition, University Press, 2008.
4. Mark Allen Weiss, ―Data Structures and Algorithm Analysis in C, Second Edition,
Pearson Education, 1996
5. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, ―Data Structures and
Algorithms, Pearson Education, 1983.
11
