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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Delhi :
Pearson,
[2012]
|
| Edition: | [First edition]. |
| Series: | Always learning.
|
| Subjects: | |
| Online Access: | CONNECT |
MARC
| LEADER | 00000nam a22000007i 4500 | ||
|---|---|---|---|
| 001 | in00006540527 | ||
| 006 | m o d | ||
| 007 | cr cnu|||unuuu | ||
| 008 | 240521s2012 ii a o 000 0 eng d | ||
| 005 | 20240524130704.0 | ||
| 035 | |a 1WRLDSHRon1434563037 | ||
| 040 | |a ORMDA |b eng |e rda |e pn |c ORMDA | ||
| 020 | |a 9781299444805 |q (electronic bk.) | ||
| 020 | |a 1299444806 |q (electronic bk.) | ||
| 035 | |a (OCoLC)1434563037 | ||
| 037 | |a 9781299444805 |b O'Reilly Media | ||
| 050 | 4 | |a QA76.9.D35 | |
| 082 | 0 | 4 | |a 005.7/3 |2 23/eng/20240521 |
| 049 | |a TXMM | ||
| 100 | 1 | |a Kamthane, Ashok N., |e author. | |
| 245 | 1 | 0 | |a Data structures using C / |c Ashok N. Kamthane. |
| 250 | |a [First edition]. | ||
| 264 | 1 | |a Delhi : |b Pearson, |c [2012] | |
| 300 | |a 1 online resource (528 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Always learning | |
| 500 | |a Subject code: BE-2106. | ||
| 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. | ||
| 500 | |a O'Reilly Online Learning Platform: Academic Edition (SAML SSO Access) |5 TMurS | ||
| 650 | 0 | |a Data structures (Computer science) |v Textbooks. | |
| 650 | 0 | |a C (Computer program language) |v Textbooks. | |
| 730 | 0 | |a WORLDSHARE SUB RECORDS | |
| 830 | 0 | |a Always learning. | |
| 856 | 4 | 0 | |u https://go.oreilly.com/middle-tennessee-state-university/library/view/-/9781299444805/?ar |z CONNECT |3 O'Reilly |t 0 |
| 949 | |a ho0 | ||
| 994 | |a 92 |b TXM | ||
| 998 | |a wi |d z | ||
| 999 | f | f | |s 7da55e35-32d6-4afd-b209-215619212b8e |i fdce41ff-6c94-4560-b76e-4605f6aa153f |t 0 |
| 952 | f | f | |a Middle Tennessee State University |b Main |c James E. Walker Library |d Electronic Resources |t 0 |e QA76.9.D35 |h Library of Congress classification |
