Data structure and Algorithm: COMPUTER SCIENCE (Computer Science Course) - Softcover

Singh Parmar, Divyansh Pratap

9781709396571: Data structure and Algorithm: COMPUTER SCIENCE (Computer Science Course)

Softcover

ISBN 10: 1709396571 ISBN 13: 9781709396571

Verlag: Independently published, 2019

Alle Exemplare dieser ISBN-Ausgabe

0 Gebraucht

1 Neu

Von EUR 15,83

hi students,if you are a computer science student then this is the best book for you...this is the whole course book for Data structure and algorithms it contains a total most of the knowledge about the subject.CONTENTSCHAPTER:1 INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS1.1 Introduction to data structures1.2 Review of data structures- Array, Pointer, Structure, Trees, and Graphs1.3 What is an Algorithm1.4 Designing Algorithms1.5 Analysing Algorithms1.6 Asymptotic Notation CHAPTER:2 ALGORITHM ON LINKED LIST:2.1 Linear Linked List and Operations2.2 Circular Liked List and Operations2.3 Doubly Linked List and Operations2.4 Applications of Linked list: Polynomial representation, CHAPTER :3 ALGORITHMS ON STACK:3.1 Introduction of stack3.2 Representation using array and linked list: Operation and Example3.3 Push and Pop Operation3.4 Representation of expressions: Infix, Postfix, Prefix3.5 Recursion: Tower of Hanoi, Recursive functionsCHAPTER:4 ALGORITHMS ON QUEUE:4.1 Introduction of queue4.2 Representation using array and linked list4.3 Insertion and Deletion Operation4.4 Circular Queue4.5 Double Ended Queue4.6 Priority QueueCHAPTER:5 NON-LINEAR DATA STRUCTURE: “TREE”5.1 Introduction of trees5.2 Sequential and Linked List Representation of Tree5.3 Binary Tree5.4 Conversion of General Trees to Binary Trees5.5 Binary Tree Traversal Algorithms: Recursive and Non-recursive 5.5.1 Preorder Traversal 5.5.2 Inorder Traversal 5.5.3 Postorder Traversal 5.5.4 Backward Inorder5.6 Binary Search Tree5.7 Applications of TreesCHAPTER:6 NON-LINEAR DATA STRUCTURE: “GRAPH”6.1 Properties of Graphs6.2 Representation of Graphs 6.2.1 Adjacency Matrix 6.2.2 Adjacency List6.3 Traversal Algorithms- Depth First Search, Breadth First Search6.4 Minimum Cost Spanning Tree 6.4.1 Prims Algorithm 6.4.2 Kruskal’s Algorithm6.5 Shortest Path Algorithms 6.5.1 Bellman-Ford Algorithm 6.5.2 Dijkastra’s Algorithm 6.5.3 Warshal Algorithm6.6 Applications of GraphsCHAPTER:7 SORTING AND SEARCHING ALGORITHMS AND THEIR ANALYSIS7.1 Internal and External Sorting7.2 Sorting Problems: 7.2.1 Selection sort 7.2.2 Bubble sort 7.2.3 Insertion Sort 7.2.4 Merge sort 7.2.5 Quick Sort 7.2.6 Heap Sort7.3 Sequential Search7.4 Binary Search7.5 Hashing: Hashing Functions Collision Resolution Techniques

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.