View LogicGate Connector.py
class LogicGate: | |
def __init__(self,n): | |
self.name = n | |
self.output = None | |
def getLabel(self): | |
return self.name | |
def getOutput(self): |
View predict_fuel_efficiency.py
from __future__ import absolute_import, division, print_function, unicode_literals | |
import matplotlib.pyplot as plt | |
import pandas as pd | |
import seaborn as sns | |
import tensorflow as tf | |
from tensorflow import keras | |
from tensorflow.keras import layers | |
print(tf.__version__) |
View recorder.html
<script src="js/jquery.min.js"></script> | |
<script type="text/javascript" src="js/mp3recorder.js"></script> | |
<script type="text/javascript"> | |
var audio_context; | |
function __log(e, data) { | |
log.innerHTML += "\n" + e + " " + (data || ''); | |
} |
View simple_sum_of_array.cpp
#include <bits/stdc++.h> | |
using namespace std; | |
int simpleArraySum(int n, vector <int> ar) | |
{ | |
int sum = 0; | |
for(int i = 0; i < n ; i++){ | |
sum += ar[i]; | |
} | |
return(sum); | |
} |
View stack_implement.cpp
#include <bits/stdc++.h> | |
using namespace std; | |
int max,i,n; | |
int top=-1; | |
class stack | |
{ | |
int s[20]; | |
public: | |
void push(); |
View merge_sort.cpp
#include <bits/stdc++.h> | |
using namespace std; | |
void mergesort(int [],int,int); | |
void merge(int[],int,int,int); | |
int main() | |
{ | |
int a[30],p,r,q,n; | |
cout<<"enter the number of element"; | |
cin>>n; |
View quick_sort.cpp
#include <bits/stdc++.h> | |
using namespace std; | |
void quicksort(int[],int,int); | |
int partition(int[],int,int); | |
// Input and Main Function | |
int main() | |
{ | |
int a[30],p,n,r; | |
cout<<"enter the number of element"; | |
cin>>n; |
View upper_string.cpp
#include <bits/stdc++.h> | |
using namespace std; | |
char* mystrupr(char *s); | |
int main() | |
{ | |
char str[20]; | |
puts("Enter a string"); | |
cin>>str; | |
mystrupr(str); | |
cout<<"Upper case is : >> "<<str; |
View selection_sort.cpp
#include<iostream> | |
using namespace std; | |
int main() | |
{ | |
int i,j,n,loc,temp,min,a[30]; | |
cout<<"Enter the number of elements:"; | |
cin>>n; | |
cout<<"Enter the element"; |
View insertion_sort.cpp
#include <bits/stdc++.h> | |
using namespace std; | |
void insertionSort(int arr[], int length); | |
void printArray(int array[],int size); | |
int main() | |
{ | |
int array[5] = {5,4,3,2,1}; | |
insertionSort(array,5); |
NewerOlder