Concepts starting with P
234 concepts, each with a plain-language explanation, examples and diagrams. Pick a letter or open a concept.
- PAC Learnability — Shattering means realizing every possible 0/1 labeling on a chosen set.
- PAC Learning — Realizability demands perfect agreement between some hypothesis in H and a target labeling function.
- PAC Learning and Sample Complexity — Uniform convergence connects a finite i.i.d. sample with representativeness of an underlying distribution.
- PAC Learning Model — Online learning has no separate training phase followed by a separate prediction phase.
- PAC-Bayes Bounds — The PAC-Bayes bound can be converted into a learning rule.
- PAC-Bayes Bounds and Measure Concentration — PAC-Bayes bounds define a hierarchy over a hypothesis class H.
- Pacing Delta Mode Against Institutional Reality — Echo mode listens and learns how the work actually happens; Delta mode ships a working system based on that learning.
- Package Statements in Java Source Files — An import directive lets you write a simple class name in the rest of a Java file instead of the full name, but it does not…
- Packages and Class Organization in Java — A jar file holds the compiled classes and resource files of a program, but running it still requires Java on the target machine…
- Packages and Classes in Java — A Java module is a collection of packages, adding one more level of containment above packages, classes, and members.
- Packages and Full Class Names — An import directive lets you write a simple class name in the rest of a Java file instead of the full name, but it does not…
- Paint Component Method — The RandomStringsPanel draws 25 messages, each with a random color, position, and one of five random fonts, on a black background.
- Palantir's Forward-Deployed Model — Forward-deployed engineering means embedded engineers working on-site with customers to implement and deploy software solutions.
- pandas DataFrames — The to_csv method, called on a pandas DataFrame, saves that DataFrame to a CSV file named by its first argument.
- Parallel Processing of Attention Heads — The current MultiHeadAttentionWrapper processes its heads sequentially through a list comprehension in the forward method.
- Parallel Streams — A collection serves as the source of values for a stream, and this applies to lists, sets, and any other collection.
- Parameter Tuning — k-Fold Cross Validation helps estimate true error without setting aside a permanently unused validation set.
- Parameter-Efficient Fine-Tuning with LoRA — The source gives four strategies for improving LLM performance: adjusting hyperparameters, increasing and diversifying the…
- Parameterized Function Approximation — Continuing cases motivate the average reward formulation.
- Parameters and Arguments in Subroutines — Modifiers appear at the front of a subroutine definition and set characteristics such as whether it is static or public.
- Parameters and Arguments: The Basics — Expressions and variables can both be passed as arguments to user-defined functions, just as they can be passed to built-in…
- Parameters and Arguments: What's the Difference? — A function is a named sequence of statements that performs a computation. You call it by name to execute its statements.
- Parentheses and Grouping in Expressions — When operators have equal precedence, they are evaluated from left to right, not right to left.
- Parser Generators Compared With Hand-Written Parsers — A recursive descent parser models every BNF grammar rule as a subroutine, so the structure of the program follows the structure…
- Parsing and Processing Text Data — The split method converts a string into a list of words by breaking on whitespace (when called with no arguments) or on a custom…
- Parsing and Processing Web Responses — HTTP responses follow a three-part structure: status line, headers, blank line, and body.
- Parsing CSV Files in Python — The INSERT OR IGNORE and SELECT pattern solves the foreign key dependency problem by inserting a record and immediately…
- Parsing HTML Tables and Extracting Structured Data — BeautifulSoup transforms raw HTML strings into searchable tree-structured objects that mirror the document's logical hierarchy.
- Parsing HTML with BeautifulSoup — Regular expressions provide a concise way to search for and extract patterns in HTML text, such as URLs in href attributes.
- Parsing JSON in Python — JSON (JavaScript Object Notation) was inspired by JavaScript but influenced by Python's dictionary and list syntax, making it…
- Parsing JSON in Your Application — JSON uses two main structures: objects (key-value pairs in curly braces) and arrays (ordered lists in square brackets).
- Parsing JSON in Your Programming Language — JSON has become the industry standard for data exchange because its structure maps directly onto native data structures in…
- Parsing Structured Text Formats — A text file can be conceptualized as a sequence of lines, analogous to how a Python string is a sequence of characters.
- Parsing XML Documents with ElementTree — findall retrieves a Python list of all XML nodes matching a specified path, enabling batch processing of similar structures.
- Parsing XML Files with ElementTree — ET.fromstring() converts an XML string into a tree structure of Element objects, making the hierarchical data queryable.
- Parsing XML with ElementTree — Triple single quotes (''') and triple double quotes (""") both create multi-line strings in Python.
- Parsing XML with Python's ElementTree — fromstring converts an XML string into a tree structure, enabling programmatic access to its data.
- Parsing XML: Reading and Extracting Data — An XML element is a complete unit consisting of an opening tag, content, and a closing tag; it can also be represented as a…
- Partial Game Trees in MCTS — MCTS repeatedly searches from the root of the current partial game tree.
- Partial Image Drawing — The Graphics class provides the methods that copy an image onto the screen or an off-screen canvas, most commonly from inside…
- Partially Full Arrays — A dynamic array lets a collection grow and shrink while the program runs, and the class design hides the internal array behind…
- Partitions in Clustering — Kleinberg's work is presented as an axiomatic attempt to define clustering.
- Passing Arguments to Functions — A reference is the association between a variable name and an object. When you assign b = a, both variables refer to the same…
- Passing Arguments to Python Programs — The sys.argv variable is a list of strings (lists are explained in detail in a later chapter. Specifically, the…
- Passing Functions as Parameters — A language has first-class functions when functions can be treated as data values, for example by assigning them to variables…
- Pattern Matching Across Multiple Lines — Parentheses in regular expressions mark the portion of a match that findall() should extract and return.
- Pattern Matching Fundamentals — Basic string methods handle simple, exact-match searches but fail when patterns are flexible or conditional.
- Pattern Matching with re.search() and re.match() — re.findall() is a Python method that extracts all non-overlapping substrings matching a regex pattern from a string.
- Pattern Recognition and Machine Learning — Three important references are associated with neural network learning, pattern recognition and machine learning, and support…
- Payment Terms and Milestone Design — A four-milestone restructure replaces a single lump-sum payment with four milestone payments, aiming to align the vendor's…
- PCA as a Representation Method — Dictionary learning creates a feature vocabulary for data that may not have an obvious vocabulary.
- Perceptron Algorithm for Halfspaces — The Perceptron algorithm alternates between checking the training examples and updating its weight vector.
- Performance Evaluation in Reinforcement Learning — The value of n is an important performance setting in n-step TD methods.
- Performance Guarantees in Consumption-Based Pricing — Consumption-based pricing charges the customer per unit of work an AI system completes, such as a support ticket resolved, a…
- Performance Optimization in Python — This chapter focuses on one particular case of optimization: finding the parameters θ of a neural network that significantly…
- Performing Arithmetic Operations — Python has two main numeric types: int (integers) and float (floating-point numbers).
- Performing Operations on Variables — Use print(variable) to display the value stored in a variable and see it on the console.
- Phasic Responses of Dopamine Neurons — TD error, denoted δt, is examined as a quantity that changes over the course of learning.
- Phil's Breakfast Example Inspiration — Phil's breakfast example was inspired by Agre (1988).
- Pilot Projects and Staged Rollouts — The pilot was staged, starting with three inspectors at one plant and growing to twenty and then sixty
- Pixel Grid and Screen Representation — A screen is a grid of pixels, and drawing means choosing the colors of individual pixels.
- PKCE and Security Best Practices for OAuth — OAuth libraries are free, pre-built tools that handle the complexity of the OAuth 2.0 protocol so you do not have to implement…
- Planning and Acting Under Time Constraints — Planning and response time compete when planning is performed during action selection.
- Planning and Learning in Dyna — The Dyna Maze has 47 states, four directional actions, zero reward on ordinary transitions, and reward +1 when entering the goal.
- Planning and Real-Time Action Selection — Goal-directed agents pursue explicit goals through sensing and action.
- Planning as Part of a Policy — MCTS connects planning with policy decisions.
- Planning Backups — State-space planning can be understood as sequences of backups.
- Planning Methods — Eligibility traces combine the strengths of Monte Carlo methods and temporal-difference methods.
- Planning the Validation Phase of an AI Engagement — A common belief holds that data access can be arranged after an AI engagement begins, but the source treats it as something to…
- Planning with Models — Models let reinforcement-learning systems simulate experience rather than relying only on directly observed experience.
- Planning with Simulated Experience — Planning can occur as part of choosing an action rather than as a permanently stored calculation.
- Planning Work Across Multiple Delivery Periods — Roadmap thinking treats the work that ships in one quarter as an input that has to feed the next quarter.
- Platform Independence in Java — The JVM is a virtual computer, not a physical machine.
- Platform Work and the Paving Stage — The source describes the paving cycle as roughly seven months, built from two three-month stages and one six-week paving stage.
- Plugin Evaluation — A plugin is a self-contained package of prompts, tools, and configuration for one specific task.
- Plugin Structure — A plugin is a self-contained package of prompts, tools, and configuration for one specific task.
- Policies and Action Selection — A reinforcement learning problem is an interaction between an agent and an environment.
- Policies and Actions — Value functions evaluate expected return under a particular policy.
- Policies and Sequential Decision Problems — Artificial neural networks are function representations that can be used within reinforcement learning.
- Policies and Transition Probabilities — Ergodicity separates temporary starting effects from long-run behavior.
- Policies in Markov Decision Processes — A state-value function evaluates a state under a policy.
- Policies in Reinforcement Learning — A tabular method stores value-function estimates directly in arrays or tables.
- Policy Evaluation and Policy Improvement — Optimality describes the highest-value policy, not the computational effort required to find it.
- Policy Evaluation in Reinforcement Learning — The optimal state-value function v∗(s) gives the maximum expected return achievable from a state.
- Policy Evaluation in Tic-Tac-Toe — Evolutionary methods evaluate a fixed policy through many game outcomes.
- Policy Gradient — Policy-gradient actor-critic learning combines a policy-based actor with a value-based critic.
- Policy Gradient for Continuing Problems — Continuing problems have no episode endpoints, so policy performance is measured by average reward per time step over the long…
- Policy Gradient Theorem — A policy-weight change has both an action-selection consequence and a state-distribution consequence.
- Policy Improvement — Policy evaluation measures a fixed policy rather than changing it.
- Policy Improvement Theorem — Greedy policy construction means selecting maximum-valued actions according to v π.
- Policy Iteration — GPI describes a feedback relationship, not one fixed algorithm.
- Policy Iteration Algorithm and Example — The example begins with an equiprobable random policy.
- Policy Iteration for Optimal Decision Making — Policy iteration is applicable to action values, not only state values.
- Policy Iteration Fundamentals — Policy iteration makes progress through a repeating evaluation-improvement cycle.
- Policy Networks and Value Networks — MCTS is a repeated search process over a partial game tree.
- Policy Optimization — The theorem connects performance to policy weights through an analytic gradient expression.
- Policy Parameterization — Softmax action selection over action preferences can approach deterministic behavior when the optimal action's preference is…
- Policy Parameterization for Continuous Actions — A normal density describes how probability is distributed across possible real-valued actions.
- Policy Parameters and Action Selection — Contingent eligibility links presynaptic participation to postsynaptic firing.
- Policy Search in Reinforcement Learning — Evolutionary methods use policy search and reward comparison rather than value-function estimation.
- Policy Space Search — Value functions play a central role in reinforcement learning methods.
- Policy Weights — The theorem connects performance to policy weights through an analytic gradient expression.
- Policy-Gradient Actor-Critic Method — The critic estimates state value by summing weighted state features.
- Policy-Gradient Methods — Function approximation introduces issues including nonstationarity, bootstrapping, and delayed targets.
- Polling Loops and Interrupts — The CPU's normal behavior is a sequential fetch-and-execute process.
- Polymorphism — Polymorphism allows a subtype to be treated as an instance of its parent type, enabling flexible code that works with multiple…
- Polymorphism and Method Resolution — A base class defines shared attributes and methods; derived classes inherit from it and add their own specialized features.
- Polynomial Basis Functions — Each OrderN polynomial basis function multiplies one powered term for every state variable.
- Polynomial Regression — Feature learning learns a function ψ that maps instances from X into d-dimensional feature vectors.
- Pooling layers — The example creates a Keras Sequential model and adds layers in a fixed order.
- Portability of Python Programs — Python programs can work on multiple platforms without changes if system-dependent features are avoided.
- Portfolio Artifacts and Verification — A portfolio holds artifacts that a reviewer can examine, not restated resume bullets.
- Positional Arguments — When you use positional arguments, you must remember the exact order in which the function expects them. If a function takes…
- Positive Semidefinite Matrices — A symmetric matrix is positive definite when every eigenvalue is positive.
- Practical Applications of Deep Learning — The canonical workflow is a standard process for solving data problems with deep learning.
- Practical Examples with Keras — Binary classification is a two-class machine-learning problem.
- Pre-call Research Agent Project Brief — The proposed pre-call briefing agent generates a one-page briefing document twenty minutes before each scheduled call.
- Pre-Trained Language Models — Fine-tuning adjusts a pre-trained LLM to a specific task, here converting active sentences to passive voice, using a single…
- Pre-Trained Models — Fine-tuning adjusts a pre-trained model's weights to fit a specific task, and it can either update the whole model or only…
- Predecessor States in Planning — Backward focusing directs planning from a changed value toward states that may depend on it.
- Predefined Java Exception Classes — A custom exception class must extend Throwable or one of its subclasses, and it is usually built to represent a failure that no…
- Prediction and Control in Reinforcement Learning — Instrumental conditioning is learning in which consequences modify behavior.
- Prediction Labels — A decision tree follows an instance from a root node to a leaf.
- Prediction Objectives in Reinforcement Learning — Value function approximation makes exact prediction for every state impossible in the described setting.
- Prediction Rule — Classifier error measures the probability of an incorrect prediction on a random data point.
- Prediction with Expert Advice — The learner distributes probability across experts rather than having to select one expert deterministically.
- Predictive Models and Quality Measures — Filter methods reduce a feature set by scoring each feature independently.
- Predictor design — Feature selection reduces a full feature collection to a subset used by the predictor.
- Preparing a Customer-Driven Demo — In customer control, the customer holds the keyboard and types the inputs they would use in their actual work.
- Preparing a Dataset for Instruction Fine-Tuning — Reading a few sample responses by hand gives only a rough idea of performance and does not scale to larger numbers of responses.
- Preparing Data for Machine Learning — Think of machine learning as a workflow of connected decisions, not only as model construction.
- Preparing Enterprise Data for AI Systems — A good model is necessary but not sufficient: the source treats the model as largely solved, while the gap lies in the…
- Preparing for a Project Interview — A demo video is a screen-recorded, narrated video of about two minutes.
- Preparing for Customer Simulations — Customer simulations are a setting where concrete stories about past engagements show problem-solving and communication.
- Preparing for Interviews After a Startup Failure — A polished press-release account of a failure is the common instinct, and the source advises against it.
- Preparing for Steering Committee Meetings — Practicing conversational responses means rehearsing specific words for situations that can be anticipated, so they are…
- Preparing Instruction Data for Batching — The Alpaca dataset is an openly shared instruction dataset of 52,002 entries, roughly fifty times larger than the earlier…
- Preparing Stories From Past Projects — The final stage of a hiring process is a conversation that looks like a discussion of your background but is really assessing…
- Preparing Text Data for Language Models — Instruction fine-tuning aims at flexibility and interaction quality across many complex user instructions, and it demands larger…
- Preparing Text for Large Language Model Training — Large language model training requires text to be prepared first, and the source treats this as a necessary step.
- Preparing Text for LLM Training — Preparing text is a necessary step before large language model training.
- Preparing Text Inputs for Neural Networks — The original transformer is a deep neural network architecture introduced in 2017, developed for machine translation, and now…
- Preprocessing Data for Neural Networks — Reshaping reorganizes a tensor's rows and columns into a target shape.
- Pretrained Convolutional Networks — VGG19 acts as a pretrained measurement network rather than as the object being generated.
- Pretrained ImageNet Models — DeepDream changes an existing image by maximizing activations inside a convolutional network.
- Pretraining a GPT Model — Instruction fine-tuning aims at flexibility and interaction quality across many complex user instructions, and it demands larger…
- Pretraining a GPT-Style Language Model — Preference fine-tuning is an optional step performed after instruction fine-tuning.
- Pretraining a Large Language Model — Instruction fine-tuning adapts a pretrained LLM to follow human instructions and generate desired responses.
- Pretraining and Fine-Tuning Language Models — GPT was introduced by Radford et al. from OpenAI in the paper Improving Language Understanding by Generative Pre-Training.
- Pretraining Large Language Models — The general process of creating an LLM has two stages: pretraining, which trains on a large, diverse dataset to build a broad…
- Preventing Common Runtime Errors — The Guardian Pattern strategically places a guard condition before a risky operation in an 'and' expression to prevent runtime…
- Preventing Overfitting — A Keras callback is an object passed to fit that is called at various points during training.
- Pricing Challenges and Outcome Pricing — Pricing models are located by attribution, meaning how much of the result the product can claim, and autonomy, meaning how much…
- Primary and Secondary Reinforcement — A delayed primary reward does not have to be the only influence operating during the delay.
- Primary Keys and Foreign Keys — Crow's Foot Diagrams use boxes to represent tables and lines with notation symbols to represent relationships between tables.
- Primary Keys and Foreign Keys: Building Connections Between Tables — A many-to-many relationship exists when records on both sides can connect to multiple records on the opposite side, unlike…
- Primary Keys and Relationships — The three primary data structures in a relational database are tables, rows, and columns.
- Primary Keys and Unique Constraints — The INSERT OR IGNORE and SELECT pattern is a two-step sequence that inserts a row and immediately retrieves its primary key for…
- Primary Keys and Unique Identifiers — A one-to-many relationship connects one entity instance to multiple instances of another entity.
- Primary Keys: Identifying Rows Uniquely — A uniqueness constraint ensures all values in a column are unique by using a special index to detect and block duplicates.
- Primary Reinforcement — Trace conditioning is defined by a temporal gap between conditioned-stimulus offset and unconditioned-stimulus onset.
- Primary Reward — A reward signal is a numerical evaluation, not necessarily a physical reward.
- Primitive Types and Their Limits — Generic data structures in Java can only hold objects, and primitive values such as int are not objects, so they cannot be used…
- Primitive Types in Java — An identifier is a sequence of one or more characters used to name classes, variables, and subroutines.
- Principal Component Analysis — Matrix A uses X transposed X and has dimensions determined by the original features.
- Printing Output in Java — A Java program is defined within a public class.
- Printing Output to the Screen — raw_input() captures text from the keyboard and returns it as a string to your program.
- Prior Knowledge in Machine Learning — The No-Free-Lunch Theorem rules out a learner that succeeds on every learning task.
- Prioritized Sweeping Algorithm — Prioritized sweeping is valuable because it helps an agent find good or optimal solutions sooner.
- Prioritizing Reusable Product Work — A monthly synthesis review is a half-day meeting where FDE and product teams meet to examine what FDEs shipped.
- Priority Queues — A PriorityQueue can sort a collection: add all items with addAll, then remove them one at a time until the queue is empty.
- Private Instance Variables — A setter method is the controlled way for other classes to change a private variable, and every change should pass through it.
- Probabilistic Sampling for Next-Token Selection — Top-k sampling restricts the candidate tokens to the k most likely ones; it does not force the single highest-scoring token to…
- Probability Distributions — D is the distribution; z ∼ D describes sampling from it.
- Probability Distributions in Learning — Classifier error measures the probability of an incorrect prediction on a randomly drawn instance.
- Probability Theory — The lemma gives a probabilistic guarantee that distances between vectors can be preserved after projection into a…
- Probability Theory Basics — Hoeffding's Inequality controls the probability of a large difference between a sample mean and the true mean.
- Probably Approximately Correct Learning — PAC learnability separates approximate correctness from the likelihood of achieving it.
- Problem Analysis and Decomposition — Specifying program requirements means translating a vague problem into concrete, measurable specifications that leave no room…
- Problem Misdefinition in Enterprise AI — The top-five-priorities filter asks whether a proposed AI problem is among the customer's top five priorities. If it is not, the…
- Problem Size Measurement — Big-Oh notation describes an upper bound on how an algorithm's running time grows as the problem size n increases without limit.
- Procedure-oriented programming — A programming paradigm where the program is constructed around procedures or functions.
- Processing Arrays with for Loops — A 2D array is declared with two pairs of brackets, as in int[][] A, and created with new, as in A = new int[5][7], which makes 5…
- Processing File Content with String Methods — The file handle does not contain file data; it is a connection to the file on disk that the for loop uses to read data…
- Processing Multiple Files in a Loop — Hardcoding file names in your code limits reusability; you have to edit the code every time you want to process a different file.
- Processing Sequence Data — Chapter 5 examines practical computer-vision examples with a focus on image classification.
- Processing Structured Text Files — startswith() checks if a string begins with a specific prefix and returns True or False—it does not search for the substring…
- Procurement Challenges for AI Startups — The standard enterprise procurement function is configured for SaaS-style contracts with predictable monthly fees, defined seat…
- Procurement Resistance to Outcome Pricing — Standard enterprise procurement is configured for SaaS-style contracts with predictable monthly fees, defined seat counts, and…
- Producer and Consumer Problems with Threads — A notification sent between a thread's check of a condition and its call to wait() is lost, and the waiting thread can wait…
- Producer/Consumer Pattern and Blocking Queues — A blocking queue suspends a thread that tries to take from an empty queue, or to put into a full limited queue, and resumes that…
- Product Positioning for Different Customer Segments — Technology adoption spreads across customer segments in sequence, and each segment has different attitudes toward new products.
- Product-Led Growth as an Alternative Motion — The viability of the FDE motion depends on a company's average contract size, not on the motion's general appeal.
- Production Code in Customer Environments — A Forward Deployed Engineer is a software engineer who works at the customer's site to close the gap between what the product…
- Production Deployment of Validated Models — Eval-driven validation judges a model with a labeled eval set before the model is deployed to production.
- Program Control Flow and Functions — exit() terminates the entire program immediately and never returns to any caller.
- Program Design — Software engineering is a discipline for constructing correct, working, and well-written programs.
- Program Design and Decomposition — Top-down programming makes a large problem manageable through repeated decomposition.
- Program Design with Subroutines — A subroutine parameter lets the same subroutine perform its task on different inputs, with the caller choosing the input on each…
- Program Execution: From Code to CPU Instructions — The CPU is the part of the computer built to obsessively ask 'What is next?' and determine the next operation to execute.
- Program Exit Status — The phone book data is held in a TreeMap while the program runs, and modifications are made to that in-memory structure.
- Program Flow and Control — Every program takes input, performs processing, and produces output—this is the fundamental structure of all programs.
- Program Flow Control with Conditionals — The try/except structure catches errors in risky code (like opening files) and runs recovery code in the except block instead of…
- Programming Language Rules — Java syntax defines the permitted vocabulary and construction of Java programs.
- Programming Languages: High-Level vs. Low-Level — A compiler translates an entire program from high-level source code to machine language in one complete pass, then saves the…
- Programming with Objects — Object is a special class in package java.lang and is the one class in Java that is not a subclass of any other class.
- Project Brief Essentials — Project scoping means defining a project tightly enough to start working on it.
- Project Components — A production AI workflow is one that is genuinely in use by someone other than the developer.
- Project Scoping — Build the evaluation set at the start of the engagement, before writing production code, standing up the integration, or…
- Project Scoping Essentials — A proposed AI project should move past scoping only if the problem is among the customer's top five priorities.
- Projection onto a Span — Non-invertibility can arise when training instances do not span the entire space of R^d.
- Prompt Design for Contract Review — The contract review system was developed iteratively, starting from a small prototype that was shown in a demo and then reshaped…
- Prompting Strategies for Large Language Models — GPT-like LLMs are primarily built for text completion, and that ability carries over to other tasks.
- Proof Coverage and Topic Scope — The supplied material describes a 14-week graduate introduction course.
- Prototyping Against Synthetic Data — The Scoping Phase is the first phase of a project and lasts a few days.
- Public and Private Access in Java Classes — A static method is called from another class by writing the class name, a dot, and the method name: ClassName.methodName();
- Python 2 versus 3 — The distinction between Python version 2 and version 3, requiring users to be aware of which version they are utilizing.
- Python Classes and Methods — A custom Dataset class in PyTorch is built by subclassing the Dataset parent class and implementing __init__, __getitem__, and…
- Python Data Types and Expressions — Start the Python interpreter by typing 'python' in a terminal; Python will display version information and a >>> prompt.
- Python Design Philosophy and PEP 20 — Pythonic means doing something the Python way, combining both engineering and artistic principles in your code.
- Python Execution Process — An internal process where Python converts source code into an intermediate bytecode form and then translates it into the…
- Python File I/O and Reading Files — A grep simulator reads a file line by line, tests each line against a user-supplied regular expression, and counts how many…
- Python File Structure — A package is a folder containing Python modules and a special __init__.py file that marks it as a package.
- Python Fundamentals for Deep Learning — The main practical prerequisite is reasonable Python proficiency for using Keras.
- Python Installation on Windows — The process of downloading and installing the latest version of Python on a Windows-based system.
- Python Modules and Packages — A module lets a programmer reuse a set of functions and variables across multiple programs, instead of redefining them in every…
- Python SQLite3 Module Basics — The INSERT OR IGNORE and SELECT pattern solves the foreign key dependency problem by inserting a record and immediately…
- Python Standard Library — A large collection of modules available wherever Python is installed.
- Python Syntax Basics — Python is designed to have an unusually simple, easy-to-read syntax that lets a learner focus on solving the problem rather than…
- Python Tuples and Unpacking — A text parser reads a file, cleans each line by removing punctuation and normalizing case, splits it into words, and counts…
- Python Variable Naming Rules and Conventions — Mnemonic variable names are memory aids chosen to reflect the programmer's intent about what data each variable stores.
- Python's re Module: search() and findall() — grep stands for Generalized Regular Expression Parser. It is a command-line program built into Unix, Linux, and macOS systems…
- Python's Reserved Words and Syntax — The print function is Python's way of displaying messages on the screen—it is how your code speaks to the user.
- Python's Vocabulary: Reserved Words and Your First Sentence — Python code you write in the course editor is read by a Python interpreter, which executes your instructions and displays output…