Program: /* Q5.Scan edges from user for an undirected graph.Create adjacency list.Perform nonrecursive DFS to check if grap...
Read More
7 Program to Create Threaded Binary Tree and Perform Delete Operation
Program: /*Q4.WAP to implement TBT with following functions. -create() recursive -delete() recursive */ #include <iostre...
Read More
6 Program to Check Graph contain Cycle or Not
Program: /* Q3.Scan adj matrix for a directed graph.Check if graph is cyclic or not. */ #include<iostream> using nam...
Read More
6 Program to Create Threaded Binary Tree and Perform Inorder, Preorder and Postorder Traversal
TBT Structure: Program: /* Q3.WAP to implement TBT with following functions. -create() -preorder() -postorder() -preo...
Read More
5 Program to Check if there is a path between any 2 vertices of Graph.
Program: /* Q5.Create an adj matrix for directed graph.Check if there is a path between any 2 vertices of graph. */ #includ...
Read More
5 Program to Create Simple Binary Tree. Find leaf node of any node, Height of any node and Delete a Node from Tree.
Program: /* Simple Binary Tree -create() -recursive inorder() -nonrecursive preorder -search data -find leaf node of any No...
Read More
4 Program to Print Number of Components in a given Graph.
Program: /* Q4-Create adj list from adj matrix.Check if graph is connected or not. Print number of components. */ #include...
Read More
4 Program to Create Non-Recursive Binary Search Tree and Non-Recursive Postorder Traversal and findmin function
Program: #include<iostream> #include<string.h> #define MAX 100 using namespace std; class Node { public: in...
Read More
3 Program to Perform Recursive DFS (Depth First Search) on Graph
DFS (Depth First Search): Program: /* Q3-Scan adj matrix of a graph from user.Perform DFS on it. */ #include<iostream>...
Read More
3 Program to Create Binary Search Tree, Count Nodes with Degree 0, 1, 2 and delete node recursively.
Program: /* 1. Create BST of integers and implement following functions. -create() until user enters "STOP" -ins...
Read More
2 Program to Check if Given Graph is Connected or Not.
Program: /* Q2-Scan edges from user.Create adj list.Check if given graph is connected or not. */ #include<iostream> u...
Read More
2 Program to Create Simple Binary Tree and Perform Non-Recursive Traversal (Inorder, Preorder and Postorder)
Program: /* Q1.WAP to create a simple binary tree and implement following functions. -create() (using 0 as a terminating val...
Read More
1 Program to Scan adjacency matrix from user. Create an Adjacency List from it. Check the possibilities of directed, undirected, weighted, non-weighted.
Program: /* Q1-Scan adj matrix from user.Create an adjacency list from it. Check the possibilities of directed,undirected,we...
Read More
1 - Program to Create a Simple Binary Tree and Perform Recursive Traversal With Search and Count Function
Program: /* Q1.WAP to create a simple binary tree and implement following functions. -create() (using 0 as a terminating val...
Read More
28 Program for Disk Scheduling Algorithm (CLOOK, SSTF, SCAN) in C
Program: #include <stdio.h> #include<stdlib.h> // Function to Sort Array void sort(int arr[],int n){ for(...
Read More
26 Program for Inter-Process Communication using shared memory
Basic Working of Shared Memory: The sender sends the data and the receiver receives the data, by applying the following steps: Sender: 1) Cr...
Read More
27 Program for Inter-Process Communication using message passing mkfifo
Working of Message Passing: The Sender Process: can use write() system call to write data into the pipe. The Receiver Process: can use read(...
Read More
25 Program for Optimal Page Replacement Algorithm
Program: #include<stdio.h> #include<limits.h> // This function is just use to check if the frame is containg ...
Read More
23 Program for First in First Out (FIFO) Page Replacement Algorithm
Program: #include<stdio.h> #include<limits.h> // This function is just use to check if the frame is containg ...
Read More
Subscribe to:
Posts (Atom)
