answersLogoWhite

0

What is case?

Updated: 12/8/2022
User Avatar

Wiki User

11y ago

Best Answer

CASE in an abbriviation for Computer-aided software engineering. CASE is the scientific application of a set of tools and methods to a software system which results in high-quality, defect-free, and maintainable software products. It also refers to methods for the development of information systems together with automated tools that can be used in the software development process.

User Avatar

Wiki User

11y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is case?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Engineering

When might you omit a break statement from the end of a case in a switchstatement?

You can omit the break statement at the end of a case whenever you want execution to flow into the next case, or when the case is the last case. For instance, if you wanted to test a character regardless of whether it was upper or lower case, you might use the following: void f(char c) { switch (c) { case 'a': // execution flows into next case... case 'A': // do something break; case 'b': // execution flows into next case... case 'B': // do something else } }


Write a java program using switch case to find zodiac signs?

Let's say you want a method which will determine if the given character is a vowel, consonant, or other (non-letter). // Will return a String representation of what the given character is: // "vowel" "consonant" or "other" public static final String getTypeOfChar(final char c) { // since chars are an integer data type in Java, we can switch on them switch(c) { case 'a': // all of these cases "fall through" to the next non-case statement case 'e': // if any of them matches case 'i': case 'o': case 'u': return "vowel"; case 'b': // again, all of these cases fall through case 'c': case 'd': case 'f': case 'g': case 'h': case 'j': case 'k': case 'l': case 'm': case 'n': case 'p': case 'q': case 'r': case 's': case 't': case 'v': case 'w': case 'x': case 'y': case 'z': return "consonant"; default: // if we have no matches yet, do this return "other"; } }


Write program to convert a string in lower case without using library function?

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.


What does CASE stands for related to agriculture?

It doesn't stand for anything. Case is not an acronym, it is just a company name for a farm machinery dealership just like that of John Deere, New Holland, Massey Ferguson, etc. However, the name Case IH stands for Case International Harvesters. The name "Case" comes from the man who founded the Case company, Jerome Increase Case. Case became Case IH when International Harvester company merged with Case a number of years later.Another vague possibility is the Clean Air, Sustainable Environment initiative.


What is the worst case and best case of bubble sort?

There is no worst case for merge sort. Each sort takes the same amount of steps, so the worst case is equal to the average case and best case. In each case it has a complexity of O( N * log(N) ).