St. Xavier's University Library Search for 'su:"Programming language"'

Programming in python 3 : A complete introduction to the python language

]]> By Summerfield, Mark .
Delhi Pearson 2018 .
xvii, 630 , Includes index & selected bibliography 9789352869176

]]> Place hold on Programming in python 3

Introduction to machine learning with python : a guide for data sciences

]]> By Muller, Andreas C. .
Kolkata Shroff publishers 2022 .
xii, 378 , Includes index 9789352134571

]]> Place hold on Introduction to machine learning with python

(The) C programming language

]]> By Kernighan, Brian W. .
New Delhi Prentice- Hall 1996 .
xii, 272 , Includes index & appendix 8120305965

]]> Place hold on (The) C programming language

Object-oriented programming with C++

]]> By Balagurusamy, E.
New Delhi Tata McGraw Hill 1995 .
xii, 321 , Includes index & appendix 007462038X

]]> Place hold on Object-oriented programming with C++

Programming in Ansi C

]]> By Balagurusamy, E. .
New Delhi Tata McGraw Hill 1992 .
xi, 411 , Includes appendix 0074604015

]]> Place hold on Programming in Ansi C

Machine learning using R

]]> By Kumar Rahul .
New Delhi Wiley 2022 .
xxii, 430 , Includes index 9789354246111

]]> Place hold on Machine learning using R

Let us C

]]> By Kanetkar, Yashavant.
New Delhi BPB 2007 .
464p. , includes index 9789387284494

]]> Place hold on Let us C

Numerical Analysis And Computational Procedures: including computer fundamentals and programming in FORTRAN & C/

]]> By Mollah, S. A. .
Kolkata: Books & Allied (P) Ltd. 2022 .
xiv, 922p. , includes index 9789394107052

]]> Place hold on Numerical Analysis And Computational Procedures:

Thinking in C++

]]> By Eckel, Bruce .
Delhi Pearson Education 2000 .
814 , Includes index 9788178082974

]]> Place hold on Thinking in C++

Computer fundamentals and programming in c

]]> By Dey, Pradip.
New Delhi Oxford 2021 .
479p. , includes index 9780198084563

]]> Place hold on Computer fundamentals and programming in c

Data structures and algorithms using c : theory, design and implementation

]]> By Salaria, R.S..
New Delhi Khanna 2024 .
522p. , includes index 9789381068588

]]> Place hold on Data structures and algorithms using c

Ansi C programming

]]> By Kanetkar, Yashavant P..
New Delhi Bpb 2025 .
589p. , includes index 9789389423006

]]> Place hold on Ansi C programming

(The) C programming language

]]> By Kernighan, Brian W..
Chennai Pearson 2025 .
272p. , includes index 9789332549449

]]> Place hold on (The) C programming language

Introduction to Machine Learning with R : Rigorous Mathematical analysis

]]> By Burger, Scott V. .
Kolkata Shroff publishers 2018 .
ix, 212 , Table of contents : What is a model? -- Supervised and unsupervised machine learning -- Sampling statistics and model training in R -- Regression in a nutshell -- Neural networks in a nutshell -- Tree-based methods -- Other advanced methods -- Machine learning with the caret package -- Encyclopedia of machine learning models in caret. Includes index 9789352137251

]]> Place hold on Introduction to Machine Learning with R

Programming neural networks with Python

]]> By Steinwendner, Joachim .
Navi Mumbai Shroff 2025 .
457 , Includes index 9789355427762

]]> Place hold on Programming neural networks with Python

Python 3 : the comprehensive guide

]]> By Ernesti, Johannes .
Kolkata Shroff 2022 .
1036 , Includes index 9789355422811

]]> Place hold on Python 3

Deep learning from scratch : building with Python from first principles

]]> By Weidman, Seth.
Navi Mumbai Shroff Publishers 2019 .
xiv, 235 , Includes Index 9789352139026

]]> Place hold on Deep learning from scratch

