A Practical Approach to Data Structures and Algorithms.

Saved in:
Bibliographic Details
Main Author: Pahuja, Sanjay.
Format: eBook
Language: English
Published: London : New Academic Science, 2009.
Subjects:
Data structures (Computer science) > Problems, exercises, etc.
Algorithms.
Computer algorithms.
elektronické knihy
electronic books
ISBN: 9781781831762
1781831769
9781523118939
1523118938
Physical Description: 1 online resource (573 pages)

Cover

Table of contents

LEADER 03984cam a2200409Mu 4500
001 kn-on1048923464
003 OCoLC
005 20240717213016.0
006 m o d
007 cr cn|||||||||
008 180818s2009 enk o 000 0 eng d
040 |a EBLCP  |b eng  |e pn  |c EBLCP  |d YDX  |d OCLCQ  |d KNOVL  |d OCLCF  |d OCLCQ  |d OCLCO  |d OCL  |d OCLCQ  |d OCLCO  |d OCLCL 
020 |a 9781781831762 
020 |a 1781831769 
020 |a 9781523118939  |q (electronic bk.) 
020 |a 1523118938  |q (electronic bk.) 
035 |a (OCoLC)1048923464  |z (OCoLC)1162164375  |z (OCoLC)1357278054 
100 1 |a Pahuja, Sanjay. 
245 1 2 |a A Practical Approach to Data Structures and Algorithms. 
260 |a London :  |b New Academic Science,  |c 2009. 
300 |a 1 online resource (573 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
505 8 |6 880-01  |a 3.1 One Dimensional Arrays3.2 Two-Dimensional Arrays; 3.3 Multidimensional Arrays; 3.4 Ordered Arrays; 3.5 Sparse Matrix; Chapter 4: Linear Data Structure-Linked List; 4.1 Linear Linked List and Operations; 4.2 Circular Linked Linear Lists and Operations; 4.3 Doubly Linear Linked Lists and Operations; 4.4 Applications of Linked Lists; 4.4.1 Polynomial Manipulation; 4.4.2 Multiple-Precision Arithmetic; 4.5 Set Operation on Linked List; Chapter 5: Algorithms on Stack; 5.1 Representation: Using Array and Linked List; 5.2 Push and Pop Operations. 
505 8 |a 5.3 Representation of expression: Infix, Postfix and Prefix5.4 Evaluation of the Postfix expression; 5.5 Transforming Infix Expression into Postfix Expression; 5.6 Recursion; Chapter 6: Algorithms on Queue; 6.1 Representation: Using Array and Linked List; 6.2 Insertion and Deletion Operations; 6.3 Circular Queue; 6.4 Double Ended Queues (DEQues); 6.5 Priority Queue; 6.6 Multiple Queues; Chapter 7: Non-Linear Data Structure: Trees; 7.1 General Concept; 7.2 Binary Tree; 7.3 Sequential and Linked List Representation of Binary Tree; 7.4 Binary Tree Traversal Algorithm: Recursive and Non-recursive. 
505 8 |a 7.5 Threaded Binary Tree Traversal7.6 General Tree and Its Conversion; 7.7 Binary Search Tree (BST); 7.8 Height Balanced Trees: AVL; 7.9 B-Trees; 7.10 Applications of Trees; Chapter 8: Non-Linear Data Structure: Graphs; 8.1 Properties of Graphs; 8.2 Representation of Graphs; 8.3 Traversal Algorithms-Depth First Search, Breadth First Search; 8.4 Minimum Cost Spanning Tree; 8.5 Biconnectivity; 8.6 Strong Connectivity; 8.7 Transitive Closure Algorithm; 8.8 Shortest Path Algorithms; 8.9 Applications of Graph; Chapter 9: Sorting Algorithms and Their Analysis; 9.1 Internal and External Sorting. 
505 8 |a 9.2 Sorting Problem9.2.1 Bubble Sort; 9.2.2 Selection Sort; 9.2.3 Insertion Sort; 9.2.4 Shell Sort; 9.2.5 Address Calculation Sort; 9.2.6 Radix Sort; 9.2.7 Merge Sort; 9.2.8 Quick Sort; 9.2.9 Heap Sort; Chapter 10: Searching Techniques; 10.1 Sequential Search; 10.2 Binary Search; 10.3 Hashing; 10.3.1 Hash Functions; 10.3.2 Collision Resolution Techniques; 10.4 Dynamic Memory Allocation; Chapter 11: File Structures; 11.1 Definition and Concept; 11.2 File Organization; 11.3 Files in 'C'; Appendix: Conceptual Problem Solutions; Index; CD-Index. 
506 |a Plný text je dostupný pouze z IP adres počítačů Univerzity Tomáše Bati ve Zlíně nebo vzdáleným přístupem pro zaměstnance a studenty 
590 |a Knovel  |b Knovel (All titles) 
650 0 |a Data structures (Computer science)  |v Problems, exercises, etc. 
650 0 |a Algorithms. 
650 0 |a Computer algorithms. 
655 7 |a elektronické knihy  |7 fd186907  |2 czenas 
655 9 |a electronic books  |2 eczenas 
776 0 8 |i Print version:  |a Pahuja, Sanjay.  |t A Practical Approach to Data Structures and Algorithms.  |d London : New Academic Science, ©2009  |z 9781906574048 
856 4 0 |u https://proxy.k.utb.cz/login?url=https://app.knovel.com/hotlink/toc/id:kpPADSA001/practical-approach-to?kpromoter=marc  |y Full text 

Similar Items