Data structures using C
Roadmap to the Syllabus: storage structure for arrays, sparse matrices; stacks and queues: representation and application; linked lists: single linked lists, linked list representation of stacks and queues; operations on polynomials; double linked list, circular list. Module II Dynamic storage manag...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Delhi
Pearson
2012
|
| Edition: | [First edition] |
| Series: | Always learning
|
| Subjects: | |
| Online Access: | |
| Collection: | O'Reilly - Collection details see MPG.ReNa |
| LEADER | 01942nmm a2200313 u 4500 | ||
|---|---|---|---|
| 001 | EB002213978 | ||
| 003 | EBX01000000000000001350939 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr||||||||||||||||||||| | ||
| 008 | 240604 ||| eng | ||
| 020 | |a 9781299444805 | ||
| 050 | 4 | |a QA76.9.D35 | |
| 100 | 1 | |a Kamthane, Ashok N. | |
| 245 | 0 | 0 | |a Data structures using C |c Ashok N. Kamthane |
| 250 | |a [First edition] | ||
| 260 | |a Delhi |b Pearson |c 2012 | ||
| 300 | |a 528 pages |b illustrations | ||
| 653 | |a Data structures (Computer science) / Textbooks | ||
| 653 | |a C (Computer program language) / Textbooks | ||
| 041 | 0 | 7 | |a eng |2 ISO 639-2 |
| 989 | |b OREILLY |a O'Reilly | ||
| 490 | 0 | |a Always learning | |
| 500 | |a Subject code: BE-2106 | ||
| 776 | |z 1299444806 | ||
| 776 | |z 9781299444805 | ||
| 856 | 4 | 0 | |u https://learning.oreilly.com/library/view/~/9781299444805/?ar |x Verlag |3 Volltext |
| 082 | 0 | |a 500 | |
| 082 | 0 | |a 005.7/3 | |
| 520 | |a Roadmap to the Syllabus: storage structure for arrays, sparse matrices; stacks and queues: representation and application; linked lists: single linked lists, linked list representation of stacks and queues; operations on polynomials; double linked list, circular list. Module II Dynamic storage management – garbage collection and compaction; infix to postfix conversion; postfix expression evaluation. Trees: tree terminology, binary tree, binary search tree, general tree, B+ tree, AVL tree, complete binary tree representation, tree traversals, operation on binary trees, expression manipulation. Module III Graphs – graph terminology, representation of graphs, path matrix, breadth first search (BFS), depth first search (DFS), topological sorting, Warshall’s algorithm (shortest path algorithm); sorting and searching techniques: bubble sort, selection sort, insertion sort, quick sort, merge sort, heap sort, radix sort; linear and binary search methods; hashing techniques and hash functions | ||