Problem solving and Python programming : fundamentals and applications NumPy, Pandas and Matplotlib

]]> By Bhasin, Harsh .
New Delhi New Age International 2022 .
xviii, 538 9788195175505

]]> Place hold on Problem solving and Python programming

Data structure and algorithms in C and python

]]> By Banerjee, Chandan.
Kolkata University press 2023 .
634p. , List of Algorithms and Pseudocodes List of C Programs List of Python Programs Preface About the Authors Chapter 1: Introduction to Data Structures 1.1 Introduction 1.2 Data Types 1.3 Dynamic Memory Allocation 1.4 Classification of Data Structures 1.5 Operations on Data Structures 1.6 Algorithms and Data Structures 1.7 Choosing Appropriate Data Structures 1.8 File Organization 1.9 Data-related Other Subjects 1.10 C and Python for Program Development 1.11 Programming Paradigms in Data Structure Quick Recap Review Questions Case Studies Chapter 2: Python Digest 2.1 Introduction 2.2 Features of Python 2.3 Advantages of Python 2.4 String and Variables 2.5 User Input 2.6 Python Operators 2.7 Lists 2.8 Sets 2.9 Tuples 2.10 Dictionaries 2.11 Conditional Statements (if, else, elif) 2.12 Iteration Loops (while and for) 2.13 Loop Control Statements (break, continue, pass) 2.14 Functions 2.15 Modules 2.16 Packages 2.17 Files 2.18 Exceptions 2.19 Classes and Objects 2.20 Functional Programming in Python 2.21 Numpy Array in Python 2.22 Series and DataFrames in Pandas Quick Recap Review Questions Case Studies Lab Exercises Chapter 3: Algorithms and Complexity Analysis 3.1 Introduction 3.2 Complexity of Algorithms 3.3 Asymptotic Notations Quick Recap Review Questions Case Studies Chapter 4: Array 4.1 Introduction 4.2 Array Operations Using Static Memory Allocation 4.3 Array Operations Using Dynamic Memory Allocation 4.4 Applications of Array Using Static Memory Allocations 4.5 Applications of Array Using Dynamic Memory Allocations 4.6 Representation of 2D Arrays in Computer Memory Quick Recap Review Questions Case Studies Lab Exercises Chapter 5: Linked List 5.1 Introduction 5.2 Classification of Linked Lists 5.3 Operations on Singly Linked List 5.4 Operations on Circular Linked List 5.5 Operations on Doubly Linked List 5.6 Traversing in Linked List 5.7 Memory Allocation and Garbage Collection 5.8 Sparse Matrix Representation Using Array and Linked List 5.9 Polynomials Representation Using Linked List Quick Recap Review Questions Case Studies Lab Exercises Chapter 6: Stack 6.1 Introduction 6.2 Design and Implementation of Stack 6.3 Applications of Stack Quick Recap Review Questions Case Studies Lab Exercises Chapter 7: Queue 7.1 Introduction 7.2 Design and Implementation of Queue 7.3 Double-ended Queue or Deque 7.4 Priority Queue 7.5 Implement Queue Using Two Stacks with the Help of Arrays Quick Recap Review Questions Case Studies Lab Exercises Chapter 8: Recursion 8.1 Introduction 8.2 GCD of Two Numbers Using Recursion 8.3 Factorial of a Number Using Recursion 8.4 Fibonacci Series Using Recursion 8.5 Ackermann Function Using Recursion 8.6 Pascal’s Triangle Representation Using Recursion 8.7 Solving the Tower of Hanoi Problem Using Recursion 8.8 Sorting a Stack Using Recursion 8.9 N-Queens Problem Using Recursion 8.10 Dynamic Programming and Memoization 8.11 Some Solved Examples of Recursion Quick Recap Review Questions Case Studies Lab Exercises Chapter 9: Trees 9.1 Introduction 9.2 Characteristics of Binary Trees 9.3 Binary Tree Traversal Algorithms 9.4 Construction of a Binary Tree Using Tree Traversal 9.5 Threaded Binary Tree 9.6 Binary Search Tree (BST) 9.7 AVL Tree or Height-balanced Tree 9.8 B Tree (Balanced Tree) Quick Recap Review Questions Case Studies Lab Exercises Chapter 10: Graphs 10.1 Introduction 10.2 Representation of Graph 10.3 Applications of Graph 10.4 Traversing a Graph 10.5 Spanning Tree 10.6 Dijkstra’s Algorithm for Shortest-path Evaluation 10.7 Grid Path Problem 10.8 Longest Common Subsequence (LCS) Quick Recap Review Questions Case Studies Lab Exercises Chapter 11: Sorting 11.1 Introduction 11.2 Bubble Sort 11.3 Insertion Sort 11.4 Selection Sort 11.5 Quick Sort 11.6 Merge Sort 11.7 Heap Sort 11.8 Radix Sort 11.9 Comparison of Time Complexity of Sorting Methods Quick Recap Review Questions Case Studies Lab Exercises Chapter 12: Searching 12.1 Introduction 12.2 Linear Search 12.3 Binary Search 12.4 Interpolation Search Quick Recap Review Questions Case Studies Lab Exercises Chapter 13: Hashing 13.1 Introduction 13.2 Popular Hashing Methods 13.3 Collision Resolution Techniques 13.4 Implementations of Collision Resolution Techniques 13.5 Analysis of Hashing Techniques and Load Factor 13.6 Rehashing Technique Quick Recap Review Questions Case Studies Lab Exercises Chapter 14: File Organization 14.1 Introduction 14.2 Classification of File Organizations 14.3 File Operations 14.4 Importance of File Organization 14.5 File Read–Write–Append Operations with C and Python 14.6 File Organization and Operating System Quick Recap Review Questions Case Studies Lab Exercises Index 9788195400904

]]> Place hold on Data structure and algorithms in C and python

