Mehwish Shaikh

Can anyone tell me what this following statement means in C++..[B] return (tos==0?1:0)[/B] where tos is a variable.. Thanks..!!

Hello All, I am having some troubles with my code, which is: [code] import java.net.*; import java.io.*; class TestInet { public static void main(String args[]) { try{ InetAddress inet = InetAddress.getByName("72.14.203.106"); InetAddress inet1 = InetAddress.getLocalHost(); InetAddress inet2[] = InetAddress.getAllByName("www.google.com"); //InetAddress inet3 = InetAddress.getHostName(); System.out.println ("Host of IP is[inet.getByName]: " + …

Im making a chat application where one client will send a message to ALL other clients who are currently online through server. The problem is that I'm unable to make such a loop which can infinitely send n receive messages using server. Secondly can't we just use PrintWriter and BufferedReader, …

Well I was just wondering what should be the first step of making a project(school or professional). Ohkay we've conceived it all. But i just make a garbage of ideas. How to make them bit neat n clear. What shud be the steps, a developer should take before going for …

I think all together its about 2000 lines of code give or take. Took me a good 2 weeks to complete. The program is called Character Creator. What is does is basically creates characters with skills / stats / attributes and a custom image that you provide. There are a …

hello friends: I am a student of Assembly language and making some programs to have an insight of this language.. along with i am also supposed to submit a project at the end. I've made this program, which'll convert tempt from celsius to fehrenheit and vice versa..It's compiled in masm611 …

Hello and hii fellows.... I want your help right now in making a BST in which we can perform treeSearch....treeMINIMUM....treeMAXIMUM....treeINSERT....treeSUCCESSOR....treePREDECESSOR....treeDELETE....alongwith INORDER....POSTORDER....PREORDER traversal methods.... I have made a program consistiting of all methods excluding treeDELETE.... I'm ordered to make a tree-class....and a structure for node of a tree.... but im confused …

Following code is implementation of stacks.. but its giving two errors [code=cplusplus] # include<iostream.h> # include<conio.h> # define SIZE 20 class stack { int a[SIZE]; int top; // Top of Stack public: stack() { top=0; } int overflow() { if(top==SIZE) { return (1); } else { return (0); } } …

I had got an assignment for sorting some data.. "Make a c++ program which takes data from a TEXT FILE, then sort it".. i made this program.. [code=cplusplus] #include <iostream.h> #include <conio.h> int main () { clrscr(); int sort[8]; cout<<"Enter DATA to be Sorted\n"; for(int get=0;get<=7;get++) cin>>sort[get]; //cin saves the …