View Music_genre_classification.ipynb
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
View LongestRemainingTimeFirstJava.java
4import java.util.*; | |
class Process { | |
int pid, bt, at, ct, tat, wt, btt; | |
// Process(){} | |
Process(int p, int b, int a) { | |
pid = p; | |
bt = b; | |
at = a; |
View LRTF.cpp
// LRTF.cpp | |
#include<iostream> | |
#include<stdlib.h> | |
#include<conio.h> | |
#include <windows.h> | |
#define MAX 500 | |
COORD coord = {0, 0}; | |
COORD max_res,cursor_size; | |
void gotoxy (int x, int y) | |
{ |
View SJFNONPREEMPTIVE.cpp
#include<iostream> | |
#include<stdlib.h> | |
#include<conio.h> | |
#include <windows.h> | |
#define MAX 100 | |
COORD coord = {0, 0}; | |
COORD max_res,cursor_size; | |
void gotoxy (int x, int y) | |
{ |
View Binary Search Tree.cpp
// Bst tree with full operations | |
#include <iostream> | |
using namespace std; | |
class bst { | |
struct Node { |
View merge_sort_recursive.cpp
//program to merge two array using recursive function | |
#include "iostream" | |
#include "conio.h" | |
using namespace std; | |
void merge_r(int a1[],int a2[],int c[],int s1,int s2,int i=0,int j=0,int k=0){ | |
if(i<s1 && j<s2){ | |
if(a1[i]>a2[j]){ |