0
Computer Programming
A category for questions about computer programming and programming languages.
10,506 Questions
Where can I learn about computer operating systems?
This depends on which operating system you want to research. For example, there are three major OS'es. Those are Mac, Windows, and Linux. For Mac, you can go to apple.com and then lookup "Mountain Lion" in the search bar. To research Windows, o to Microsoft.com and find Windows. For Linux, you can goto ubuntu.com or look up fedora Linux on google. You can also find information about many OSes using wikipedia.
How do you restore the original computer system?
You can usually perform a factory reset by pressing F8 to get to the restore menu on the computer. This will restore the computer back to factory.
I think it is most probably an error caused by the modification of the "EXE" file by a virus or a file patcher program. You will get this error mostly in demo games restricted to 1 hour limit, if u modify a few bytes in the EXE file. This has something with the structure of EXE files (mostly PE). The actual program code is loaded later into memory by the loader. The loader code verifies the demo limit and then tried to unpack the main program code into memory. If some bytes regarding the information of the main program block has been modified, you are likely to get the LP5 unpack error. Just my thoughts. Ain't sure if it is the truth.
printf(\n "ENTER THE NUMBER\t");
scanf{"%d",&a);
while(a!=0);
{
r=a%2;
if(r==0)
printf("\n\n THE NUMBER IS EVEN \t");
else
printf("\n\n THE NUMBER IS ODD \t");
printf ("\n ENTER THE NUMBER \t");
scanf("%d",&a);
}
getch();
}
What are some dead computer languages?
Basic A, Dark Basic, DOS (just kidding.... in a way)
AnswerForth, Ada, Pascal, you don't hear much about them anymore but they probably exist somewhere in limited use.RPG (Report Program Generator), XSYMBOL (spelling uncertain - 1979 - flip switches and hit enter, as well as punch cards, on Control Data computers, I believe), APL, Xenix/Unix, one of which was licenced by Microsoft and even Radio Shack from, initially, AT&T.) I assume that Fortran and COBOL are in use somewhere?
Which computer and network service companies went national in 2007?
Masley And Associates was founded in 1987 by my father John Masley in Southern California. In 1994 I graduated from Network Engineer School with my CNE, CNA and MCSE and took over the business. We had one simple goal in mind: To offer seasoned, experienced, professional, certified network engineers and network administrators to local companies in Southern California and Southern Colorado at the same low cost as the less qualified "PC Geek" competition.
Business was well received when clients realized the amount of money and time they were saving using our experienced network engineers and network administrators over the PC technicians that they had been using with their previous IT support companies and the business grew.
Soon after customers were requesting Masley And Associates network engineers and network administrators in other states and in 2007 the company grew from MasleyAssociates.com which focussed on local companies in Southern California and Southern Colorado to MasleyAssociates.info Nationwide computer and network repair, sales, service, support and maintenance.
For more information on how we can provide your company with better IT support services than you have received in the past for the same cost contact Greg Masley CNE, CNA, MCSE at (719)649-7451 Greg@masleyassociates.com http://www.masleyassociates.com or http://www.masleyassociates.info
Probability search in data structure and algorithm?
manu_del In Probability Search , the list is ordered with most probable search element at the beginning of the list and least probable at the end.
Useful when a relatively small number of elements are the targets for most of the searches. To ensure that the probability ordering is correct over time, in each search we exchange the located element with the element immediately before it in the list.
This is a sample ProbabilitySearch program for a list of integers
INPUT:
list[] : reference of integer array
last : index of last item
target: target to be found
ref_locn: reference to the location of target
OUT:
If target is found
location of target is stored in ref_locn
found = 1 is returned
target is moved up in priority
Else
last is stored in ref_locn
found = 0 is returned
int ProbabilitySearch (int list[],int last, int target, int *ref_locn)
{
int looker = 1;
int found = 0;
int temp;
while(looker <= last && target != list[looker])
{
looker = looker + 1;
}
if(target == list[looker])
{
found = 1;
if(looker > 1)
{
temp = list[looker -1];
list[looker -1] = list[looker];
list[looker] = temp;
looker = looker -1;
}
}
else
found = 0;
*ref_locn = looker;
return found;
}
C plus plus program that display an employees name by entering an id?
Ideally you'd want to use a DBMS to store and retrieve the employee data, but we'll keep it simple and use some static data instead.
#include
#include
#include
#include
struct employee
{
std::string m_name;
unsigned m_id;
employee(std::string name, unsigned id): m_name(name), m_id(id) {}
};
std::vector
void load_data ()
{
employees.push_back (employee ("Alan", 1));
employees.push_back (employee ("Brian", 2));
employees.push_back (employee ("Charles", 3));
employees.push_back (employee ("David", 4));
employees.push_back (employee ("Eric", 5));
}
unsigned input_id (std::string prompt)
{
unsigned id = 0;
while (1)
{
std::cout< std::string input=""; getline (std::cin, input); std::stringstream ss (input); if (ss>>id) break; std::cout<<"Invalid input.\n"; } return (id); } employee* locate (unsigned id) { for (unsigned i=0; i { if (employees[i].m_id == id) return (&employees[i]); } return (NULL); } int main() { load_data (); unsigned id=0; do { if( id=input_id("Enter an employee ID (0 to exit)")) { if (employee* emp = locate( id )) std::cout< else std::cout<<"There is no employee with that ID.\n"< } } while( id ); std::cout< } Example output Enter an employee ID (0 to exit): 6 There is no employee with that ID. Enter an employee ID (0 to exit): 5 Eric Enter an employee ID (0 to exit): 2 Brian Enter an employee ID (0 to exit): 0
When signing up on on to a website what does characters mean?
The characters are like the letters of the alphabet, exclamation marks, dollars signs, etc, unless other wise specified. Everything I just wrote here are characters. "Use 6 to 8 Characters" would mean just type in a 6 or 8 letter word or random letters.
Alpha/Numeric would be letters and numbers like a password:.....answer22it.com......would be alpha/numeric.
List of the upcat 2008 passers?
You can find the list of UPCAT passers on the link below. I have also included a link for the waitlisting process if ever the one you're looking for is not in the list.
What is the difference between a compact computer and other computers?
There are quite a few differences between a compact computer and other computers. Compact computers are easier to take with you.
Passward is a password management system created by Matthew Ward Solutions. It basically allows your to never have to remember your password without worrying about identify theft.
View the related links for the website.
Why are flowcharts usually used to describe algorithms instead of written descriptions?
Flowcharts are sometimes the preferred tool to describe an algorithm because a flowchart can visualize a simple algorithm effectively, or can outline the major steps in a more complex algorithm. In comparison with natural language prose, flowcharts tend to be less ambiguous.
It must be noted, however, that flowcharts are not suitable to visualize many types of algorithms. While natural language prose is not always a good alternative due to the inherent ambiguity (and the requirement that all readers need to understand the specific language), other languages, such as the language of mathematical notation, are often used to describe more complex algorithms.
The claim embedded in this question that flowcharts are usually used to describe algorithms is an incorrect claim.
Assuming the choices are:
A counter is a constant and 10 is a constant.
or
A counter is a constant.
I'd have to say that that makes no sense, since a constant is something that cannot be changed, and a counter changes every iteration. However, maybe they're teaching something different in school these days. However, I know for sure that 10 is a constant, since it is a defined real number who's value will never change (the number ten will always refer to having exactly ten of something, not eleven or nine.), so -
Since 10 is a constant:
"A counter is a constant and 10 is a constant" must be true.
Maybe repost it, if I'm misunderstanding the question?
How does Excess 64 and IEEE 754 floating point binary work?
First off, most computers use IEE 754, not excess 64 format. IBM System/360 computers use Base-16 Excess 64 format. If you're running a standard desktop computer chances are your computer uses IEEE 754.
In Base-16 Excess 64 - for single precision numbers, like floats - we use 4 bytes, or 32 bits. The first bit is the sign bit, followed by a 7 bit exponent, followed by the mantissa (or the significand). I assume you know how to convert numbers into binary. Let's convert 2.25 into excess 64.
1) Get the sign bit.
2.25 is positive so it's 0.
2) Write the number in binary.
2.25 = 10.01B
3) Move the radix (the decimal) in powers of 16 (4 bits - nibbles) until the number is less than 1 and greater than .03125 (or .00001B). In other words, we want the radix as close to the first 1 as possible, but the number has to be less than 1. When the number is stored like this it is said to be normalized.*
10.01 = .001001 * 161
4) Remove the decimal and add zeros to the end of the number until there are 24 bits. This is the mantissa.
0010 0100 0000 0000 0000 0000
5) Since this is excess 64 (the bias is 64), we add the exponent from step 3 to 64 and convert that to binary, which will be the exponent. In this case, the exponent of 16 was 1.
64 + 1 = 65 = 1000001B
6) Now we put it all together. Sign bit, then exponent, then mantissa.
0 1000001 001001000000000000000000
s e m
or in hex:
0x41 0x24 0x00 0x00
*Step 3 is a bit hard to follow, so here are more examples. If the number is .03125 (.00001B) we would move the radix right one nibble, so it would become .1 * 16-1. If the number was 37.5 (100101.1B) it would become .001001011 * 162
IEEE 754
As I mentioned in the beginning, real numbers are usually stored in IEEE 754, not excess 64. In IEEE 754 - for single precision, like floats - 1 bit is used for the sign bit, 8 bits are used for the exponent, and the last 23 bits are used for the mantissa. Also, in IEEE 754 the number is said to be normalized when it is between 1 and 2, the bias is 127 (as opposed to excess 64 where the bias is 64), and it is base-2. Let's convert 17.125.
1) Find the sign bit.
17.125 is positive so the sign bit is 0.
2) Write the number in binary.
17.125 = 10001.001B
3) Move the radix (the decimal) in powers of 2 (1 bit) until the number is between 1 and 2. When the number is stored like this it is said to be normalized.*
10001.001 = 1.0001001 * 24
4) The number is normalized (it is between 1 and 2), so the leading 0 is dropped. Only the floating portion is retained. Remove the decimal point and add zeros to the right until there are 23 bits. This is the mantissa.
0001 0010 0000 0000 0000 000
5) Add the exponent from step 3 (24 so the exponent is 4) to the bias, 127, and convert it to binary. This is the exponent.
127 + 4 = 131 = 10000011B
6) Now just put it all together. Sign bit, then exponent, then mantissa.
0 10000011 00010010000000000000000
s e m
or in hex:
0x41 0x89 0x00 0x00
*Step 3 is hard to follow, so here are two more examples of normailizing numbers:
12.5 = 1100.1B = 1.1001 * 23.
.125 = .001B = 1 * 2-3
Something to remember is that in memory numbers are stored low order first, then high order, so if you have a look at your memory, you will see the numbers in reverse. Here's a C++ code snippet to show that it works:
typedef unsigned char BYTE;
float fl = 17.125;
BYTE* pFl = (BYTE*)&fl;
for (int i= sizeof(float) - 1; i >= 0; i--)
cout << hex << "0x" << (unsigned)pFl[i] << ' ';
cout << endl;
outputs 0x41 0x89 0x00 0x00
C plus plus programme to count non-vowels in a file of test?
#include<iostream>
#include<fstream>
#include<string>
int main()
{
size_t count=0;
std::string vowels ("aeiouAEIOU");
std::ifstream ifs;
ifs.open ("test.txt", std::ios::in);
if (ifs.bad())
{
ifs.close();
std::cerr << "Invalid input file.\n" << std::endl;
return;
}
while (!ifs.eof())
{
char c = ifs.get();
if ((c>='a' && c<='z') (c>='A' && c<='Z'))
if (vowels.find (c) != vowels.npos)
++count;
}
ifs.close();
std::cout << "The file has " << count << " non-vowels.\n" << std::endl;
}
What is a one of a kind computer program developed for a particular company?
The program developed for the company(unversities) is like "online student registration".
How many binary sequences has 3 bitzi?
Assuming you're talking about bits, the answer is always "2 to the x power" where in this case x is 3.
This is obviously a homework question, so instead of giving you the answer, I'll give you the explanation.
In the case of 4 bits, you'd have 16 values possible. 8 bits would be 256.
If you consider a bit to be a digit where the lowest number is 0 and the highest number is 1, then there are 2 possible values a bit can be. In the case of decimal (your normal counting numbers), the lowest value is 0 and the highest is 9 which is a maximum of 10.
If you have 3 decimal digits, there are 1000 possible decimal sequences or combinations that those numbers can be. Starting at 000 and working up to 999.
So you can calculate that by saying 10 to the 3rd power or 10x10x10 is 1000.
If you're solving for 2, then you'd multiply by 2 instead of 10. For example if you had 5 binary digits, your biggest number will be 11111 which is 31 in decimal, which means 5 digits of binary can go from 00000 to 11111 or 0 to 31. Or 32 possible values.
You can calculate this easily by multiplying 2 five times. 2x2x2x2x2 = 32.
How do you write logic for palindrome numbers?
#include <stdio.h> int main() { int n, n1, rev = 0, rem; printf("Enter any number: \n"); scanf("%d", &n); n1 = n; /* logic */ while (n > 0){ rem = n % 10; rev = rev * 10 + rem; n = n / 10; } if (n1 == rev){ printf("Given number is a palindromic number"); } else{ printf("Given number is not a palindromic number"); } return 0; }
Write Shell programme to check number is perfect or not?
Write a shell program to test whether the given number is a perfect number or not.
#include#include
void main()
{
int n,s=0,i;
clrscr()
printf("s=");
scanf("%d",&n);
for(i=0;i
if(n==s)
printf("prfect");
else
printf("not");
getch();
}
How do you convert decimal numbers like 126 to binary?
The short answer is 1111110.
For my long answer, the following code example is a complete program that will take an integer as input and print out the corresponding binary value. Because I've coded it around being able to view all the bits of an int, small numbers will have quite a few leading 0s.
Code example:#include #include #define iBYTE_BITS 8 #define iINT_BITS (sizeof(int) * iBYTE_BITS) void vIntToBinary(int iNum, char *cpString); int main(int iArgc, char *acpArgv[]) { char acBinaryString[iINT_BITS + 1]; int iInputNum; if(iArgc != 2) { fprintf(stderr, "Please provide an integer argument.\n"); } else { iInputNum = atoi(acpArgv[1]); vIntToBinary(iInputNum, acBinaryString); printf("%d: %s\n", iInputNum, acBinaryString); } return 0; } void vIntToBinary(int iNum, char *cpString) { char cBit; for(cBit = iINT_BITS - 1; cBit >= 0; cBit--, cpString++) { *cpString = ((iNum >> cBit) & 1) + '0'; } *cpString = '\0'; }What is the meaning of cvv in computer language?
It has no meaning in computer language; CVV is a card validation value, the 3-digit value on the back of credit and debit cards. If CVV has any meaning within a computer program, it is user-defined. You will have to look at the declaration of the symbol and/or how it is used in order to determine its meaning.
