Электронный каталог

DDC 005.133
J 22
Jamro, Marcin.
    C# Data Structures and Algorithms [[electronic resource] :] : Explore the possibilities of C# for developing a variety of efficient applications. / Marcin. Jamro. - 1788833738. - Birmingham : : Packt Publishing,, 2018. - 1 online resource (287 p.) ( час. мин.), 1788833738. - URL: https://library.dvfu.ru/lib/document/SK_ELIB/7C4244C4-3708-40D1-BF46-6CEC3759E2A4. - ISBN 9781788834681 (electronic bk.). - ISBN 1788834682 (electronic bk.). - ISBN 1788833732. - ISBN 9781788833738
Description based upon print version of record.
Параллельные издания: Print version: : Jamro, Marcin C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications. - Birmingham : Packt Publishing,c2018
    Содержание:
Cover; Title Page; Copyright and Credits; Packt Upsell; Contributors; Table of Contents; Preface; Chapter 1: Getting Started; Programming language; Data types; Value types; Structs; Enumerations; Reference types; Strings; Object; Dynamic; Classes; Interfaces; Delegates; Installation and configuration of the IDE; Creating the project; Input and output; Reading from input; Writing to output; Launching and debugging; Summary; Chapter 2: Arrays and Lists; Arrays; Single-dimensional arrays; Example - month names; Multi-dimensional arrays; Example - multiplication table; Example - game map
Jagged arraysExample - yearly transport plan; Sorting algorithms; Selection sort; Insertion sort; Bubble sort; Quicksort; Simple lists; Array list; Generic list; Example - average value; Example - list of people; Sorted lists; Example - address book; Linked lists; Example - book reader; Circular-linked lists; Implementation; Example - spin the wheel; Summary; Chapter 3: Stacks and Queues; Stacks; Example - reversing words; Example - Tower of Hanoi; Queues; Example - call center with a single consultant; Example - call center with many consultants; Priority queues
Example - call center with priority supportSummary; Chapter 4: Dictionaries and Sets; Hash tables; Example - phone book; Dictionaries; Example - product location; Example -- user details; Sorted dictionaries; Example -- definitions; Hash sets; Example -- coupons; Example -- swimming pools; Sorted"" sets; Example -- removing duplicates; Summary; Chapter 5: Variants of Trees; Basic trees; Implementation; Node; Tree; Example - hierarchy of identifiers; Example - company structure; Binary trees; Implementation; Node; Tree; Example - simple quiz; Binary search trees; Implementation; Node; Tree; Lookup
InsertionRemoval; Example - BST visualization; AVL trees; Implementation; Example - keep the tree balanced; Red-black trees; Implementation; Example - RBT-related features; Binary heaps; Implementation; Example - heap sort; Binomial heaps; Fibonacci heaps; Summary; Chapter 6: Exploring Graphs; Concept of graphs; Applications; Representation; Adjacency list; Adjacency matrix; Implementation; Node; Edge; Graph; Example - undirected and unweighted edges; Example - directed and weighted edges; Traversal; Depth-first search; Breadth-first search; Minimum spanning tree; Kruskal's algorithm
Prim's algorithmExample - telecommunication cable; Coloring; Example - voivodeship map; Shortest path; Example - game map; Summary; Chapter 7: Summary; Classification of data structures; Diversity of applications; Arrays; Lists; Stacks; Queues; Dictionaries; Sets; Trees; Heaps; Graphs; The last word; Other Books You May Enjoy; Index

Jamro, Marcin. C# Data Structures and Algorithms [[electronic resource] :] : Explore the possibilities of C# for developing a variety of efficient applications. / Marcin. Jamro, 2018. - 1 online resource (287 p.) с. (Введено оглавление)

DDC 005.133
A 57
Anggoro, Wisnu.
    C++ Data Structures and Algorithms : : Learn how to write efficient code to build scalable and robust applications in C++. / Wisnu. Anggoro. - Birmingham : : Packt Publishing,, 2018. - 1 online resource (314 pages). - URL: https://library.dvfu.ru/lib/document/SK_ELIB/529FC5D6-2CD5-4D37-9C74-90054E79B518. - ISBN 9781788831970 (electronic bk.). - ISBN 1788831977 (electronic bk.)
Interpolation search. Print version record.
Параллельные издания: Print version: : Anggoro, Wisnu. C++ Data Structures and Algorithms : Learn how to write efficient code to build scalable and robust applications in C++. - Birmingham : Packt Publishing, ©2018
    Содержание:
Cover; Title Page; Copyright and Credits; Packt Upsell; Contributors; Table of Contents; Preface; Chapter 1: Learning Data Structures and Algorithms in C++; Technical requirements; Introduction to basic C++; Creating your first code in C++; Enhancing code development experience with IDE; Defining the variables using fundamental data types; Controlling the flow of the code; Conditional statement; Loop statement; Leveraging the variable capability using advanced data types; Developing abstract data types; Applying C++ classes to build user-defined ADTs; Playing with templates.
Function templatesClass templates; Standard Template Library; Analyzing the algorithm; Asymptotic analysis; Worst, average, and best cases; Big Theta, Big-O, and Big Omega; Recursive method; Amortized analysis; Summary; QA section; Further reading; Chapter 2: Storing Data in Lists and Linked Lists; Technical requirements; Getting closer to an array; Building a List ADT; Fetching an item in the List; Inserting an item into the List ADT; Finding out the index of a selected item in the List ADT; Removing an item from the List ADT; Consuming a List ADT; Introduction to node.
Building a Singly Linked List ADTFetching an item in the LinkedList class; Inserting an item in the LinkedList class; Getting the index of the selected item in the LinkedList; Removing an item from the LinkedList ADT; Consuming the LinkedList ADT; Building the Doubly Linked List ADT; Refactoring the Node data type; Refactoring several operations in the LinkedList ADT; Removing an element; Inserting an element; Consuming the DoublyLinkedList ADT; Applying List and LinkedList using STL; std::vector; std::list; Summary; QA section; Further reading; Chapter 3: Constructing Stacks and Queues.
Technical requirementsBuilding a Stack ADT; Fetching the item's value in the Stack ADT; Pushing the items of the Stack ADT; Popping the items from the Stack ADT; Consuming a Stack ADT; Another example of Stack ADT implementation; Building a Queue ADT; Getting a value from Queue ADT; Inserting an element into the Queue ADT; Removing an element from the Queue ADT; Consuming the Queue ADT; Building a Deque ADT; Fetching a value from a Deque; Enqueueing an element into the Deque ADT; Dequeuing an element from the Deque ADT; Consuming the Deque ADT; Summary; QA section; Further reading.
Chapter 4: Arranging Data Elements Using a Sorting AlgorithmTechnical requirements; Bubble sort; Selection sort; Insertion sort; Merge sort; Quick sort; Counting sort; Radix sort; Summary; QA section; Further reading; Chapter 5: Finding out an Element Using Searching Algorithms; Technical requirements; Linear search; Developing a linear search algorithm; Implementing the linear search algorithm; Binary search; Developing binary search algorithm; Implementing binary search algorithm ; Ternary search; Developing ternary search algorithm; Applying the ternary search algorithm.

Anggoro, Wisnu. C++ Data Structures and Algorithms : [Электронный ресурс] : Learn how to write efficient code to build scalable and robust applications in C++. / Wisnu. Anggoro, 2018. - 1 online resource (314 pages) с. (Введено оглавление)