From this page you can:
| Home |
Descriptors
Make a suggestion Refine your searchData abstraction & problem solving with C++ / Frank M. Carrano
Title : Data abstraction & problem solving with C++ : walls and mirrors Material Type: printed text Authors: Frank M. Carrano, Author ; Timothy M. Henry, Author Edition statement: 7th edition Publisher: Boston : Pearson Publication Date: 2017 Pagination: 835 p. Layout: ill. Size: 25 cm ISBN (or other code): 978-0-13-446397-1 General note: Includes bibliographical footnotes
Includes bibliographical index (p. [828]- 839)
Languages : English (eng) Original Language : English (eng) Descriptors: Computer algorithms
Data processing
Data structures
Electronic books
Java (Computer Program Language)Class number: 005.73 Abstract: The Seventh Edition of Data Abstraction & Problem Solving with C++: Walls and Mirrors introduces fundamental computer science concepts related to the study of data structures. The text explores problem solving and the efficient access and manipulation of data and is intended for students who already have a basic understanding of programming, preferably in C++. The “walls and mirrors” mentioned in the title represent problem-solving techniques that appear throughout the text. Data abstraction hides the details of a module from the rest of the program, whereas recursion is a repetitive technique that solves a problem by solving smaller versions of the same problems, much as images in facing mirrors grow smaller with each reflection. Along with general changes to improve clarity and correctness, this Seventh Edition features new notes, programming tips, examples, and programming problems, as well as C++11 and C++14 features–including safe memory management using smart pointers–and safe and secure coding techniques. Contents note: Recursion: The Mirrors; Array-Based Implementations; Link-Based Implementations; Stacks; List Implementations; Algorithm Efficiency; Graphs; Review of C++ Fundamentals; Mathematical Induction; Algorithm Verification; C++ Java Verification; C++ File Fundamentals; C++ for Java Programmers; C++ for Python Programmers; Record link: https://library.seeu.edu.mk/index.php?lvl=notice_display&id=18762 Hold
Place a hold on this item
Copies
Barcode Call number Media type Location Section Status 1702-002132 005.73 Car-Dat 2017 General Collection Library "Max van der Stoel" English Available
Title : Data structures and algorithms in C++ Material Type: printed text Authors: Michael T. Goodrich, Author ; Roberto Tamassia, Author ; David Mount, Author Publisher: New York : Wiley Publication Date: 2004 Pagination: xv, 683 p. Layout: ill. Size: 25 cm ISBN (or other code): 978-0-471-42924-1 General note: Includes index
Includes bibliographical references (p. [665]-670)Languages : English (eng) Original Language : English (eng) Descriptors: C++ (Computer program language)
Computer algorithms
Data structuresClass number: 005.13 Record link: https://library.seeu.edu.mk/index.php?lvl=notice_display&id=1122 Hold
Place a hold on this item
Copies
Barcode Call number Media type Location Section Status 1702-000344 005.13 Goo-Dat 2004 General Collection SEEU Library Skopje English Available
Title : Data Structures and Algorithms Made Easy : Data Structures and Algorithmic Puzzles Material Type: printed text Authors: Narasimha Karumanchi, Author Edition statement: 5th edition Publisher: Bombay : CareerMonk Publications Publication Date: 2017 Pagination: 433 p. Size: 25 cm ISBN (or other code): 978-81-932452-7-9 General note: Includes bibliographical footnotes Languages : English (eng) Original Language : English (eng) Descriptors: Algorithms
Computer algorithms
Data structuresClass number: 005.73 Abstract: Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists. A handy guide of sorts for any computer science professional. It is not the main objective of this book to present you with the teorems and proofs on data structures and algorithms. This book is also useful for Engineering degree students and Master degree students during their academic preparations. In all the chapters you will see that there is more emphasis on problems and their analysis rather than on theory. Contents note: Variables; Data Types; Data structures; What is an Algorithm?; Goal of the Analysis of Algorithms; Types of Analysis; Asymptotic Notation; Important Notes; Guidelines for Asymptotic Analysis; Amortized Analysis; Notes of Recursion; Example Algorithms of Recursion; Arrays Overview; Circular Linked Lists; Skip Lists; Binary Trees; Types of Binary Trees; XOR Trees; Pririty Queue ADT; Binary Heaps; Heapsort; Topological Sort; Bubble Sort; Insertion Sort; Tree Sort; Load Factor; Master Theorem; Record link: https://library.seeu.edu.mk/index.php?lvl=notice_display&id=18766 Hold
Place a hold on this item
Copies
Barcode Call number Media type Location Section Status 1702-002133 005.73 Kar-Dat 2017 General Collection Library "Max van der Stoel" English Available
Title : Data Structures and Other Objects Using C++ Material Type: printed text Authors: Michael Main, Author ; Walter Savitch, Author Edition statement: 4th edition Publisher: Boston : Addison Wesley Publication Date: 2010 Pagination: 818 p. Layout: ill. Size: 22 cm ISBN (or other code): 978-0-13-212948-0 General note: Includes bibliographical index (p. 812-818)
Includes bibliographical footnotesLanguages : English (eng) Original Language : English (eng) Descriptors: Computer science
Data structures
Programming
Programming and programsClass number: 005.133 Abstract: Data Structures and Other Objects Using C++ takes a gentle approach to the data structures course in C++. Providing an early, self-contained review of object-oriented programming and C++, this text gives students a firm grasp of key concepts and allows those experienced in another language to adjust easily. Flexible by design, professors have the option of emphasizing object-oriented programming, covering recursion and sorting early, or accelerating the pace of the course. Finally, a solid foundation in building and using abstract data types is also provided, along with an assortment of advanced topics such as B-trees for project building and graphs. Contents note: The phases of software development; Pointers and dynamic arrays; Queues; Recursive thinking; Trees; Sorting; Balanced trees; Linked lists; Stacks; Derived classes and inheritance; Record link: https://library.seeu.edu.mk/index.php?lvl=notice_display&id=18768 Hold
Place a hold on this item
Copies
Barcode Call number Media type Location Section Status 1702-002135 005.133 Mai-Dat 2010 General Collection Library "Max van der Stoel" English Available