Data structures using C

]]> By Balagurusamy, E.
Chennai McGraw Hill 2025 .
422p. , '- About the Author - Preface - Preface to the First Edition Chapter 1: C Recap – I Chapter 2: C Recap – II Chapter 3: Introduction to Algorithm and Data Structures Chapter 4: Arrays Chapter 5: Strings Chapter 6: Recursion Chapter 7: Linked Lists Chapter 8: Stacks Chapter 9: Queues Chapter 10: Trees Chapter 11: Graphs Chapter 12: Sorting and Searching - Index 9789364443012

]]> Place hold on Data structures using C

Problem solving suing programming in c

By Neogi, Amartya.
Kolkata Aryan 2024 .
696p. , includes index 978819651258

]]> Place hold on Problem solving suing programming in c

Python programming

]]> By Satyanarayana, Ch.
Kolkata University press 2018 .
xii,336p. , Preface Introduction 1.1 Introduction to Computer Systems Generations of computers | Applications of computers | Classification of computers 1.2 Computer Hardware Input/ Output devices | CPU | Memory 1.3 Computer Software System software | Application software 1.4 Programming Languages Machine-level programming language | Assembly-level programming language | High-level programming language 1.5 Algorithmic Problem Solving Algorithms | Characteristics of algorithm | Advantages and disadvantages of algorithm | Algorithm notation | Building blocks of algorithms | Steps for developing algorithms | Simple strategies for developing algorithms | Find minimum in a list | Insert a card in a list of sorted cards | Guess an integer number in a range | Towers of Hanoi algorithm 1.6 Building Blocks of Program 1.7 Background of Learning to Write Programs 1.8 Sample Algorithms Glossary | Summary | Multiple Choice Questions | Fill in the Blanks |State True/False |Find the Output | Find the Error | Long Answer Questions |Short Answer Questions |Exercise Algorithms | Answers 2. Fundamentals of Python Programming 2.1 Introduction to Python 2.2 Features of Python 2.3 Applications of Python Web and internet development | Scientific and numeric | Education | Desktop GUIs | Software development 2.4 Installation of Python Windows operating system | Linux operating system 2.5 Sample Program 2.6 Python Virtual Machine 2.7 Frozen Binaries 2.8 Memory Management in Python 2.9 Comparison Between C and Python 2.10 Comparison Between Java and Python 2.11 Python vs Similar Tools 2.12 Python Keywords 2.13 Python Identifiers 2.14 Python Statements 2.15 Python Indentation 2.16 Comments in Python 2.17 Differences Between Python 2.x and 3.x 2.18 Coding Styles in Python Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Long Answer Questions | Short Answer Questions | Answers 3. Syntax and Styles 3.1 Data Types 3.2 Literal 3.3 Numeric Literal 3.4 Boolean Literal 3.5 String Literal 3.6 Variable 3.7 Operators and Expressions Arithmetic operators | Comparison (relational) operators | Assignment operators | Logical operators| Bitwise operators | Membership operators | Identity operators 3.8 Expressions and Order of Evaluations 3.9 Numbers Integers | Floating point numbers | Complex numbers 3.10 Functions Applicable to All Types of Numbers 3.11 Sample Programs Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions| Short Answer Questions | Exercise Programs | Answers 4. Control Flow 4.1 If Statement 4.2 While Statement 4.3 For Statement 4.4 Break Statement 4.5 Continue Statement 4.6 Pass Statement 4.7 Entry Controlled Loop 4.8 Exit Controlled Loop 4.9 Counter Controlled Loop 4.10 Condition Controlled Loop 4.11 Nested Loops 4.12 Sample Programs 4.13 Case Studies Simple temperature converter | Simple number system converter | Generation of vowel alphabet pattern Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output |Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs | Answers 5. Sequences–Lists 5.1 Arrays 5.2 Sequences 5.3 Using Lists 5.4 List Assignment and Equivalence 5.5 List Bounds 5.6 List Slicing 5.7 List Cloning 5.8 Nested Lists 5.9 List Comprehensions 5.10 Lists and Functions 5.11 Prime Generation with a List 5.12 Adding List Elements 5.13 Mutability 5.14 List Unpacking 5.15 Stack 5.16 Queue 5.17 Functional Programming 5.18 Sample Programs Glossary | Summary | Multiple Choice Questions | Fill in the Blanks |State True/False | Find the Output |Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs | Answers 6. Tuples 6.1 Need of Tuple 6.2 Sequence Unpacking 6.3 Methods 6.4 Sample Programs Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs | Answers 7. Dictionaries 7.1 Making a Dictionary 7.2 Basic Operations 7.3 Dictionary Operations 7.4 Sets 7.5 Iterators and Generators 7.6 Sample Programs Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs| Answers 8. Functions 8.1 Introduction 8.2 Defining Functions 8.3 Calling Functions 8.4 Passing Arguments 8.5 Keyword Arguments 8.6 Default Arguments 8.7 Required Arguments 8.8 Variable-length Arguments 8.9 Return Statement 8.10 Nesting of Passing Arguments 8.11 Anonymous Functions 8.12 Recursive Function 8.13 Scope of Local and Global Variable 8.14 Documentation Strings 8.15 Sample Programs 8.16 Case Studies Recursive binary search | Substitution Cipher| Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs| Answers 9. Modules 9.1 Introduction 9.2 Importing Modules Importing all elements of a module | Importing the specific elements of a module 9.3 Creating Modules 9.4 Use of name 9.5 Name Spacing Scope 9.6 Reloading Module 9.7 Sample Programs Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs | Answers 10. Object Oriented Programming Principles 10.1 Class Statement 10.2 Class Body 10.3 Objects 10.4 Class Methods 10.5 Self Variable 10.6 Class Properties and Instance Properties 10.7 Static Method 10.8 Data Hiding 10.9 Deleting an Object 10.10 Constructor 10.11 Method Overriding 10.12 Inheritance 10.13 Composition or Containership or Complex Object 10.14 Abstract Classes and Interfaces 10.15 Metaclass 10.16 Operator Overloading Reverse adding | getitem() and setitem() | Membership operators | Miscellaneous functions 10.17 Garbage Collection 10.18 Sample Programs Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs| Answers 11. Packages 11.1 Introduction to PIP 11.2 Installing Packages via PIP 11.3 Using Python Packages 11.4 Absolute and Relative Imports 11.5 Namespace Package 11.6 Sample Programs Glossary |Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs | Answers 12. Strings and Regular Expressions 12.1 Methods of String Objects Escape sequencing 12.2 Iterating Strings 12.3 String Module 12.4 String Formatting 12.5 Regular Expression Re-module 12.6 Dictionary-based Formatting Expressions 12.7 Sample Programs Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs | Answers 13. Files and Directory Access 13.1 Files and Streams 13.2 Opening a File The read mode | The write mode | The append mode 13.3 Reading/Writing Operations on a File The read operation | The write operation 13.4 Other File Operations 13.5 Iterating through Files 13.6 Splitting Words 13.7 Serialization and De-serialization 13.8 Hash Files 13.9 Directory Access 13.10 Sample Programs Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs | Answers 14. Errors and Exceptions 14.1 Motivation 14.2 Examples of Exception 14.3 Handling Exceptions 14.4 Try Keyword 14.5 Finally Keyword 14.6 Handling Exception in Invoked Functions 14.7 With and Except Statements 14.8 Raising Exceptions 14.9 Re-raising Exception 14.10 Instantiating Exception 14.11 Custom Exceptions 14.12 Assert Statement 14.13 Pre-defined Clean-up Actions 14.14 Sample Programs Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs| Answers 15. Multithreading 15.1 Introduction to Thread 15.2 Differences Between Process and Thread 15.3 Threading Module 15.4 Thread Synchronization 15.5 Sample Program Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs | Answers 16. Tkinter 16.1 Introduction 16.2 Widget 16.3 Label Widget 16.4 Button Widget 16.5 Checkbutton Widget 16.6 Entry Widget 16.7 Listbox Widget 16.8 Radiobutton Widget 16.9 Scrollbar Widget 16.10 Text Widget 16.11 Container Widgets 16.12 Frame Widget 16.13 Menu Widget 16.14 Labelframe Widget 16.15 Message Widget 16.16 Combobox Widget 16.17 Scale Widget 16.18 Canvas Widget 16.19 Sample Programs Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs | Answers 17. Events 17.1 Event Object 17.2 Binding Callbacks to Events 17.3 Events Names 17.4 Keyboard Events 17.5 Mouse Events 17.6 Sample Programs Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs | Answers 18. Standard Library 18.1 Operating System Interface 18.2 Text Processing 18.3 Mathematics 18.4 Internet Access 18.5 Dates and Times 18.6 Data Compression 18.7 Turtle Graphics 18.9 Sample Programs Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs | Answers 19. Testing 19.1 Basic Concepts of Testing 19.2 Unit Testing in Python 19.3 Grouping Test Cases in Unit Testing 19.4 Loading and Running Tests 19.5 Sample Programs Glossary | Summary | Multiple Choice Questions | Fill in the Blanks | State True/False | Find the Output | Find the Error | Long Answer Questions | Short Answer Questions | Exercise Programs | Answers Appendix A: Networking Appendix B: Sending E-mail Appendix C: Plotting Graphs Appendix D: CGI/Web Programming using Python Index 9789386235633

]]> Place hold on Python programming

