Saqib Mohammad (173 results)

paperback. Condition: Very Good. Stranded in Panama: A Romantic Comedy About Love, Second Chances, and Tropical Chaos This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. .…

paperback. Condition: Very Good. Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee.

Paperback. Condition: new. Paperback. Fourteen days of drills that turn data structures and algorithms into something you can use under pressure.This is a book of problems. Every rule is stated in as few words as it can be, shown working in a short program with its real captured output, and then handed back as drills. Nothing is asserted that is not also demonstrated: every listing in the book was compiled and run with Rust 1.97.1, and every printed result was captured from that run.The programming problems build one real tool across the fourteen days. It is called tally, a command-line text index. It begins on Day 1 as a word counter and gains, day by day, a growing buffer, a document list, a query parser, a directory walk, a ranking, a heap, a sorted vocabulary, a hash index, a search tree, a trie, a graph of related terms and a comparison of two documents. Each day's tool is the previous day's with one structure added, so the reason for a structure arrives before it does.Rust is not a passenger here. Ownership decides how a linked list is written, why a tree is held in one vector rather than a Box per node, and what a deletion is allowed to touch. Those decisions are shown as measurements, not as opinions: an arena builds a hundred thousand nodes in two thirds of the time and half the memory of one Box per node, and the book prints both numbers.The two weeks run in three movements. Days 1 to 5 build the foundations: the cost model, arrays, linked lists, stacks and queues, and recursion with backtracking. Days 6 to 9 cover sorting, heaps and priority queues, searching and two pointers, and hash tables. Days 10 to 14 cover binary search trees, balanced trees and tries, graphs and traversal, shortest paths, and dynamic programming and greedy algorithms.Every chapter has the same shape. Numbered sections state the rules. Twenty worked examples show each rule running, each with a complete program, its real output, a figure and a short explanation. Then a fixed ladder of five problem sets: review questions, worked problems with full solutions, worked programming problems, and unassisted practice problems in both written and programming form. The review answers are at the end of the chapter; the practice problems have no answers anywhere, by design.YOUR 14-DAY PATHWEEK 1 - FOUNDATIONS AND SORTINGDay 1 - Complexity and the Cost ModelDay 2 - Arrays and Dynamic ArraysDay 3 - Linked ListsDay 4 - Stacks and QueuesDay 5 - Recursion and BacktrackingDay 6 - Elementary and Divide-and-Conquer SortingDay 7 - Heaps, Priority Queues and Linear-Time SortingWEEK 2 - SEARCHING, TREES, GRAPHS AND DESIGN METHODSDay 8 - Searching, Binary Search and Two PointersDay 9 - Hash TablesDay 10 - Binary Trees and Binary Search TreesDay 11 - Balanced Trees and TriesDay 12 - Graphs and TraversalDay 13 - Shortest Paths, Spanning Trees and Topological OrderDay 14 - Dynamic Programming and Greedy AlgorithmsWHO IT'S FORStudents taking a data structures course who want drills rather than a reference. Readers preparing for an examination or a technical interview. Working programmers who want fluency in the structures they already use by name. One programming language is assumed: loops, functions and arrays. No prior work on data structures is assumed. Rust is taught only where a structure needs it, so a reader who knows another language can follow the drills and pick up the language on the way.281 worked examples. 463 figures. 736 problems. 390 pages. Written to Rust 1.97.Fourteen days. Work them in order, and do the problems. This item is printed on Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Paperback. Condition: new. Paperback. Fourteen days of drills on JavaScript and the Node runtime it actually runs on.This is a drill manual, not a tutorial and not a reference. The programming problems build one real program across the book: pulse, a command-line task and notification scheduler. It starts as a script that runs a single job on a timer and ends as a multi-file tool that persists jobs to disk, schedules recurring work, and dispatches webhook alerts when a job fires. Every listing in the book - 414 of them - was executed on Node v24.13.1, and every printed output block, thrown errors included, is a paste from that run. A reader who works the programming problems finishes with pulse running end to end; a reader who skips them still finishes with the language.The fourteen chapters move through three arcs. The first is the language itself: values and coercion, control flow and functions, arrays and iteration, objects, JSON and destructuring, scope and closures, higher-order functions, prototypes, classes, this-binding, and the errors and modules that hold a program together. The second is the runtime that makes JavaScript worth running on a server: the event loop and callbacks, promises and async/await, the core modules, files and streams, EventEmitter, and networking. The third is shipping: the command line, npm and publishing a package, and testing, debugging and the current edition of the language.Written to ECMAScript 2026, the seventeenth edition of ECMA-262, approved 2026-06-30. ES2026 adds exactly seven things: Map.prototype.getOrInsert and getOrInsertComputed, Math.sumPrecise, Error.isError, Array.fromAsync, Uint8Array Base64 and Hex conversions, JSON.rawJSON and isRawJSON, and Iterator.concat. Only three of the seven run on Node v24.13.1. This book shows the other four throwing a real error on this Node, on the page, and then the manual equivalent a reader can use today.Every chapter has the same shape, in the same order. A short opener states what the chapter covers. Numbered sections state the rules. Each rule carries its own worked examples: complete programs, run, with the real output pasted underneath and a figure. Five problem sets close the chapter in a fixed ladder: review questions, worked problems with full solutions, worked programming problems, and unassisted practice problems.Your 14-Chapter Path1. JAVASCRIPT AND THE NODE RUNTIME2. VALUES, TYPES AND COERCION3. CONTROL FLOW AND FUNCTIONS4. ARRAYS AND ITERATION5. OBJECTS, JSON AND DESTRUCTURING6. SCOPE, CLOSURES AND HIGHER-ORDER FUNCTIONS7. PROTOTYPES, CLASSES AND THIS8. ERRORS AND MODULES9. THE EVENT LOOP AND CALLBACKS10. PROMISES AND ASYNC AWAIT11. CORE MODULES, FILES AND STREAMS12. EVENTEMITTER AND NETWORKING13. THE COMMAND LINE, NPM AND PUBLISHING14. TESTING, DEBUGGING AND ES2026 Who It's ForA reader who can already program in some language and wants fluency in modern JavaScript on Node under test conditions. Front-end developers moving to the server. Students on a web or systems course who need a vehicle beyond the browser. Readers preparing for a technical interview or an exam. Working programmers who measure a book by how many problems they can work afterward. No prior Node is assumed.312 worked examples. 312 figures. 630 numbered problems. 414 runnable listings. 378 pages. Written to ECMAScript 2026, the seventeenth edition, with every listing run on Node v24.13.1.Install Node v24.13.1, open a terminal, and start Cha Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Paperback. Condition: new. Paperback. Fourteen days of drills that turn shell scripting into something you can trust on a machine you cannot watch. This is a book of problems. Every rule is stated in as few words as it can be, shown working in a short script with its real captured output, and then handed back as drills. Nothing is asserted that is not also demonstrated: every listing in the book was run under GNU Bash 5.3.15 on Linux, and every printed result was captured from that run. The programming problems build one real tool across the fourteen days. It is called sentry, a host audit command. It begins on Day 1 as a script that refuses to run half-broken and gains, day by day, arguments that survive a space, settings with defaults, named checks chosen by option, tallies in arrays, log reading that loses no character, file discovery that survives every legal filename, a formatted report, checks that run in parallel behind a lock, and finally a dry run, a self-test, a log and an installable command. The shell is not a passenger here. Quoting decides whether a filename with a space is one argument or two. Strict mode decides whether a failed command stops the script or is ignored. A subshell decides whether a counter survives the loop that filled it. Every one of those decisions is shown as a measurement rather than an opinion, and the book prints both outcomes. The two weeks run in two movements. Days 1 to 7 cover the language: the execution model and strict mode, quoting and expansions, parameter expansion, tests and control flow, arrays, functions and scope, and reading input safely. Days 8 to 14 cover the machine: processes, pipelines and exit status, globs and awkward filenames, traps and cleanup, text processing inside the shell, concurrency and locking, the failure modes a defensive script must survive, and packaging a script an operator can run at three in the morning. Every chapter has the same shape. Numbered sections state the rules. Twenty worked examples show each rule running, each with a complete script, its real output, a figure and a short explanation. Then a fixed ladder of five problem sets: review questions, worked problems with full solutions, worked programming problems, and unassisted practice problems in both written and programming form. The review answers are at the end of the chapter; the practice problems have no answers anywhere, by design.Your 14-day pathWeek 1 - the languageDay 1 - The Shell, the Script and Strict ModeDay 2 - Words, Quoting and the Order of ExpansionsDay 3 - Parameters and Parameter ExpansionDay 4 - Tests, Conditions and Control FlowDay 5 - Arrays and Associative ArraysDay 6 - Functions, Scope and Return ValuesDay 7 - Reading Input with read, IFS and File Descriptors Week 2 - the machineDay 8 - Processes, Pipelines and Exit StatusDay 9 - Files, Globs and Awkward NamesDay 10 - Traps, Signals and CleanupDay 11 - Text Processing inside the ShellDay 12 - Concurrency, Jobs, wait and LocksDay 13 - The Failure Modes of a Shell ScriptDay 14 - Packaging a Script for Operations Who it's forSystem administrators who write the scripts a fleet depends on. Site reliability engineers who inherit them. Developers who maintain the shell that holds a deployment together. Readers preparing for a technical interview. Use of a command line is assumed. No prior scripting is assumed, and no other programming language. 280 worked examples. 462 figures. 910 pr Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Taschenbuch. Condition: Neu. Neuware.

