Add files via upload

Author: skjha1

Problems/Memory Allocation/01 create new node.cpp

@@ -0,0 +1,29 @@
+/*
+Your job is to create number of nodes as per user request using pointer
+4
+1 4 5 99
+1 4 5 99
+5
+1 4 5 99 100
+1 4 5 99 100
+2
+1 4
+1 4
+
+*/
+#include<stdio.h>
+#include<stdlib.h>
+int main ()
+{
+  int *p,i,no;
+  scanf("%d",&no);
+  p = (int *)malloc (no*sizeof(int));
+  for (i=0;i<no;i++)
+    scanf("%d",p+i);
+  for (i=0;i<no;i++)
+  {
+    printf("%d ",*p);
+    p++;
+  }
+  return 0;
+}

Problems/Memory Allocation/02 Help bob.c

@@ -0,0 +1,52 @@
+/*Bob was bored that day, so she was sitting on the riverbank .Suddenly she notices a talking, White Rabbit with a pocket watch .It ran fast, and she followed it, down a rabbit hole .She fell into the hole and found a magical wonderland with dark trees, beautiful flowers.She found many ways numbered from 1,2,3,........18.she was confused which is the right way that will lead her to her home. She found a cute bird, standing in one of the tree. Alice asked the bird the way to go back to her home.The bird said a two digit number( say 23 ) and asked her to find the sum of its digits (2+3=5) and that numbered way will lead her to her home.Alice was already confused, so pls help Alice in finding the route to her home....
+
+Input Format:
+Input consists of an integer corresponding to the 2-digit number.
+Output Format:
+Output consists of an integer corresponding to the sum of its digits. Refer sample input and output for formatting specifications.
+
+[All text in bold corresponds to input and the rest corresponds to output]
+TEST CASE 1
+
+INPUT
+23
+OUTPUT
+Bob must go in path-5 to find her way to home
+TEST CASE 2
+
+INPUT
+99
+OUTPUT
+Bob must go in path-18 to find her way to home
+*/
+
+#include <stdio.h>
+int main() {
+	int no,a,b,c;
+  scanf("%d",&no);
+    a=no/10;
+    b=no%10;
+    c=-a-b;
+    printf("Bob must go in path%d to find her way to home",c);
+	return 0;
+}
+--------------------------------------------------------------
+
+#include <stdio.h>
+ 
+int main()
+{
+    int num, temp, digit, sum = 0;
+ 
+    
+    scanf("%d", &num);
+    temp = num;
+    while (num > 0)
+    {
+        digit = num % 10;
+        sum  = sum + digit;
+        num /= 10;
+    }
+    printf("Bob must go in path-%d to find her way to home",sum);
+  return 0;
+}

Problems/Memory Allocation/03 Dynamic memory allocation.c

@@ -0,0 +1,35 @@
+/*Write a program to find sum of n elements entered by user. To perform this program, allocate memory dynamically using malloc() function
+TEST CASE 1
+
+INPUT
+5
+1 2 3 4 5
+OUTPUT
+Sum=15
+TEST CASE 2
+
+INPUT
+7
+5 5 5 5 5 1 1
+OUTPUT
+Sum=27
+*/
+#include<stdio.h>
+#include<stdlib.h>
+int main ()
+{
+  int i,no,*p,sum=0;
+  scanf("%d",&no);
+  p= (int * ) malloc (no*sizeof(int));
+
+  for (i=0;i<=no;i++)
+  {
+    scanf("%d",p+i);
+  }
+  for(i=0;i<no;i++){
+  sum=sum+*p;
+    p++;
+}
+printf("Sum=%d",sum);
+return 0;
+}

Problems/Memory Allocation/04 Swapping of no using ptr.c

@@ -0,0 +1,42 @@
+/*Rahul and Ram played a game of exchanging their pocket money on a holiday. Rahul tries to give his pocket money to Ram and get Ram's pocket money.
+Both of them were strucking in to solve the problem. You help them to solve the problem
+TEST CASE 1
+
+INPUT
+5 4
+OUTPUT
+x=5
+y=4
+After Swapping
+x=4
+y=5
+TEST CASE 2
+
+INPUT
+100 239
+OUTPUT
+x=100
+y=239
+After Swapping
+x=239
+y=100
+*/
+#include<iostream>
+using namespace std;
+int main ()
+{
+  int *a,*b,temp,x,y;
+  scanf("%d%d",&x,&y);
+  printf("x=%d\ny=%d\n",x,y);
+  
+  a=&x;// a assign to x 
+  b=&y;// b assign to y
+  
+  temp=*a;
+  *a=*b;
+  *b=temp;
+  printf("After Swapping\n");
+  printf("x=%d\ny=%d\n",x,y);
+  return 0;
+}
+  

Problems/Memory Allocation/05 Finding Square Roots.c

@@ -0,0 +1,52 @@
+/*
+In olden days finding square roots seemed to be difficult but nowadays it can be easily done using in-built functions available across many languages .
+
+Assume that you happen to hear the above words and you want to give a try in finding the square root of any given integer using in-built functions. So here's your chance.
+Input
+
+The first line of the input contains an integer T, the number of test cases. T lines follow. Each T contains an integer N whose square root needs to be computed.
+Output
+
+For each line of input output the square root of the input integer.
+Constraints
+
+1<=T<=20
+1<=N<=10000
+TEST CASE 1
+
+INPUT
+3
+10
+5
+10000
+OUTPUT
+3
+2
+100
+TEST CASE 2
+
+INPUT
+1
+10
+OUTPUT
+3
+*/
+
+#include <stdio.h>
+#include<stdlib.h>
+#include<math.h>
+int main() {
+	int no,*p,i,a;
+  scanf("%d",&no);
+  p=(int *)malloc(no*sizeof(int));
+  for (i=0;i<no;i++){
+    
+    scanf("%d",p+i);
+  }
+  for(i=0;i<no;i++){
+    a=sqrt(*p);
+    p++;
+     printf("%d\n",a);
+  }note 
+	return 0;
+}