Python programming : an objected-oriented approach

]]> By Goel, Anita.
Kolkata Unversity press 2025 .
xxxvi, 818p. , Preface About the Author Basics of Computer Programming Fundamentals Python Environment Setting Basic Data Types, Literals and Variables Operators and Expressions Control Flow Function and Module String List and Tuple Set and Dictionary Files Error and Exception Handling Classes and Objects Inheritance and Polymorphism GUI Programming – Tkinter Python Libraries Using Python to Access Web Data Using Databases with Python Case Studies Annexure 1: The Python Standard Library Annexure 2: os.path — Common Pathname Manipulations Annexure 3: pathlib — Object-Oriented Filesystem Paths Index 9789393330390

]]> Place hold on Python programming

(The) C programming language

]]> By Kernighan, Brian W..
Chennai Pearson 2025 .
272p. , includes index 9789332549449

]]> Place hold on (The) C programming language

Problem solving using programming in c

]]> By Neogi, Amartya.
Kolkata Aryan 2024 .
696p. , includes index 9788196512958

]]> Place hold on Problem solving using programming in c

Fundamentals of data structure in C

]]> By Horowitz, Ellis.
Kolkata University press 2023 .
xvii,617p. , CHAPTER 1 BASIC CONCEPTS 1.1 Overview: System Life Cycle 1.2 Pointers and Dynamic Memory Allocation 1.2.1 Pointers 1.2.2 Dynamic Memory Allocation 1.2.3 Pointers Can Be Dangerous 1.3 Algorithm Specification 1.3.1 Introduction 1.3.2 Recursive Algorithms 1.4 Data Abstraction 1.5 Performance Analysis 1.5.1 Space Complexity 1.5.2 Time Complexity 1.5.3 Asymptotic Notation 1.5.4 Practical Complexities 1.6 Performance Measurement 1.6.1 Clocking 1.6.2 Generating Test Data 1.7 Referenes And Selected Readings CHAPTER 2 ARRAYS AND STRUCTURES 2.1 Arrays 2.1.1 The Abstract Data Type 2.1.2 Arrays in C 2.2 Dynamically Allocated Arrays 2.2.1 One-dimensional Arrays 2.2.2 Two-dimensional Arrays 2.3 Structures and Unions 2.3.1 Strctures 2.3.2 Unions 2.3.3 Internal Representation of Structures 2.3.4 Self-referential Structures 2.4 Polynomials 2.4.1 The Abstract Data Type 2.4.2 Polynomial Representation 2.4.3 Polynomial Addition 2.5 Sparse Matrices 2.5.1 The Abstract Data Type 2.5.2 Sparse Matrix Representation 2.5.3 Transposing a Matrix 2.5.4 Matrix Multiplication 2.6 Representation of Multidimensional Arrays 2.7 Strings 2.7.1 The Abstract Data Type 2.7.2 Strings in C 2.7.3 Pattern Matching 2.8 References and Selected Readings 2.9 Additional Exercises CHAPTER 3 STACKS AND QUEUES 3.1 Stacks 3.2 Stacks Using Dynamic Arrays 3.3 Queues 3.4 Circular Queues Using Dynamic Arrays 3.5 A Mazing Problem 3.6 Evaluation of Expressions 3.6.1 Expressions 3.6.2 Evaluating Postfix Expressions 3.7 Multiple Stacks and Queues 3.7 Additional Exercises CHAPTER 4 LINKED LISTS 4.1 Singly Linked Lists and Chains 4.2 Representing Chains in C 4.3 Linked Stacks and Queues 4.4 Polynomials 4.4.1 Polynomial Representation 4.4.2 Adding Polynomials 4.4.3 Erasing Polynomials 4.4.4 Circular List Representation of Polynomials 4.4.5 Summary 4.5 Additional List Operations 4.5.1 Operations for Chains 4.5.2 Operations for Circularly Linked Lists 4.6 Equivalence Classes 4.7 Sparse Matrices 4.7.1 Sparse Matrix Representation 4.7.2 Sparse Matrix Input 4.7.3 Sparse Matrix Output 4.7.4 Erasing a Sparse Matrix 4.8 Doubly Linked Lists CHAPTER 5 TREES 5.1 Introduction 5.1.1 Terminology 5.1.2 Representation of Trees 5.2 Binary Trees 5.2.1 The Abstract Data Type 5.2.2 Properties of Binary Trees 5.2.3 Binary Tree Representations 5.3 Binary Tree Traversals 5.3.1 Inorder Traversal 5.3.2 Preorder Traversal 5.3.3Postorder Traversal 5.3.4 Iterative Inorder Traversal 5.3.5 Level-Order Traversal 5.3.6 Traversal Without a Stack 5.4 Additional Binary Tree Operations 5.4.1 Copying Binary Trees 5.4.2 Testing Equality 5.4.3 The Satisfiability Problem 5.5 Threaded Binary Trees 5.5.1 Threads 5.5.2 Inorder Traversal of a Threaded Binary Tree 5.5.3 Inserting a Node into a Threaded Binary Tree 5.6 Heaps 5.6.1 Priority Ques 5.6.2 Definition of a Max Heap 5.6.3 Insertion into a Max Heap 5.6.4 Deletion from a Max Heap 5.7 Binary Search Trees 5.7.1 Definition 5.7.2 Searching a Binary Search Tree 5.7.3 Insertion into a Binary Search Tree 5.7.4 Deletion from a Binary Search Tree 5.7.5 Joining and Splitting Binary Search Trees 5.7.6 Height of a Binary Search Tree 5.8 Selection Trees 5.8.1 Introduction 5.8.2 Winner Trees 5.8.3 Loser Trees 5.9 Forests 5.9.1 Transforming a Forest into a Binary Tree 5.9.2 Forest Traversals 5.10 Representation of Disjoint Sets 5.10.1 Introduction 5.10.2 Union and find Operations 5.10.3 Application to Equivalence Classes 5.11 Counting Binary Trees 5.11.1 Distinct Binary Trees 5.11.2 Stack Permutations 5.11.3 Matrix Multiplication 5.11.4 Number of Distinct Binary Trees 5.12 References and Selected Readings CHAPTER 6 GRAPHS 6.1 The Graph Abstract Data Type 6.1.1 Introduction 6.1.2 Definitions 6.1.3 Graph Representations 6.2 Elementary Graph Operations 6.2.1 Depth First Search 6.2.2 Breadth First Search 6.2.3 Connected Components 6.2.4 Spanning Trees 6.2.5 Biconnected Components 6.3 Minimum Cost Spanning Trees 6.3.1 Kruskal’s Algorithm 6.3.2 Prim’s Algorithm 6.3.3 Sollin’s Algorithm 6.4 Shortest Paths and Transitive Closure 6.4.1 Single Source/All Destination: Nonnegative Edge Costs 6.4.2 Single Source/all Destination: General Weights 6.4.3 All Pairs Shortest Paths 6.4.4 Transitive Closure 6.5 Activity Networks 6.5.1 Activity-on-Vertex (AOV) Networks 6.5.2 Activity-on-Edge (AOE) Networks 6.6 References and Selected Readings 6.7 Additional Exercises CHAPTER 7 SORTING 7.1 Motivation 7.2 Insertion Sort 7.3 Quick Sort 7.4 How Fast Can We Sort? 7.5 Merge Sort 7.5.1 Merging 7.5.2 Interative Merge Sort 7.5.3 Recursive Merge Sort 7.6 Heap Sort 7.7 Sorting on Several Keys 7.8 List and Table Sorts 7.9 Summary of Internal Sorting 7.10 External Sorting 7.10.1 Introduction 7.10.2 k-way Merging 7.10.3 Buffer Handling for Parallel Operation 7.10.4 Run Generation 7.10.5 Optimal Merging of Runs 7.11 References and Selected Readings CHAPTER 8 HASHING 8.1 Introduction 8.2 Static Hashing 8.2.1 Hash Tables 8.2.2 Hash Functions 8.2.3 Overflow Handling 8.2.4 Theoretical Evaluation of Overflow Techniques 8.3 Dynamic Hashing 8.3.1 Motivation for Dynamic Hashing 8.3.2 Dynamic Hashing using Directories 8.3.3 Directoryless Dynamic Hashing 8.4 Bloom Filters 8.4.1 An Application--Differential Files 8.4.2 Bloom Filter Design 8.5 References and selected Readings CHAPTER 9 PRIORITY QUEUES 9.1 Single- and Double-Ended Priority Queues 9.2 Leftist Trees 9.2.1 Height-Biased Leftist Trees 9.2.2 Weight-Biased Leftist Trees 9.3 Binomial Heaps 9.3.1 Cost Amortization 9.3.2 Definition of Binomial Heaps 9.3.3 Insertion into a Binomial Heap 9.3.4 Melding Two Binomial Heaps 9.3.5 Deletion of Min Element 9.3.6 Analysis 9.4 Fibonacci Heaps 9.4.1 Definition 9.4.2 Deletion from an f-heap 9.4.3 Decrease Key 9.4.4 Cascading Cut 9.4.5 Analysis 9.4.6 Application to The Shortest Paths Problem 9.5 Pairing Heaps 9.5.1 Definition 9.5.2 Meld and Insert 9.5.3 Decrease Key 9.5.4 Delete Min 9.5.5 Arbitrary Delete 9.5.6 Implementation Considerations 9.5.7 Complexity 9.6 Symmetric Min-Max Heaps 9.6.1 Definition and Properties 9.6.2 SMMH Representation 9.6.3 Inserting into an SMMH 9.6.4 Deleting from an SMMH 9.7 Interval Heaps 9.7.1 Definition and Properties 9.7.2 Inserting into an Interval Heap 9.7.3 Deleting the Min Element 9.7.4 Initializing an Interval Heap 9.7.5 Complexity of Interval Heap Operations 9.7.6 The Complementary Range Search Problem 9.8 References and Selected Readings CHAPTER 10 EFFICIENT BINARY SEARCH TREES 10.1 Optimal Binary Search Trees 10.2 AVL Trees 10.3 Red-Black Trees 10.3.1 Definition 10.3.2 Representation of a Red-Black Tree 10.3.3 Searching a Red-Black Tree 10.3.4 Inserting to a Red-Black Tree 10.3.5 Deletion from a Red-Black Tree 10.3.6 Joining Red-Black Trees 10.3.7 Splitting a Red-Black Tree 10.4 Splay Trees 10.4.1 Bottom-Up Splay Trees 10.4.2 Top-Down Splay Trees 10.5 References and Selected Readings CHAPTER 11 MULTIWAY SEARCH TREES 11.1 m-way Search Trees 11.1.1 Definition and Properties 11.1.2 Searching an m-way Search Tree 11.2 B-Trees 11.2.1 Definition and Properties 11.2.2 Number of Elements in a B-Tree 11.2.3 Insertion into a B-tree 11.2.4 Deletion from a B-tree 11.3 B-Trees 11.3.1 Definition 11.3.2 Searching a B____________Tree 11.3.3 Insertion into a B____________Tree 11.3.4 Deletion from a B____________Tree 11.4 References and Selected Readings CHAPTER 12 DIGITAL SEARCH STRUCTURES 12.1 Digital Search Trees 12.1.1 Definition 12.1.2 Search, Insert and Delete 12.2 Binary Tries and Patricia 12.2.1 Binary Tries 12.2.2 Compressed Binary Tries 12.2.3 Patricia 12.3 Multiway Tries 12.3.1 Definition 12.3.2 Searching a Trie 12.3.3 Sampling Strategies 12.3.4 Insertion into a Trie 12.3.5 Deletion from a Trie 12.3.6 Keys with Different Length 12.3.7 Height of a Trie 12.3.8 Space Required and Alternative Node Structures 12.3.9 Prefix Search and Applications 12.3.10 Compressed Tries 12.3.11 Compressed Tries with Skip Fields 12.3.12 Compressed Tries with Labeled Edges 12.3.13 Space Required by a Compressed Trie 12.4 Suffix Trees 12.4.1 Have you Seen this String? 12.4.2 The Suffix Tree Data Structure 12.4.3 Let’s Find That Substring (Searching a Suffix Tree) 12.4.4 Other Nifty Things You Can Do with a Suffix Tree 12.5 Tries and Internet Packet Forwarding 12.5.1 IP Routing 12.5.2 I-Bit Tries 12.5.3 Fixed-Stride Tries 12.5.4 Variable-Stride Tries 12.6 References and Selected Readings 9788173716058

]]> Place hold on Fundamentals of data structure in C

Python computing : fundamentals and applications

]]> By Gupta, Kar Abhijit.
Kolkata Techno world 2023 .
408p. , includes index 9789392145551

]]> Place hold on Python computing