Probability & Statistics (PCCAIML 501)

The basic building blocks of an operating system, these routines provide access to system resources like memory, files, and peripherals.

A way to run multiple programs or tasks concurrently on a single processor. It gives the illusion of multitasking by quickly switching between different processes.

A fundamental principle of operating systems that prevents multiple processes from interfering with each other's critical data. It ensures that shared data is accessed and modified in a controlled manner.

A classic problem used to illustrate the complexities of inter-process communication, where multiple philosophers try to eat from bowls of noodles but need to share chopsticks to do so.

A common approach to handling concurrent access to shared resources. It provides a mechanism to protect critical sections and ensure that only one process can enter at a time.

A type of operating system structure where components are organized in layers, with each layer building upon the one below. This modular approach promotes maintainability and code reuse.

A mechanism that allows a single process to appear as multiple independent processes. It helps improve efficiency by utilizing the CPU more effectively.

The various states a process can be in, including running, waiting, ready, and terminated. Transitions between these states are governed by the operating system.

Represents a collection of data elements in a logical and structured manner, allowing for efficient manipulation and access.

The ability to hide implementation details of an object, exposing only essential functionalities.

The ability of an object to take on multiple forms or behaviors based on the context.

The mechanism for creating new classes based on existing ones, inheriting properties and methods.

Reusable solutions to common design problems, promoting code reusability and consistency.

The capacity for an object to be uniquely identified, even if its state might be the same as another object.

A function that governs the state of an object, ensuring it remains valid within its defined constraints.

A function that maps an object's abstract representation to its concrete implementation.

A structured way of organizing and representing information, with a focus on relationships between elements. It includes components, boundaries, and interactions within a system.

A set of actions designed to achieve a specific goal, usually involving planning, organizing, leading, and controlling resources.

The functions of management include setting goals, analyzing situations, making decisions, implementing plans, and monitoring progress.

Bagging (Bootstrap Aggregating) is a machine learning technique that combines multiple decision trees to improve prediction accuracy. It reduces variance and overfitting by averaging individual tree predictions.

An unsupervised learning algorithm used for grouping data points into clusters based on their similarities. It identifies 'natural patterns' in data by minimizing the distance between points within a cluster and maximizing the distance between clusters.

A hierarchical clustering method that builds a dendrogram by iteratively merging clusters based on their similarity. It uses a distance metric to determine the closeness of clusters.

A clustering technique specifically designed for categorical data. It uses the concept of frequency of categorical values to form clusters. K-Modes is similar to K-Means but for categorical variables.

A technique for discovering association rules (relationships) within data. It uses the FP-Growth algorithm to efficiently find frequent itemsets and their associated patterns.

A way of managing and delivering IT services, such as storage, computing power, and networking, over the internet instead of on physical hardware.

A collection of technologies and services that enable businesses to manage their cloud infrastructure effectively. It involves tasks like resource allocation, security, monitoring, and cost optimization.

A type of program architecture where services are broken down into smaller components that communicate with each other through messages. It allows for faster development and easier maintenance.

A platform that helps connect different services and applications within an SOA. It provides a central bus for messages and communication.

A type of cloud storage where data can be accessed and stored online, without the need for physical servers. It is typically managed by a third-party provider.

A type of storage where data is stored and managed physically within a data center, requiring human intervention for its maintenance.

A type of storage where data is stored and managed automatically by machines without human intervention. This allows for greater efficiency and scalability.

Email services that are hosted online and accessible from anywhere with an internet connection, such as Gmail, Hotmail, and Yahoo Mail.

Data that doesn't have numerical values, like categories or labels. Think of it like descriptive information.

A flowchart-like structure used to make decisions based on data. It helps predict an outcome by asking a series of yes/no questions.

Finding patterns and grouping similar data without any pre-defined labels. It's like sorting objects into piles based on their similarities.

A function that measures how good a cluster is based on how similar items within a cluster are. It's like a scorecard for cluster quality.

Popular algorithms used for unsupervised learning. K-means divides data into K clusters, while hierarchical methods create a tree-like structure of clusters.

The study of graphs (networks of nodes and edges) with applications in various fields like computer science, social networks, and logistics.

A sequence of nodes in a graph that visits each node exactly once, creating a closed loop.

Finding the shortest path between two points in a graph, like finding the most efficient route on a map.

The minimum number of colors needed to color the vertices of a graph so that no two adjacent vertices have the same color.

A complete subgraph within a larger graph.

A graph where every cycle has an edge connecting non-adjacent vertices within the cycle.

A graph coloring algorithm where each vertex is assigned the lowest available color, starting from an arbitrary vertex.

A theorem stating that the chromatic number of a graph is at most one more than the maximum degree of any vertex in the graph, except for complete graphs and odd cycles.

An assignment of colors to the edges of a graph so that no two adjacent edges have the same color.

A theorem stating that the chromatic index of a graph (minimum number of colors for edges) is either equal to the maximum degree of any vertex or one more than the maximum degree.

A graph where the maximum degree of any vertex is equal to the chromatic index (minimum number of colors for edges).