11 may (assigment 1(shivraj singh(jiet_cstt_batch_3))

Author: shiv12-svg

assigment 1 (11 may 2020)/Ques1 (1).cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+using namespace std;
+
+int findSingle(int ar[], int ar_size)
+	{
+		int res = ar[0];
+		for (int i = 1; i < ar_size; i++)
+			res = res ^ ar[i];
+		
+		return res;
+	}
+
+int main()
+	{
+		int ar[] = {2, 3, 5, 4, 5, 3, 4};
+		int n = sizeof(ar) / sizeof(ar[0]);
+		cout << "element occuring once is "
+			 << findSingle(ar , n);
+		return 0;
+	}
+	
+// output is : element occuring once is 2

assigment 1 (11 may 2020)/Ques1 (1).exe

@@ -0,0 +1,19 @@
+#include <iostream> 
+using namespace std; 
+  
+int numberOfPaths(int m, int n) 
+{  
+    if (m == 1 || n == 1) 
+        return 1; 
+  
+    return numberOfPaths(m - 1, n) + numberOfPaths(m, n - 1); 
+} 
+  
+int main() 
+{ 
+    cout << numberOfPaths(3, 3); 
+    return 0; 
+} 
+
+// output is 6
+

assigment 1 (11 may 2020)/Ques4 (1).cpp

@@ -0,0 +1,40 @@
+#include <bits/stdc++.h> 
+using namespace std; 
+   
+int solve(int low, int high, int T) 
+{ 
+    while (low <= high)
+	 { 
+        int mid = (low + high) / 2; 
+  
+        if ((mid * (mid + 1)) == T) 
+            return mid; 
+  
+        if (mid > 0 && (mid * (mid + 1)) > T &&  
+                        (mid * (mid - 1)) <= T) 
+            return mid - 1; 
+  
+        if ((mid * (mid + 1)) > T) 
+            high = mid - 1; 
+  
+        else
+            low = mid + 1; 
+     } 
+    return -1; 
+} 
+  
+int main() 
+{ 
+    int T = 15; 
+  
+    int ans = solve(1, T, 2 * T); 
+  
+    if (ans != -1) 
+        ans--; 
+  
+    cout << "Number of stair steps = "
+         << ans << endl; 
+    return 0; 
+} 
+
+// output is Number of stair steps = 4

assigment 1 (11 may 2020)/Ques4 (1).exe

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h> 
+using namespace std; 
+  
+double Square(double n, double i, double j) 
+{ 
+    double mid = (i + j) / 2; 
+    double mul = mid * mid; 
+  
+
+    if ((mul == n) || (abs(mul - n) < 0.00001)) 
+        return mid; 
+  
+    else if (mul < n) 
+        return Square(n, mid, j); 
+  
+    else
+        return Square(n, i, mid); 
+} 
+  
+void findSqrt(double n) 
+{ 
+    double i = 1; 
+  
+    bool found = false; 
+    while (!found) { 
+  
+        if (i * i == n) { 
+            cout << fixed << setprecision(0) << i; 
+            found = true; 
+        } 
+        else if (i * i > n) { 
+  
+            double res = Square(n, i - 1, i); 
+            cout << fixed << setprecision(5) << res; 
+            found = true; 
+        } 
+        i++; 
+    } 
+} 
+  
+int main() 
+{ 
+    double n = 7; 
+  
+    findSqrt(n); 
+  
+    return 0; 
+} 
+//output is 2.4575

assigment 1 (11 may 2020)/Question3 (1).cpp

@@ -0,0 +1,38 @@
+#include <stdio.h>
+
+int PathCounting(int m, int n)
+{
+    int ctr[m][n];
+    for (int i = 0; i < m; i++)
+        {
+		ctr[i][0] = 1;
+		}
+    for (int j = 0; j < n; j++)
+        {
+		ctr[0][j] = 1;
+		}
+    for (int i = 1; i < m; i++)
+    {
+        for (int j = 1; j < n; j++)
+            { 
+			ctr[i][j] = ctr[i-1][j] + ctr[i][j-1];
+			}
+    }
+    return ctr[m-1][n-1];
+}
+ 
+int main()
+{
+    int p,q;
+    printf("enter no. of rows of matrix ");
+    scanf("%d",&p);
+    printf("enter no. of column of matrix ");
+    scanf("%d",&q);
+	printf("The size of matrix is : %d, %d\n",p,q);
+	printf("The all possible paths from top left to bottom right is: %d \n",PathCounting(p,q));
+}
+// output is
+// enter no. of rows of matrix 3
+// enter no. of column of matrix 4
+// The size of matrix is : 3, 4
+// The all possible paths from top left to bottom right is: 10