Round Robin

Array structure.c

@@ -0,0 +1,25 @@
+//
+//  main.c
+//  Array structure
+//
+//  Created by APPLE on 11/13/18.
+//  Copyright © 2018 APPLE. All rights reserved.
+//
+
+#include <stdio.h>
+
+struct friend
+{
+    int phoneno;
+    char name[10];
+    int hno;
+
+}s[5];
+int main()
+{
+    int i;
+    for(i=0;i<5;i++)
+        scanf("%s%d%d",s[i].name,&s[i].phoneno,&s[i].hno);
+        for(i=0;i<5;i++)
+            printf("%s%d%d\n",s[i].name,&s[i].phoneno,&s[i].hno);
+}

Binary_Search.cpp

@@ -0,0 +1,88 @@
+// C++ program to implement
+// the above approach
+
+#include <bits/stdc++.h>
+using namespace std;
+
+// Stores the frequency of
+// each type of chocolate
+map<int, int> mp;
+
+int N, P;
+
+// Function to check if chocolates
+// can be eaten for 'mid' no. of days
+bool helper(int mid)
+{
+
+	int cnt = 0;
+	for (auto i : mp) {
+		int temp = i.second;
+
+		while (temp >= mid) {
+			temp -= mid;
+			cnt++;
+		}
+	}
+
+	// If cnt exceeds N,
+	// return true
+	return cnt >= N;
+}
+
+// Function to find the maximum
+// number of days for which
+// chocolates can be eaten
+int findMaximumDays(int arr[])
+{
+
+	// Store the frequency
+	// of each type of chocolate
+	for (int i = 0; i < P; i++) {
+		mp[arr[i]]++;
+	}
+
+	// Initialize start and end
+	// with 0 and P respectively
+	int start = 0, end = P, ans = 0;
+	while (start <= end) {
+
+		// Calculate mid
+		int mid = start
+				+ ((end - start) / 2);
+
+		// Check if chocolates can be
+		// distributed for mid days
+		if (mid != 0 and helper(mid)) {
+
+			ans = mid;
+
+			// Check if chocolates can
+			// be distributed for more
+			// than mid consecutive days
+			start = mid + 1;
+		}
+		else if (mid == 0) {
+			start = mid + 1;
+		}
+		else {
+			end = mid - 1;
+		}
+	}
+
+	return ans;
+}
+
+// Driver code
+int main()
+{
+
+	N = 3, P = 10;
+	int arr[] = { 1, 2, 2, 1, 1,
+				3, 3, 3, 2, 4 };
+
+	// Function call
+	cout << findMaximumDays(arr);
+
+	return 0;
+}

Circle.c

@@ -0,0 +1,22 @@
+//
+//  main.c
+//  CIRCLE
+//
+//  Created by APPLE on 23/08/18.
+//  Copyright © 2018 APPLE. All rights reserved.
+//
+
+#include <stdio.h>
+
+int main() {
+    float radius, area;
+
+    printf("\nEnter the radius of Circle : ");
+    scanf("%f", &radius);
+
+    area = 3.14 * radius * radius;
+    printf("\nArea of Circle : %f", area);
+
+    return (0);
+}
+

Circular_Queue.cpp

