-
What is a modulus operator? What are the restrictions of a modulus operator?
A Modulus operator gives the remainder value. The result of x%y is obtained by(x-(x/y)*y). This operator is applied only to integral operands and cannot be applied to float or double.
-
-
-
-
-
-
-
What is the quickest searching method to use?
A binary search, such as bsearch() performs, is much faster than a linear search. A hashing algorithm can provide even faster searching. One particularly interesting and fast method for searching is to keep the data in a “digital trie.” A digital trie offers the prospect of being able to search for an item in essentially a constant amount of time, independent of how many items are in the data set....
-
If the program (myprog) is run from the command line as myprog 1 2 3 , What would be the output? main(int argc, char *argv[]) { int i; for(i=0;i<argc;i++) printf("%s",argv[i]); } a) 1 2 3 b) C:MYPROG.EXE 1 2 3 c) MYP d) None of the above
kiran
- May 21st, 2006
The answer is b) C:myprog.exe 1 2 3 . the relative path of the file is passed as the first argument for main method by default.then followed by others.
-
How can I sort a linked list?
Both the merge sort and the radix sort are good sorting algorithms to use for linked lists.
venkatesh
- May 19th, 2006
For this no need to write sepate function. We can arrage the elements in order by using some comaprisons in creation of list.venkatesh_ch@fastmail.fm
-
-
Write a code for implementation of doubly linked list with use of single pointer in each node
Xavier Raj
- May 9th, 2006
Hi,I agree with Ashtosh , since linked list nodes are stored dynamically in memory wherever it has space so the simple addition wont give track of nodes but a junk value.we can construct this only by combining two pointer nodes for single data value.its complex too...!
ashutosh_dasgupta
- Apr 28th, 2006
hi viral,???? how does doing simple addtion to the addresses will take u to the next node?as far as i remember the nodes are not in a sequence in the memory. this is true in case of an array, but not in dynamically allocated memory as in linked list!
-
-
How do you print an address?
The safest way is to use printf() (or fprintf() or sprintf()) with the %P specification. That prints a void pointer (void*). Different compilers might print a pointer with different formats. Your compiler will pick a format that’s right for your environment. If you have some other kind of pointer (not a void*) and you want to be very safe, cast the pointer to a void*: printf( “%Pn”, (void*) buffer...
paulson paul chambakottukudyil
- Apr 24th, 2006
I tried both %p and %Fp. There is no difference, atleast in MS visual studio. Both are printing the same value.
ravisankar2
- Feb 19th, 2006
THIS IS FROM c.ravi sankar reddy,hai to ALL........we can print the address of a variable or a function using the following specifiers %u,%p here %u prints address in decimal form and %p prints in hex...
-
Main(int x).............explaination on arguments passed thr' main
shibaji paul
- Apr 20th, 2006
I am afraid, nitil goel is also partially correct. The environment parameter is not a character pointer, rather it is a array of character pointers.The actual prototype of the main function wouold be ...
nitin.goel
- Apr 8th, 2006
I think u r correct but partially as there rthree arguments not 2 third one is environmentand passed as (char *env) it gives the environment details in the programit'l help when we want to get the environment variables in our program.
-
-
On combining the following statements, you will get char*p; p=malloc(100); a) char *p= malloc(100) b) p= (char*)malloc(100) c) All of the above d) None of the above
krishan pratap
- Mar 27th, 2006
The answer would be Because the Their is a need of the decleration the this is the character type of the pointer.
-
What is the easiest sorting method to use?
The answer is the standard library function qsort(). It’s the easiest sort by far for several reasons: It is already written. It is already debugged. It has been optimized as much as possible (usually). Void qsort(void *buf, size_t num, size_t size, int (*comp)(const void *ele1, const void *ele2));
venki_max
- Mar 26th, 2006
Greetings!can u plz explain me the sorting function with its implementation in a small program and send it to my e-mail Id : venki_m182003@yahoo.com
rahul
- Oct 17th, 2005
Very amazing
-
What is a function and built-in function?
A large program is subdivided into a number of smaller programs or subprograms. Each subprogram specifies one or more actions to be performed for a large program.such subprograms are functions. The function supports only static and extern storage classes.By default, function assumes extern storage class.functions have global scope. Only register or auto storage class is allowed in the function...
-
How argc and argv works in the following main function?main(int argc,char *argv[]) { int n,i=0; while(argv[1][i]!=\'\\0\') { n=fun(); i++;} printf(\
mpanigrahi
- Mar 22nd, 2006
*****main can recieve its own arguments but in a preconditioned way: main (int argc, char **argv) { ............ }*****% a.out 1 my_input argc is 3 argv[0] = "a.out" argv[1]="1" argv[2]="my_input"
C Interview Questions
Ans