Normal view MARC view ISBD view

Data structure and algorithms in C and python (Record no. 14359)

MARC details
000 -LEADER
fixed length control field	05496nam a22002057a 4500
005 - DATE & TIME
control field	20260213121146.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field	260213b \|\|\|\|\|\|\|\| \|\|\|\| 00\| 0 eng d
020 ## - ISBN
International Standard Book Number	9788195400904
Price	795.00
040 ## - CATALOGING SOURCE
Original cataloging agency	S.X.U.K
041 ## - Language
Language	English
082 ## - DDC NUMBER
Classification number	R 005.73133 BAN(DAT)
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name	Banerjee, Chandan
245 ## - TITLE STATEMENT
Title	Data structure and algorithms in C and python
Statement of responsibility	Chandan Banerjee, Atanu Das
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc	Kolkata
Name of publisher, distributor, etc	University press
Date of publication, distribution, etc	c2023
300 ## - PHYSICAL DESCRIPTION
Pages	634p.
Other Details	P.B.
500 ## - GENERAL NOTE
General note	List of Algorithms and Pseudocodes<br/>List of C Programs<br/>List of Python Programs<br/>Preface<br/>About the Authors<br/><br/>Chapter 1: Introduction to Data Structures<br/><br/>1.1 Introduction<br/>1.2 Data Types<br/>1.3 Dynamic Memory Allocation<br/>1.4 Classification of Data Structures<br/>1.5 Operations on Data Structures<br/>1.6 Algorithms and Data Structures<br/>1.7 Choosing Appropriate Data Structures<br/>1.8 File Organization<br/>1.9 Data-related Other Subjects<br/>1.10 C and Python for Program Development<br/>1.11 Programming Paradigms in Data Structure<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/><br/>Chapter 2: Python Digest<br/><br/>2.1 Introduction<br/>2.2 Features of Python<br/>2.3 Advantages of Python<br/>2.4 String and Variables<br/>2.5 User Input<br/>2.6 Python Operators<br/>2.7 Lists<br/>2.8 Sets<br/>2.9 Tuples<br/>2.10 Dictionaries<br/>2.11 Conditional Statements (if, else, elif)<br/>2.12 Iteration Loops (while and for)<br/>2.13 Loop Control Statements (break, continue, pass)<br/>2.14 Functions<br/>2.15 Modules<br/>2.16 Packages<br/>2.17 Files<br/>2.18 Exceptions<br/>2.19 Classes and Objects<br/>2.20 Functional Programming in Python<br/>2.21 Numpy Array in Python<br/>2.22 Series and DataFrames in Pandas<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/>Lab Exercises<br/><br/>Chapter 3: Algorithms and Complexity Analysis<br/><br/>3.1 Introduction<br/>3.2 Complexity of Algorithms<br/>3.3 Asymptotic Notations<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/><br/>Chapter 4: Array<br/><br/>4.1 Introduction<br/>4.2 Array Operations Using Static Memory Allocation<br/>4.3 Array Operations Using Dynamic Memory Allocation<br/>4.4 Applications of Array Using Static Memory Allocations<br/>4.5 Applications of Array Using Dynamic Memory Allocations<br/>4.6 Representation of 2D Arrays in Computer Memory<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/>Lab Exercises<br/><br/>Chapter 5: Linked List<br/><br/>5.1 Introduction<br/>5.2 Classification of Linked Lists<br/>5.3 Operations on Singly Linked List<br/>5.4 Operations on Circular Linked List<br/>5.5 Operations on Doubly Linked List<br/>5.6 Traversing in Linked List<br/>5.7 Memory Allocation and Garbage Collection<br/>5.8 Sparse Matrix Representation Using Array and Linked List<br/>5.9 Polynomials Representation Using Linked List<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/>Lab Exercises<br/><br/>Chapter 6: Stack<br/><br/>6.1 Introduction<br/>6.2 Design and Implementation of Stack<br/>6.3 Applications of Stack<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/>Lab Exercises<br/><br/>Chapter 7: Queue<br/><br/>7.1 Introduction<br/>7.2 Design and Implementation of Queue<br/>7.3 Double-ended Queue or Deque<br/>7.4 Priority Queue<br/>7.5 Implement Queue Using Two Stacks with the Help of Arrays<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/>Lab Exercises<br/><br/>Chapter 8: Recursion<br/><br/>8.1 Introduction<br/>8.2 GCD of Two Numbers Using Recursion<br/>8.3 Factorial of a Number Using Recursion<br/>8.4 Fibonacci Series Using Recursion<br/>8.5 Ackermann Function Using Recursion<br/>8.6 Pascal’s Triangle Representation Using Recursion<br/>8.7 Solving the Tower of Hanoi Problem Using Recursion<br/>8.8 Sorting a Stack Using Recursion<br/>8.9 N-Queens Problem Using Recursion<br/>8.10 Dynamic Programming and Memoization<br/>8.11 Some Solved Examples of Recursion<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/>Lab Exercises<br/><br/>Chapter 9: Trees<br/><br/>9.1 Introduction<br/>9.2 Characteristics of Binary Trees<br/>9.3 Binary Tree Traversal Algorithms<br/>9.4 Construction of a Binary Tree Using Tree Traversal<br/>9.5 Threaded Binary Tree<br/>9.6 Binary Search Tree (BST)<br/>9.7 AVL Tree or Height-balanced Tree<br/>9.8 B Tree (Balanced Tree)<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/>Lab Exercises<br/><br/>Chapter 10: Graphs<br/><br/>10.1 Introduction<br/>10.2 Representation of Graph<br/>10.3 Applications of Graph<br/>10.4 Traversing a Graph<br/>10.5 Spanning Tree<br/>10.6 Dijkstra’s Algorithm for Shortest-path Evaluation<br/>10.7 Grid Path Problem<br/>10.8 Longest Common Subsequence (LCS)<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/>Lab Exercises<br/><br/>Chapter 11: Sorting<br/><br/>11.1 Introduction<br/>11.2 Bubble Sort<br/>11.3 Insertion Sort<br/>11.4 Selection Sort<br/>11.5 Quick Sort<br/>11.6 Merge Sort<br/>11.7 Heap Sort<br/>11.8 Radix Sort<br/>11.9 Comparison of Time Complexity of Sorting Methods<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/>Lab Exercises<br/><br/>Chapter 12: Searching<br/><br/>12.1 Introduction<br/>12.2 Linear Search<br/>12.3 Binary Search<br/>12.4 Interpolation Search<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/>Lab Exercises<br/><br/>Chapter 13: Hashing<br/><br/>13.1 Introduction<br/>13.2 Popular Hashing Methods<br/>13.3 Collision Resolution Techniques<br/>13.4 Implementations of Collision Resolution Techniques<br/>13.5 Analysis of Hashing Techniques and Load Factor<br/>13.6 Rehashing Technique<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/>Lab Exercises<br/><br/>Chapter 14: File Organization<br/><br/>14.1 Introduction<br/>14.2 Classification of File Organizations<br/>14.3 File Operations<br/>14.4 Importance of File Organization<br/>14.5 File Read–Write–Append Operations with C and Python<br/>14.6 File Organization and Operating System<br/>Quick Recap<br/>Review Questions<br/>Case Studies<br/>Lab Exercises<br/><br/>Index
650 ## - Subject
Subject	Data structure
--	programming language
700 ## - Added Entry Personal Name
Relator Code	auth.
Added Entry Personal Name	Das, Atanu
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type	REFERENCE COMPUTER SCIENCE

