0% found this document useful (0 votes)
6K views1 page

Data Structure

The document outlines the modules covered in a course on data structures and algorithms, including algorithms and analysis, arrays, stacks, queues, linked lists, graphs, trees, sorting, and searching. Key data structures like arrays, stacks, queues, linked lists, trees, and graphs are discussed along with algorithms for sorting and searching. The modules cover topics like algorithm analysis, implementation of various data structures, graph algorithms, binary trees, AVL trees, sorting, and searching algorithms.

Uploaded by

Piyush Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6K views1 page

Data Structure

The document outlines the modules covered in a course on data structures and algorithms, including algorithms and analysis, arrays, stacks, queues, linked lists, graphs, trees, sorting, and searching. Key data structures like arrays, stacks, queues, linked lists, trees, and graphs are discussed along with algorithms for sorting and searching. The modules cover topics like algorithm analysis, implementation of various data structures, graph algorithms, binary trees, AVL trees, sorting, and searching algorithms.

Uploaded by

Piyush Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

Copy and paCP2101 DATA STRUCTURES AND ALGORITHMS MODULE I Algorithms and Analysis of Algorithms: Definition, Structure and

d Properties of A lgorithms, Development of an Algorithm, Data Structures and Algorithms, Data Str ucture Definition and Classification, Efficiency of Algorithms, Apriory Analysis , Asymptotic Notations, Time Complexity of an Algorithm using O Notation, Polyno mial Vs Exponential Algorithms, Average, Best and Worst case Complexities, Analy zing Recursive Programs. 03 Lectures MODULE II Arrays, Stacks and Queues: Array Operations, Number of Elements in an Array, Rep resentation of Arrays in Memory, Applications of Array, Stack-Introduction, Stac k Operations, Applications of Stack, Queues-Introduction, Operations on Queues, Circular Queues, Other Types of Queues, Applications of Queues. 08 Lectures MODULE III Linked List, Linked Stacks and Linked Queues: Singly Linked Lists, Circularly Li nked Lists, Doubly Linked Lists, Multiply Linked Lists, Applications of Linked L ists, Introduction to Linked Stack and Linked Queues, Operations on Linked Stack s and Linked Queues, Dynamic Memory Management and Linked Stack, Implementations of Linked Representations, Applications of Linked Stacks and Linked Queues. 07 Lectures MODULE IV Graphs: Introduction, Definitions and Basic Terminologies, Representations of Gr aphs, Graph Traversals, Single-Source Shortest-Path Problem, Minimum Cost Spanni ng Trees. 05 Lectures MODULE V Trees, Binary Trees, BST, AVL Trees and B Trees: Trees: Definition and Basic Ter minologies, Representation of Trees, Binary Trees: Basic Terminologies and Types , Representation of Binary Trees, Binary Tree Traversals, Threaded Binary Trees, Applications, BST & AVL Trees: Introduction, BST: Definition and Operations, AV L Trees: Definition and Operations, B Trees: Introduction, m-way search trees: D efinition and Operations, B Trees: Definition and Operations. 10 Lectures MODULE VI Sorting: Introduction, Shell Sort, Quick Sort, Heap Sort. 04 Lectures MODULE VII Searching: Introduction, Binary Search, Transpose Sequential Search, Interpolati on Search. 03 Lectures Text Book: G A V Pai Data Structures and Algorithms: Concepts, Techniques and Applications, 2nd Edn, Tata McGraw-Hill, 2008 Reference Books: 1. J. P. Tremblay , P. G. Sorenson An Introduction to Data Structures With Applications, 2nd Edn, McGraw-Hill, Inc. New York, NY, USA. 2. Seymour Lipschutz Data Structures, 6th Edn, 9th Reprint 2008, Tata McGra w-Hill. ste to create a document

You might also like