Lowyat.NET: Latest topics by tadapapaya

[WTB] GTO - Guru Terampil Onizuka

tadapapaya — Thu, 11 Jun 2015 14:27:13 +0800

Hi,

Currently im looking for these comics. Kindly pm if you got the full set of them Vol1-25.

Thanks..

Keyboard stickers

tadapapaya — Fri, 19 Apr 2013 20:26:53 +0800

Where can I get keyboard sticker like this?

» Click to show Spoiler - click again to hide... «

[WTS] Blackberry Playbook 32GB

tadapapaya — Tue, 01 Jan 2013 12:18:24 +0800

Item(s): Blackberry Playbook 32GB

Package includes: Standard Set

Price: RM800

Dealing method: Kajang

Location of seller: Kajang

Contact method/details: 0193227393 - erin
0192827393 - lina

Item(s) conditions: 10/10, seldom use

Picture:

» Click to show Spoiler - click again to hide... «

Power adapter asus a53sv

tadapapaya — Mon, 17 Sep 2012 20:54:21 +0800

my asus power adapter is not charging..
the blue led is on though but still not charging...

must i go to the service senter?
any asus service center around PJ?

Ideas for Final Year Project

tadapapaya — Fri, 15 Apr 2011 08:45:21 +0800

next semester i'm going to do my FYP..I'm degree student, IT majoring in networking..So, i'm looking any rough ideas or help to guide me..thanks in advance..

binary tree system

tadapapaya — Fri, 30 Apr 2010 11:53:57 +0800

CODE

typedef struct record{
int data;
struct record*aleft,*aright,*next;
}record;

record *root,*locptr,*parent,*newnode;

CODE

/*-----------------------Function Num Record----------------*/

void numrecord(){
record *num;
num=root;
parent=NULL;
int record=0;

while(num!=NULL){
if(newnode->data<num->data){
record++;
parent=num;
num=num->aleft;
}
else{
record++;
parent=num;
num=num->aright;
}
}
printf("\n\t\tNumber Of Record In List=>%d\n",record);
printf("\n\t\tReturn To Main Menu--->[ENTER]");
getche();
}

how come the output is true when entered 4 data but when entered 10 data, output 6?

Tree implementation

tadapapaya — Thu, 08 Apr 2010 21:32:32 +0800

CODE

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<conio.h>

typedef struct rekod{
int data;
struct rekod*akiri,*akanan,*next;
}rekod;

rekod *akar,*locptr,*bapa,*nodbaru;

void tambahrekod();
void hapus();
void dlmtertib(rekod *akar);
void pratertib(rekod *akar);
void lpstertib(rekod *akar);
void terkecil();
void terbesar();
void tambah();
void bilrekod();
void purata();
int gelintarrekod();
int pokokkosong();
void ciptapokok();
void inputdata();

