Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// 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) | |
{ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#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) | |
{ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Bst tree with full operations | |
#include <iostream> | |
using namespace std; | |
class bst { | |
struct Node { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//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]){ |