Paperback. Condition: new. Paperback. Fourteen days of drills that turn shell scripting into something you can trust on a machine you cannot watch.This is a book of problems. Every rule is stated in as few words as it can be, shown working in a short script with its real captured output, and then handed back as drills. Nothing is asserted that is not also demonstrated: every listing in the book was run under GNU Bash 5.3.15 on Linux, and every printed result was captured from that run.The programming problems build one real tool across the fourteen days. It is called sentry, a host audit command. It begins on Day 1 as a script that refuses to run half-broken and gains, day by day, arguments that survive a space, settings with defaults, named checks chosen by option, tallies in arrays, log reading that loses no character, file discovery that survives every legal filename, a formatted report, checks that run in parallel behind a lock, and finally a dry run, a self-test, a log and an installable command.The shell is not a passenger here. Quoting decides whether a filename with a space is one argument or two. Strict mode decides whether a failed command stops the script or is ignored. A subshell decides whether a counter survives the loop that filled it. Every one of those decisions is shown as a measurement rather than an opinion, and the book prints both outcomes.The two weeks run in two movements. Days 1 to 7 cover the language: the execution model and strict mode, quoting and expansions, parameter expansion, tests and control flow, arrays, functions and scope, and reading input safely. Days 8 to 14 cover the machine: processes, pipelines and exit status, globs and awkward filenames, traps and cleanup, text processing inside the shell, concurrency and locking, the failure modes a defensive script must survive, and packaging a script an operator can run at three in the morning.Every chapter has the same shape. Numbered sections state the rules. Twenty worked examples show each rule running, each with a complete script, its real output, a figure and a short explanation. Then a fixed ladder of five problem sets: review questions, worked problems with full solutions, worked programming problems, and unassisted practice problems in both written and programming form. The review answers are at the end of the chapter; the practice problems have no answers anywhere, by design.Your 14-day pathWeek 1 - the languageDay 1 - The Shell, the Script and Strict ModeDay 2 - Words, Quoting and the Order of ExpansionsDay 3 - Parameters and Parameter ExpansionDay 4 - Tests, Conditions and Control FlowDay 5 - Arrays and Associative ArraysDay 6 - Functions, Scope and Return ValuesDay 7 - Reading Input with read, IFS and File DescriptorsWeek 2 - the machineDay 8 - Processes, Pipelines and Exit StatusDay 9 - Files, Globs and Awkward NamesDay 10 - Traps, Signals and CleanupDay 11 - Text Processing inside the ShellDay 12 - Concurrency, Jobs, wait and LocksDay 13 - The Failure Modes of a Shell ScriptDay 14 - Packaging a Script for OperationsWho it's forSystem administrators who write the scripts a fleet depends on. Site reliability engineers who inherit them. Developers who maintain the shell that holds a deployment together. Readers preparing for a technical interview. Use of a command line is assumed. No prior scripting is assumed, and no other programming language.< Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Paperback. Condition: new. Paperback. Fourteen days of drills that turn data structures and algorithms into something you can use under pressure.This is a book of problems. Every rule is stated in as few words as it can be, shown working in a short program with its real captured output, and then handed back as drills. Nothing is asserted that is not also demonstrated: every listing in the book was compiled and run with Rust 1.97.1, and every printed result was captured from that run.The programming problems build one real tool across the fourteen days. It is called tally, a command-line text index. It begins on Day 1 as a word counter and gains, day by day, a growing buffer, a document list, a query parser, a directory walk, a ranking, a heap, a sorted vocabulary, a hash index, a search tree, a trie, a graph of related terms and a comparison of two documents. Each day's tool is the previous day's with one structure added, so the reason for a structure arrives before it does.Rust is not a passenger here. Ownership decides how a linked list is written, why a tree is held in one vector rather than a Box per node, and what a deletion is allowed to touch. Those decisions are shown as measurements, not as opinions: an arena builds a hundred thousand nodes in two thirds of the time and half the memory of one Box per node, and the book prints both numbers.The two weeks run in three movements. Days 1 to 5 build the foundations: the cost model, arrays, linked lists, stacks and queues, and recursion with backtracking. Days 6 to 9 cover sorting, heaps and priority queues, searching and two pointers, and hash tables. Days 10 to 14 cover binary search trees, balanced trees and tries, graphs and traversal, shortest paths, and dynamic programming and greedy algorithms.Every chapter has the same shape. Numbered sections state the rules. Twenty worked examples show each rule running, each with a complete program, its real output, a figure and a short explanation. Then a fixed ladder of five problem sets: review questions, worked problems with full solutions, worked programming problems, and unassisted practice problems in both written and programming form. The review answers are at the end of the chapter; the practice problems have no answers anywhere, by design.YOUR 14-DAY PATHWEEK 1 - FOUNDATIONS AND SORTINGDay 1 - Complexity and the Cost ModelDay 2 - Arrays and Dynamic ArraysDay 3 - Linked ListsDay 4 - Stacks and QueuesDay 5 - Recursion and BacktrackingDay 6 - Elementary and Divide-and-Conquer SortingDay 7 - Heaps, Priority Queues and Linear-Time SortingWEEK 2 - SEARCHING, TREES, GRAPHS AND DESIGN METHODSDay 8 - Searching, Binary Search and Two PointersDay 9 - Hash TablesDay 10 - Binary Trees and Binary Search TreesDay 11 - Balanced Trees and TriesDay 12 - Graphs and TraversalDay 13 - Shortest Paths, Spanning Trees and Topological OrderDay 14 - Dynamic Programming and Greedy AlgorithmsWHO IT'S FORStudents taking a data structures course who want drills rather than a reference. Readers preparing for an examination or a technical interview. Working programmers who want fluency in the structures they already use by name. One programming language is assumed: loops, functions and arrays. No prior work on data structures is assumed. Rust is taught only where a structure needs it, so a reader who knows another language can follow the drills and pick up the language on the way.281 worked examples. 463 figures. 736 problems. 390 pages. Written to Rust 1.97.Fourteen days. Work them in order, and do the problems. This item Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Paperback. Condition: new. Paperback. Fourteen days of drills on JavaScript and the Node runtime it actually runs on.This is a drill manual, not a tutorial and not a reference. The programming problems build one real program across the book: pulse, a command-line task and notification scheduler. It starts as a script that runs a single job on a timer and ends as a multi-file tool that persists jobs to disk, schedules recurring work, and dispatches webhook alerts when a job fires. Every listing in the book - 414 of them - was executed on Node v24.13.1, and every printed output block, thrown errors included, is a paste from that run. A reader who works the programming problems finishes with pulse running end to end; a reader who skips them still finishes with the language.The fourteen chapters move through three arcs. The first is the language itself: values and coercion, control flow and functions, arrays and iteration, objects, JSON and destructuring, scope and closures, higher-order functions, prototypes, classes, this-binding, and the errors and modules that hold a program together. The second is the runtime that makes JavaScript worth running on a server: the event loop and callbacks, promises and async/await, the core modules, files and streams, EventEmitter, and networking. The third is shipping: the command line, npm and publishing a package, and testing, debugging and the current edition of the language.Written to ECMAScript 2026, the seventeenth edition of ECMA-262, approved 2026-06-30. ES2026 adds exactly seven things: Map.prototype.getOrInsert and getOrInsertComputed, Math.sumPrecise, Error.isError, Array.fromAsync, Uint8Array Base64 and Hex conversions, JSON.rawJSON and isRawJSON, and Iterator.concat. Only three of the seven run on Node v24.13.1. This book shows the other four throwing a real error on this Node, on the page, and then the manual equivalent a reader can use today.Every chapter has the same shape, in the same order. A short opener states what the chapter covers. Numbered sections state the rules. Each rule carries its own worked examples: complete programs, run, with the real output pasted underneath and a figure. Five problem sets close the chapter in a fixed ladder: review questions, worked problems with full solutions, worked programming problems, and unassisted practice problems.Your 14-Chapter Path1. JAVASCRIPT AND THE NODE RUNTIME2. VALUES, TYPES AND COERCION3. CONTROL FLOW AND FUNCTIONS4. ARRAYS AND ITERATION5. OBJECTS, JSON AND DESTRUCTURING6. SCOPE, CLOSURES AND HIGHER-ORDER FUNCTIONS7. PROTOTYPES, CLASSES AND THIS8. ERRORS AND MODULES9. THE EVENT LOOP AND CALLBACKS10. PROMISES AND ASYNC AWAIT11. CORE MODULES, FILES AND STREAMS12. EVENTEMITTER AND NETWORKING13. THE COMMAND LINE, NPM AND PUBLISHING14. TESTING, DEBUGGING AND ES2026 Who It's ForA reader who can already program in some language and wants fluency in modern JavaScript on Node under test conditions. Front-end developers moving to the server. Students on a web or systems course who need a vehicle beyond the browser. Readers preparing for a technical interview or an exam. Working programmers who measure a book by how many problems they can work afterward. No prior Node is assumed.312 worked examples. 312 figures. 630 numbered problems. 414 runnable listings. 378 pages. Written to ECMAScript 2026, the seventeenth edition, with every listing run on Node v24.13.1.Install Node v24.13.1, open a terminal, Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware - Fourteen days of drills that turn design patterns from vocabulary into judgment. Most pattern books show you Java-shaped code and leave out the question C++ actually asks: who owns these objects, and how long do they live This one answers it for every pattern. That is the difference between a diagram you can recite and a design you can ship. You learn by doing, on one real project. studio is a command-line vector-drawing and report-generating application. It starts on Day 1 as a rigid hundred-line program and ends on Day 14 as a design that absorbs change. Every pattern earns its place in it rather than being bolted on. Week one builds the foundation: what a design is judged by, object lifetime and ownership in C++, and all five SOLID principles. Week two is the twenty-three classic patterns in their three groups, then the C++ forms that reach the same flexibility with no virtual function at all, then removing designs as well as adding them. Every pattern is presented the same way. First the change that breaks the rigid design. Then the rigid code, with the exact line you would have to edit. Then the hinge, the one abstraction that turns editing into adding. Then the code that changed. Then the cost, stated plainly, because a pattern that looks free gets used everywhere. Every day is self-contained: numbered rules, short worked examples with real captured output and a diagram of the mechanism, then a fixed ladder of five problem sets running from recall to unassisted building. Practice problems have no answers anywhere, by design. YOUR 14-DAY PATH Week 1 - Principles Day 1: Design, Change and Cost Day 2: Single Responsibility and Open-Closed Day 3: Substitution, Segregation and Inversion Day 4: Creating Objects by Name Day 5: Assembling, Copying and Sharing Day 6: Wrapping, Splitting and Nesting Day 7: Adding, Hiding, Deferring and Sharing Week 2 - Patterns and judgment Day 8: Interchangeable Behaviour Day 9: Objects That Talk to Each Other Day 10: Mode, Traversal and History Day 11: Operations over a Structure Day 12: Patterns without Virtual Functions Day 13: Anti-Patterns and Refactoring toward Patterns Day 14: The Assembled Application WHO IT'S FOR Working C++ programmers who can write a class but cannot yet say why one design survives a change and another does not. Students on a software design or software engineering course. Candidates preparing for a design interview, where the twenty-three patterns are asked about by name. Written to C++23. Every listing was compiled and run with g++ -std=c++23 -O2 -Wall -Wextra, and every printed output is what came back from that run. Nothing was typed from memory. Work the problems. That is what the book is for. …

