Scribd
Upload
49 views2 pages

Ds Syllabus

Uploaded by

sindhusrrcetsoftware
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
49 views2 pages

Ds Syllabus

Uploaded by

sindhusrrcetsoftware
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/ 2

CS3301 DATA STRUCTURES LTPC 3003

OBJECTIVES:
 To understand the concepts of ADTs
 To Learn linear datastructures –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

UNITI 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 – Multi lists.

UNITII STACKS ANDQUEUES 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.

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

UNITIV MULTIWAYSEARCH TREES ANDGRAPHS 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

UNITV SEARCHING,SORTINGANDHASHINGTECHNIQUES 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.
TOTAL: 45 PERIODS

OUTCOMES:
At the end of the course,the student should beable to:
 Define linear and non-linear data structures.
 Implement linear and non–linear data structure operations.
 Use appropriate linear/non–linear data structure operations for
solving a given problem.
 Apply appropriate graph algorithms for graph applications.
 Analyze the various searching and sorting algorithms.
TEXT BOOKS:
1. MarkAllenWeiss,“DataStructuresandAlgorithmAnalysisinC”,2ndEd
ition, Pearson Education,1997.
2. Kamthane, IntroductiontoDataStructuresinC,1stEdition,PearsonEducation,2007

REFERENCES:
1. Langsam,Augenstein andTanenbaum, DataStructuresUsingCandC++,
2ndEdition, Pearson Education, 2015.
2. ThomasH.Cormen,CharlesE.Leiserson,RonaldL.Rivest,CliffordStein,
“Introduction to Algorithms”, Second Edition, Mcgraw Hill, 2002.
3. Alfred V. Aho, Jeffrey D. Ullman,John E. Hopcroft ,Data Structures
and Algorithms, 1st edition, Pearson, 2002.
4. Kruse,DataStructuresandProgramDesigninC,2ndEdition,PearsonEdu
cation, 2006.

You might also like