Skip to main content

DATA STRUCTURES

Search This Blog

on May 26, 2021

Get link
Facebook
X
Pinterest
Email
Other Apps

Good morning All,

Finally I am having My Blog,,,

Here u will gets Things related to DATA STRUCTURE

Get link
Facebook
X
Pinterest
Email
Other Apps

Comments

Post a Comment

Popular Posts

Group A: (Assignment No:01) (SPPU Syllabus Assignment No:01)

SE -Computer (2019 PAT) Group A: (Assignment No:01) (SPPU Syllabus Assignment No:01) Problem Statement: Consider telephone book database of N clients. Make use of a hash table implementation to quickly look up client‘s telephone Number. Make Use of two Collision Techniques and Compare them using number of Comparisons required to find a set of telephone numbers. --------------------------------------------------------------------- Program implementation using Python 1. Python program File Name LinearProbing.py ----------------------------------------------------------------------- # Program to implement Hashing with Linear Probing from Record import Record class hashTable: # initialize hash Table def __init__(self): self.size = int(input("Enter the Size of the hash table : ")) # initialize table with all elements 0 self.table = l...

Group B Assignment 6 : BST Operations Program

BST Operations Program Beginning with an empty binary search tree, Construct binary search tree by inserting the values in the order given. After constructing a binary tree - i. Insert new node, ii. Find number of nodes in longest path from root, iii. Minimum data value found in the tree, iv. Change a tree so that the roles of the left and right pointers are swapped at every node, v. Search a value // Program #include<iostream> using namespace std; struct node { int data; node *left,*right; }; class BST { public: node *root; BST() { root=NULL; } node *create_BST(); node * insert(node *, int); void display(node *); node * findmin(node *); node * findmax(node *); node * find(node *, int ); int height(node *); }; node * BST::create_BST() { int n, i, x; cout<<"Enter total number of nodes : "; cin>>n; for(i=0;i<n;i++) { cout<<"Enter Data : "; cin>>x; root=in...

Group D Assignment 18 : OBST Program

Problem Statement : Given sequence k = k1 <k2 < … <kn of n sorted keys, with a search probability pi for each key ki . Build the Binary search tree that has the least search cost given the access probability for each key? Program : #include<iostream> using namespace std; #define MAX 10 int find(int,int); void print(int,int); int p[MAX],q[MAX],w[10][10],c[10][10],r[10][10],i,j,k,n,m; char idnt[7][10]; int main() { cout<<"enter a number of identifiers : "; cin>>n; cout<<"enter idntifiers : "; for(i=1;i<=n;i++) cin>>idnt[i]; cout<<"enter success probability for identifiers : "; for(i=1;i<=n;i++) cin>>p[i]; cout<<"enter failure probability for identifiers : "; for(i=0;i<=n;i++) cin>>q[i]; cout<<"\n Weight Cost Root \n"; for(i=0;i<=n;i++) { w[i...

Powered by Blogger