C Programming

void print_fib (unsigned terms) {

unsigned f1 = 0; // the first term

unsigned f2 = 1; // the second term

while (terms--) {

std::cout<<f1<<std::endl;

unsigned f3 = f1 + f2; // the next term

f1 = f2; // shift the terms for the next iteration

f2 = f3;

}

}

Example: WIHLE instead of WHILE

It is not certain if the question asked to convert lower case to upper case, or upper case to lower case. This answer assumes the latter. You could easily change this around for the former.

ConvertToLower (char*psz) {

while (*psz != '\0') {

switch (*psz) {

case 'A': *psz = 'a'; break;

case 'B': *psz = 'b'; break;

case 'C': *psz = 'c'; break;

case 'D': *psz = 'd'; break;

case 'E': *psz = 'e'; break;

case 'F': *psz = 'f'; break;

case 'G': *psz = 'g'; break;

case 'H': *psz = 'h'; break;

case 'I': *psz = 'i'; break;

case 'J': *psz = 'j'; break;

case 'K': *psz = 'k'; break;

case 'L': *psz = 'l'; break;

case 'M': *psz = 'm'; break;

case 'N': *psz = 'n'; break;

case 'O': *psz = 'o'; break;

case 'P': *psz = 'p'; break;

case 'Q': *psz = 'q'; break;

case 'R': *psz = 'r'; break;

case 'S': *psz = 's'; break;

case 'T': *psz = 't'; break;

case 'U': *psz = 'u'; break;

case 'V': *psz = 'v'; break;

case 'W': *psz = 'w'; break;

case 'X': *psz = 'x'; break;

case 'Y': *psz = 'y'; break;

case 'Z': *psz = 'z'; break;

}

psz++;

}

Warning. Do not be tempted to replace the switch statement with ...

if (*psz >= 'A' && *psz <= 'Z') *psz += 32;

... because that will only work on ASCII implementations, and it is most definitely not portable, such as in EBCDIC implementations.

Recursion is what it's called when a function calls itself. When a function calls itself immediately before returning, it's called tail recursion. Tail recursion can be more efficiently written as iteration. In fact a good compiler will recognize tail recursion and compile it as iteration.

There is no such thing as left or right recursion in C programming.

comment n' critisize constructive criticism command and conquer Computer Numerical Control

The role of the data structure in compiler designer is to take an input of a program written in another language and produce an output in another language. It also performs error detection.

Vendor Account, Bank Account

dvd gives better quality...!

No, the int variable uses less memory, and therefore it is preferable to use an int rather than a double where you can.

A boolean variable uses even less memory, but obviously is useful only in limited circumstances.

Yes, please do.

FORTRAN is a third generation language.

Note: I don't know what these generations are, but I'm quite sure that Fortran is one of the oldest high-level programming languages, as are Cobol and Algol.

2. Write a program using switch statement that reads a character representing a geometrical figure, then asks the user to enter the required data (ex. Radius for a circle, length and height for a rectangle, etc. ...) . The program should then print the area and circumference.
Figures are: circle(c), square(s), rectangle(r), triangle (t).

This is not a question, this is your homework.

For a start, read this: https://en.wikipedia.org/wiki/Eight_queens_puzzle

Counting from the right, group the binary into groups of 4. If you are left with less than 4 binary digits, then add preceding zeros.

Then recode each quartet as follows:

0000 = 0 0001 = 1 0010 = 2 0011 = 3

0100 = 4 0101 = 5 0110 = 6 0111 = 7

1000 = 8 1001 = 9 1010 = A 1011 = B

1100 = C 1101 = D 1110 = E 1111 = F

The simplest way is to add a loop around the ask-for-the-number, show-the-table routine. In pseudocode:

while (1) { ask-for-the-number; show-the-table; }

Not possible to write one here (too complex). Look for a commercial program to do this.

long *longPtr;

Terminate and Stay Resident (TSR) programs are a DOS concept, not a Windows concept.

garbage collection

If necessary, pad the value with zeroes so the number of bits is an exact multiple of 3. Then divide the binary value into groups of 3 bits. Convert each group to its corresponding octal digit as follows:

Bin = Oct

000 = 0

001 = 1

010 = 2

011 = 3

100 = 4

101 = 5

110 = 6

111 = 7

Example 1:

16-bit value: 1011101101100011

3-bit groupings: (00)1 011 101 101 100 011

Octal digits: 1 3 5 4 3

Octal value: 13543

Example 2:

24-bit value: 010111011010010101011010

3-bit groupings: 010 111 011 010 010 101 011 010

Octal digits: 2 7 3 2 2 5 3 2

Octal value: 27322532

There are no methods in C, and you should have only one main function.
Methods are associated with a specific class, and there are no classes in c.

The simplest solution is to use a std::set<size_t> sequence container to store the values as they are input. Duplicate entries are ignored automatically, thus when all 5 numbers have been input, the set will have at least 1 number but no more than 5. Thus the size of the set represents the count of distinct values that were input.