just would like to know ur opinions on this issue
Wat page replacemtn algorithm would be best effective for a process which randomly reads 10,000 locations in its address space?
Im thinking...
Type: Posts; User: chizzy
just would like to know ur opinions on this issue
Wat page replacemtn algorithm would be best effective for a process which randomly reads 10,000 locations in its address space?
Im thinking...
thanks.. it was the comments
thakns
i get the same error..
im using cc -o compiler..via ssh secure shell...
hey every one.. i get these error msgs with my code.. i just dont get.. it.. am i missing something
cc -o clock clock.c clock.h
cc: Error: clock.c, line 76: In this statement,...
i have add more code aboe
thankx
i have this array
char subcode[CODELENGTH];
say the value JJ123
i also have
#include <iostream.h>
#include <conio.h>
#include <fstream.h>
#include <stdlib.h>
const int MAXSTUDENTS = 20;
const int MAXSUBJECTS = 10;
void ReadFile(void);
just the third one is in ReadFile..
the others are b4 main..
ive got this
struct student
{
int mark[MAX];
long id[MAX];
};
its initialised
char num_students[MAXCHARS];
inFile.getline(num_students,MAXCHARS, ' ');
thnx.. but it doesnt have anything on array of classes
hey
im doin this program..
i can load data.. from a text file and output..
say ive got this..
J1744 6
99123456 23
thanx. im goin try that out ...
fry - yes
benny..
umm..
all im having trouble with is filling the array..
lets say one command is for the turtle to move 15 spaces across..
using an if statement i will be able to determine...
tFloor is a 2d array..
when u combine the pen down and movement of the turtle.. for eg..
6x5 array grid.. the ones represent the movement of the turtle.
011110
010010
010010
010010
011110
using
int ExecuteCommand(int com[], int max)
{
int Tfloor[FLOORSIZE][FLOORSIZE];
int i, move, penup, pendown, n, s, e=1, w;
for(i=0;i< max;i++)
{
wat do u mean
using
int ExecuteCommand(int com[], int max)
{
int Tfloor[FLOORSIZE][FLOORSIZE];
int i, move, penup, pendown, n, s, e=1, w;
for(i=0;i< max;i++)
{