• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History
  • ورود / ثبت نام

عنوان
C# Data Structures and Algorithms :

پدید آورنده

موضوع
Application software-- Development.,C# (Computer program language),Data structures (Computer science),Application software-- Development.,C# (Computer program language),COMPUTERS-- Programming Languages-- C#.,Data structures (Computer science)

رده
QA76
.
73
.
C154
.
J367
2018eb

کتابخانه
Center and Library of Islamic Studies in European Languages

محل استقرار
استان: Qom ـ شهر: Qom

Center and Library of Islamic Studies in European Languages

تماس با کتابخانه : 32910706-025

INTERNATIONAL STANDARD BOOK NUMBER

(Number (ISBN
1788833732
(Number (ISBN
1788834682
(Number (ISBN
9781788833738
(Number (ISBN
9781788834681
Erroneous ISBN
1788833732
Erroneous ISBN
9781788833738

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
C# Data Structures and Algorithms :
General Material Designation
[Book]
Other Title Information
Explore the possibilities of C# for developing a variety of efficient applications.

.PUBLICATION, DISTRIBUTION, ETC

Place of Publication, Distribution, etc.
Birmingham :
Name of Publisher, Distributor, etc.
Packt Publishing,
Date of Publication, Distribution, etc.
2018.

PHYSICAL DESCRIPTION

Specific Material Designation and Extent of Item
1 online resource (287 pages)

CONTENTS NOTE

Text of Note
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.
Text of Note
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.
Text of Note
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.
Text of Note
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.
Text of Note
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.
0
8
8
8
8

SUMMARY OR ABSTRACT

Text of Note
Data structures allow organizing data efficiently. Their suitable implementation can provide a complete solution that acts like reusable code. In this book, you will learn how to use various data structures while developing in the C# language as well as how to implement some of the most common algorithms used with such data structures.

ACQUISITION INFORMATION NOTE

Source for Acquisition/Subscription Address
OverDrive, Inc.
Source for Acquisition/Subscription Address
01201872
Stock Number
8A3DD13E-4FF6-46D9-A342-15BABB4D48CD
Stock Number
B09540

OTHER EDITION IN ANOTHER MEDIUM

Title
C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications.

TOPICAL NAME USED AS SUBJECT

Application software-- Development.
C# (Computer program language)
Data structures (Computer science)
Application software-- Development.
C# (Computer program language)
COMPUTERS-- Programming Languages-- C#.
Data structures (Computer science)

(SUBJECT CATEGORY (Provisional

COM-- 051310

DEWEY DECIMAL CLASSIFICATION

Number
005
.
133
Edition
23

LIBRARY OF CONGRESS CLASSIFICATION

Class number
QA76
.
73
.
C154
Book number
.
J367
2018eb

PERSONAL NAME - PRIMARY RESPONSIBILITY

Jamro, Marcin.

ORIGINATING SOURCE

Date of Transaction
20200823060452.0
Cataloguing Rules (Descriptive Conventions))
pn

ELECTRONIC LOCATION AND ACCESS

Electronic name
 مطالعه متن کتاب 

[Book]

Y

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival