Scribd
Upload
18 views1 page

Data Structures

Uploaded by

srinivasan pichandi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views1 page

Data Structures

Uploaded by

srinivasan pichandi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

S3351 DATA STRUCTURES L T P C 3 0 0 3

COURSE OBJECTIVES:

• To understand the concepts of ADTs.

• To Learn linear data structures – lists, stacks, and queues.

• To understand non-linear data structures – trees and graphs.

• To understand sorting, searching and hashing algorithms.

• To apply Tree and Graph structures.

UNIT I LISTS 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 ADT

– Radix Sort – Multilists.

UNIT II STACKS AND QUEUES 9

Stack ADT – Operations – Applications – Balancing Symbols – Evaluating arithmetic expressions- Infix
to Postfix conversion – Function Calls – Queue ADT – Operations – Circular Queue – DeQueue –
Applications of Queues.

UNIT III TREES 9

Tree ADT – Tree Traversals - Binary Tree ADT – Expression trees – Binary Search Tree ADT – AVL
Trees – Priority Queue (Heaps) – Binary Heap.

UNIT IV MULTIWAY SEARCH TREES AND GRAPHS 9

B-Tree – B+ Tree – Graph Definition – Representation of Graphs – Types of Graph - Breadth-first


traversal – Depth-first traversal –– Bi-connectivity – Euler circuits – Topological Sort – Dijkstra's
algorithm – Minimum Spanning Tree – Prim's algorithm – Kruskal's algorithm

UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES 9

Searching – Linear Search – Binary Search. Sorting – Bubble sort – Selection sort – Insertion sort

– Shell sort –. Merge Sort – Hashing – Hash Functions – Separate Chaining – Open Addressing –
Rehashing – Extendible Hashing.

You might also like