Taschenbuch. Condition: Neu. Neuware - Fourteen days of drills on the SQL a technical interview actually asks for, run through nothing but Python's own standard library. This is a drill manual, not a narrative course. Every listing was executed for real against a small SQLite database built up across the fourteen days, and every printed output block, including every EXPLAIN QUERY PLAN, is a paste from that run. Each chapter states a rule in as few words as it can, shows the rule working in a short numbered example with its captured output, and hands it straight back as problems. The vehicle is hiredb, one job-application database with four tables: applications, companies, contacts and a status-history log. Only Python 3.11 or later is required. sqlite3 ships in the standard library, so there is no server to install, no account to create, and no driver to configure. Every listing runs unchanged on Windows, macOS and Linux. The first week covers the ground a screen opens with: the table and the first query, SELECT and WHERE, every join type, GROUP BY and aggregate traps, subqueries and CTEs, window functions, and NULL and three-valued logic. The second week covers what separates a pass from a strong pass: indexes, reading a query plan, transactions and isolation, normalisation and schema design, calling SQL safely from Python, one full take-home task, and a closing chapter of forty timed questions, each worked and its own plan read. The findings are reported as they came out. A missing index turns a two-hundred-thousand-row filter from fourteen milliseconds into one tenth of one. A naive pay comparison shows remote roles earning nineteen points more than onsite ones, and the gap nearly disappears once role is held constant. Your 14-Day Path - 1. THE TABLE, THE ROW AND THE QUERY- 2. SELECT, WHERE AND THE FIRST QUESTIONS- 3. JOINS: INNER, LEFT AND THE ONE THAT LOSES ROWS- 4. GROUP BY, HAVING AND AGGREGATE TRAPS- 5. SUBQUERIES, CTEs AND READABLE SQL- 6. WINDOW FUNCTIONS- 7. NULL AND THREE-VALUED LOGIC- 8. INDEXES AND WHY YOUR QUERY IS SLOW- 9. READING A QUERY PLAN- 10. TRANSACTIONS AND ISOLATION- 11. NORMALISATION AND SCHEMA DESIGN- 12. SQL FROM PYTHON- 13. THE TAKE-HOME DATA TASK- 14. THE LIVE SQL SCREEN Who It's For Job seekers preparing a technical screen or a take-home assignment. Students learning SQL through Python's own standard library. Working developers whose SQL has stayed at a beginner's level for years. Anyone who wants every answer checked against a real database, not memorized. 284 worked examples. 286 figures. 650 numbered problems. 392 pages. Built and measured against Python 3.11 and SQLite 3.38. You need only Python and about an hour a day. Start Day 1.…

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware - Fourteen days of drills on the patterns a coding interview actually asks for, run through nothing but plain Python and a harness built on Day 1. This is a drill manual, not a narrative course. Every listing was executed for real through drillkit, a small timing-and-testing harness the book builds and grows across fourteen days, and every printed output block is a paste from that run. Each chapter states a rule in as few words as it can, shows the rule working in a short numbered example with its captured output, and hands it straight back as problems. Only Python 3.11 or later is required. No package needs installing and no account needs creating. Every listing runs unchanged on Windows, macOS and Linux. The first week builds the model and the instruments: how a score is built from four axes, complexity spoken out loud, arrays and two pointers, hash maps, sliding windows, linked lists, and stacks and monotonic structures. The second week covers trees, graphs, recursion and backtracking, sorting and binary search, dynamic programming, heaps and greedy choices, and a closing mock loop of four timed interviews. The findings are reported as they came out. A heap-based merge loses to a single call to Python's own sort. A first-element quicksort pivot turns a fast sort thirty times slower on sorted input. Two candidates with identical, unfinished code cross a hiring threshold on one axis alone: the one who says what they would try next scores higher than the one who goes silent. Your 14-Day Path - 1. HOW A CODING INTERVIEW IS SCORED- 2. COMPLEXITY YOU CAN DEFEND OUT LOUD- 3. ARRAYS AND TWO POINTERS- 4. HASH MAPS AND COUNTING- 5. STRINGS AND SLIDING WINDOWS- 6. LINKED LISTS AND POINTER SURGERY- 7. STACKS, QUEUES AND MONOTONIC STRUCTURES- 8. TREES AND TRAVERSAL- 9. GRAPHS- 10. RECURSION, BACKTRACKING AND PRUNING- 11. SORTING AND BINARY SEARCH- 12. DYNAMIC PROGRAMMING WITHOUT PANIC- 13. HEAPS, INTERVALS AND GREEDY CHOICES- 14. THE MOCK LOOP Who It's For Bootcamp graduates and career changers preparing a first technical screen. Students who want every claim measured against a running program. Working developers whose interview skills have gone rusty. 280 worked examples. 336 figures. 630 numbered problems. 384 pages. Built and measured against Python 3.11. You need only Python and about an hour a day. Start Day 1.…

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware - CUDA Programming in 21 DaysA Hands-On Course in C++ and Python>================================================================Go from 'what even is a GPU ' to writing, debugging, and tuningyour own CUDA kernels - in three focused weeks.>Most GPU books are either a wall of reference material or a thinlayer of copy-paste recipes. This one is a course. Each day is asingle sitting that builds on the last, teaches one ideaproperly, and ends with a workshop so the knowledge lands in your>You write REAL CUDA C++ that compiles with nvcc, and you see thePython equivalent (CuPy and Numba) alongside every step, so youcan run and experiment even before your C++ is fluent. Every>WHAT YOU GET- 21 chapters (3 weeks x 7 days), 1.2 million words of careful, worked teaching - no filler.- 229 figures, diagrams, and plots, every one generated from areal computation or a clean schematic.- Hundreds of runnable listings in CUDA C++, CuPy, and Numba.>THE THREE WEEKSWeek 1 - Get onto the GPU: why GPUs win, the toolkit, yourfirst kernel, thread indexing, moving data, and debugging.Week 2 - Make it fast: the memory hierarchy, coalescing, shared memory and tiling, synchronization, warps anddivergence, occupancy, and honest profiling with a roofline.Week 3 - Patterns, libraries, and a real project: reduction, atomics, scan, streams and overlap, Thrust/cuBLAS/cuFFT/CuPy, >WHO IT'S FORYou know a little C or C++ and a little Python. You do NOT needany GPU experience. You do not even need an expensive GPU - anyrecent NVIDIA card works, and Day 2 shows you how to run every>BY DAY 21 YOU CAN- decide whether a problem suits a GPU, and why;- write, launch, and debug your own kernels;- lay out memory and choose a launch configuration for speed;- use reductions, scans, atomics, and streams with confidence;- reach for the right library - and verify its result;>The GPU stops being a black box. Go build something that neededall those threads.…

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware.

Taschenbuch. Condition: Neu. Neuware.