Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sull?autore
Achuthsankar S. Nair, Ph.D., is Honorary Director, Centre for Bioinformatics, University of Kerala, Thiruvananthapuram. He has over two decades of teaching experience in various engineering colleges and institutes in India and abroad. Dr. Nair has been a Visiting Professor at University of Korea, Seoul. He is a member of the Executive Committee of Higher Education Council, Government of Kerala, and a syndicate member of Cochin University of Science and Technology. T. Mahalekshmi (Ph.D., Computer Science) is Principal, Sree Narayana Institute of Technology, Vadakevilla, Kollam, Kerala. She has more than 20 years of teaching experience in the field.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.