Holdings
Source of classification or shelving scheme	Not for loan	Koha collection	Location (home branch)	Sublocation or collection (holding branch)	Shelving location	Date acquired	Source of acquisition	Cost, normal purchase price	Serial Enumeration / chronology	Koha full call number	Barcode (Accession No.)	Koha date last seen	Copy Number	Price effective from	Koha item type
Dewey Decimal Classification	Not For Loan	Reference	St. Xavier's University, Kolkata	St. Xavier's University, Kolkata	Reference Section	02/13/2026	K.M. Enterprise	795.00	S.X.U.K	R 005.73133 BAN(DAT)	UCS13967	02/13/2026	13967	02/13/2026	REFERENCE COMPUTER SCIENCE
Dewey Decimal Classification			St. Xavier's University, Kolkata	St. Xavier's University, Kolkata	Lending Section	02/13/2026	K.M. Enterprise	795.00	S.X.U.K	005.73133 BAN(DAT)	CS13968	02/13/2026	13968	02/13/2026	COMPUTER SCIENCE
Dewey Decimal Classification			St. Xavier's University, Kolkata	St. Xavier's University, Kolkata	Lending Section	02/13/2026	K.M. Enterprise	795.00	S.X.U.K	005.73133 BAN(DAT)C1	CS13969	02/13/2026	13969	02/13/2026	COMPUTER SCIENCE