Scribd
Upload
47 views

BCA-DSC05 Core-V: Data Structures Unit - I: Ii Year / Iii Sem

This document outlines the units of study for a course on data structures. The five units cover abstract data types and various implementations of lists, stacks, queues and trees. Specific data structures studied include linked lists, binary trees, binary search trees, AVL trees, B-trees, heaps and graphs. Additional topics include searching, sorting, hashing and algorithm analysis. The course aims to teach fundamental data structures and their applications.

Uploaded by

Pradee
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
47 views

BCA-DSC05 Core-V: Data Structures Unit - I: Ii Year / Iii Sem

This document outlines the units of study for a course on data structures. The five units cover abstract data types and various implementations of lists, stacks, queues and trees. Specific data structures studied include linked lists, binary trees, binary search trees, AVL trees, B-trees, heaps and graphs. Additional topics include searching, sorting, hashing and algorithm analysis. The course aims to teach fundamental data structures and their applications.

Uploaded by

Pradee
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

BCA-DSC05

CORE-V: DATA STRUCTURES


II YEAR / III SEM

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

UNIT - II
Stack ADT-Operations- Applications- Evaluating arithmetic expressions – Conversion of
infix to postfix expression-Queue ADT-Operations-Circular Queue- Priority Queue-
deQueueapplications of queues.

UNIT - III
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
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- 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.

TEXT BOOKS:
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson
Education 2014, 4th Edition.
2. Reema Thareja, “Data Structures Using C”, Oxford Universities Press 2014, 2nd
Edition.

REFERENCES:
1. Thomas H.Cormen,Chales E.Leiserson,Ronald L.Rivest, Clifford Stein, “Introduction
to
Algorithms”, McGraw Hill 2009, 3rd Edition.
2. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education
2003.

You might also like