Prim Algorithm and kruskal algorithm
Download as ppt, pdf2 likes1,635 views
The document discusses minimum spanning trees and two algorithms for finding them: Prim's algorithm and Kruskal's algorithm. Prim's algorithm works by growing a spanning tree from an initial node, always adding the edge with the lowest weight that connects to a node not yet in the tree. Kruskal's algorithm sorts the edges by weight and builds up a spanning tree by adding edges in order as long as they do not form cycles. Both algorithms run on undirected, weighted graphs and produce optimal minimum spanning trees.
1 of 36
Downloaded 48 times
Ad
Recommended
Kruskal & Prim's Algorithm
Kruskal & Prim's AlgorithmIfad Rahman This presentation summarizes Kruskal's algorithm and Prim's algorithm for finding minimum spanning trees in graphs. Kruskal's algorithm works by selecting the shortest edge in a network that does not create a cycle, repeating until all vertices are connected. Prim's algorithm starts with any vertex and selects the shortest edge connected to vertices already in the tree, repeating until all vertices are connected. Both algorithms are demonstrated on a example network to connect five villages to a market town, finding the minimum total edge length of 18 using either algorithm by connecting edges of length 2, 3, 4, 4, and 5.
Prim's Algorithm on minimum spanning tree
Prim's Algorithm on minimum spanning treeoneous Prim's algorithm is used to find the minimum spanning tree of a connected, undirected graph. It works by continuously adding edges to a growing tree that connects vertices. The algorithm maintains two lists - a closed list of vertices already included in the minimum spanning tree, and a priority queue of open vertices. It starts with a single vertex in the closed list. Then it selects the lowest cost edge that connects an open vertex to a closed one, adds it to the tree and updates the lists. This process repeats until all vertices are in the closed list and connected by edges in the minimum spanning tree. The algorithm runs in O(E log V) time when using a binary heap priority queue.
Spanning trees & applications
Spanning trees & applicationsTech_MX This document discusses minimum spanning trees. It defines a minimum spanning tree as a spanning tree of a connected, undirected graph that has a minimum total cost among all spanning trees of that graph. The document provides properties of minimum spanning trees, including that they are acyclic, connect all vertices, and have n-1 edges for a graph with n vertices. Applications of minimum spanning trees mentioned include communication networks, power grids, and laying telephone wires to minimize total length.
prim's and kruskal's algorithm
prim's and kruskal's algorithmshreeuva Prim's algorithm finds a minimum spanning tree of a graph using a greedy approach. It treats the nodes as a single tree and adds new nodes from the graph one by one, choosing the connection with the lowest weight at each step. This grows the tree until all nodes are included. Kruskal's algorithm also uses greedy approach but treats the graph as separate trees that merge as it adds edges from lowest to highest weight while ensuring no cycles are formed.
Minimum spanning tree
Minimum spanning treeAmit Kumar Rathi The document discusses minimum spanning trees (MST) and two algorithms for finding them: Prim's algorithm and Kruskal's algorithm. It begins by defining an MST as a spanning tree (connected acyclic graph containing all vertices) with minimum total edge weight. Prim's algorithm grows a single tree by repeatedly adding the minimum weight edge connecting the growing tree to another vertex. Kruskal's algorithm grows a forest by repeatedly merging two components via the minimum weight edge connecting them. Both algorithms produce optimal MSTs by adding only "safe" edges that cannot be part of a cycle.
Prims and kruskal algorithms
Prims and kruskal algorithmsSaga Valsalan The document discusses minimum spanning trees (MST) and two algorithms for finding them: Prim's algorithm and Kruskal's algorithm. Prim's algorithm operates by building the MST one vertex at a time, starting from an arbitrary root vertex and at each step adding the cheapest connection to another vertex not yet included. Kruskal's algorithm finds the MST by sorting the edges by weight and sequentially adding edges that connect different components without creating cycles.
Kruskal Algorithm
Kruskal AlgorithmBhavik Vashi Kruskal's algorithm is a minimum spanning tree algorithm that finds the minimum cost collection of edges that connect all vertices in a connected, undirected graph. It works by sorting the edges by weight and then sequentially adding the shortest edge that does not create a cycle. The algorithm uses a disjoint set data structure to track connected components in the graph. It runs in O(ElogE) time, where E is the number of edges.
Kruskal's algorithm
Kruskal's algorithmRaj Kumar Ranabhat Kruskal's algorithm is used to find the minimum cost spanning tree in a connected weighted undirected graph. It operates by creating a disjoint set for each vertex, sorting the edges by weight, and iteratively adding edges that connect unconnected components until all vertices are connected. This method ensures that the resulting spanning tree has the minimum total weight.
A presentation on prim's and kruskal's algorithm
A presentation on prim's and kruskal's algorithmGaurav Kolekar The document discusses Prim's and Kruskal's algorithms for finding a minimum spanning tree (MST) in undirected graphs. It outlines the step-by-step processes for both algorithms, highlighting their greedy nature and optimal solutions. Additionally, it compares the two algorithms, noting that Prim's maintains a tree at all times while Kruskal's can form a forest.
Bellman ford algorithm
Bellman ford algorithmMdSajjadulislamBappi The Bellman-Ford algorithm, proposed by Richard Bellman and Lester Ford Jr., is designed to find the shortest paths in graphs that may contain negative edge weights. It can detect negative cycles, which can affect the existence of a shortest path, making it a valuable tool in various applications. The algorithm processes each edge iteratively to ensure accurate path cost calculations from a source to all other vertices.
Kruskal’s algorithm
Kruskal’s algorithmAbdul Moiz Lakhani The document presents a presentation on Kruskal's Algorithm, which is used to compute the minimal spanning tree (MST) of a weighted graph. It details Joseph Kruskal's contributions to mathematics and computer science, including the introduction of his algorithm. The process of using Kruskal's Algorithm involves selecting the smallest weight edges while avoiding the formation of circuits until the MST is completed.
Floyd warshall algorithm
Floyd warshall algorithmA. S. M. Shafi The Floyd-Warshall algorithm finds the shortest paths between all pairs of vertices in a weighted graph. It can handle both directed and undirected graphs, except those with negative cycles. The algorithm works by iteratively updating a distance matrix to track the shortest distances between all pairs as it considers paths that pass through intermediate vertices. It runs in O(n3) time, where n is the number of vertices.
Approximation Algorithms
Approximation AlgorithmsNicolas Bettenburg The document discusses approximation algorithms for NP-complete problems. It introduces the idea of finding near-optimal solutions in polynomial time for problems where optimal solutions cannot be found efficiently. It provides examples of the vertex cover problem and set cover problem, describing greedy approximation algorithms that provide performance guarantees for finding near-optimal solutions for these problems. The document also discusses some open questions around whether these approximation ratios can be improved.
Kruskal’s Algorithm
Kruskal’s AlgorithmSyed Maniruzzaman Pabel This document traces Kruskal's algorithm to find the minimum-cost spanning tree of an undirected weighted graph. It shows the graph with 8 vertices and 12 edges having different weights. It then sorts the edges in ascending order of their weights and applies Kruskal's algorithm by choosing edges without cycles until all vertices are included. The algorithm results in a minimum-cost spanning tree with a total weight of 40.
PRIM'S ALGORITHM
PRIM'S ALGORITHMgarishma bhatia Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. It was developed in 1930 by Czech mathematician Vojtěch Jarník but later rediscovered and published by computer scientists Robert C. Prim in 1957 and Edsger W. Dijkstra in 1959. The algorithm finds the minimum spanning tree by building it one edge at a time, each time choosing the next edge that connects an isolated vertex to a partially constructed minimum spanning tree.
Shortest Path in Graph
Shortest Path in GraphDr Sandeep Kumar Poonia The document discusses algorithms for finding shortest paths in graphs. It describes Dijkstra's algorithm and Bellman-Ford algorithm for solving the single-source shortest paths problem and Floyd-Warshall algorithm for solving the all-pairs shortest paths problem. Dijkstra's algorithm uses a priority queue to efficiently find shortest paths from a single source node to all others, assuming non-negative edge weights. Bellman-Ford handles graphs with negative edge weights but is slower. Floyd-Warshall finds shortest paths between all pairs of nodes in a graph.
PRIM’S AND KRUSKAL’S ALGORITHM
PRIM’S AND KRUSKAL’S ALGORITHMJaydeepDesai10 Prim's and Kruskal's algorithms are greedy algorithms used to find minimum spanning trees in graphs. Prim's algorithm builds the spanning tree by repeatedly adding the shortest edge that connects to the current tree. Kruskal's algorithm builds the tree by repeatedly adding the shortest edge that does not create a cycle. Both algorithms are used for applications like network design, cluster analysis, and map routing. The key difference is that Prim's starts from a node while Kruskal's starts from the minimum edge, making Prim's faster for dense graphs and Kruskal's faster for sparse graphs.
Prim's algorithm
Prim's algorithmPankaj Thakur The document is a presentation on Prim's algorithm, which is a greedy algorithm used to find the minimum spanning tree (MST) of a weighted undirected graph. It covers key concepts such as spanning trees, minimum spanning tree problems, and details of the algorithm's steps, initialization, and complexity analysis. Additionally, it discusses applications and recent research related to Prim's algorithm.
DAA-Floyd Warshall Algorithm.pptx
DAA-Floyd Warshall Algorithm.pptxArbabMaalik The Floyd-Warshall algorithm finds the shortest paths between all pairs of vertices in a weighted graph. It works by computing the shortest path between every pair of vertices through dynamic programming. The algorithm proceeds in steps, where in each step it considers all vertices as potential intermediate vertices to find even shorter paths between vertex pairs. This is done by comparing the newly computed shortest paths to the values stored in the previous matrix.
minimum spanning tree
minimum spanning tree Melaku Bayih Demessie - A minimum spanning tree (MST) connects all nodes in a graph with the minimum total edge weight while avoiding cycles.
- There are different algorithms that can find an MST, such as Kruskal's algorithm and Prim's algorithm, which were introduced in the document.
- Kruskal's algorithm works by sorting the edges by weight and building the MST by adding the shortest edges that do not create cycles. Prim's algorithm grows the MST from an initial node by always adding the shortest edge connected to the current MST.
Minimum spanning tree
Minimum spanning treeHinal Lunagariya The document discusses minimum spanning tree algorithms for finding low-cost connections between nodes in a graph. It describes Kruskal's algorithm and Prim's algorithm, both greedy approaches. Kruskal's algorithm works by sorting edges by weight and sequentially adding edges that do not create cycles. Prim's algorithm starts from one node and sequentially connects the closest available node. Both algorithms run in O(ElogV) time, where E is the number of edges and V is the number of vertices. The document provides examples to illustrate the application of the algorithms.
Dijkstra's algorithm presentation
Dijkstra's algorithm presentationSubid Biswas Dijkstra's algorithm is a method for finding the shortest paths from a single source vertex to all other vertices in a weighted graph with nonnegative edge weights. It operates using a greedy approach, efficiently calculating paths through priority queues while having a time complexity of O(E log V) and space complexity of O(V). Applications include digital mapping services, social networking connections, IP routing, and robotic navigation.
Prims & kruskal algorithms
Prims & kruskal algorithmsAyesha Tahir The document discusses algorithms for finding the minimum spanning tree of a graph. It begins by defining what a spanning tree is - a subset of edges that connects all vertices using the fewest possible edges. It then explains Kruskal's and Prim's algorithms for finding the minimum spanning tree, which is the spanning tree with the lowest total edge weight. Kruskal's algorithm sorts the edges by weight and builds the tree by adding edges that do not create cycles. Prim's algorithm grows the tree from an initial vertex by always adding the lowest weight edge that connects to a new vertex. Pseudocode is provided for both algorithms.
B tree
B treeFatimah Alqadheeb This document provides an overview of B-trees, which are balanced search trees used to store large datasets efficiently on disk. It discusses the key properties of B-trees, including their height, minimum node size of t keys, and ability to reduce disk accesses. The basic operations of insertion and deletion are explained through examples, along with the process of splitting or merging nodes when they become too full or empty. B-trees allow searching in O(log n) time and are commonly used in databases and file systems to enable fast indexed retrieval of data.
Shortest path algorithm
Shortest path algorithmsana younas The document discusses several shortest path algorithms for graphs, including Dijkstra's algorithm, Bellman-Ford algorithm, and Floyd-Warshall algorithm. Dijkstra's algorithm finds the shortest path from a single source node to all other nodes in a graph with non-negative edge weights. Bellman-Ford can handle graphs with negative edge weights but is slower. Floyd-Warshall can find shortest paths in a graph between all pairs of nodes.
Bellman ford Algorithm
Bellman ford Algorithmtaimurkhan803 The document describes the Bellman-Ford algorithm for finding the shortest paths in a graph. It begins by defining the shortest path problem and describing applications that can be modeled as shortest path problems, such as network routing. It then explains that Bellman-Ford can find single-source shortest paths in graphs with positive or negative edge weights, unlike Dijkstra's algorithm which only works for positive edges. The core of the algorithm uses relaxation to iteratively update the shortest path estimates over multiple rounds until convergence. Pseudocode is provided to demonstrate how the relaxation process is repeated for all edges |V|-1 times to find a shortest path from the source node to all other nodes.
Biconnected components (13024116056)
Biconnected components (13024116056)Akshay soni This document discusses bi-connected components in graphs. It defines an articulation point as a vertex in a connected graph whose removal would disconnect the graph. A bi-connected component is a maximal subgraph that contains no articulation points. The document presents algorithms for identifying articulation points and bi-connected components in a graph using depth-first search (DFS). It introduces the concepts of tree edges, back edges, forward edges and cross edges in a DFS tree and explains how to use these edge types to determine if a vertex is an articulation point based on the minimum discovery time of its descendant vertices.
Kruskal Algorithm
Kruskal AlgorithmSnehasis Panigrahi The Kruskal algorithm is used to find the minimum spanning tree (MST) of a connected undirected weighted graph. It works by sorting the edges in non-decreasing order of their weight, and then selecting edges one by one if they do not form a cycle with the previously selected edges. The algorithm is applied on the given graph, sorting its edges by weight and sequentially selecting edges that do not form cycles. This results in a MST with total weight of 38.
Tiny os
Tiny osAcad The document provides an overview of TinyOS, an open source operating system designed for wireless sensor networks. It discusses TinyOS' architecture, component model, programming using NesC, and key characteristics. TinyOS uses an event-driven model with non-blocking calls and no process scheduling. It has a small memory footprint and aims to minimize power consumption. The document also provides examples of TinyOS applications and components.
c and data structures first unit notes (jntuh syllabus)
c and data structures first unit notes (jntuh syllabus)Acad This document provides an overview of computer systems and components. It discusses the hardware and software aspects of computers, including input/output devices, the central processing unit, primary and auxiliary storage, and system and application software. It also describes different computing environments like personal, time-sharing, client-server, and distributed computing. The document outlines the evolution of computer languages from machine language to high-level languages. It discusses the steps to create and run computer programs, including writing, compiling, linking, and executing programs. Finally, it introduces the C programming language and provides a brief history of its development.
More Related Content
What's hot (20)
A presentation on prim's and kruskal's algorithm
A presentation on prim's and kruskal's algorithmGaurav Kolekar The document discusses Prim's and Kruskal's algorithms for finding a minimum spanning tree (MST) in undirected graphs. It outlines the step-by-step processes for both algorithms, highlighting their greedy nature and optimal solutions. Additionally, it compares the two algorithms, noting that Prim's maintains a tree at all times while Kruskal's can form a forest.
Bellman ford algorithm
Bellman ford algorithmMdSajjadulislamBappi The Bellman-Ford algorithm, proposed by Richard Bellman and Lester Ford Jr., is designed to find the shortest paths in graphs that may contain negative edge weights. It can detect negative cycles, which can affect the existence of a shortest path, making it a valuable tool in various applications. The algorithm processes each edge iteratively to ensure accurate path cost calculations from a source to all other vertices.
Kruskal’s algorithm
Kruskal’s algorithmAbdul Moiz Lakhani The document presents a presentation on Kruskal's Algorithm, which is used to compute the minimal spanning tree (MST) of a weighted graph. It details Joseph Kruskal's contributions to mathematics and computer science, including the introduction of his algorithm. The process of using Kruskal's Algorithm involves selecting the smallest weight edges while avoiding the formation of circuits until the MST is completed.
Floyd warshall algorithm
Floyd warshall algorithmA. S. M. Shafi The Floyd-Warshall algorithm finds the shortest paths between all pairs of vertices in a weighted graph. It can handle both directed and undirected graphs, except those with negative cycles. The algorithm works by iteratively updating a distance matrix to track the shortest distances between all pairs as it considers paths that pass through intermediate vertices. It runs in O(n3) time, where n is the number of vertices.
Approximation Algorithms
Approximation AlgorithmsNicolas Bettenburg The document discusses approximation algorithms for NP-complete problems. It introduces the idea of finding near-optimal solutions in polynomial time for problems where optimal solutions cannot be found efficiently. It provides examples of the vertex cover problem and set cover problem, describing greedy approximation algorithms that provide performance guarantees for finding near-optimal solutions for these problems. The document also discusses some open questions around whether these approximation ratios can be improved.
Kruskal’s Algorithm
Kruskal’s AlgorithmSyed Maniruzzaman Pabel This document traces Kruskal's algorithm to find the minimum-cost spanning tree of an undirected weighted graph. It shows the graph with 8 vertices and 12 edges having different weights. It then sorts the edges in ascending order of their weights and applies Kruskal's algorithm by choosing edges without cycles until all vertices are included. The algorithm results in a minimum-cost spanning tree with a total weight of 40.
PRIM'S ALGORITHM
PRIM'S ALGORITHMgarishma bhatia Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. It was developed in 1930 by Czech mathematician Vojtěch Jarník but later rediscovered and published by computer scientists Robert C. Prim in 1957 and Edsger W. Dijkstra in 1959. The algorithm finds the minimum spanning tree by building it one edge at a time, each time choosing the next edge that connects an isolated vertex to a partially constructed minimum spanning tree.
Shortest Path in Graph
Shortest Path in GraphDr Sandeep Kumar Poonia The document discusses algorithms for finding shortest paths in graphs. It describes Dijkstra's algorithm and Bellman-Ford algorithm for solving the single-source shortest paths problem and Floyd-Warshall algorithm for solving the all-pairs shortest paths problem. Dijkstra's algorithm uses a priority queue to efficiently find shortest paths from a single source node to all others, assuming non-negative edge weights. Bellman-Ford handles graphs with negative edge weights but is slower. Floyd-Warshall finds shortest paths between all pairs of nodes in a graph.
PRIM’S AND KRUSKAL’S ALGORITHM
PRIM’S AND KRUSKAL’S ALGORITHMJaydeepDesai10 Prim's and Kruskal's algorithms are greedy algorithms used to find minimum spanning trees in graphs. Prim's algorithm builds the spanning tree by repeatedly adding the shortest edge that connects to the current tree. Kruskal's algorithm builds the tree by repeatedly adding the shortest edge that does not create a cycle. Both algorithms are used for applications like network design, cluster analysis, and map routing. The key difference is that Prim's starts from a node while Kruskal's starts from the minimum edge, making Prim's faster for dense graphs and Kruskal's faster for sparse graphs.
Prim's algorithm
Prim's algorithmPankaj Thakur The document is a presentation on Prim's algorithm, which is a greedy algorithm used to find the minimum spanning tree (MST) of a weighted undirected graph. It covers key concepts such as spanning trees, minimum spanning tree problems, and details of the algorithm's steps, initialization, and complexity analysis. Additionally, it discusses applications and recent research related to Prim's algorithm.
DAA-Floyd Warshall Algorithm.pptx
DAA-Floyd Warshall Algorithm.pptxArbabMaalik The Floyd-Warshall algorithm finds the shortest paths between all pairs of vertices in a weighted graph. It works by computing the shortest path between every pair of vertices through dynamic programming. The algorithm proceeds in steps, where in each step it considers all vertices as potential intermediate vertices to find even shorter paths between vertex pairs. This is done by comparing the newly computed shortest paths to the values stored in the previous matrix.
minimum spanning tree
minimum spanning tree Melaku Bayih Demessie - A minimum spanning tree (MST) connects all nodes in a graph with the minimum total edge weight while avoiding cycles.
- There are different algorithms that can find an MST, such as Kruskal's algorithm and Prim's algorithm, which were introduced in the document.
- Kruskal's algorithm works by sorting the edges by weight and building the MST by adding the shortest edges that do not create cycles. Prim's algorithm grows the MST from an initial node by always adding the shortest edge connected to the current MST.
Minimum spanning tree
Minimum spanning treeHinal Lunagariya The document discusses minimum spanning tree algorithms for finding low-cost connections between nodes in a graph. It describes Kruskal's algorithm and Prim's algorithm, both greedy approaches. Kruskal's algorithm works by sorting edges by weight and sequentially adding edges that do not create cycles. Prim's algorithm starts from one node and sequentially connects the closest available node. Both algorithms run in O(ElogV) time, where E is the number of edges and V is the number of vertices. The document provides examples to illustrate the application of the algorithms.
Dijkstra's algorithm presentation
Dijkstra's algorithm presentationSubid Biswas Dijkstra's algorithm is a method for finding the shortest paths from a single source vertex to all other vertices in a weighted graph with nonnegative edge weights. It operates using a greedy approach, efficiently calculating paths through priority queues while having a time complexity of O(E log V) and space complexity of O(V). Applications include digital mapping services, social networking connections, IP routing, and robotic navigation.
Prims & kruskal algorithms
Prims & kruskal algorithmsAyesha Tahir The document discusses algorithms for finding the minimum spanning tree of a graph. It begins by defining what a spanning tree is - a subset of edges that connects all vertices using the fewest possible edges. It then explains Kruskal's and Prim's algorithms for finding the minimum spanning tree, which is the spanning tree with the lowest total edge weight. Kruskal's algorithm sorts the edges by weight and builds the tree by adding edges that do not create cycles. Prim's algorithm grows the tree from an initial vertex by always adding the lowest weight edge that connects to a new vertex. Pseudocode is provided for both algorithms.
B tree
B treeFatimah Alqadheeb This document provides an overview of B-trees, which are balanced search trees used to store large datasets efficiently on disk. It discusses the key properties of B-trees, including their height, minimum node size of t keys, and ability to reduce disk accesses. The basic operations of insertion and deletion are explained through examples, along with the process of splitting or merging nodes when they become too full or empty. B-trees allow searching in O(log n) time and are commonly used in databases and file systems to enable fast indexed retrieval of data.
Shortest path algorithm
Shortest path algorithmsana younas The document discusses several shortest path algorithms for graphs, including Dijkstra's algorithm, Bellman-Ford algorithm, and Floyd-Warshall algorithm. Dijkstra's algorithm finds the shortest path from a single source node to all other nodes in a graph with non-negative edge weights. Bellman-Ford can handle graphs with negative edge weights but is slower. Floyd-Warshall can find shortest paths in a graph between all pairs of nodes.
Bellman ford Algorithm
Bellman ford Algorithmtaimurkhan803 The document describes the Bellman-Ford algorithm for finding the shortest paths in a graph. It begins by defining the shortest path problem and describing applications that can be modeled as shortest path problems, such as network routing. It then explains that Bellman-Ford can find single-source shortest paths in graphs with positive or negative edge weights, unlike Dijkstra's algorithm which only works for positive edges. The core of the algorithm uses relaxation to iteratively update the shortest path estimates over multiple rounds until convergence. Pseudocode is provided to demonstrate how the relaxation process is repeated for all edges |V|-1 times to find a shortest path from the source node to all other nodes.
Biconnected components (13024116056)
Biconnected components (13024116056)Akshay soni This document discusses bi-connected components in graphs. It defines an articulation point as a vertex in a connected graph whose removal would disconnect the graph. A bi-connected component is a maximal subgraph that contains no articulation points. The document presents algorithms for identifying articulation points and bi-connected components in a graph using depth-first search (DFS). It introduces the concepts of tree edges, back edges, forward edges and cross edges in a DFS tree and explains how to use these edge types to determine if a vertex is an articulation point based on the minimum discovery time of its descendant vertices.
Kruskal Algorithm
Kruskal AlgorithmSnehasis Panigrahi The Kruskal algorithm is used to find the minimum spanning tree (MST) of a connected undirected weighted graph. It works by sorting the edges in non-decreasing order of their weight, and then selecting edges one by one if they do not form a cycle with the previously selected edges. The algorithm is applied on the given graph, sorting its edges by weight and sequentially selecting edges that do not form cycles. This results in a MST with total weight of 38.
Viewers also liked (12)
Tiny os
Tiny osAcad The document provides an overview of TinyOS, an open source operating system designed for wireless sensor networks. It discusses TinyOS' architecture, component model, programming using NesC, and key characteristics. TinyOS uses an event-driven model with non-blocking calls and no process scheduling. It has a small memory footprint and aims to minimize power consumption. The document also provides examples of TinyOS applications and components.
c and data structures first unit notes (jntuh syllabus)
c and data structures first unit notes (jntuh syllabus)Acad This document provides an overview of computer systems and components. It discusses the hardware and software aspects of computers, including input/output devices, the central processing unit, primary and auxiliary storage, and system and application software. It also describes different computing environments like personal, time-sharing, client-server, and distributed computing. The document outlines the evolution of computer languages from machine language to high-level languages. It discusses the steps to create and run computer programs, including writing, compiling, linking, and executing programs. Finally, it introduces the C programming language and provides a brief history of its development.
Structure and Typedef
Structure and TypedefAcad A structure is a collection of variables of different data types grouped together under a single name. A structure declaration defines the format of the structure, while a structure variable allocates memory for it. Structures allow grouping of related data and can be used within other structures or as elements of an array. Pointers to structures can be used to access member variables using the -> operator. Structures can be passed as arguments to functions to organize related data.
input output Organization
input output OrganizationAcad The document discusses input/output organization in computer systems. It describes peripheral devices like monitors, keyboards, printers, and storage devices that are connected to computers. It then explains the need for input/output interfaces to handle differences in signal values, timing, data formats, and operating modes between the CPU and peripherals. Common interface types include serial and parallel interfaces. The document outlines techniques for synchronous and asynchronous data transfer, including the use of handshaking protocols to ensure reliable communication between devices. It provides examples of specific interface chips like the 8251 serial interface adapter.
Cluster analysis
Cluster analysisAcad Cluster analysis is a technique used to group objects into clusters based on similarities. There are several major approaches to cluster analysis including partitioning methods, hierarchy methods, density-based methods, and grid-based methods. Partitioning methods construct partitions of the data objects into a set number of clusters by optimizing a chosen criterion, such as k-means and k-medoids clustering algorithms.
Memory Organization
Memory OrganizationAcad The document discusses different levels of computer memory hierarchy including main memory, cache memory, auxiliary memory, and virtual memory. Main memory uses RAM and ROM chips that are connected to the CPU through address and data buses. The address lines select the specific memory chip and byte location within that chip. Main memory is the highest level of memory that can be accessed directly by the CPU for storage of data and instructions currently in use.
pipeline and vector processing
pipeline and vector processingAcad This document discusses parallel processing techniques such as pipelining and vector processing to increase computational speed. It covers Flynn's classification of computer architectures, arithmetic pipelining using a floating-point adder as an example, instruction pipelining with a four-segment model, resolving data dependencies and branch difficulties in pipelines, and RISC pipeline examples addressing delayed load and branch issues. The key techniques discussed are decomposing operations into parallel suboperations, hardware interlocks, operand forwarding, and compiler assistance.
Classification and prediction
Classification and predictionAcad This document discusses classification and prediction. Classification predicts categorical class labels by classifying data based on a training set and class labels. Prediction models continuous values and predicts unknown values. Some applications are credit approval, marketing, medical diagnosis, and treatment analysis. Classification involves a learning step to describe classes and a classification step to classify new data. Prediction involves estimating accuracy by comparing test results to known labels. Issues with classification and prediction include data preparation, comparing methods, and decision tree induction algorithms.
Branch and bound
Branch and boundAcad Backtracking and branch and bound are algorithms for solving problems systematically by trying options in an orderly manner. Backtracking uses depth-first search and prunes subtrees that don't lead to solutions. Branch and bound uses breadth-first search and pruning, maintaining upper and lower bounds to eliminate options. Both aim to avoid exhaustive search by eliminating non-promising options early. Examples that can use these techniques include maze navigation, the eight queens problem, and Sudoku puzzles.
Union from C and Data Strutures
Union from C and Data StruturesAcad Union allows different data types to share the same memory location. It allocates enough memory to hold the largest member. While structures allocate separate memory for each member, unions share the same memory so only one member can be active at a time. For example, a union could hold an integer or float in the same memory space. Unions are useful for reducing memory usage but require careful use since writing to one member can overwrite another member's value.
Data retrieval in sensor networks
Data retrieval in sensor networksAcad This document provides an overview of wireless sensor networks (WSNs). It discusses the architecture of sensor networks, including sensor node hardware, operating systems, and network density considerations. It also describes several layers of the WSN protocol stack, including the MAC layer and common MAC protocols like S-MAC. Key topics covered include query-based communication in WSNs, classifications of WSNs based on functionality, and energy-efficient operation through low-duty cycling.
Association rule mining
Association rule miningAcad This document discusses association rule mining. Association rule mining finds frequent patterns, associations, correlations, or causal structures among items in transaction databases. The Apriori algorithm is commonly used to find frequent itemsets and generate association rules. It works by iteratively joining frequent itemsets from the previous pass to generate candidates, and then pruning the candidates that have infrequent subsets. Various techniques can improve the efficiency of Apriori, such as hashing to count itemsets and pruning transactions that don't contain frequent itemsets. Alternative approaches like FP-growth compress the database into a tree structure to avoid costly scans and candidate generation. The document also discusses mining multilevel, multidimensional, and quantitative association rules.
Ad
Similar to Prim Algorithm and kruskal algorithm (20)
19 primkruskal
19 primkruskalfika sweety The document discusses two algorithms for finding minimum spanning trees: Prim's algorithm and Kruskal's algorithm. Prim's algorithm is similar to Dijkstra's algorithm for finding shortest paths. It works by gradually adding the closest vertex to the growing spanning tree. Kruskal's algorithm focuses on edges rather than vertices. It sorts the edges by weight and builds the spanning tree by adding the lowest weight edges that do not create cycles. Both algorithms find optimal minimum spanning trees for weighted and unweighted graphs.
2.4 mst prim &kruskal demo
2.4 mst prim &kruskal demoKrish_ver2 The document discusses minimum spanning trees and two algorithms for finding them: Prim's algorithm and Kruskal's algorithm. Prim's algorithm works by growing a spanning tree from an initial node, always adding the lowest cost edge that connects to a node not yet in the tree. Kruskal's algorithm sorts the edges by cost and builds up a spanning tree by adding edges in order as long as they do not form cycles. Both algorithms find optimal minimum spanning trees for weighted, undirected graphs.
19 prim,kruskal alg. in data structure
19 prim,kruskal alg. in data structureEMEY GUJJAR Both Prim's and Kruskal's algorithms can be used to find the minimum spanning tree (MST) of a weighted, undirected graph. Prim's algorithm grows the MST from an initial node by repeatedly adding the lowest-cost edge that connects to the MST. Kruskal's algorithm sorts the edges by weight and builds the MST by adding edges in order as long as they do not form cycles.
prims and Kruskal 1.pdf
prims and Kruskal 1.pdfDEEPAK948083 The document discusses algorithms for finding minimum spanning trees in graphs. It describes Kruskal's and Prim's algorithms. Kruskal's algorithm works by sorting the edges by weight and building the spanning tree by adding the shortest edges that do not create cycles. Prim's algorithm works by growing a spanning tree from an initial node by repeatedly adding the shortest edge connecting an already included node to an unincluded node. The document provides pseudocode and a walkthrough example of Kruskal's algorithm and Prim's algorithm.
Farhana shaikh webinar_spanning tree
Farhana shaikh webinar_spanning treeFarhana Shaikh The document discusses spanning trees and minimum spanning trees. It introduces Prim's algorithm and Kruskal's algorithm for finding minimum spanning trees in weighted graphs. Prim's algorithm builds the minimum spanning tree incrementally by adding edges connected to the partial tree, while Kruskal's algorithm sorts the edges by weight and adds edges in order while avoiding cycles.
2.4 mst prim’s algorithm
2.4 mst prim’s algorithmKrish_ver2 The document discusses spanning trees and minimum spanning trees for graphs. A spanning tree is a minimal set of edges that connect all vertices of a connected, undirected graph without cycles. A minimum spanning tree is a spanning tree for a connected, undirected and weighted graph where the sum of the weights of the edges is minimized. Prim's algorithm is presented for finding a minimum spanning tree. The algorithm initializes the minimum spanning tree to be empty and selects the minimum weight edge connecting a vertex in the tree to one not in the tree, adding it to the tree iteratively until all vertices are included. An example run-through of Prim's algorithm on a weighted graph is shown step-by-step.
lecture 23 algorithm design and analysis
lecture 23 algorithm design and analysisbluebirdrish666 The document discusses minimum spanning trees (MSTs) in the context of algorithms used to connect vertices in a weighted, undirected graph with the least total edge cost. It outlines Prim's and Kruskal's algorithms for finding MSTs, explaining their workings, properties, and applications. The lecture emphasizes the properties of MSTs, such as the cycle and cut properties, and their importance in practical problems like optimizing construction connections.
APznzaZLM_MVouyxM4cxHPJR5BC-TAxTWqhQJ2EywQQuXStxJTDoGkHdsKEQGd4Vo7BS3Q1npCOMV...
APznzaZLM_MVouyxM4cxHPJR5BC-TAxTWqhQJ2EywQQuXStxJTDoGkHdsKEQGd4Vo7BS3Q1npCOMV...KUSHDHIRRA2111026030 This document discusses algorithms for finding minimum spanning trees and shortest paths in graphs. It covers Prim's algorithm and Kruskal's algorithm for finding minimum spanning trees, and Dijkstra's algorithm for finding single-source shortest paths in graphs with non-negative edge weights. Examples are provided to illustrate how each algorithm works on sample graphs by progressively building up the minimum spanning tree or shortest path tree. Resources for further learning about data structures and algorithms are also listed.
Ram minimum spanning tree
Ram minimum spanning treeRama Prasath A The document discusses minimum spanning trees (MSTs) and algorithms for finding them. It defines an MST as a subgraph of an undirected weighted graph that spans all nodes, is connected, acyclic, and has the minimum total edge weight among all spanning trees. The document explains Prim's and Kruskal's algorithms for finding MSTs and provides examples of how they work on sample graphs. It also discusses properties of MSTs such as that multiple MSTs may exist for a given graph.
Data Structures and Algorithm - Week 8 - Minimum Spanning Trees
Data Structures and Algorithm - Week 8 - Minimum Spanning TreesFerdin Joe John Joseph PhD The document discusses minimum spanning trees and provides examples of Prim's and Kruskal's algorithms. It includes:
- A definition of minimum spanning tree as a subgraph that spans all nodes with minimum total edge weight.
- Characteristics of Prim's and Kruskal's algorithms such as working with undirected, weighted/unweighted graphs and producing optimal solutions greedily.
- A walk-through example of Prim's algorithm on a graph and calculating the minimum spanning tree cost.
Greedy Approach in Design Analysis and Algorithms
Greedy Approach in Design Analysis and AlgorithmsNikunjGoyal20 The document explains greedy algorithms and their application to optimization problems, focusing on minimum spanning trees (MST). It describes two key greedy algorithms—Kruskal's and Prim's—that are used to find MSTs in undirected weighted graphs. The document includes definitions, examples, and the time complexities associated with both algorithms.
OTP, Phishing, QR code, Shares, Visual Cryptography.
OTP, Phishing, QR code, Shares, Visual Cryptography.IJERA Editor The document surveys classical and recent algorithms for finding minimum spanning trees (MST) in weighted graphs, including Kruskal's, Prim's, and Boruvka's algorithms. It discusses the applications, objectives, advantages, and disadvantages of these algorithms, along with newer approaches that enhance classical methods. The findings highlight the importance of MST in various fields such as communication networks and optimization problems, while also presenting complexities associated with different algorithms.
Unit 5 session 2 MinimumSpanningTrees.ppt
Unit 5 session 2 MinimumSpanningTrees.pptprithivr1 The document discusses minimum spanning trees (MST), defining them as spanning trees that minimize the total edge weights in connected graphs. It outlines algorithms for finding MSTs, including Prim's algorithm, which uses greedy strategies to incrementally build the tree by selecting the lightest edges. The document concludes by touching upon practical applications of MSTs, such as optimizing connections in networks and infrastructure.
Greedy technique - Algorithm design techniques using data structures
Greedy technique - Algorithm design techniques using data structuresdivyammo Greedy technique - Algorithm design techniques using data structures
minimum spanning trees Algorithm
minimum spanning trees Algorithm sachin varun The document discusses minimum spanning trees (MSTs). It defines MSTs and provides examples of applications like wiring electronic circuits. It then describes two common algorithms for finding MSTs: Kruskal's algorithm and Prim's algorithm. Kruskal's algorithm finds MSTs by sorting edges by weight and adding edges that connect different components without creating cycles. Prim's algorithm grows an MST from a single vertex by always adding the lowest-weight edge connecting a vertex to the growing tree.
uva-201026072839.pptxvcvczcvzvcxbxcvbcxvbvcxbcx
uva-201026072839.pptxvcvczcvzvcxbxcvbcxvbvcxbcxavishekpradhan24 Prim's and Kruskal's algorithms are greedy methods for finding minimum spanning trees in graphs, with Prim's focusing on growing a tree from any vertex and Kruskal's treating the graph as a forest and connecting trees based on edge weights. Prim's algorithm has a time complexity of O(V^2) which can be improved to O(E + log V), while Kruskal's runs faster in sparse graphs with a complexity of O(E log V). The document also touches on the Bellman-Ford algorithm for detecting negative cycles in graphs and Dijkstra's algorithm for finding shortest paths in graphs with nonnegative edge weights.
DATA STRUCTURES & ALGORITHMS MINIMUM SPANNING TREE
DATA STRUCTURES & ALGORITHMS MINIMUM SPANNING TREEnguyenminhhuy2905 The document discusses minimum spanning trees (MST) and the various algorithms used to find them, such as Kruskal's and Prim's algorithms. It elaborates on the concept of spanning trees, their mathematical properties, applications in network design, clustering, and graph-related problems, along with implementation details in programming languages like C++ and Python. Additionally, it provides a step-by-step breakdown of the algorithms and their complexity.
2.4 mst kruskal’s
2.4 mst kruskal’s Krish_ver2 Kruskal's algorithm is used to find the minimum spanning tree of a connected, undirected graph. It works by sorting the edges by weight and building up the minimum spanning tree by adding edges one by one if they do not form cycles, until n-1 edges are added where n is the number of nodes. The algorithm takes as input a weighted, connected graph and outputs the minimum spanning forest by iteratively selecting the lowest cost edge that avoids cycles.
APznzaZLM_MVouyxM4cxHPJR5BC-TAxTWqhQJ2EywQQuXStxJTDoGkHdsKEQGd4Vo7BS3Q1npCOMV...
APznzaZLM_MVouyxM4cxHPJR5BC-TAxTWqhQJ2EywQQuXStxJTDoGkHdsKEQGd4Vo7BS3Q1npCOMV...KUSHDHIRRA2111026030
Ad
More from Acad (15)
routing alg.pptx
routing alg.pptxAcad The document discusses routing protocols at the network layer. It describes shortest path algorithms, distance vector routing, and link state routing. Distance vector routing can experience the count-to-infinity problem when a link fails. Link state routing avoids this by having each router share link state information to build a common view of the network topology.
Network Layer design Issues.pptx
Network Layer design Issues.pptxAcad The network layer provides two main services: connectionless and connection-oriented. Connectionless service routes packets independently through routers using destination addresses and routing tables. Connection-oriented service establishes a virtual circuit between source and destination, routing all related traffic along the pre-determined path. The document also discusses store-and-forward packet switching, where packets are stored until fully received before being forwarded, and services provided to the transport layer like uniform addressing.
Computer Science basics
Computer Science basics Acad The document contains 3 multiple choice questions about the OSI model: 1) OSI stands for Open System Interconnection, 2) The number of layers in the OSI reference model is 7, 3) The transport layer is responsible for process to process delivery in a general network model.
Union
UnionAcad Union allows different data types to share the same memory location. It allocates enough memory to hold the largest member data type. While structures allocate separate memory for each member, unions share the same memory location, allowing only one member to be active at a time. For example, a union can hold an integer or float or character in the same memory space. Unions are useful for saving memory but require careful use since writing to one member can overwrite another member's value.
Stacks
StacksAcad The document discusses stacks and queues as linear data structures. It defines a stack as a first-in last-out (LIFO) structure where elements are inserted and deleted from one end. Stacks are commonly used to handle function calls and parameters. The document also defines queues as first-in first-out (FIFO) structures where elements are inserted at the rear and deleted from the front. Examples of stack and queue applications are given. Implementation of stacks using arrays and pointers is described along with push and pop algorithms.
Str
StrAcad A structure is a collection of variables of different data types grouped under a single name. A structure is declared using the struct keyword followed by the structure tag name within curly braces. Variables within a structure are called members and can be accessed using the dot operator. Structures allow grouping of related data and can be used to represent complex data. Arrays of structures can also be defined to store multiple structures. Pointers to structures allow accessing members of a structure using pointer notation. User defined data types like enum and typedef allow defining custom data types in C.
Functions
FunctionsAcad Functions break problems into smaller, more manageable steps and allow code to be reused. A function header specifies the return type, name, and parameters. The body contains local variable declarations and statements that solve the problem, ending with a return. Parameters in the header communicate with code outside the function, while local variables are private and only used within the function.
File
FileAcad fgets() and fputs() are used for string input/output operations. fgets() reads a string from a file into a specified memory location, reading up to a maximum number of characters. fputs() writes a string to a specified file. getw() and putw() are used to read and write integers to files. Fscanf() and fprintf() handle formatted input/output, with fscanf() reading formatted data from a file according to a control string, similar to scanf() but taking a file pointer as the first argument.
Ds
DsAcad 1. A stack is a linear data structure that follows the LIFO (Last In First Out) principle, where the last item inserted is the first item removed. It allows insertion and removal of items from one end only.
2. Stacks have many applications including function calls, memory allocation, undo operations, and parsing expressions. They use push and pop operations to insert and remove items.
3. A queue is a linear data structure that follows the FIFO (First In First Out) principle, where the first item inserted is the first item removed. It allows insertion at one end (rear) and removal from the other (front). Queues are useful for scheduling processes.
Dma
DmaAcad 1. Dynamic memory allocation allows programs to allocate memory as needed during runtime rather than having fixed memory allocations. This is done using dynamic data structures and memory management techniques.
2. Key memory management functions like malloc(), calloc(), free(), and realloc() allow programs to allocate, initialize, free, and modify the size of memory blocks dynamically.
3. Memory is allocated from the heap, located between the program instructions/global variables in permanent storage and local variables on the stack. The size of the heap changes as programs execute due to dynamic memory allocation.
Botnet detection by Imitation method
Botnet detection by Imitation methodAcad This document summarizes research on detecting botnets. It discusses how botnets are networks of infected computers or "bots" controlled remotely by botmasters to perform malicious tasks like DDoS attacks. Botnets are increasingly using encryption like SSL to evade detection. The paper presents a technique to detect botnets based on the assumption that botnet domains have short lifespans. It involves monitoring network traffic, extracting attributes from packets, and using an artificial neural network to cluster data and identify suspicious bots. The experiments analyzed real network traffic using this method to detect botnets using SSL encryption.
Bot net detection by using ssl encryption
Bot net detection by using ssl encryptionAcad The document discusses botnet detection using SSL encryption. It begins with an abstract discussing how botnets spread through distributed denial of service attacks and control large numbers of computers. The authors propose checking SSL traffic and features to detect malicious connections. It then discusses how botnets use peer-to-peer networks and protocols like HTTP and IRC, making detection challenging. The document outlines a framework for detecting P2P botnets using host-based and network-based methods. It describes applying the Apriori algorithm to find frequent itemsets in network data to identify systems likely to be infected. In conclusion, the authors present a detection system that can identify malicious connections over SSL and propose a graphical tool to detect future infected systems through data mining.
An Aggregate Location Monitoring System Of Privacy Preserving In Authenticati...
An Aggregate Location Monitoring System Of Privacy Preserving In Authenticati...Acad The document presents a privacy-preserving location monitoring system for wireless sensor networks, which utilizes k-anonymity to protect personal location privacy while providing accurate monitoring services. Two algorithms are proposed: a resource-aware algorithm that minimizes communication costs and a quality-aware algorithm that enhances the accuracy of aggregate locations. Simulated experiments demonstrate that both algorithms effectively balance privacy protection with service quality, revealing the potential for secure location monitoring in various applications.
Literature survey on peer to peer botnets
Literature survey on peer to peer botnetsAcad This document summarizes a literature study on peer-to-peer botnets presented at the International Conference on Recent Innovations in Science, Engineering and Technology (ICRISET-18) on May 18-19, 2018. It discusses the evolution of botnets from centralized command and control structures to decentralized peer-to-peer architectures to avoid detection. The paper then reviews various approaches for detecting P2P botnets, including signature-based, traffic analysis, behavior analysis, graph analysis, and data mining techniques. It concludes that no single technique can effectively detect the evolving botnets and that a collaborative detection framework is needed, with future work developing a model to analyze current botnets and a generic detection framework.
multi processors
multi processorsAcad This document discusses multiple processor systems including multiprocessors, multicomputers, and distributed systems. It covers topics such as multiprocessor hardware architectures, operating systems, scheduling, synchronization, and communication in these systems. It also discusses distributed system middleware including document-based systems like the web, file system-based systems like AFS, shared object systems like CORBA and Globe, and coordination-based systems like Linda and Jini.
Recently uploaded (20)
Cadastral Maps
Cadastral MapsGoogle Preparation of cadastral maps based by Engineer Dungo Tizazu from Dire Dawa University
Call For Papers - 17th International Conference on Wireless & Mobile Networks...
Call For Papers - 17th International Conference on Wireless & Mobile Networks...hosseinihamid192023 17th International Conference on Wireless & Mobile Networks (WiMoNe 2025) will provide
an excellent international forum for sharing knowledge and results in theory, methodology and
applications of Wireless & Mobile computing Environment. Current information age is witnessing
a dramatic use of digital and electronic devices in the workplace and beyond. Wireless, Mobile
Networks & its applications had received a significant and sustained research interest in terms of
designing and deploying large scale and high performance computational applications in real life.
The aim of the conference is to provide a platform to the researchers and practitioners from both
academia as well as industry to meet and share cutting-edge development in the field.
Complete guidance book of Asp.Net Web API
Complete guidance book of Asp.Net Web APIShabista Imam Unlock the full potential of modern web development with the Complete Guidance Book of ASP.NET Web API—your all-in-one resource for mastering RESTful services using Microsoft’s powerful ASP.NET Core framework. This book takes you on a step-by-step journey from beginner to expert, covering everything from routing and controllers to security, performance optimization, and real-world architecture.
Machine Learning - Classification Algorithms
Machine Learning - Classification Algorithmsresming1 This covers traditional machine learning algorithms for classification. It includes Support vector machines, decision trees, Naive Bayes classifier , neural networks, etc.
It also discusses about model evaluation and selection. It discusses ID3 and C4.5 algorithms. It also describes k-nearest neighbor classifer.
May 2025: Top 10 Read Articles in Data Mining & Knowledge Management Process
May 2025: Top 10 Read Articles in Data Mining & Knowledge Management ProcessIJDKP Data mining and knowledge discovery in databases have been attracting a significant amount of research, industry, and media attention of late. There is an urgent need for a new generation of computational theories and tools to assist researchers in extracting useful information from the rapidly growing volumes of digital data.
This Journal provides a forum for researchers who address this issue and to present their work in a peer-reviewed open access forum. Authors are solicited to contribute to the Journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas, but are not limited to these topics only.
Introduction to Natural Language Processing - Stages in NLP Pipeline, Challen...
Introduction to Natural Language Processing - Stages in NLP Pipeline, Challen...resming1 Lecture delivered in 2021. This gives an introduction to Natural Language Processing. It describes the use cases of NLP in daily life. It discusses the stages in NLP Pipeline. It highlights the challenges involved covering the different levels of ambiguity that could arise. It also gives a brief note on the present scenario with the latest language models, tools and frameworks/libraries for NLP.
International Journal of Advanced Information Technology (IJAIT)
International Journal of Advanced Information Technology (IJAIT)ijait International journal of advanced Information technology (IJAIT) is a bi monthly open access peer-
reviewed journal, will act as a major forum for the presentation of innovative ideas, approaches,
developments, and research projects in the area advanced information technology applications and
services. It will also serve to facilitate the exchange of information between researchers and industry
professionals to discuss the latest issues and advancement in the area of advanced IT. Core areas of
advanced IT and multi-disciplinary and its applications will be covered during the conferences.
Rapid Prototyping for XR: Lecture 6 - AI for Prototyping and Research Directi...
Rapid Prototyping for XR: Lecture 6 - AI for Prototyping and Research Directi...Mark Billinghurst This is lecture 6 in the course on Rapid Prototyping for XR, taught on June 13th, 2025 by Mark Billinghurst. This lecture was about using AI for Prototyping and Research Directions.
Rapid Prototyping for XR: Lecture 5 - Cross Platform Development
Rapid Prototyping for XR: Lecture 5 - Cross Platform DevelopmentMark Billinghurst This is lecture 5 in the course about Rapid Prototyping for XR, taught by Mark Billinghurst. This lecture is about Cross Platform Development.
Deep Learning for Natural Language Processing_FDP on 16 June 2025 MITS.pptx
Deep Learning for Natural Language Processing_FDP on 16 June 2025 MITS.pptxresming1 This gives an introduction to how NLP has evolved from the time of World War II till this date through the advances in approaches, architectures and word representations. From rule based approaches, it advanced to statistical approaches. from traditional machine learning algorithms it advanced to deep neural network architectures. Deep neural architectures include recurrent neural networks, long short term memory, gated recurrent units, seq2seq models, encoder decoder models, transformer architecture, upto large language models and vision language models which are multimodal in nature.
Prim Algorithm and kruskal algorithm
- 1. Minimum Spanning Trees Text • Read Weiss, §9.5 Prim’s Algorithm • Weiss §9.5.1 • Similar to Dijkstra’s Algorithm Kruskal’s Algorithm • Weiss §9.5.2 • Focuses on edges, rather than nodes
- 2. Definition • A Minimum Spanning Tree (MST) is a subgraph of an undirected graph such that the subgraph spans (includes) all nodes, is connected, is acyclic, and has minimum total edge weight
- 3. Algorithm Characteristics • Both Prim’s and Kruskal’s Algorithms work with undirected graphs • Both work with weighted and unweighted graphs but are more interesting when edges are weighted • Both are greedy algorithms that produce optimal solutions
- 4. Prim’s Algorithm • Similar to Dijkstra’s Algorithm except that dv records edge weights, not path lengths
- 5. Walk-Through Initialize array K dv pv A F ∞ − B F ∞ − C F ∞ − D F ∞ − E F ∞ − F F ∞ − G F ∞ − H F ∞ − 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 2
- 6. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Start with any node, say D K dv pv A B C D T 0 − E F G H 2
- 7. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Update distances of adjacent, unselected nodes K dv pv A B C 3 D D T 0 − E 25 D F 18 D G 2 D H 2
- 8. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Select node with minimum distance K dv pv A B C 3 D D T 0 − E 25 D F 18 D G T 2 D H 2
- 9. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Update distances of adjacent, unselected nodes K dv pv A B C 3 D D T 0 − E 7 G F 18 D G T 2 D H 3 G 2
- 10. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Select node with minimum distance K dv pv A B C T 3 D D T 0 − E 7 G F 18 D G T 2 D H 3 G 2
- 11. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Update distances of adjacent, unselected nodes K dv pv A B 4 C C T 3 D D T 0 − E 7 G F 3 C G T 2 D H 3 G 2
- 12. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Select node with minimum distance K dv pv A B 4 C C T 3 D D T 0 − E 7 G F T 3 C G T 2 D H 3 G 2
- 13. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Update distances of adjacent, unselected nodes K dv pv A 10 F B 4 C C T 3 D D T 0 − E 2 F F T 3 C G T 2 D H 3 G 2
- 14. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Select node with minimum distance K dv pv A 10 F B 4 C C T 3 D D T 0 − E T 2 F F T 3 C G T 2 D H 3 G 2
- 15. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Update distances of adjacent, unselected nodes K dv pv A 10 F B 4 C C T 3 D D T 0 − E T 2 F F T 3 C G T 2 D H 3 G 2 Table entries unchanged
- 16. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Select node with minimum distance K dv pv A 10 F B 4 C C T 3 D D T 0 − E T 2 F F T 3 C G T 2 D H T 3 G 2
- 17. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Update distances of adjacent, unselected nodes K dv pv A 4 H B 4 C C T 3 D D T 0 − E T 2 F F T 3 C G T 2 D H T 3 G 2
- 18. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Select node with minimum distance K dv pv A T 4 H B 4 C C T 3 D D T 0 − E T 2 F F T 3 C G T 2 D H T 3 G 2
- 19. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Update distances of adjacent, unselected nodes K dv pv A T 4 H B 4 C C T 3 D D T 0 − E T 2 F F T 3 C G T 2 D H T 3 G 2 Table entries unchanged
- 20. 4 25 A H B F E D C G 7 2 10 18 3 4 3 7 8 9 3 10 Select node with minimum distance K dv pv A T 4 H B T 4 C C T 3 D D T 0 − E T 2 F F T 3 C G T 2 D H T 3 G 2
- 21. 4 A H B F E D C G 2 3 4 3 3 Cost of Minimum Spanning Tree = Σ dv = 21 K dv pv A T 4 H B T 4 C C T 3 D D T 0 − E T 2 F F T 3 C G T 2 D H T 3 G 2 Done
- 22. Kruskal’s Algorithm • Work with edges, rather than nodes • Two steps: – Sort edges by increasing edge weight – Select the first |V| – 1 edges that do not generate a cycle
- 23. Walk-Through Consider an undirected, weight graph 5 1 A H B F E D C G 3 2 4 6 3 4 3 4 8 4 3 10
- 24. Sort the edges by increasing edge weight edge dv (D,E) 1 (D,G) 2 (E,G) 3 (C,D) 3 (G,H) 3 (C,F) 3 (B,C) 4 5 1 A H B F E D C G 3 2 4 6 3 4 3 4 8 4 3 10 edge dv (B,E) 4 (B,F) 4 (B,H) 4 (A,H) 5 (D,F) 6 (A,B) 8 (A,F) 10
- 25. Select first |V|–1 edges which do not generate a cycle edge dv (D,E) 1 √ (D,G) 2 (E,G) 3 (C,D) 3 (G,H) 3 (C,F) 3 (B,C) 4 5 1 A H B F E D C G 3 2 4 6 3 4 3 4 8 4 3 10 edge dv (B,E) 4 (B,F) 4 (B,H) 4 (A,H) 5 (D,F) 6 (A,B) 8 (A,F) 10
- 26. Select first |V|–1 edges which do not generate a cycle edge dv (D,E) 1 √ (D,G) 2 √ (E,G) 3 (C,D) 3 (G,H) 3 (C,F) 3 (B,C) 4 5 1 A H B F E D C G 3 2 4 6 3 4 3 4 8 4 3 10 edge dv (B,E) 4 (B,F) 4 (B,H) 4 (A,H) 5 (D,F) 6 (A,B) 8 (A,F) 10
- 27. Select first |V|–1 edges which do not generate a cycle edge dv (D,E) 1 √ (D,G) 2 √ (E,G) 3 χ (C,D) 3 (G,H) 3 (C,F) 3 (B,C) 4 5 1 A H B F E D C G 3 2 4 6 3 4 3 4 8 4 3 10 edge dv (B,E) 4 (B,F) 4 (B,H) 4 (A,H) 5 (D,F) 6 (A,B) 8 (A,F) 10 Accepting edge (E,G) would create a cycle
- 28. Select first |V|–1 edges which do not generate a cycle edge dv (D,E) 1 √ (D,G) 2 √ (E,G) 3 χ (C,D) 3 √ (G,H) 3 (C,F) 3 (B,C) 4 5 1 A H B F E D C G 3 2 4 6 3 4 3 4 8 4 3 10 edge dv (B,E) 4 (B,F) 4 (B,H) 4 (A,H) 5 (D,F) 6 (A,B) 8 (A,F) 10
- 29. Select first |V|–1 edges which do not generate a cycle edge dv (D,E) 1 √ (D,G) 2 √ (E,G) 3 χ (C,D) 3 √ (G,H) 3 √ (C,F) 3 (B,C) 4 5 1 A H B F E D C G 3 2 4 6 3 4 3 4 8 4 3 10 edge dv (B,E) 4 (B,F) 4 (B,H) 4 (A,H) 5 (D,F) 6 (A,B) 8 (A,F) 10
- 30. Select first |V|–1 edges which do not generate a cycle edge dv (D,E) 1 √ (D,G) 2 √ (E,G) 3 χ (C,D) 3 √ (G,H) 3 √ (C,F) 3 √ (B,C) 4 5 1 A H B F E D C G 3 2 4 6 3 4 3 4 8 4 3 10 edge dv (B,E) 4 (B,F) 4 (B,H) 4 (A,H) 5 (D,F) 6 (A,B) 8 (A,F) 10
- 31. Select first |V|–1 edges which do not generate a cycle edge dv (D,E) 1 √ (D,G) 2 √ (E,G) 3 χ (C,D) 3 √ (G,H) 3 √ (C,F) 3 √ (B,C) 4 √ 5 1 A H B F E D C G 3 2 4 6 3 4 3 4 8 4 3 10 edge dv (B,E) 4 (B,F) 4 (B,H) 4 (A,H) 5 (D,F) 6 (A,B) 8 (A,F) 10
- 32. Select first |V|–1 edges which do not generate a cycle edge dv (D,E) 1 √ (D,G) 2 √ (E,G) 3 χ (C,D) 3 √ (G,H) 3 √ (C,F) 3 √ (B,C) 4 √ 5 1 A H B F E D C G 3 2 4 6 3 4 3 4 8 4 3 10 edge dv (B,E) 4 χ (B,F) 4 (B,H) 4 (A,H) 5 (D,F) 6 (A,B) 8 (A,F) 10
- 33. Select first |V|–1 edges which do not generate a cycle edge dv (D,E) 1 √ (D,G) 2 √ (E,G) 3 χ (C,D) 3 √ (G,H) 3 √ (C,F) 3 √ (B,C) 4 √ 5 1 A H B F E D C G 3 2 4 6 3 4 3 4 8 4 3 10 edge dv (B,E) 4 χ (B,F) 4 χ (B,H) 4 (A,H) 5 (D,F) 6 (A,B) 8 (A,F) 10
- 34. Select first |V|–1 edges which do not generate a cycle edge dv (D,E) 1 √ (D,G) 2 √ (E,G) 3 χ (C,D) 3 √ (G,H) 3 √ (C,F) 3 √ (B,C) 4 √ 5 1 A H B F E D C G 3 2 4 6 3 4 3 4 8 4 3 10 edge dv (B,E) 4 χ (B,F) 4 χ (B,H) 4 χ (A,H) 5 (D,F) 6 (A,B) 8 (A,F) 10
- 35. Select first |V|–1 edges which do not generate a cycle edge dv (D,E) 1 √ (D,G) 2 √ (E,G) 3 χ (C,D) 3 √ (G,H) 3 √ (C,F) 3 √ (B,C) 4 √ 5 1 A H B F E D C G 3 2 4 6 3 4 3 4 8 4 3 10 edge dv (B,E) 4 χ (B,F) 4 χ (B,H) 4 χ (A,H) 5 √ (D,F) 6 (A,B) 8 (A,F) 10
- 36. Select first |V|–1 edges which do not generate a cycle edge dv (D,E) 1 √ (D,G) 2 √ (E,G) 3 χ (C,D) 3 √ (G,H) 3 √ (C,F) 3 √ (B,C) 4 √ 5 1 A H B F E D C G 2 3 3 3 edge dv (B,E) 4 χ (B,F) 4 χ (B,H) 4 χ (A,H) 5 √ (D,F) 6 (A,B) 8 (A,F) 10 Done Total Cost = Σ dv = 21 4 }not considered