kunal_ktr

This is a program..to implement stack operations..it is working fine..but a warning message is being displayed..as " Functions containing for are not expanded inline". I would be glad if anyone can tell me the reason for this. Thanks for all the support. #include<iostream.h> #include<conio.h> #include<stdlib.h> #define max 5 [CODE]class stack …

I know there is a way for the user to enter input and be able to accept it without the user having to press the Enter key but I do not know the command. Does anyone here know? For example, I have a menu like this: A Add a record …

Hi... please help me with this qn... i really have no idea how to start off... thanks.. i have attached the pdf here... pls do help me... it will be great if you can tell how to start off... thanks thkanks

hi, in c/c++ we have a function system() that lets us to call any external application from the c/c++ program. i wanted to knw that do we hve any similar function/method in C#?

I have a weird situation. Suppose a string will be entered as an input. using the getchar() function i count the number of characters the string contains until a new line character is encountered. So i know the size of the string. And then i try to allocate enough memory …

Hi, I am new to programming. The program I made reads a list of points from a text file. Then it finds the standard deviation and how many sets of points are in the file. Now I want to find the highest x value from the list and the highest …

[code] int ans, guess, random, type, counter, num, i; char option[20], numb[10], input[5]; int power(int num) { ans=2; if(num==0) { return(1); } if(num<0) { printf("incorrect input, please input a positive integer:"); return(0); } else for(i=1; i!=num; i++) { return(ans=ans*2); } return(0); } int main() { /*before this there is all …

Hi..this is a program to find if the no. is prime and to find the factorial of a given no. i have validated this program ..so that it gives an error message and [U]exits[/U] when negative nos. or zero are given as input. Instead of exit..i want to display the …

i've referred a couple of datastructure books and both give different definitions for width of a binary tree. one says its the no of nodes at a level,while another says its the longest path that can be traversed in a binary tree. can any one help me with a recursive …