Scribd
Upload
8 views

Data Structure Syllabus

The document outlines the curriculum for the Data Structures course (BTCOC303) at Dr. Babasaheb Ambedkar Technological University, covering five units: Introduction to data structures, Stacks and Queues, Linked Lists, Trees and Graphs, and Searching and Sorting. Each unit includes key concepts, implementations, and applications relevant to data structures. The document also lists a primary textbook and several reference books for further reading.

Uploaded by

syedgaffarsyedrajjak1
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Data Structure Syllabus

The document outlines the curriculum for the Data Structures course (BTCOC303) at Dr. Babasaheb Ambedkar Technological University, covering five units: Introduction to data structures, Stacks and Queues, Linked Lists, Trees and Graphs, and Searching and Sorting. Each unit includes key concepts, implementations, and applications relevant to data structures. The document also lists a primary textbook and several reference books for further reading.

Uploaded by

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

DR.

BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE

BTCOC303: Data Structures


[UNIT 1] Introduction [7 Hours]
Data, Data types, Data structure, Abstract Data Type (ADT), representation of Information, characteristics of
algorithm, program, analyzing programs. Arrays and Hash Tables Concept of sequential organization, linear
and non-linear data structure, storage representation, array processing sparse matrices, transpose of sparse
matrices, Hash Tables, Direct address tables, Hash tables, Hash functions, Open addressing, Perfect hashing.

[UNIT 2] Stacks and Queues [7 Hours]


Introduction, stack and queue as ADT, representation and implementation of stack and queue using sequential
and linked allocation, Circular queue and its implementation, Application of stack for expression evaluation
and expression conversion, recursion, priority queue.
[UNIT 3] Linked list [7 Hours]
Concept of linked organization, singly and doubly linked list and dynamic storage management, circular
linked list, operations such as insertion, deletion, concatenation, traversal of linked list, dynamic memory
management, garbage collection.
[UNIT 4] Trees and Graphs [7 Hours]
Basic terminology, binary trees and its representation, insertion and deletion of nodes in binary tree, binary
search tree and its traversal, threaded binary tree, Heap, Balanced Trees, Terminology and representation of
graphs using adjacency matrix, Warshall‘s algorithm.
[UNIT 5] Searching and Sorting [7 Hours]
Sequential, binary searching, skip lists – dictionaries, linear list representation, skip list representation,
operations– insertion, deletion and searching. Insertion sort, selection sort, radix sort, File handling.

Text Book:
1. Weiss, Data structures and algorithms analysis in C++, Pearson Education, 4th Edition,2013

Reference Books:
1. S. Lipschutz, Data Structures, McGraw-Hill Publication, Revised 1st Edition, 2014.
2. Y. Langsm, M. Augenstin, A. Tanenbaum , Data Structure using C and C++, Prentice Hall India
Learning Private Limited,2nd edition,1998.
3. Horowitz and Sahani, Fundamentals of Data Structures, Universities Press, 2nd Edition,2008.
4. Thomas Cormen, Introduction to Algorithms, PHI Publication, 2nd Edition,2002.
5. Venkatesan& Rose, Data Structures, Wiley Publication, 1st Edition,2015.
6. Goodrich &Tamassia, Data Structure & Algorithm in C++, Wiley Publication, 2nd Edition,2011.
7. R. G. Dromey, How to Solve it by Computer, 2nd Impression, PearsonEducation.
8. Kyle Loudon, Mastering Algorithms with C: Useful Techniques from Sorting to Encryption,
O'Reilly Media, 1st Edition,1999.

Dr. Babasaheb Ambedkar Technological University, Lonere UG CURRICULUM 2020 Page 23

You might also like