Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
19 views

DataStructures Unit 4

The document outlines the syllabus for the course CS8391 Data Structures. It covers 5 units - linear data structures like lists, stacks, queues and trees, non-linear data structures like graphs, and searching, sorting and hashing techniques. Example implementations and applications are discussed for each data structure.

Uploaded by

DIVAKAR .K.G
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
19 views

DataStructures Unit 4

The document outlines the syllabus for the course CS8391 Data Structures. It covers 5 units - linear data structures like lists, stacks, queues and trees, non-linear data structures like graphs, and searching, sorting and hashing techniques. Example implementations and applications are discussed for each data structure.

Uploaded by

DIVAKAR .K.G
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 32

JEPPIAAR INSTITUTE OF TECHNOLOGY

“Self Belief | Self Discipline | Self Respect”

DEPARTMENT OF
COMPUTER SCIENCE AND ENGINEERING

LECTURE NOTES

CS8391 / DATA STRUCTURES


(2017 Regulation)
Year/Semester: II / 03

Prepared by

Dr. K. Tamilarasi,

Professor / Dept. of CSE.


SYLLABUS

CS8391 DATA STRUCTURES LTPC 3003

UNIT I LINEAR DATA STRUCTURES – LIST 9


Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list
implementation ––singly linked lists- circularly linked lists- doubly-linked lists – applications
of lists –Polynomial Manipulation – All operations (Insertion, Deletion, Merge, Traversal).

UNIT II LINEAR DATA STRUCTURES – STACKS, QUEUES 9


Stack ADT – Operations - Applications - Evaluating arithmetic expressions-
Conversion of Infix to postfix expression - Queue ADT – Operations - Circular Queue –
Priority Queue - deQueue – applications of queues.

UNIT III NON LINEAR DATA STRUCTURES – TREES 9


Tree ADT – tree traversals - Binary Tree ADT – expression trees – applications of
trees – binary search tree ADT –Threaded Binary Trees- AVL Trees – B-Tree - B+ Tree -
Heap – Applications of heap.

UNIT IV NON LINEAR DATA STRUCTURES - GRAPHS 9


Definition – Representation of Graph – Types of graph - Breadth-first traversal -
Depth-first traversal – Topological Sort – Bi-connectivity – Cut vertex – Euler circuits –
Applications of graphs.

UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES 9


Searching- Linear Search - Binary Search. Sorting - Bubble sort - Selection sort -
Insertion sort - Shell sort – Radix sort. Hashing- Hash Functions – Separate Chaining –
Open Addressing – Rehashing – Extendible Hashing.
TOTAL: 45 PERIODS

TEXT BOOKS:
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson
Education,1997.
2. ReemaThareja, “Data Structures Using C”, Second Edition , Oxford University Press,
2011
REFERENCES:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, “Introduction to
Algorithms", Second Edition, Mcgraw Hill, 2002.
2. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education,1983.
3. Stephen G. Kochan, “Programming in C”, 3rd edition, Pearson Education.

You might also like