Data Structures
Data Structures
DATA STRUCTURES
I B. Tech. - II Semester L T P C
Course Code: A3CS04 4 1 - 4
COURSE OBJECTIVES:
1. To teach efficient storage mechanisms of data for an easy access.
2. To design and implementation of various basic and advanced data structures.
3. To introduce various techniques for representation of the data in the real world.
4. To develop application using data structures.
5. To improve the logical ability
COURSE OUTCOMES:
Upon completion of the course, the students will be able to:
Upon completion of the course, the students will be able to:
1. Student will be able to choose appropriate data structure as applied to specified problem
Definition.
2. Student will be able to handle operations like searching, insertion, deletion, traversing
mechanism etc. on various data structures.
3. Students will be able to apply concepts learned in various domains like DBMS, compiler
construction etc.
4. Students will be able to use linear and non-linear data structures like stacks, queues, linked
list.
5. Students will be able to write the programs using data structures in C.
SYLLABUS
UNIT-I
Enumerated, Structure ,and Union Types– The Type Definition (typedef), Enumerated types,
Structures –Declaration, initialization, accessing structures, operations on structures, Complex
structures, structures and functions, Passing structures through pointers, self referential structures,
unions, bit fields, C programming examples.
UNIT-II
Data Structures – Introduction to Data Structures, abstract data types.
Linear list – singly linked list implementation, insertion, deletion and searching operations on linear
list, circularly linked lists- Operations for Circularly linked lists, doubly linked list implementation,
insertion, deletion and searching operations, applications of linked lists.
UNIT-III
Stack ADT- definition, operations, array and linked implementations in C, applications-infix to postfix
conversion, Postfix expression evaluation, recursion implementation.
Queue ADT- definition and operations, array and linked Implementations in C, Circular queues-
Insertion and deletion operations, Deque (Double ended queue) ADT, array and linked
implementations in C
UNIT-IV
Searching and Sorting – Searching-linear and binary search methods
Sorting- selection sort, bubble sort, insertion sort, quick sort, merge sort comparison of sorting and
searching methods.
UNIT-V
Trees – Definitions, tree representation, properties of trees, Binary tree, Binary tree representation,
binary tree properties, binary tree traversals, binary tree implementation, applications of trees.
TEXT BOOKS:
1. Fundamentals of Data structures in C, 2nd Edition, E.Horowitz, S.Sahni and Susan
AndersonFreed, Universities Press.
2. Data structures A Programming Approach with C, D.S.Kushwaha and A.K.Misra, PHI.
REFERENCE BOOKS:
1. Data structures: A Pseudo code Approach with C, 2nd edition, R.F.GilbergAndB.A.Forouzan,
Cengage Learning.
2. Data structures and Algorithm Analysis in C, 2nd edition, M.A.Weiss, Pearson.
3. Data Structures using C, A.M.Tanenbaum,Y. Langsam, M.J.Augenstein, Pearson.
4. Data structures and Program Design in C, 2nd edition, R.Kruse, C.L.Tondo and
B.Leung,Pearson