0
C Programming
Questions related to the C Computer Programming Language. This ranges all the way from K&R to the most recent ANSI incarnations. C has become one of the most popular languages today, and has been used to write all sorts of things for nearly all of the modern operating systems and applications. It it a good compromise between speed, power, and complexity.
9,649 Questions
== == The simplest way to that is using quillpad site. Not only Punjabi but you can type in 10 other languages on that site. www [dot] quillpad [dot] in
To type in Punjabi, perhaps go to the TypeWithNoKeys Express World Wide Web site, select Punjabi (in the list titled "Language Sections"), and select a Symbol Subset. Then note the instructions displayed.
If you have related questions (for example, "How do you make your computer screen display Punjabi properly?") or need related training, perhaps you might e-mail to the e-mail address at the bottom of the pages at that Web site.
TypeWithNoKeys can be used with various languages. These tips might be helpful:
- How do you use TypeWithNoKeys?
At
TypeWithNoKeys Express
Internet: http://mythanks.tripod.com/typewithnokeys/tnke.htm
select the preferred language in the Language Sections,
select from the Symbol Subsets,
select the characters that you want, and then
paste - into
- your word-processing document,
- your e-mail message,
- your drawing,
- your signage or greeting, or
- other destinations
You can also use a major Internet search engine to find:
TypeWithNoKeys
Thanks!
Bar.
Terms
Product, brand, and trade names in this and future communications may be trademarks or registered trademarks of their respective owners. Barry G. Wong and the Equinet Broadcasting Network shall not be liable for any errors, omissions, or lack of appropriateness, timeliness, or accuracy in, for your use of or your inability to use, or for any other aspect or matter relating to this or related communications.
Barry Wong
Web: http://mythanks.tripod.com/
Try this http://www.shriwaheguru.com/punjabi_keyboard.html.
What is the purpose of using modulo 2 arithmetic rather than binary arithmetic in computing an FCS?
Any arithmetic process would work provided it is applied the same way in the forward
and reverse process. Modulo 2 is easy to implement in hardware.
How to write a c plus plus program to multiply matrices using function template?
#include<iostream>
#include<algorithm>
#include<cassert>
unsigned multiply_recursive (unsigned a, unsigned b)
{
if (!a !b) return 0; // Note: not(a) or not (b)
if (a==1) return b;
if (b==1) return a;
return a + multiply_recursive (a, --b);
}
unsigned multiply_iterative (unsigned a, unsigned b)
{
int product = 0;
int x = std::min (a, b);
int y = std::max (b, a);
while (x--)
product += y;
return product;
}
int main()
{
unsigned x, y;
// Test all combinations with 0.
x = multiply_recursive (0, 0);
assert (x==0);
x = multiply_iterative (0, 0);
assert (x==0);
x = multiply_recursive (0, 1);
assert (x==0);
x = multiply_iterative (0, 1);
assert (x==0);
x = multiply_recursive (1, 0);
assert (x==0);
x = multiply_iterative (1, 0);
assert (x==0);
// Test non-zero values with 1.
x = multiply_recursive (1, 42); // inefficient: lowest value must be on right (fewer recursions).
y = multiply_iterative (1, 42);
assert (x==42 && y==42);
x = multiply_recursive (42, 1);
y = multiply_iterative (42, 1);
assert (x==42 && y==42);
// Test other non-zero values are commutative.
x = multiply_recursive (24, 42); // inefficient: lowest value must be on right (fewer recursions).
y = multiply_iterative (24, 42);
assert (x==1008 && y==1008);
x = multiply_recursive (42, 24);
y = multiply_iterative (42, 24);
assert (x==1008 && y==1008);
}
What type of transmission do burst errors occur?
In burst error, it is not necessary that only consecutive bits are changed. The length of burst error is measured from first changed bit to last changed bit. As shown in fig. length of burst error is 8, although some bits are unchanged in between. Burst error is most likely to occur in a serial transmission. The noise occurring for a longer duration affects multiple bits. The number of bits affected depends on the data rate & duration of noise. For e.g. if data rate is 1 kbps, a noise of 1/100 second can affect 10 bits.
Why structure variables cannot be compared?
They can be compared with memcmp, but you should be careful if your structures contain:
- pointers
- alignment gaps
- numeric variables (byte order!)
- nested structures/unions
What happened to b j Armstrong?
As per I Know Benjamin Roy "B. J." Armstrong, Jr. (born September 9, 1967) is a retired American professional basketball player.
Later he endeavors. B J Armstrong stepped into Chicago's front office as a special assistant to Vice President of Basketball Operations Jerry Krause. Having replaced Paxson as the Bulls' starting point guard years before, Armstrong was himself replaced by Paxson as hire to the GM job in Chicago when Krause resigned in 2003. Armstrong remained with the organization as a scout for a couple of seasons, leaving in 2005.
He was employed by ESPN as a basketball analyst in recent years for the 'NBA Fast Break' television series. Since 2006 he has also been employed by Wasserman Media Group, a sports marketing and representation group out of Los Angeles, California representing professional athletes and other entertainers.
He currently serves as an agent for Bulls point guard Derrick Rose, who was the first player selectedin the 2008 NBA Draft.
How do you write a program to check the string of a given grammar?
#include<stdio.h>
#include<conio.h>
#include<string.h>
void main()
{
char string[50];
int flag,count=o;
clrscr();
printf("The grammar is: S->aS, S->Sb, S->ab\n");
printf("Enter the string to be checked:\n");
gets(string);
if(string[0]=='a')
{
flag=0;
for(count=1;string[count-1]!='\0';count++)
{
if(string[count=='b'])
{
flag=1;
continue;
}
else if((flag==1)&&(string[count]=='a'))
{
printf("The string does not belong to the specified grammar");
break;
}
else if(string[count=='a'])
continue;
else if(flag==1)&&(string[count]='\0'))
{
printf("The string accepted");
break;
}
else
{
printf("String not accepted");
}
getch():
Yes.
A Bank of England 196? Five Pound note (Series C - blue)(Chief Cashier J.S. Fforde - serial Z93), uncirculated and in absolute mint condition could fetch anything up to £35 GBP. If it has been circulated but still in good condition, it might fetch anything up to £15 GBP.
A reputable coin dealer will be able to give a more accurate valuation.
How do you draw a flow chart to find the average of three numbers?
Sum = Sum + first number
Sum = Sum + second number
Sum = Sum + third number
Average = 1/3 x Sum
What is the need for another oops language java instead of c?
actually the c language is the procedure based language n emphasis on the procedure. on tyhe other hand the java is object oriented lannguage,emphasis on the data and it's importance.
Refinement
Java is platform independent language and it made it more popular in creating embedded system. As its bytecode can be transferred to any platform so there was no need to implement compiler in the embedded system but JVM(a runtime systme) was required to be installed in embedded software.
Moreover the runtime was also reduced as it was not required to be compiled again.
http:\\in-central.blogspot.com
Best bet is to do your research on the internet. As of this writing, I'm not aware of any that have Guide Plus as part of their programming. Strange though it may sound, I have it on my computer as it was supplied by the video card manufacturer. Update: The "LiteOn LVW-5045 DVR" uses Guide Plus. Here is a list of the products that use the Guide Plus service: http://www.europe.guideplus.com/En/our_service/models.html Note: There are DVRs and DVD-Rs in this list in addition to VCRs.
What is the prototype of scanf in c programmin?
int scanf(char* format, ...);
the format accepts the format specifier string, the elipsis operator accepts the variable list
scanf("var type var type ...", &var, &var, ...);
example:
int num1, num2, num3;
scanf("%d %d %d",&num1,&num2,&num3);
Is that what you were looking for?
Maybe this can help also...
What keyword is using to create objects?
In C# and Visual Basic.NET the keyword is "new". C doesn't have such an animal, but you generally use the library call to malloc to get new memory.
Write a c or c plus plus program to print first 50 odd numbers using do while loop?
unsigned count = 0;unsigned num=1;
do {
std::cout << num << std::endl;
num +=2;
} while (++count<50);
Program to find largest and smallest element in a matrix and print its position using c language?
#include
using std::cin;
using std::cout;
using std::endl;
void setData(double data[], const int& dataSize);
void min(const double data[], const int& dataSize);
void max(const double data[], const int& dataSize);
int main()
{
const int numberOfElements = 6;
double myArray[numberOfElements] = {0.0};
cout << endl << "Enter " << numberOfElements << " elements of your array" << endl;
setData(myArray, numberOfElements);
min(myArray, numberOfElements);
max(myArray, numberOfElements);
cout << endl;
system("PAUSE");
return 0;
}
void setData(double data[], const int& dataSize)
{
for (int i(0); i < dataSize; i++)
{
cout << (i + 1) << " element: ";
cin >> data[i];
}
}
void min(const double data[], const int& dataSize)
{
int minValPos(0);
double minVal = data[0];
for (int i(0); i < dataSize; i++)
{
if (minVal > data[i])
{
minVal = data[i];
minValPos = i;
}
}
cout << endl << "Minimum value is: " << minVal
<< " its position is: " << minValPos << endl;
return;
}
void max(const double data[], const int& dataSize)
{
int maxValPos(0);
double maxVal = data[0];
for (int i(0); i < dataSize; i++)
{
if (maxVal < data[i])
{
maxVal = data[i];
maxValPos = i;
}
}
cout << endl << "Maximum value is: " << maxVal
<< " its position is: " << maxValPos << endl;
return;
}
What is the sunny number program in c?
A "sunny number" is a whole number, n, such that the square root of n+1 is a whole number.
#include<stdio.h>
#include<math.h> // for sqrt
bool is_sunny (int n) {
int s = sqrt (++n);
return s*s==n;
}
int main (void) {
// print sunny numbers in the half-closed range [0:100)
for (int n=0; n<100; ++n) {
if (is_sunny (n)) {
printf ("%d is a sunny number\n");
} else {
printf ("%d is not a sunny number\n");
}
}
return 0;
}
How c stores a float value in 4 bytes of float variable?
You should not concern yourself with the internal bit representation of a floating point variable, because that is an implementation specific thing. Writing code that depends on the internal format is certainly not-portable, and possibly dangerous.
That said, many implementations use the IEEE 754-2008 format. The binary32 format has 1 sign bit, 8 exponent bits, and 23+1 mantissa bits for a total of 32 bits.
The sign bit is 0 for positive and 1 for negative.
The exponent is in excess 128 format, which means that it is biased by 128. Simply put, a value of 011111112 means "mantissa x 21".
The mantissa is the binary fraction, i.e. the binary point is to the left of the first bit. It is normalized, meaning that it is left or right shifted until the high order bit is 1, placing its value in the range [0.5, 1.0). Since the high order bit is one, it is left shifted again, and the high order bit is not stored, i.e. it is assumed, giving one more bit of precision. That is why the exponent appears to be excess 127 instead of excess 128.
If the number is actually zero, then all of the bits are zero. There are some reserved bit patterns for special numbers, such as invalid, positive infinity, and negative infinity.
In the Intel format, the order of the bytes are reversed, with the low order mantissa first, and the sign/first exponent byte last.
Again, all of this is an implementation specific thing, and should not be depended on.
What are source language issues in run time environment?
The allocation of data objects is managed by the run-time support package, consisting of routines loaded with the generated target code. The design of run-time support package is influenced by the semantics of procedures. Each execution of the procedure is referred to as an activation of the procedure. If the procedure is recursive several of its activations may be alive at the same time.
Source Language IssuesProceduresA procedure definition is a declaration that, in its simplest form, associates an identifier with a statement. The identifier is the procedure name, and the statement is the procedure body. Procedures that return values are called function in many languages; however, it is convenient to refer them as procedures. A complete will also be treated as a procedure.When a procedure name appears within an executable statement, we say that the procedure is called at that point. The basic idea is that a procedure call executes the procedure body.
Some of the identifiers appearing in a procedure definition are special, and are called formal parameters (or just formals) of the procedure. Arguments known as actual parameters may be passed to a called procedure they are substituted for the formals in the body.
Activation TreesWe make the following assumptions about the flow of control among procedure during the execution of a program:
- Control flows sequentially, that is, the execution of a program consists of a sequence of steps, with control being at some point in the program at each step.
- Each execution of a procedure starts at the beginning of the procedure body and eventually returns control to the point immediately following the place where the procedure was called. This means the flow of control between procedures can be depicted using trees.
Each execution of a procedure body is referred to as an activation of the procedure. The lifetime of an activation of a procedure p is the sequence of steps between the first and last steps in the execution of the procedure called by them and so on. In general the term "lifetime" refers to a consecutive sequence of steps during the execution of a program.
If a, b are procedure then their lifetimes are either non-overlapping or are nested. That is if b is entered before a, is left then control must leave b before it leaves a. this nested property of activation lifetime can be illustrated by inserting two print statements in each procedure one before the first statement of the procedure body and the other after the last. The first statement prints enter followed by the name of the procedure and the values of the actual parameters; the last statement prints leave followed by the same information.
A procedure is recursive if a new activation can begin before an earlier activation of the same procedure has ended. A recursive procedure need not call itself directly; p may call another procedure q, which may then call p through some sequence of procedure calls. We can use tree, called an activation tree, to depict the way control enters and leaves activations. In an activation tree,
1. Each node represents an activation of a procedure,
2. The root represents the activation of the main program,
3. The node for a is the parent of the node for b if and only if the control flows from activation a to b, and
4. The node for a, is to the left of the node for b if and only if the lifetime of a, occurs before the lifetime of b.
Since each node represents a unique activation and vice versa it is convenient to talk of control being at a node it is in the activation represented by the node.
Control Stacksthe flow of control in a program corresponds to a depth-first traversal of the activation tree that starts at the root ,visits a node before its children, and recursively visits children at each node left to right order. the output in fig 7.2 can therefore be reconstructed by traversing the activation tree in fig7.3,printing enter when the node for an activation is reaches for the first time and printing leave after the entire sub tree of the node has been visited during the traversal.
We can use a stack, called a control stack to keep track of live procedure activations. The idea is to push the node for activation onto the control stack as the activation begins and to pop the node when the activation ends.
Then the contents of the control stack are related to the paths to the root f the activation tree. When the node n is at the top of the control stack, the stack contains the nodes along the path from n to the root.
Example 7.2:fig 7.4 shows nodes from the activation tree of fig 7.3 that that have been reached when control enters the activation represented by q(2,3).Activations with labels r, p(1,9),p(1.3),and q(1,0) have executed to completion, so the figure contains dashed lines to their nodes. The solid lines mark the path from q (2, 3) to the root.
At this point the control stack contains the following nodes along this path to the root (the top of the stack is to the right)
s, q(1,9),q(1,3),q(2,3) and the other nodes.
The Scope of a Declaration
A declaration in a language is a syntactic construct that associates information with a name. Declarations may be explicit, as in the Pascal fragment
Var i : integer;
Or they may be explicit. For example, any variable name starting with I is or assumed to denote an integer in a FORTRAN program unless otherwise declared.
There may be independent declarations of the same name in the different parts of the program. The scope rules of a language determine which declaration of a name applies when the name appears in the text of a program. In the Pascal program in fig 7.1, i am declared thrice, on lines 4, 9 and 13, and the users of the name i in procedures read array, partition and quick sort are independent of each other. The declaration on line 4 applies to uses of i on line 6.tht is, the two occurrences of i on the line 6 are in the scope of the
The portion of the program to which a declaration applies is called the scope of the declaration applies is called the scope of the declaration .An occurrence of a name in a procedure is called to be local to the procedure if it is the scope of a declaration within the procedure; otherwise, the occurrence is said to be non-local.
The distinction between local and the non-local names carries over to any syntactic construct that can have declarations within it.
While the scope is a property of the declaration of a name, it is sometimes convenient to use the abbreviation "the scope of a name x" for "the scope of the declaration of name x that applies to this occurrence of x". In this sense, the scope of ion line 17 in fig7.1 is the body of quick sort. At compile time, the symbol table can be to find the declaration that applies to an occurrence of a name. When a declaration is seen, a symbol table entry is created for it. As long as we are in the scope of the declaration, its entry is returned when the name in it is looked up. Symbol tables are discussed in section 7.6a
Write a C program to implement excelp system call?
You are not able to do that, but you can write a program, that uses the system-call.
/* exectest.c */
#include
int main (void)
{
execlp ("/bin/ls", "ls", "-ld", ".", NULL);
return 0;
}
Some solved question of array in C programming?
Q: What is the very first element of array 'argv' is good for?
A: It contains the name of the actual program. Try it: printf ("I am '%s'\n", argv[0]);
What is the algorithm for finding largest and smallest of given number?
To find the largest number: Assume (temporarily) that the first number is the largest number. You might call this the "largest number found so far". Then, for each number after the first one, compare the number with the largest number found so far. If the new number in the list is larger, call that one the "largest number found so far". Repeat for each number. After processing all the numbers, the "largest number found so far" will simply be the largest number.For example, if your list is (5, 2, 8, -1), you start assuming that 5 (the first number in the list) is the largest number. You compare with 2 - "5" is still the largest number, since 2 is smaller. When you compare with 8, you find that 8 is larger, so you replace your "largest number" with 8. "-1" is smaller, so nothing changes. Since we processed the entire list, the largest number is now 8.
You can do the same - mutatis mutandis - to find the smallest number.
Compute the Number of seconds in a year in c program?
int main (void) { printf ("%ld\n", 365L*24*60*60); }
or
int main (void) { printf ("%ld\n", 366L*24*60*60); }
C program to solve the given array element in descending order?
- #include
- #include
- int main()
- {
- long int sort[10],i,j,t;
- printf("\n\ n Enter 10 Elements In Array To Sort In Descending Order:\n"); for(i=0;i<10;i++)
- scanf("%ld",&sort[i]);
- for(i=0;i<10;i++)
- for(j=i+1;j<10;j++)
- if(sort[i]>sort[j])
- {
- t=sort[i]; sort[i]=sort[j];
- sort[j]=t;
- }
- printf("Array Elements in Descending Order Are :");
- for(i=9;i>=0;i--)
- {
- printf("%ld\n",sort[i]);
- }
- getch();
- return 0;
- }
How do you respond to an interruption?
respond appropriately like excuse/pardon me, I haven't finish my point, or I'm interested in what you have to say, but may I finish my thought?, or Just a moment, please, and I'll be finished.