void main(){

int pilih,jumpa;
FILE *pFile;
pFile = fopen("tree.txt", "w");
if ( pFile == NULL )
printf("\nFile not opened\n");
else {

while(1){
clrscr();
printf("\n\n\n\t\t************************************");
printf("\n\t\t\t\tTREE SYSTEM");
printf("\n\t\t************************************");
printf("\n\n\t\t[1]Add Record");
printf("\n\t\t [2]Delete Record");
printf("\n\t\t [3]Search Record");
printf("\n\t\t [4]Print Record In Order [LVR]");
printf("\n\t\t [5]Print Record Pre Order[VLR]");
printf("\n\t\t [6]Print Record Post Order [LRV]");
printf("\n\t\t [7]Number of Record");
printf("\n\t\t [8]Sum Record");
printf("\n\t\t [9]Record an Average");
printf("\n\t\t [10]Largest Record ");
printf("\n\t\t [11]Smallest Record ");
printf("\n\t\t [12]Exit");
printf("\n\n\t\t************************************");
printf("\n\n\t\tEnter Your Choice : ");
scanf("%d",&pilih);

if(pilih==1){
tambahrekod();
}
else if(pilih==2){
hapus();
}
else if(pilih==3){
jumpa=gelintarrekod();
if(jumpa){
printf("\n\n\tRekod Yang Dicari Wujud\n");
printf("\n\n\t\tKembali ke menu utama-->[Enter]");
getche();
}
else{
printf("\n\n\tRekod Yang Dicari Tidak Wujud\n");
printf("\n\n\t\tKembali ke menu utama-->[Enter]");
getche();
}
}
else if(pilih==4){

printf("\n\n=====================================\n");
printf("\tSenarai Dalam Tertib [LNR]\n");
printf("=====================================\n\n");
dlmtertib(akar);
printf("\n\n\t\tKembali Ke Menu Utama-->[ENTER]");
getche();
}
else if(pilih==5){
printf("\n\n====================================\n");
printf("\tSenarai Pra Tertib [NLR]\n");
printf("====================================\n\n");
pratertib(akar);
printf("\n\n\t\tKembali Ke Menu Utama-->[ENTER]");
getche();
}
else if(pilih==6){
printf("\n\n===================================\n");
printf("\tSenarai Lepas Tertib [LRN]\n");
printf("===================================\n\n");
lpstertib(akar);
printf("\n\n\t\tKembali Ke Menu Utama-->[ENTER]");
getche();
}
else if(pilih==7){
bilrekod();
}
else if(pilih==8){
tambah();
}
else if(pilih==9){
purata();
}
else if(pilih==10){
terbesar();
}
else if(pilih==11){
terkecil();
}
else if(pilih==12){
exit(1);
}fclose(pFile);
}
}

/*-----------Fungsi Cipta pokok-------------*/

void ciptapokok(){ //error goes here..
akar=NULL;
}

/*------------fungsi input data--------*/

void inputdata(){

nodbaru=(rekod*)malloc(sizeof(rekod));
printf("\n\n\tMasukkan Rekod=>");
scanf("%d",&nodbaru->data);
fprintf(pFile, "%d",&nodbaru->data);
//printf("\n\n\tKembali Ke Menu Utama-->[ENTER]");
// getche();
}
int pokokkosong(){
if(akar==NULL)
return(1);
else
return(0);
}

/*----------------fungsi tambah rekod--------------*/

void tambahrekod(){

int jumpa;
jumpa=gelintarrekod();
if(jumpa){
printf("\n\n\tRekod Telah Wujud\n");
printf("\n\n\t\tKembali ke menu utama-->[Enter]");
getche();
}
else{
nodbaru->akiri=NULL;
nodbaru->akanan=NULL;
if(pokokkosong())
akar=nodbaru;
else
if(nodbaru->data<bapa->data)
bapa->akiri=nodbaru;
else
bapa->akanan=nodbaru;
}
}

/*---------fungsi gelintarrekod-------------*/

int gelintarrekod(){

int jumpa=0;

inputdata();
locptr=akar;
bapa=NULL;

while(!jumpa&&locptr!=NULL)
if(nodbaru->data<locptr->data){
bapa=locptr;
locptr=locptr->akiri;
}
else if(nodbaru->data>locptr->data){
bapa=locptr;
locptr=locptr->akanan;
}
else
jumpa=1;
return(jumpa);
}

/*---------------------hapus rekod-----------*/

void hapus(){

rekod *p,*temp;
int jumpa;

jumpa=gelintarrekod();
if(!jumpa){
printf("\n\n\tRekod tidak jumpa\n");
printf("\n\n\t\tKembali ke Menu Utama-->[ENTER]");
getche();
}
else{
printf("\n\n\tRekod Sudah di hapus");
printf("\n\n\t\tKembali Ke Menu Utama-->[ENTER]");
getche();

/*hapus nod yg ada 2 anak */
if((locptr->akiri!=NULL)&&(locptr->akanan!=NULL)){
p=locptr->akanan;
bapa=locptr;
while(p->akiri!=NULL){
bapa=p;
p=p->akiri;
}
locptr->data=p->data;
locptr=p;
}
/*hapus nod daun @ nod yg ada 1 anak*/

temp=locptr->akiri;
if(temp==NULL)
temp=locptr->akanan;
if(bapa==NULL)
akar=temp;
else if(bapa->akiri==locptr)
bapa->akiri=temp;
else
bapa->akanan=temp;
}
}

/*--------------fungsi dlm tertib-------*/

void dlmtertib(rekod *akar){

if(akar==NULL){
return;
}
else {
dlmtertib(akar->akiri);
printf("%d\t",akar->data);
fprintf(pFile, "%d\t",akar->data);
dlmtertib(akar->akanan);
}
}

/*-------------------fungsi pratertib-------------*/

void pratertib(rekod *akar){

if(akar==NULL)
return;
else {
printf("%d\t",akar->data);
fprintf(pFile, "%d\t",akar->data);
pratertib(akar->akiri);
pratertib(akar->akanan);
}
}
/*--------------------fungsi lps tertib------------*/

void lpstertib(rekod *akar){

if(akar==NULL)
return;
else {
lpstertib(akar->akiri);
lpstertib(akar->akanan);
printf("%d\t",akar->data);
fprintf(pFile, "%d\t",akar->data);
}
}
/*-----------------------fungsi bilrekod----------------*/

void bilrekod(){
rekod *bil;
bil=akar;
bapa=NULL;
int rekod=0;

while(bil!=NULL){
if(nodbaru->data<bil->data){
rekod++;
bapa=bil;
bil=bil->akiri;
}
else{
rekod++;
bapa=bil;
bil=bil->akanan;
}
}
printf("\n\n\tBil Rekod Dalam Senarai=>%d",rekod);
printf("\n\n\t\tKembali Ke Menu Utama--->[ENTER]");
getche();
}
/*-----------------fungsi hasiltambah rekod-----------*/

void tambah(){

rekod *sum;
sum=akar;
bapa=NULL;
int jumlah=0;

while(sum!=NULL){
if(nodbaru->data<sum->data){
jumlah=jumlah+sum->data;
bapa=sum;
sum=sum->akiri;
}
else{
jumlah=jumlah+sum->data;
bapa=sum;
sum=sum->akanan;
}
}
printf("\n\n\tJumlah Rekod=>%d",jumlah);
fprintf(pFile, "\n\n\tJumlah Rekod=>%d",jumlah);
printf("\n\n\t\tKembali Ke Menu Utama-->[ENTER]");
getche();
}
/*------------------------fungsi purata-----------*/

void purata(){

rekod *bil;
rekod *sum;
sum=akar;
bil=akar;
bapa=NULL;
int rekod=0;
int jumlah=0;
int jumpurata=0;

while(bil!=NULL){
if(nodbaru->data<bil->data){
rekod++;
bapa=bil;
bil=bil->akiri;
}
else{
rekod++;
bapa=bil;
bil=bil->akanan;
}
}

while(sum!=NULL){
if(nodbaru->data<sum->data){
jumlah=jumlah+sum->data;
bapa=sum;
sum=sum->akiri;
}
else{
jumlah=jumlah+sum->data;
bapa=sum;
sum=sum->akanan;
}
}
jumpurata=jumlah/rekod;
printf("\n\n\tJumlah Purata=>%d",jumpurata);
fprintf(pFile, "\n\n\tJumlah Purata=>%d",jumpurata);
printf("\n\n\t\tKembali Ke Menu Utama-->[ENTER]");
getche();
}

/*--------------------fungsi mencari nilai terkecil------*/

void terkecil(){
rekod *min;
min=akar;
int terkecil;

while(min!=NULL){
if(min->data<=terkecil){
terkecil=min->data;
min=min->akiri;
}
}
printf("\n\n\tNilai Rekod Terkecil=>%d",terkecil);
fprintf(pFile, "\n\n\tNilai Rekod Terkecil=>%d",terkecil);
printf("\n\n\t\tKembali Ke Menu Utama-->[ENTER]");
getche();

}
/*-----------------fungsi mencari nilai terbesar----*/

void terbesar(){
rekod *max;
max=akar;
int terbesar=0;

while(max!=NULL){
if(max->data>=terbesar)
terbesar=max->data;
max=max->akanan;
}
printf("\n\n\tNilai Rekod Terbesar=>%d",terbesar);
fprintf(pFile, "\n\n\tNilai Rekod Terbesar=>%d",terbesar);
printf("\n\n\t\tKembali Ke Menu Utama-->[ENTER]");
getche();
}
} // error goes here too..