@@ -0,0 +1,134 @@
+// C or C++ program for insertion and 
+// deletion in Circular Queue 
+#include<bits/stdc++.h> 
+using namespace std; 
+
+struct Queue 
+{ 
+	// Initialize front and rear 
+	int rear, front; 
+
+	// Circular Queue 
+	int size; 
+	int *arr; 
+
+	Queue(int s) 
+	{ 
+	front = rear = -1; 
+	size = s; 
+	arr = new int[s]; 
+	} 
+
+	void enQueue(int value); 
+	int deQueue(); 
+	void displayQueue(); 
+}; 
+
+
+/* Function to create Circular queue */
+void Queue::enQueue(int value) 
+{ 
+	if ((front == 0 && rear == size-1) || 
+			(rear == (front-1)%(size-1))) 
+	{ 
+		printf("\nQueue is Full"); 
+		return; 
+	} 
+
+	else if (front == -1) /* Insert First Element */
+	{ 
+		front = rear = 0; 
+		arr[rear] = value; 
+	} 
+
+	else if (rear == size-1 && front != 0) 
+	{ 
+		rear = 0; 
+		arr[rear] = value; 
+	} 
+
+	else
+	{ 
+		rear++; 
+		arr[rear] = value; 
+	} 
+} 
+
+// Function to delete element from Circular Queue 
+int Queue::deQueue() 
+{ 
+	if (front == -1) 
+	{ 
+		printf("\nQueue is Empty"); 
+		return INT_MIN; 
+	} 
+
+	int data = arr[front]; 
+	arr[front] = -1; 
+	if (front == rear) 
+	{ 
+		front = -1; 
+		rear = -1; 
+	} 
+	else if (front == size-1) 
+		front = 0; 
+	else
+		front++; 
+
+	return data; 
+} 
+
+// Function displaying the elements 
+// of Circular Queue 
+void Queue::displayQueue() 
+{ 
+	if (front == -1) 
+	{ 
+		printf("\nQueue is Empty"); 
+		return; 
+	} 
+	printf("\nElements in Circular Queue are: "); 
+	if (rear >= front) 
+	{ 
+		for (int i = front; i <= rear; i++) 
+			printf("%d ",arr[i]); 
+	} 
+	else
+	{ 
+		for (int i = front; i < size; i++) 
+			printf("%d ", arr[i]); 
+
+		for (int i = 0; i <= rear; i++) 
+			printf("%d ", arr[i]); 
+	} 
+} 
+
+/* Driver of the program */
+int main() 
+{ 
+	Queue q(5); 
+
+	// Inserting elements in Circular Queue 
+	q.enQueue(14); 
+	q.enQueue(22); 
+	q.enQueue(13); 
+	q.enQueue(-6); 
+
+	// Display elements present in Circular Queue 
+	q.displayQueue(); 
+
+	// Deleting elements from Circular Queue 
+	printf("\nDeleted value = %d", q.deQueue()); 
+	printf("\nDeleted value = %d", q.deQueue()); 
+
+	q.displayQueue(); 
+
+	q.enQueue(9); 
+	q.enQueue(20); 
+	q.enQueue(5); 
+
+	q.displayQueue(); 
+
+	q.enQueue(20); 
+	return 0; 
+} 

Cpy to dma.c

@@ -0,0 +1,28 @@
+//
+//  main.c
+//  CPY DMA
+//
+//  Created by APPLE on 11/1/18.
+//  Copyright © 2018 APPLE. All rights reserved.
+//
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+
+int main()
+{
+    char s1[20];
+    char s2[20];
+    int result;
+    printf("\nEnter the string");
+    gets(s1);
+    strcpy(s2,s1);
+    strrev(s2);
+    result=strcmp(s1,s2);
+    if(result==0)
+        printf("\nIt is a palindrome string");
+    else
+        printf("\n It is not a palindrome string");
+
+}

Floor-in-a-Sorted-Array-Binary.cpp

@@ -0,0 +1,32 @@
+#include <stdio.h>
+#include <iostream>
+using namespace std;
+int floorSearch(int arr[], int low, int high, int x) {
+	if (low > high) return -1;
+	if (x >= arr[high]) return high;
+	int mid = (low + high) / 2;
+	if (arr[mid] == x) return mid;
+	if (mid > 0 && arr[mid - 1] <= x && x < arr[mid]) return mid - 1;
+	if (x < arr[mid]) return floorSearch(arr, low, mid - 1, x);
+	return floorSearch(arr, mid + 1, high, x);
+}
+int main() {
+	int num, m;
+	printf("Enter the size of the array = ");
+	cin >> num;
+	int arr[num];
+	printf("Enter elements = ");
+	for (int i = 0; i < num; i++) {
+		cin >> arr[i];
+	}
+	printf("Enter the value to be generated = ");
+	cin >> m;
+	printf("Minimum time = ");
+	int index = floorSearch(arr, 0, num - 1, m);
+	if (index == -1)
+		printf("Floor of %d doesn't exist in array ", m);
+	else
+		printf("Floor of %d is %d", m, arr[index]);
+	return 0;
+}
+

Floor-in-a-Sorted-Array-Linear.cpp

@@ -0,0 +1,31 @@
+#include <stdio.h>
+#include <iostream>
+using namespace std;
+int floorSearch(int arr[], int n, int x) {
+	if (x >= arr[n - 1]) return n - 1;
+	if (x < arr[0]) return -1;
+	for (int i = 1; i < n; i++)
+		if (arr[i] > x) return (i - 1);
+
+	return -1;
+}
+int main() {
+	int num, m;
+	printf("Enter the size of the array = ");
+	cin >> num;
+	int arr[num];
+	printf("Enter elements = ");
+	for (int i = 0; i < num; i++) {
+		cin >> arr[i];
+	}
+	printf("Enter the value to be generated = ");
+	cin>>m;
+	printf("Minimum time = ");
+	int index = floorSearch(arr, num - 1, m);
+	if (index == -1)
+		printf("Floor of %d doesn't exist in array ", m);
+	else
+		printf("Floor of %d is %d", m, arr[index]);
+	return 0;
+}
+