DAA_Lab

DAA Lab KIIT 5th semester.

Author: abhishekxgithub

LAB/DAA Sessional/sessional Insertionsort.cpp

@@ -0,0 +1,32 @@
+#include<iostream>
+using namespace std;
+void insertionSort(int arr[], int nElements)
+{
+    int p, key, q;
+    for (p = 1; p < nElements; p++)
+    {
+        key = arr[p];
+        q = p - 1;
+        while (q >= 0 && arr[q] > key)
+        {
+            arr[q + 1] = arr[q];
+            q = q - 1;
+        }
+        arr[q + 1] = key;
+    }
+}
+void printArray(int arr[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        cout << arr[i] << " ";
+    cout << endl;
+}
+int main()
+{
+    int arr[] = {5, 8, 9, 6, 7, 18, 15};
+    int n = sizeof(arr) / sizeof(arr[0]);
+    insertionSort(arr, n);
+    printArray(arr, n);
+    return 0;
+}

LAB/Lab1(14th July)/q1.c

@@ -0,0 +1,29 @@
+//WAP to find the smallest and largest element in an array take input from the user and generate random number.
+
+#include<stdio.h>
+
+int main()
+{
+int a[50],i,n,large,small;
+printf("\nEnter the number of elements :");
+scanf("%d",&n);
+printf("\nInput the array elements :");
+for(i=0;i<n;++i)
+scanf("%d",&a[i]);
+
+large=small=a[0];
+
+for(i=1;i<n;++i)
+{
+if(a[i]>large)
+large=a[i];
+
+if(a[i]<small)
+small=a[i];
+}
+
+printf("\nThe smallest element is %d\n",small);
+printf("\nThe largest element is %d\n",large);
+
+return 0;
+}

LAB/Lab1(14th July)/q1.cpp

@@ -0,0 +1,30 @@
+#include<bits/stdc++.h>
+#include<iostream>
+
+using namespace std;
+int main()
+{
+    int n;
+    cin>>n;
+    int arr[n];
+    for(int i=0;i<n;i++)
+    {
+        arr[i] = rand();
+    }
+    for(int i=0;i<n;i++)
+    {
+        cout<<arr[i]<<" ";   
+    }
+    cout<<endl;
+    int max=INT_MIN,min=INT_MAX;
+    for(int i=0;i<n;i++)
+    {
+        if(arr[i]>max)
+            max=arr[i];
+        if(arr[i]<min)
+            min=arr[i];   
+    }
+    cout<<"largest number"<<max<<endl;
+    cout<<"smallest number"<<min<<endl;
+
+}

LAB/Lab1(14th July)/q1random.cpp

@@ -0,0 +1,30 @@
+#include<bits/stdc++.h>
+#include<iostream>
+
+using namespace std;
+int main()
+{
+    int n;
+    cin>>n;
+    int arr[n];
+    for(int i=0;i<n;i++)
+    {
+        arr[i] = rand();
+    }
+    for(int i=0;i<n;i++)
+    {
+        cout<<arr[i]<<" ";   
+    }
+    cout<<endl;
+    int max=INT_MIN,min=INT_MAX;
+    for(int i=0;i<n;i++)
+    {
+        if(arr[i]>max)
+            max=arr[i];
+        if(arr[i]<min)
+            min=arr[i];   
+    }
+    cout<<"largest number"<<max<<endl;
+    cout<<"smallest number"<<min<<endl;
+
+}

LAB/Lab1(14th July)/q2.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+void swap1(int &x, int &y) {
+    int temp = x;
+    x = y;
+    y = temp;
+    
+}
+
+int main()
+{
+   int a, b, c;
+   cin>>a>>b>>c;
+   
+   swap1(a,c);
+   swap1(b,c);
+   cout<<a<<b<<c;
+   
+
+    return 0;
+}

LAB/Lab1(14th July)/q3.cpp

@@ -0,0 +1,23 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int n;
+    cin>>n;
+    int arr[n];
+    for(int i=0;i<n;i++)
+    {
+        cin>>arr[i];
+    }
+    int max=INT_MIN,min=INT_MAX;
+    for(int i=0;i<n;i++)
+    {
+        if(arr[i]>max)
+            max=arr[i];
+        if(arr[i]<min)
+            min=arr[i];   
+    }
+    cout<<"largest number"<<max<<endl;
+    cout<<"smallest number"<<min<<endl;
+
+}

LAB/Lab1(14th July)/q4.cpp

@@ -0,0 +1,57 @@
+using namespace std;
+
+int ss(vector<int>&arr, int n) {
+    int small = arr[0];
+    int ssmall = arr[1];
+    for(int i = 0;i<small;i++) {
+        if(arr[i] < small) {
+            ssmall = small;
+            small = arr[i];
+        }
+    }
+    
+    for(int i = 0; i<n;i++) {
+        if(arr[i] < ssmall && arr[i] != small) {
+            ssmall = arr[i];
+        }
+    }
+    
+    return ssmall;
+}
+
+// second largest
+
+int sl(vector<int>&arr, int n) {
+    int large = arr[0];
+    int slarge = arr[1];
+    for(int i = 0;i<n;i++) {
+        if(arr[i] > large) {
+            slarge = large;
+            large = arr[i];
+        }
+    }
+    
+    for(int i = 0; i<n;i++) {
+        if(arr[i] > slarge && arr[i] != large) {
+            slarge = arr[i];
+        }
+    }
+    
+    return slarge;
+}
+
+int main()
+{
+    int n;
+    cin>>n;
+    
+    vector<int>arr(n);
+    
+    for(int i = 0; i<n;i++) {
+        cin>>arr[i];
+    }
+    int secondm = ss(arr,n);
+    int secondl = sl(arr,n);
+    cout<<"second smallest is :"<<secondm<<" and second large : "<<secondl;
+ return 0;
+}

LAB/Lab10(9th Nov)/DFS BFS.txt

@@ -0,0 +1,69 @@
+// BFS DFS
+#include <bits/stdc++.h>
+using namespace std;
+vector<int> adj[8];
+DFS(int s, int V)
+{
+    vector<bool> visited(V, false);
+
+    stack<int> stack;
+    stack.push(s);
+
+    while (!stack.empty())
+    {
+        int s = stack.top();
+        stack.pop();
+        if (!visited[s])
+        {
+            cout << s << " ";
+            visited[s] = true;
+        }
+        for (auto i = adj[s].begin(); i != adj[s].end(); ++i)
+            if (!visited[*i])
+                stack.push(*i);
+    }
+}
+
+void BFS(int s, int V)
+{
+    vector<bool> visited;
+    visited.resize(V, false);
+    list<int> queue1;
+    visited[s] = true;
+    queue1.push_back(s);
+
+    while (!queue1.empty())
+    {
+        s = queue1.front();
+        cout << s << " ";
+        queue1.pop_front();
+        for (auto adjecent : adj[s])
+        {
+            if (!visited[adjecent])
+            {
+                visited[adjecent] = true;
+                queue1.push_back(adjecent);
+            }
+        }
+    }
+}
+void addEdge(int u, int v)
+{
+    adj[u].push_back(v);
+    adj[v].push_back(u);
+}
+
+int main()
+{
+    addEdge(0, 1);
+    addEdge(0, 2);
+    addEdge(1, 3);
+    addEdge(2, 3);
+
+    cout << "BFS= ";
+    BFS(0, 8);
+    cout << "\nDFS= ";
+    DFS(0, 8);
+
+    return 0;
+}