it have 2 errors...it is declaration syntax error and missing..please help me..

Data Structure..need help..

tadapapaya — Thu, 08 Apr 2010 07:39:32 +0800

CODE

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#include<string.h>

typedef struct nod{
int staffNo;
char name[10];
float salary;
struct nod *next;

}NOD;

NOD *senarai,*locPtr,*preNod;

void createList(),addRecord(int nomStaff,char nameStaff[],float salaryStaff()),deleteRecord(),inputInformation(),printRecord();
int searchRecord(int nStaff),emptyList(),inputStaffNo();
char nameStaff[10];
float salaryStaff;

void main()
{
int pilih,nomStaff;

createList();
do {
clrscr();
printf("\n[1] Add Record");
printf("\n[2] Delete Record");
printf("\n[3] Search Record");
printf("\n[4] View/Print All Records");
printf("\n[5] System Exit");
printf("\n\n Key In Your Choice:");
scanf("%d",&pilih);
switch (pilih) {
case 1: nomStaff=inputStaffNo();
if(searchRecord(nomStaff)) {
printf("\nRecord Exist..[ENTER]");
getche();
}
else {
printf("\nName:");scanf("%s",nameStaff);
printf("\nSalary:");scanf("%f",&salaryStaff);
addRecord(nomStaff,nameStaff,salaryStaff); //error goes here
}
break;
case 2: nomStaff=inputStaffNo();
if(!searchRecord(nomStaff)) {
printf("\nNo Such Record...[ENTER]");
getche();
}
else {
deleteRecord();
printf("\nName : %s",nameStaff);
printf("\nSalary :%.2f",salaryStaff);
printf("\n\nThe Record Delete...[ENTER]");
getche();
}
break;
case 3: nomStaff=inputStaffNo();
if(searchRecord(nomStaff)) {
printf("\nName : %s",locPtr->name);
printf("\nSalary:%.2f",locPtr->salary);
printf("\n\nPress[ENTER]");
getche();

}
else {
printf(" \nNo Such Record...press[ENTER]");
getche();
}
break;

case 4: if(emptyList()) {
printf("\nList Is Empty...Press[ENTER]");
getche();
}
else {
printRecord();
printf("\n\nPress[ENTER]");
getche();
}
break;
case 5: exit(1);
}
}while (pilih !=5);

}

