data structures algorithms using de sudha (8 résultats)

Etat : New.

Etat : New.

paperback. Etat : New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Data structure is a way of organizing and storing data in a computer program so that it can be accessed and used efficiently. Data structures provide a means of managing large amounts of data, enabling efficient searching, sorting, insertion, and deletion of data.Data structures can be categorized into two types: primitive data structures and non-primitive data structures. Primitive data structures are the most basic data structures available in a programming language, such as integers, floating-point numbers, characters, and Booleans. Non-primitive data structures are complex data structures that are built using primitive data types, such as arrays, linked lists, stacks, queues, trees, graphs, and hash tables.The choice of data structure for a particular task depends on the type and amount of data to be processed, the operations that need to be performed on the data, and the efficiency requirements of the program. Efficient use of data structures can greatly improve the performance of a program, making it faster and more memory-efficient. 208 pp. Englisch.

Etat : New. Print on Demand.

Etat : New. PRINT ON DEMAND.

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Data structure is a way of organizing and storing data in a computer program so that it can be accessed and used efficiently. Data structures provide a means of managing large amounts of data, enabling efficient searching, sorting, insertion, and deletion of data.Data structures can be categorized into two types: primitive data structures and non-primitive data structures. Primitive data structures are the most basic data structures available in a programming language, such as integers, floating-point numbers, characters, and Booleans. Non-primitive data structures are complex data structures that are built using primitive data types, such as arrays, linked lists, stacks, queues, trees, graphs, and hash tables.The choice of data structure for a particular task depends on the type and amount of data to be processed, the operations that need to be performed on the data, and the efficiency requirements of the program. Efficient use of data structures can greatly improve the performance of a program, making it faster and more memory-efficient.Books on Demand GmbH, Überseering 33, 22297 Hamburg 208 pp. Englisch.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Data structure is a way of organizing and storing data in a computer program so that it can be accessed and used efficiently. Data structures provide a means of managing large amounts of data, enabling efficient searching, sorting, insertion, and deletion of data.Data structures can be categorized into two types: primitive data structures and non-primitive data structures. Primitive data structures are the most basic data structures available in a programming language, such as integers, floating-point numbers, characters, and Booleans. Non-primitive data structures are complex data structures that are built using primitive data types, such as arrays, linked lists, stacks, queues, trees, graphs, and hash tables.The choice of data structure for a particular task depends on the type and amount of data to be processed, the operations that need to be performed on the data, and the efficiency requirements of the program. Efficient use of data structures can greatly improve the performance of a program, making it faster and more memory-efficient.