Data Structure in C

By:

Achuthsankar S. Nair

Contributor(s):

T. Mahalakshmi

Material type: Text

TextPublication details: New Delhi PHI Learning 2009Description: 281pISBN:

9788120336421

Subject(s):

C (Computer program language)

DDC classification:

005.13/3 ACH-D

Summary: The text begins with an introduction to the most common concepts of C and then it goes on to give a detailed discussion on the processing of one-dimensional and two-dimensional arrays, their internal organization, and handling arrays using pointers. Besides, it dwells on the dynamic linked list and its variations such as doubly linked lists and circular linked lists, with the help of memory diagrams. The text delineates the static and dynamic implementations of stacks and queues, the application, implementation, and construction of binary trees, and representation of graphs and graph traversal. The book concludes with a discussion on the various types of searching and sorting techniques, with the help of visual examples.

Tags from this library: No tags from this library for this title. Log in to add tags.

Holdings
Item type	Current library	Home library	Call number	Status	Date due	Barcode
Book	Dept. of Computational Biology and Bioinformatics Processing Center	Dept. of Computational Biology and Bioinformatics	005.13/3 ACH-D (Browse shelf(Opens below))	Available		DCB1323

Browsing Dept. of Computational Biology and Bioinformatics shelves, Shelving location: Processing Center Close shelf browser (Hides shelf browser)

Previous	No cover image available No cover image available							Next
Previous	005.12 GRI-E The Essence of Structural Systems Analysis	005.13/1 LIN-I An Introduction to Formal Languages and Automata	005.13/1 PAN-I An Introduction To Automata Theory & Formal	005.13/3 ACH-D Data Structure in C	005.13/3 BEA-P Python Essential Reference	005.13/3 BUR-P Perl & Lwp	005.13/3 COG-P Php 5 Unleashed	Next

The text begins with an introduction to the most common concepts of C and then it goes on to give a detailed discussion on the processing of one-dimensional and two-dimensional arrays, their internal organization, and handling arrays using pointers. Besides, it dwells on the dynamic linked list and its variations such as doubly linked lists and circular linked lists, with the help of memory diagrams. The text delineates the static and dynamic implementations of stacks and queues, the application, implementation, and construction of binary trees, and representation of graphs and graph traversal. The book concludes with a discussion on the various types of searching and sorting techniques, with the help of visual examples.

There are no comments on this title.

to post a comment.