void createList()
{
senarai=NULL;

}

int emptyList()
{

if(senarai == NULL)
return(1);
else
return(0);
}

int searchRecord(int nStaff)
{
int found=0;

locPtr=senarai;
preNod=NULL;
if(emptyList())
return(found);
else
while((locPtr != NULL)&&(!found))
if(locPtr->staffNo==nStaff)
found=1;
else { //read next nod
preNod=locPtr;
locPtr=locPtr->next;
}
return(found);

}

int inputStaffNo()
{

int nom;

printf("\nNumber:");
scanf("%d",&nom);
return(nom);
}

void addRecord(int nomStaff,char nameStaff[],float salaryStaff)
{
NOD*nodBaru;

nodBaru=(NOD*)malloc(sizeof(NOD));
nodBaru->staffNo=nomStaff;
strcpy(nodBaru->name,nameStaff);
nodBaru->salary=salaryStaff;
nodBaru->next=NULL;
if(emptyList()) //if empty list,add in front of the list
senarai=nodBaru;
else //add at the end of the list
preNod->next=nodBaru;

}

void deleteRecord()
{
strcpy(nameStaff,locPtr->name);
salaryStaff=locPtr->salary;
if(preNod==NULL) //if list have one record,set list to NULL
senarai=NULL;
else // adjust linked between list
preNod->next=locPtr->next;
free(locPtr);
}

void printRecord()
{
NOD *papar;

papar=senarai;
while(papar!=NULL) {
printf("\n%d%s%.2f",papar->staffNo,papar->name,papar->salary);
papar=papar->next;

}
}

is says incompatible type conversion in function main()

[C] Queue in Linked List

tadapapaya — Sun, 28 Feb 2010 23:59:20 +0800

