What program in Turbo C that determines whether the input is vowel or consonant letter?
#include<stdio.h>
main()
{ char ch;
clrscr();
gotoxy(5,3); printf("*Identification of Consonant and Vowel letter*");
gotoxy(5,5); printf("*Please input a letter from A-Z in order to determine");
gotoxy(5,6); printf("if it is a CONSONANT or a VOWEL*");
gotoxy(5,8); printf("Enter a Letter: "); scanf("%c",&ch);
gotoxy(5,10); printf("Letter %c is a ",ch);
switch(ch)
{ case 'A':
case 'a':
case 'E':
case 'e':
case 'I':
case 'i':
case 'O':
case 'o':
case 'U':
case 'u': printf("VOWEL."); break;
default: gotoxy(5,10); printf("Letter %c is a CONSONANT.",ch); }
gotoxy(5,15); printf("Thanks you for trying this!"); getch();
}
How do you reverse a given string without using string functions?
1.take while loop in which u continue up to null in array of string.
2.once u get null pointer then take a new array of same length.
3.when u get null there ll save position no in variable i.
4.take while loop i to 0;
5.and j=0 for new array.
6.in above loop copy old array to new array in each cycle of loop.
7.j++;
8.u ll get reverse of string.
u(t)-u(-t)=sgn(t)
How do you write a program that outputs a given characters in reverse?
write the javascript code to display the reverse no. of given no. (e.g. 247 reverse of 742)
How did the compilers of hadis muhaddisin judge between acceptable and unacceptable hadis?
Compilers ensured that there was no conflict between the Hadith and the teachings of the
Qur'an, i.e. both the Qur'an and Hadith were in conformity and taught the same lessons. It
could be added that they compared the body (matn) of the Hadith with reason, the Qur'an
and other Hadiths to ensure that they agreed with the primary Islamic teaching. Answers
could be further elaborated to state that they ensured the chain of transmitters (isnad) was
unbroken and that the transmitter was a person of sound mind, good memory and upright
character. Examples of collectors going about their work could be given to answer
You want many conditions to be satisfied for a single while loop how can you do it?
You can put as many conditional tests as you want in the while loop conditional location.
As a rule, however, it is a better idea to simplify the conditions as much as possible so that the reader of the code has a better understanding of what is being accomplished.
Once you start putting multiple conditions in a while loop with ANDs and ORs together, the logic can get complex and not well understood.
How does biconditional statement different from a conditional statement?
a condtional statement may be true or false but only in one direction
a biconditional statement is true in both directions
Advantage and distadvantage in hash table?
ANSWER A hash table is a way to find data in an array, when you have a known key and an unknown value that corresponds to the key. You use a hashing function on the key to create an index into the hash table containing the value. In the ideal case, this directly returns the corresponding value. In the usual case, a collision can occur. This means that the hashed key points to multiple possible values. A hash table is usually used on large arrays that would take a long time to search using other methods. A hash table can be very fast and use very little memory, and does not require the array to be sorted. The source code is slightly more complicated than some search methods. With a poorly designed hashing function when the hashed keys do not correspond one-to-one with the values, the secondary search after a hash collision can take a large amount of time.
How can you accept sum and print numbers without creating variables?
It is very easy.
The program begins here.....
/*Program to sum and print numbers without creating variables*/
#include<stdio.h>
main()
{
clrscr();
printf("%d+%d=%d",5,2,5+2);
getch();
}
/*Program ends here*/
Now just by changing the numbers in the "printf" statement we can add, subtract, multiply and divide the numbers without using variables.
Hence the problem is solved..........
C program to find the largest and smallest of three numbers using IF IF ELSE?
#include<stdio.h>
#include<conio.h>
void main()
{
int a,b,c;
clrscr();
printf("Enter any three numbers");
scanf("%d%d%d",&a,&b,&c);
if(a>b&&a>c)
printf("A is greatest");
else if(b>a&&a>c)
printf("B is greatest");
else if(c>a&&c>b)
printf("C is greatest");
if(a<b&&a<c)
printf("A is smallest");
else if(b<a&&b<c)
printf("B is smallest");
else if(c<a&&c<b)
printf("C is smallest");
getch();
}
What is TRACERT and when is it function?
Short for traceroute: it is a utility program to check IP-routing.
When you start it, e.g: tracert www.ibm.com
What is d command for square root in C programming in Linux?
No commands in C; the name of function sqrt is sqrt (include math.h; and use -lm at linkage)
Why in Access can you not set an index to an OLEobject?
You use OLE Object fields to insert documents (Word, PDF, bitmap images, etc) into records. The OLE Object itself is actually a binary data field and the only way to compare any two OLE Objects is to compare the binary data itself. This makes no sense because we normally compare documents by type, size, author, title, creation date, last modified date, and so on, we don't compare their physical representations (the binary data itself). If we want to sort documents, we must extract the properties we wish to sort by and insert them as separate fields in our records, and use those fields as our index/sort keys.
Sometimes we really do need to use binary data as a sort key, but we cannot use an OLE Object to store that data because OLE Objects cannot be used as sort keys. Instead, we must use the built-in binary data field which can be indexed and sorted. Binary data fields can be fixed-length (binary) or variable length (varbinary). Note that OLE Objects are variable length with a theoretical limit of 1 GB, which is yet another reason why they are unsuitable for indexing. The fixed-length binary field has an upper limit of 510 bytes, making it ideal for indexing and sorting small amounts of binary data.
Unfortunately, the built-in binary data fields cannot be created using the table designer for no practical reason other than Microsoft decreed that you couldn't. Instead you must use DDL or VBA/DAO. Using DDL, the following will create a binary and a varbinary field. For completeness, I've also included an OLE Object field:
CREATE TABLE tblBinTestSQL (
Id counter NOT NULL PRIMARY KEY,
VarbinaryColumn varbinary(100) NULL,
BinaryColumn binary(100) NULL,
OLEColumn Longbinary NULL
);
Here's the VBA/DAO method of achieving the same thing:
Public Sub CreateBinaryColumns()
Dim td As DAO.TableDef
Dim db As DAO.Database
Dim fd As Field
Set db = CurrentDb
Set td = db.CreateTableDef("tblBinTestDAO")
Set fd = td.CreateField("ID", DataTypeEnum.dbLong)
fd.Attributes = fd.Attributes Or dbAutoIncrField
td.Fields.Append fd
Set fd = td.CreateField("BinaryColumn", DataTypeEnum.dbBinary, 100)
fd.Attributes = fd.Attributes Or dbFixedField
td.Fields.Append fd
Set fd = td.CreateField("VarbinaryColumn", DataTypeEnum.dbBinary, 100)
td.Fields.Append fd
Set fd = td.CreateField("OLEColumn", DataTypeEnum.dbLongBinary)
td.Fields.Append fd
db.TableDefs.Append td
End Sub
Once you have at least one table with a binary or varbinary field, you can simply copy that field to other tables. You can also modify the properties of those fields in table designer; you just can't use table designer to create those fields.
How do you convert the hexadecimal number ff to binary?
Any base that is itself a power of 2 is easily converted to and from binary. With base 4, each digit represents 2 bits. With base 8 (octal), each digit represents 3 bits. And with base 16 (hexadecimal), each digit represents 4 bits. Thus two hexadecimal digits represent an 8-bit binary value. This is convenient because we typically refer to a unit of computer memory as an 8-bit byte, thus every byte value can be represented using just 2 hex digits. If we had a system with a 9-bit byte we'd use 3 octal digits instead. A 24-bit value can either be represented using 6 hex digits or 8 octal digits.
To convert a hexadecimal value to binary, we simply consult the following table (note that 0x is the conventional prefix for a hexadecimal value):
hex = binary
0x0 = 0000
0x1 = 0001
0x2 = 0010
0x3 = 0011
0x4 = 0100
0x5 = 0101
0x6 = 0110
0x7 = 0111
0x8 = 1000
0x9 = 1001
0xA = 1010
0xB = 1011
0xC = 1100
0xD = 1101
0xE = 1110
0xF = 1111
Here, hexadecimal digit 0xF has the binary value 1111, thus 0xFF would be 11111111. Note that the bit patterns are in the same order as the hexadecimal digits. Thus 0x0F becomes 00001111 and 0xF0 becomes 11110000.
Knowing this, we can easily convert binary values into hexadecimal, we simply divide the binary value into groups of 4 bits and convert each group to the corresponding hex digit. Thus 101101001100 becomes B4C (1011=B, 0100=4 and 1100=C). If there aren't enough bits, we simply pad the first group with leading zeroes.
We can use a similar technique to convert between octal and binary, we simply divide the bits into groups of 3:
octal = binary
00 = 000
01 = 001
02 = 010
03 = 011
04 = 100
05 = 101
06 = 110
07 = 111
Note that a leading 0 is the conventional prefix for octal values. Thus binary value 100010 would be written 042 in octal to avoid confusion with 42 decimal.
What is a flow void seen in the brain?
A flow void in the brain refers to an area on an MRI scan where blood flow is absent or significantly reduced, typically seen in blood vessels. This phenomenon is often characterized by a dark appearance on T2-weighted images, indicating the presence of high-velocity blood flow or the absence of blood in certain regions. Flow voids are commonly associated with normal vascular structures, such as arteries and veins, but can also indicate pathological conditions, such as vascular occlusions or malformations. Identifying flow voids is crucial for diagnosing various neurological conditions.
Structured Packing ----www.rubbersealing.com
Gauze structured packing from T.C.I is recognized worldwide as the leader in applications with low liquid-loading systems or temperature-sensitive compounds. Vacuum distillations, specialty chemicals, and many highly refined, value-added processing operations also benefit from gauze packing efficiency-improving capabilities.
Koch-Glitsch wire gauze packing is the most efficient commercial tower packing available on the market today. Koch-Glitsch wire gauze packing has a proven track record of providing superior performance in thousands of diverse applications around the world. Koch-Glitsch Mass Transfer Technology has more than 85 years of combined experience. Our process and design expertise, coupled with superior manufacturing and pilot plant test facilities, provide Koch-Glitsch customers with solutions to mass transfer problems.
The packing is fabricated from sheets of metal gauze. Type BX gauze structured packing, with 500 m2/m3 specific surface area, is manufactured using the same geometric configuration as FLEXIPAC® packing. For even higher requirements, Type CY gauze packing with 750 m2/m3 specific surface is available.
Matching this high-efficiency packing with our custom-designed internals offers our customers complete systems engineered to maximize tower performance.
Features: for Gauze structured packing
Hgih number of theoretical plate, best loading factor 1.5-2m/s, min. liquid load 0.2m3/m2.h。
Materials: for Gauze structured packing
stainless steel, carbon steel, 304, 316L, phosphor bronze etc. Upon clients' request.
Spec. for Gauze structured packing
Does a subprogram always return a value to the program or subprogram that calls it?
No. In some languages PROCEDUREs don't return a value, FUNCTIONs do; in C (and derivatives) return-type void means no return value. Example:
void Hello (const char *msg) { puts (msg); }
Write a program to print following series 1 01 010 1010 .?
Program to print one & zero Alternatively
#include
#include
void main()
{
int i,j,n,k=1;
clrscr();
printf("Enter the Iteration Value : ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
{
printf("%d",k);
if(k==1)
k=0;
else
k=1;
}
printf("\t");
}
getch();
}
Output :
Enter the Iteration Value : 5
1 01 010 1010 10101