It looks like you're offline.
Open Library logo
additional options menu

MARC record from Internet Archive

LEADER: 02882cam a22003737a 4500
001 2012405741
003 DLC
005 20140717082217.0
008 120725s2012 ii a 001 0 eng d
010 $a 2012405741
016 7 $a016120992$2Uk
020 $a9780198066231
020 $a0198066236
035 $a(OCoLC)ocn780482748
040 $aBTCTA$beng$cBTCTA$dCDX$dYDXCP$dYNK$dUAT$dBWX$dUKMGB$dOCLCF$dDAC$dDLC
042 $alccopycat
050 00 $aQA76.73.C153$bP395 2012
082 04 $a005.133
100 1 $aPatil, Varsha H.
245 10 $aData structures using C++ /$cVarsha H. Patil.
260 $aNew Delhi, India :$bOxford University Press,$c2012.
300 $axvi, 803 p. :$bill. ;$c25 cm.
490 1 $aOxford higher education
500 $aIncludes index.
505 0 $aFundamental concepts -- Linear data structure using arrays -- Stacks -- Recursion -- Queues -- Linked lists -- Trees -- Graphs -- Searching and sorting -- Search trees -- Hashing -- Heaps -- Indexing and multiway trees -- Files -- Standard template library -- Algorithm analysis and design.
520 $aData Structures Using C++ is designed to serve as a textbook for undergraduate engineering students of computer science and information technology as well as postgraduate students of computer applications. The book aims to provide a comprehensive coverage of all the topics related to data structures. The book begins with a discussion on the fundamentals of data structures and algorithms, and moves on to the concepts of linear data structures, stacks, recursion, queues, and searching and sorting. All the elements of data structures, such as linked lists, trees, graphs, hashing, heaps, and indexing, are covered in separate chapters in detail. The chapter on files explains file management and organization using C++ and the chapter on the standard template library provides detailed coverage of entities such as containers and iterators. A chapter on algorithm analysis and design is provided towards the end that discusses the various algorithmic strategies required to solve a problem effectively and efficiently. Written in a simple manner with strong pedagogy including numerous multiple choice and review questions, the book also provides programming problems at the end of every chapter.--$cPublisher description.
650 0 $aC++ (Computer program language)
650 0 $aData structures (Computer science)
650 7 $aC++ (Computer program language)$2fast
650 7 $aData structures (Computer science)$2fast
830 0 $aOxford higher education.
856 42 $3Contributor biographical information$uhttp://www.loc.gov/catdir/enhancements/fy1409/2012405741-b.html
856 42 $3Publisher description$uhttp://www.loc.gov/catdir/enhancements/fy1409/2012405741-d.html
856 41 $3Table of contents only$uhttp://www.loc.gov/catdir/enhancements/fy1409/2012405741-t.html