Von dem Buch Problem Solving in Data Structures & Algorithms Using C: The Ultimate Guide to Programming Interviews haben wir 5 gleiche oder sehr ähnliche Ausgaben identifiziert!
Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
100%: Hemant Jain: Problem Solving in Data Structures & Algorithms Using C: The Ultimate Guide to Programming Interviews (ISBN: 9789352655915) 2016, TARAN TECHNOLOGIES PRIVATE LIMITED, Erstausgabe, in Englisch, Taschenbuch.Nur diese Ausgabe anzeigen…
71%: Jain, Hemant: Problem Solving in Data Structures Algorithms Using Visual Basic .Net: Programming Interview Guide (Paperback) (ISBN: 9781541353367) 2016, Createspace Independent Publishing Platform, United States, in Englisch, Taschenbuch.Nur diese Ausgabe anzeigen…
71%: Jain, Hemant: Problem Solving in Data Structures & Algorithms Using C#: Programming Interview Guide (ISBN: 9781540407306) 2016, CreateSpace Independent Publishing Platform, in Englisch, Taschenbuch.Nur diese Ausgabe anzeigen…
63%: Jain, Hemant: Problem Solving in Data Structures & Algorithms Using C+: Programming Interview Guide (ISBN: 9781542396479) 2017, CreateSpace Independent Publishing Platform, in Englisch, Taschenbuch.Nur diese Ausgabe anzeigen…
63%: Jain, Hemant: Problem Solving in Data Structures & Algorithms Using C#: Programming Interview Guide (ISBN: 9781726789981) 2018, Independently published, in Englisch, Taschenbuch.Nur diese Ausgabe anzeigen…
Problem Solving in Data Structures & Algorithms Using C: The Ultimate Guide to Programming Interviews
18 Angebote vergleichen
Bester Preis: € 4,26 (vom 25.02.2017)1
Problem Solving in Data Structures & Algorithms Using C: The Ultimate Guide to Programming Interviews (2016)
EN PB NW FEISBN: 9789352655915 bzw. 9352655915, in Englisch, 426 Seiten, TARAN TECHNOLOGIES PRIVATE LIMITED, Taschenbuch, neu, Erstausgabe.
Lieferung aus: Indien, Usually dispatched within 2-3 business days, इसके अलावा अगर (शिप) शिपिंग.
Von Händler/Antiquariat, Taran Technologies.
This book is about the usage of data structures and algorithms in computer programming. Designing an efficient algorithm to solve a computer science problem is a skill of Computer programmer. This is the skill which tech companies like Google, Amazon, Microsoft, Adobe and many others are looking for in an interview. Once we are comfortable with a programming language the next step is to learn how to write efficient algorithms. This book assumes that you are a C language developer. You are not an expert in C language, but you are well familiar with concepts of pointers, functions, arrays and recursion. In the start of this book, we will be revising the C language fundamentals that will be used throughout this book. We will be looking into some of the problems in arrays and recursion too. Then in the coming chapter, we will be looking into complexity analysis. Then will look into the various data structures and their algorithms. We will be looking into a linked list, stack, queue, trees, heap, hash table and graphs. We will be looking into sorting, searching techniques. Then we will be looking into algorithm analysis, we will be looking into brute force algorithms, greedy algorithms, divide and conquer algorithms, dynamic programming, reduction and back tracking. In the end, we will be looking into system design which will give a systematic approach for solving the design problems in an Interview. Paperback, संस्करण: 1, स्वरूप: Import, लेबल: TARAN TECHNOLOGIES PRIVATE LIMITED, TARAN TECHNOLOGIES PRIVATE LIMITED, उत्पाद समूह: Book, प्रकाशित: 2016-08-25, स्टूडियो: TARAN TECHNOLOGIES PRIVATE LIMITED, बिक्री रैंक: 26014.
Von Händler/Antiquariat, Taran Technologies.
This book is about the usage of data structures and algorithms in computer programming. Designing an efficient algorithm to solve a computer science problem is a skill of Computer programmer. This is the skill which tech companies like Google, Amazon, Microsoft, Adobe and many others are looking for in an interview. Once we are comfortable with a programming language the next step is to learn how to write efficient algorithms. This book assumes that you are a C language developer. You are not an expert in C language, but you are well familiar with concepts of pointers, functions, arrays and recursion. In the start of this book, we will be revising the C language fundamentals that will be used throughout this book. We will be looking into some of the problems in arrays and recursion too. Then in the coming chapter, we will be looking into complexity analysis. Then will look into the various data structures and their algorithms. We will be looking into a linked list, stack, queue, trees, heap, hash table and graphs. We will be looking into sorting, searching techniques. Then we will be looking into algorithm analysis, we will be looking into brute force algorithms, greedy algorithms, divide and conquer algorithms, dynamic programming, reduction and back tracking. In the end, we will be looking into system design which will give a systematic approach for solving the design problems in an Interview. Paperback, संस्करण: 1, स्वरूप: Import, लेबल: TARAN TECHNOLOGIES PRIVATE LIMITED, TARAN TECHNOLOGIES PRIVATE LIMITED, उत्पाद समूह: Book, प्रकाशित: 2016-08-25, स्टूडियो: TARAN TECHNOLOGIES PRIVATE LIMITED, बिक्री रैंक: 26014.
2
Symbolbild
Problem Solving in Data Structures Algorithms Using Visual Basic .Net: Programming Interview Guide (Paperback) (2016)
EN PB NW RPISBN: 9781541353367 bzw. 1541353366, in Englisch, Createspace Independent Publishing Platform, United States, Taschenbuch, neu, Nachdruck.
Lieferung aus: Vereinigtes Königreich Großbritannien und Nordirland, Free shipping.
Von Händler/Antiquariat, The Book Depository US [58762574], London, United Kingdom.
Language: English . Brand New Book ***** Print on Demand *****. Problem Solving in Data Structures Algorithms is a series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for interview preparation point of view. In various books, the examples are solved in various languages like C, C++, Java, C#, Python, VB, JavaScript and PHP. Book s Composition This book is designed for interviews so in Chapter 0, various preparation plans are proposed. Then in chapters 1, a brief introduction of the programming language and concept of recursion is explained. A number of problems based on recursion and array are explained. Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting Searching techniques. Then will look into the various data structures and their algorithms. We will be looking into a Linked List, Stack, Queue, Trees, Heap, Hash Table and Graphs. Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide Conquer algorithms, Dynamic Programming, and Backtracking. In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview. Table of Contents Chapter 0: How to use this book. Chapter 1: Introduction - Programming Overview Chapter 2: Algorithms Analysis Chapter 3: Approach to solve algorithm design problems Chapter 4: Abstract Data Type Chapter 5: Searching Chapter 6: Sorting Chapter 7: Linked List Chapter 8: Stack Chapter 9: Queue Chapter 10: Tree Chapter 11: Priority Queue Chapter 12: Hash-Table Chapter 13: Graphs Chapter 14: String Algorithms Chapter 15: Algorithm Design Techniques Chapter 16: Brute Force Algorithm Chapter 17: Greedy Algorithm Chapter 18: Divide Conquer Chapter 19: Dynamic Programming Chapter 20: Backtracking Chapter 21: Complexity Theory Chapter 22: Interview Strategy Chapter 23: System Design.
Von Händler/Antiquariat, The Book Depository US [58762574], London, United Kingdom.
Language: English . Brand New Book ***** Print on Demand *****. Problem Solving in Data Structures Algorithms is a series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for interview preparation point of view. In various books, the examples are solved in various languages like C, C++, Java, C#, Python, VB, JavaScript and PHP. Book s Composition This book is designed for interviews so in Chapter 0, various preparation plans are proposed. Then in chapters 1, a brief introduction of the programming language and concept of recursion is explained. A number of problems based on recursion and array are explained. Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting Searching techniques. Then will look into the various data structures and their algorithms. We will be looking into a Linked List, Stack, Queue, Trees, Heap, Hash Table and Graphs. Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide Conquer algorithms, Dynamic Programming, and Backtracking. In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview. Table of Contents Chapter 0: How to use this book. Chapter 1: Introduction - Programming Overview Chapter 2: Algorithms Analysis Chapter 3: Approach to solve algorithm design problems Chapter 4: Abstract Data Type Chapter 5: Searching Chapter 6: Sorting Chapter 7: Linked List Chapter 8: Stack Chapter 9: Queue Chapter 10: Tree Chapter 11: Priority Queue Chapter 12: Hash-Table Chapter 13: Graphs Chapter 14: String Algorithms Chapter 15: Algorithm Design Techniques Chapter 16: Brute Force Algorithm Chapter 17: Greedy Algorithm Chapter 18: Divide Conquer Chapter 19: Dynamic Programming Chapter 20: Backtracking Chapter 21: Complexity Theory Chapter 22: Interview Strategy Chapter 23: System Design.
3
Problem Solving in Data Structures & Algorithms Using Visual Basic .Net: Programming Interview Guide (2016)
EN PB USISBN: 9781541353367 bzw. 1541353366, in Englisch, 438 Seiten, CreateSpace Independent Publishing Platform, Taschenbuch, gebraucht.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, super_star_seller.
"Problem Solving in Data Structures & Algorithms" is a series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for interview preparation point of view. In various books, the examples are solved in various languages like C, C++, Java, C#, Python, VB, JavaScript and PHP. Book’s Composition This book is designed for interviews so in Chapter 0, various preparation plans are proposed. Then in chapters 1, a brief introduction of the programming language and concept of recursion is explained. A number of problems based on recursion and array are explained. Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting & Searching techniques. Then will look into the various data structures and their algorithms. We will be looking into a Linked List, Stack, Queue, Trees, Heap, Hash Table and Graphs. Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide & Conquer algorithms, Dynamic Programming, and Backtracking. In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview. Table of Contents Chapter 0: How to use this book. Chapter 1: Introduction - Programming Overview Chapter 2: Algorithms Analysis Chapter 3: Approach to solve algorithm design problems Chapter 4: Abstract Data Type Chapter 5: Searching Chapter 6: Sorting Chapter 7: Linked List Chapter 8: Stack Chapter 9: Queue Chapter 10: Tree Chapter 11: Priority Queue Chapter 12: Hash-Table Chapter 13: Graphs Chapter 14: String Algorithms Chapter 15: Algorithm Design Techniques Chapter 16: Brute Force Algorithm Chapter 17: Greedy Algorithm Chapter 18: Divide & Conquer Chapter 19: Dynamic Programming Chapter 20: Backtracking Chapter 21: Complexity Theory Chapter 22: Interview Strategy Chapter 23: System Design, Paperback, Edition: First, Label: CreateSpace Independent Publishing Platform, CreateSpace Independent Publishing Platform, Product group: Book, Published: 2016-12-29, Studio: CreateSpace Independent Publishing Platform, Sales rank: 8343440.
Von Händler/Antiquariat, super_star_seller.
"Problem Solving in Data Structures & Algorithms" is a series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for interview preparation point of view. In various books, the examples are solved in various languages like C, C++, Java, C#, Python, VB, JavaScript and PHP. Book’s Composition This book is designed for interviews so in Chapter 0, various preparation plans are proposed. Then in chapters 1, a brief introduction of the programming language and concept of recursion is explained. A number of problems based on recursion and array are explained. Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting & Searching techniques. Then will look into the various data structures and their algorithms. We will be looking into a Linked List, Stack, Queue, Trees, Heap, Hash Table and Graphs. Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide & Conquer algorithms, Dynamic Programming, and Backtracking. In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview. Table of Contents Chapter 0: How to use this book. Chapter 1: Introduction - Programming Overview Chapter 2: Algorithms Analysis Chapter 3: Approach to solve algorithm design problems Chapter 4: Abstract Data Type Chapter 5: Searching Chapter 6: Sorting Chapter 7: Linked List Chapter 8: Stack Chapter 9: Queue Chapter 10: Tree Chapter 11: Priority Queue Chapter 12: Hash-Table Chapter 13: Graphs Chapter 14: String Algorithms Chapter 15: Algorithm Design Techniques Chapter 16: Brute Force Algorithm Chapter 17: Greedy Algorithm Chapter 18: Divide & Conquer Chapter 19: Dynamic Programming Chapter 20: Backtracking Chapter 21: Complexity Theory Chapter 22: Interview Strategy Chapter 23: System Design, Paperback, Edition: First, Label: CreateSpace Independent Publishing Platform, CreateSpace Independent Publishing Platform, Product group: Book, Published: 2016-12-29, Studio: CreateSpace Independent Publishing Platform, Sales rank: 8343440.
4
Problem Solving in Data Structures & Algorithms Using C#: Programming Interview Guide (2016)
EN PB USISBN: 9781540407306 bzw. 1540407306, in Englisch, 475 Seiten, CreateSpace Independent Publishing Platform, Taschenbuch, gebraucht.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days, Real shipping costs can differ.
Von Händler/Antiquariat, NTS Book Store.
"Problem Solving in Data Structures & Algorithms" is a series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for interview preparation point of view. In various books, the examples are solved in various languages like Go, C, C++, Java, C#, Python, VB, JavaScript and PHP. GitHub Repositories https://github.com/Hemant-Jain-Author Book’s Composition This book is designed for interviews so in Chapter 0, various preparation plans are proposed. Then in chapters 1, a brief introduction of the programming language and concept of recursion is explained. A number of problems based on recursion and array are explained. Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting & Searching techniques. Then will look into the various data structures and their algorithms. We will be looking into a Linked List, Stack, Queue, Trees, Heap, Hash Table and Graphs. Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide & Conquer algorithms, Dynamic Programming, and Backtracking. In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview. Table of Contents Chapter 0: How to use this book. Chapter 1: Introduction - Programming Overview Chapter 2: Algorithms Analysis Chapter 3: Approach to solve algorithm design problems Chapter 4: Abstract Data Type Chapter 5: Searching Chapter 6: Sorting Chapter 7: Linked List Chapter 8: Stack Chapter 9: Queue Chapter 10: Tree Chapter 11: Priority Queue Chapter 12: Hash-Table Chapter 13: Graphs Chapter 14: String Algorithms Chapter 15: Algorithm Design Techniques Chapter 16: Brute Force Algorithm Chapter 17: Greedy Algorithm Chapter 18: Divide & Conquer Chapter 19: Dynamic Programming Chapter 20: Backtracking Chapter 21: Complexity Theory Chapter 22: Interview Strategy Chapter 23: System Design, Paperback, Edition: First, Label: CreateSpace Independent Publishing Platform, CreateSpace Independent Publishing Platform, Product group: Book, Published: 2016-11-14, Studio: CreateSpace Independent Publishing Platform, Sales rank: 435639.
Von Händler/Antiquariat, NTS Book Store.
"Problem Solving in Data Structures & Algorithms" is a series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for interview preparation point of view. In various books, the examples are solved in various languages like Go, C, C++, Java, C#, Python, VB, JavaScript and PHP. GitHub Repositories https://github.com/Hemant-Jain-Author Book’s Composition This book is designed for interviews so in Chapter 0, various preparation plans are proposed. Then in chapters 1, a brief introduction of the programming language and concept of recursion is explained. A number of problems based on recursion and array are explained. Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting & Searching techniques. Then will look into the various data structures and their algorithms. We will be looking into a Linked List, Stack, Queue, Trees, Heap, Hash Table and Graphs. Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide & Conquer algorithms, Dynamic Programming, and Backtracking. In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview. Table of Contents Chapter 0: How to use this book. Chapter 1: Introduction - Programming Overview Chapter 2: Algorithms Analysis Chapter 3: Approach to solve algorithm design problems Chapter 4: Abstract Data Type Chapter 5: Searching Chapter 6: Sorting Chapter 7: Linked List Chapter 8: Stack Chapter 9: Queue Chapter 10: Tree Chapter 11: Priority Queue Chapter 12: Hash-Table Chapter 13: Graphs Chapter 14: String Algorithms Chapter 15: Algorithm Design Techniques Chapter 16: Brute Force Algorithm Chapter 17: Greedy Algorithm Chapter 18: Divide & Conquer Chapter 19: Dynamic Programming Chapter 20: Backtracking Chapter 21: Complexity Theory Chapter 22: Interview Strategy Chapter 23: System Design, Paperback, Edition: First, Label: CreateSpace Independent Publishing Platform, CreateSpace Independent Publishing Platform, Product group: Book, Published: 2016-11-14, Studio: CreateSpace Independent Publishing Platform, Sales rank: 435639.
5
Problem Solving in Data Structures & Algorithms Using C#: Programming Interview Guide (2016)
EN PB NWISBN: 9781540407306 bzw. 1540407306, in Englisch, 475 Seiten, CreateSpace Independent Publishing Platform, Taschenbuch, neu.
Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 6 days, free shipping for AmazonPrime only. Regular USD 4.98.
Von Händler/Antiquariat, Amazon.com.
"Problem Solving in Data Structures & Algorithms" is a series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for interview preparation point of view. In various books, the examples are solved in various languages like Go, C, C++, Java, C#, Python, VB, JavaScript and PHP. GitHub Repositories https://github.com/Hemant-Jain-Author Book’s Composition This book is designed for interviews so in Chapter 0, various preparation plans are proposed. Then in chapters 1, a brief introduction of the programming language and concept of recursion is explained. A number of problems based on recursion and array are explained. Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting & Searching techniques. Then will look into the various data structures and their algorithms. We will be looking into a Linked List, Stack, Queue, Trees, Heap, Hash Table and Graphs. Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide & Conquer algorithms, Dynamic Programming, and Backtracking. In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview. Table of Contents Chapter 0: How to use this book. Chapter 1: Introduction - Programming Overview Chapter 2: Algorithms Analysis Chapter 3: Approach to solve algorithm design problems Chapter 4: Abstract Data Type Chapter 5: Searching Chapter 6: Sorting Chapter 7: Linked List Chapter 8: Stack Chapter 9: Queue Chapter 10: Tree Chapter 11: Priority Queue Chapter 12: Hash-Table Chapter 13: Graphs Chapter 14: String Algorithms Chapter 15: Algorithm Design Techniques Chapter 16: Brute Force Algorithm Chapter 17: Greedy Algorithm Chapter 18: Divide & Conquer Chapter 19: Dynamic Programming Chapter 20: Backtracking Chapter 21: Complexity Theory Chapter 22: Interview Strategy Chapter 23: System Design, Paperback, Edition: First, Label: CreateSpace Independent Publishing Platform, CreateSpace Independent Publishing Platform, Product group: Book, Published: 2016-11-14, Studio: CreateSpace Independent Publishing Platform, Sales rank: 435639.
Von Händler/Antiquariat, Amazon.com.
"Problem Solving in Data Structures & Algorithms" is a series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for interview preparation point of view. In various books, the examples are solved in various languages like Go, C, C++, Java, C#, Python, VB, JavaScript and PHP. GitHub Repositories https://github.com/Hemant-Jain-Author Book’s Composition This book is designed for interviews so in Chapter 0, various preparation plans are proposed. Then in chapters 1, a brief introduction of the programming language and concept of recursion is explained. A number of problems based on recursion and array are explained. Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting & Searching techniques. Then will look into the various data structures and their algorithms. We will be looking into a Linked List, Stack, Queue, Trees, Heap, Hash Table and Graphs. Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide & Conquer algorithms, Dynamic Programming, and Backtracking. In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview. Table of Contents Chapter 0: How to use this book. Chapter 1: Introduction - Programming Overview Chapter 2: Algorithms Analysis Chapter 3: Approach to solve algorithm design problems Chapter 4: Abstract Data Type Chapter 5: Searching Chapter 6: Sorting Chapter 7: Linked List Chapter 8: Stack Chapter 9: Queue Chapter 10: Tree Chapter 11: Priority Queue Chapter 12: Hash-Table Chapter 13: Graphs Chapter 14: String Algorithms Chapter 15: Algorithm Design Techniques Chapter 16: Brute Force Algorithm Chapter 17: Greedy Algorithm Chapter 18: Divide & Conquer Chapter 19: Dynamic Programming Chapter 20: Backtracking Chapter 21: Complexity Theory Chapter 22: Interview Strategy Chapter 23: System Design, Paperback, Edition: First, Label: CreateSpace Independent Publishing Platform, CreateSpace Independent Publishing Platform, Product group: Book, Published: 2016-11-14, Studio: CreateSpace Independent Publishing Platform, Sales rank: 435639.
6
Problem Solving in Data Structures & Algorithms Using C#: Programming Interview Guide (2016)
EN PBISBN: 9781540407306 bzw. 1540407306, in Englisch, CreateSpace Independent Publishing Platform, Taschenbuch.
Von Händler/Antiquariat, medimops [55410863], Berlin, Germany.
Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.
Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.
7
Symbolbild
9781541353367 (2016)
EN NW RPISBN: 9781541353367 bzw. 1541353366, in Englisch, Createspace Independent Pub, neu, Nachdruck.
Von Händler/Antiquariat, Pbshop [61989342], Wood Dale, IL, U.S.A.
New Book.Shipped from US within 10 to 14 business days.THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
New Book.Shipped from US within 10 to 14 business days.THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
8
Symbolbild
9781541353367 (2016)
EN NW RPISBN: 9781541353367 bzw. 1541353366, in Englisch, Createspace Independent Pub, neu, Nachdruck.
Von Händler/Antiquariat, Books2Anywhere [190245], Fairford, GLOS, United Kingdom.
New Book. Delivered from our US warehouse in 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND.Established seller since 2000.
New Book. Delivered from our US warehouse in 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND.Established seller since 2000.
9
Problem Solving in Data Structures & Algorithms Using C#: Programming Interview Guide (2016)
EN PB NW RPISBN: 9781540407306 bzw. 1540407306, in Englisch, Createspace Independent Pub, Taschenbuch, neu, Nachdruck.
Von Händler/Antiquariat, Revaluation Books [2134736], Exeter, United Kingdom.
468 pages. 11.00x8.50x1.06 inches. This item is printed on demand.
468 pages. 11.00x8.50x1.06 inches. This item is printed on demand.
10
Problem Solving in Data Structures & Algorithms Using C#: Programming Interview Guide (2016)
EN PB USISBN: 9781540407306 bzw. 1540407306, in Englisch, CreateSpace Independent Publis, Taschenbuch, gebraucht.
Lieferung aus: Vereinigte Staaten von Amerika, Free shipping.
Von Händler/Antiquariat, Murray Media [70565310], NORTH MIAMI BEACH, FL, U.S.A.
Great condition with minimal wear, aging, or shelf wear.
Von Händler/Antiquariat, Murray Media [70565310], NORTH MIAMI BEACH, FL, U.S.A.
Great condition with minimal wear, aging, or shelf wear.
Lade…