Read more
Informationen zum Autor Varsha H. Patil is currently working as Head of Computer & I.T. Engineering department at Matoshri College of Engineering. She is also serving as the Vice Principal of the same institute. She has more than 18 years of teaching experience. She is a life member of many professional bodies such as ISTE, CSI, IE(I), and IETE. Having published many national and international journals she is also an author of five books in different areas of Computer Science & Engineering. Klappentext Data Structures Using C++ is designed to serve as a textbook for undergraduate engineering students of Computer Science and Information Technology as well as postgraduate students of Computer Applications. The book aims to provide a comprehensive coverage of the concepts of Data Structures using C++. Zusammenfassung Data Structures Using C++ is designed to serve as a textbook for undergraduate engineering students of computer science and information technology as well as postgraduate students of computer applications. The book aims to provide a comprehensive coverage of all the topics related to data structures. The book begins with a discussion on the fundamentals of data structures and algorithms, and moves on to the concepts of linear data structures, stacks, recursion, queues, and searching and sorting. All the elements of data structures, such as linked lists, trees, graphs, hashing, heaps, and indexing, are covered in separate chapters in detail. The chapter on files explains file management and organization using C++ and the chapter on the standard template library provides detailed coverage of entities such as containers and iterators. A chapter on algorithm analysis and design is provided towards the end that discusses the various algorithmic strategies required to solve a problem effectively and efficiently. Written in a simple manner with strong pedagogy including numerous multiple choice and review questions, the book also provides programming problems at the end of every chapter. Inhaltsverzeichnis 1 Fundamental Concepts 1 1.1 Introduction to Programming 1 1.2 Object-oriented Programming 3 1.3 Introduction to Data Structures 3 1.3.1 Data 4 1.3.2 Data type 4 1.3.3 Data object 5 1.3.4 Data structure 5 1.3.5 Abstract data type 6 1.4 Types of Data Structures 9 1.4.1 Primitive and non-primitive data structures 9 1.4.2 Linear and non-linear data structures 9 1.4.3 Static and dynamic data structures 10 1.4.4 Persistent and ephemeral data structures 10 1.4.5 Sequential access and direct access data structures 11 1.5 Introduction to Algorithms 11 1.5.1 Characteristics of algorithms 12 1.5.2 Algorithmics 13 1.5.3 Algorithm design tools: Pseudocode and fl owchart 13 1.6 Pseudocode 14 1.6.1 Pseudocode notations 14 1.6.2 Algorithm header 14 1.6.3 Purpose 15 1.6.4 Condition and return statements 15 1.6.5 Statement numbers 16 1.6.6 Variables 16 1.6.7 Statement constructs 17 1.6.8 Subalgorithms 18 1.7 Relationship among data, data structures, and algorithms 20 1.8 Implementation of data structures 21 1.9 Flowcharts 22 1.10 Analysis of Algorithms 22 1.10.1 Complexity of algorithms 22 1.10.2 Space complexity 23 1.10.3 Time complexity 24 1.10.4 Computing time complexity of an algorithm 24 1.10.5 Big-O notation 25 1.11 From Problem to Program 26 1.12 Software Engineering 27 1.12.1 Analysis phase 27 1.12.2 Design phase 28 1.12.3 Implementation phase 28 1.12.4 Testing phase 29 1.12.5 Verifi cation 29 2 Linear Data Structure Using Arrays 34 2.1 Sequential Organization 34 2.2 Linear Data Structure Using Sequential Organization: Arrays 35 2.3 Array as an Abstract Data Type 37 2.4 Memory Representation and Address Calculation 39 2.5 The Class Array 41 2.5.1 Inserting an element into an array 43 2...
