Book Details

Data Struture

Data Struture

Published by uLektz

Course Code:ULZ0239

Author:uLektz

University: General for All University

Regulation:2017

Categories:Mechanical

Format : ico_bookePUB3 (DRM Protected)

Type :eBook

FREE

Buy Now

Description :Data Struture of ULZ0239 covers the latest syllabus prescribed by General for All University for regulation 2017. Author: uLektz, Published by uLektz Learning Solutions Private Limited.

Note : No printed book. Only ebook. Access eBook using uLektz apps for Android, iOS and Windows Desktop PC.

Topics
UNIT - I ARRAYS

1.1 Abstract Data Type, The Array as an Abstract Data Type

1.2 The Polynomial Abstract Data type-Polynomial Representation-Polynomial Addition

1.3 Spares Matrices, Introduction-Sparse Matrix Representation

1.4 Transposing a Matrix-Matrix Multiplication, Representation of Arrays

UNIT - II STACKS AND QUEUES

2.1 The Stack Abstract Data Type

2.2 The Queue Abstract Data Type

2.3 Evaluation of Expressions, Expression- Postfix Notation- Infix to Postfix.

UNIT - III LINKED LISTS

3.1 Single Linked List and Chains

3.2 Circular Lists, Available Space Lists

3.3 Linked Stacks and Queues

3.4 Polynomials, Polynomial Representation-Adding Polynomials-Circular List -Representation of Polynomials

3.5 Equivalence Classes, Sparse Matrices,Sparse Matrix Representation, Sparse Matrix Input- Deleting a Sparse Matrix

3.6 Doubly Linked Lists, Generalized Lists, Representation of Generalized Lists

3.7 Recursive Algorithms for Lists

3.8 Reference Counts, Shared and Recursive Lists

UNIT - IV TREES

4.1 Representation of Trees

4.2 Binary Trees, The Abstract data type, Properties of Binary Tress, Binary Tree Representations, Binary Tree Traversal,Introduction, Inorder Traversal Preorder Traversal, Postorder Traversal

4.3 Thread Binary Trees,Threads,Inorder Traversal of a Threaded Binary Tree, Inserting a Node into a Threaded Binary Tree

4.4 Heaps,Priority Queues,Definition of a Max Heap, Insertion into a Max Heap, Deletion from a Max Heap

4.5 Binary Search Trees, Definition, Searching a Binary Search Tree, Insertion into a Binary Search Tree,Deletion from a Binary Search Tree, Height of Binary Search Tree

UNIT - V GRAPHS

5.1 The Graph Abstract Data Type, Introduction, Definition, Graph Representation, Elementary Graph Operation

5.2 Depth First Search

5.3 Breadth First Search, Connected Components

5.4 Spanning Trees, Biconnected Components, Minimum Cost Spanning Trees

5.5 Kruskal’s Algorithm

5.6 Prim’s Algorithm, Sollin’s Algorithm

5.7 Shortest Paths and Transitive Closure, Single Source/All Destination: Nonnegative Edge Cost, Single Source/All Destination: General Weights, All-Pairs Shortest Path, Transitive Closure.

UNIT - VI SORTING

6.1 Insertion Sort

6.2 Quick Sort

6.3 Merge Sort Merging, Iterative Merge Sort, Recursive Merge Sort

6.4 Heap Sort, Summary of Internal Sorting

loading