I am supposed to rewrite all the functions to where it used the linked-list format. I've used linked-lists before and we were just introduced to queues. We were never taught how to combine the two though, so I am lost. I was wondering if you could just give me a basic outline of where to start. I read above and I don't want you to do my homework for me. I just want to know how I would go about this. Also, please put your answer in the simplest terms possible. I have written the code below. Thank you.

CODE

# include <stdio.h>
# include <string.h>
# define SIZE 20

int population[SIZE], front = -1, rear = -1, i;
char state[SIZE][SIZE];
void enqueue();
void dequeue();
void display();

int main()
{
int ch;
do
{
printf("\n[1].ENQUEUE\n");
printf("[2].DEQUEUE\n");
printf("[3].DISPLAY\n");
printf("[4].EXIT\n");
printf("Enter your choice [1-4] : ");
scanf("%d", &ch);
switch(ch)
{
case 1 :
enqueue();
break;
case 2 :
dequeue();
break;
case 3 :
display();
break;
case 4 :
break;
default :
printf("Invalid option\n");
}
} while(ch != 4);
}

void enqueue()
{
if(rear == SIZE - 1)
{
printf("Queue is full\n");
return;
}
rear++;
printf("Enter the state to add : ");
scanf("%s", &state[rear]);
printf("Enter the population to add : ");
scanf("%d", &population[rear]);
if(front == -1)
front++;
}

void dequeue()
{
if(front == -1)
{
printf("Queue is empty (underflow)\n");
return;
}
printf("The deleted state is : %s\n", &state[front]);
printf("The deleted population is : %d\n", population[front]);
if(front == rear)
front = rear = -1;
else
front++;
}

void display()
{
if(front == -1)
{
printf("Queue is empty\n");
return;
}
printf("The state in queue are : FRONT -> ");
for(i = front; i <= rear; i++)
printf(" ... %s", state[i]);
printf(" ... <- REAR\n");
printf("The population in queue are : FRONT -> ");
for(i = front; i <= rear; i++)
printf(" ... %d", population[i]);
printf(" ... <- REAR\n");
}

[C] Queue in Array

tadapapaya — Sun, 28 Feb 2010 20:34:51 +0800

hi..below is my code..when inserting 1st state, its ok..but when inserting 2nd state,all the state in the array become the 2nd state..how to solve this..reply ASAP..

CODE

# include <stdio.h>
# define SIZE 20

int population[SIZE], front = -1, rear = -1, i;
char state[SIZE];
void enqueue();
void dequeue();
void display();

int main()
{
int ch;
do
{
printf("\n[1].ENQUEUE\n");
printf("[2].DEQUEUE\n");
printf("[3].DISPLAY\n");
printf("[4].EXIT\n");
printf("Enter your choice [1-4] : ");
scanf("%d", &ch);
switch(ch)
{
case 1 :
enqueue();
break;
case 2 :
dequeue();
break;
case 3 :
display();
break;
case 4 :
break;
default :
printf("Invalid option\n");
}
} while(ch != 4);
}

void enqueue()
{
if(rear == SIZE - 1)
{
printf("Queue is full\n");
return;
}
rear++;
printf("Enter the state to add : ");
scanf("%s", state[rear]);
printf("Enter the population to add : ");
scanf("%d", &population[rear]);
if(front == -1)
front++;
}

void dequeue()
{
if(front == -1)
{
printf("Queue is empty (underflow)\n");
return;
}
printf("The deleted state is : %s\n", state[front]);
printf("The deleted population is : %d\n", population[front]);
if(front == rear)
front = rear = -1;
else
front++;
}

void display()
{
if(front == -1)
{
printf("Queue is empty\n");
return;
}
printf("The state in queue are : FRONT -> ");
for(i = front; i <= rear; i++)
printf(" ... %s", state[i]);
printf(" ... <- REAR\n");
printf("The population in queue are : FRONT -> ");
for(i = front; i <= rear; i++)
printf(" ... %d", population[i]);
printf(" ... <- REAR\n");
}

Price Lists

tadapapaya — Sun, 25 Jan 2009 08:28:14 +0800

where can i download all the computer price lists?
all i know is at cycom...
but i need em all the stores because want to comparing price..
email me at biotik@yahoo.com or u cant leave the website links here...