Implement a t9 mobile dictionary.
(Give code with explanation )
Answer / guna
http://www.eecs.yorku.ca/course_archive/2004-05/F/4441/T9.java
http://javatroops.blogspot.in/2012/10/implement-mobile-t9-using-trie.html
| Is This Answer Correct ? | 2 Yes | 1 No |
find simple interest & compund interest
main() { int i=300; char *ptr = &i; *++ptr=2; printf("%d",i); }
main() { main(); }
main() { unsigned int i=10; while(i-->=0) printf("%u ",i); }
Write a routine that prints out a 2-D array in spiral order
#define max 5 #define int arr1[max] main() { typedef char arr2[max]; arr1 list={0,1,2,3,4}; arr2 name="name"; printf("%d %s",list[0],name); }
write a c program to Reverse a given string using string function and also without string function
main() { int i=5; printf("%d",++i++); }
typedef struct error{int warning, error, exception;}error; main() { error g1; g1.error =1; printf("%d",g1.error); }
Link list in reverse order.
Given a list of numbers ( fixed list) Now given any other list, how can you efficiently find out if there is any element in the second list that is an element of the first list (fixed list)
3 Answers Disney, Google, ZS Associates,
int i=10; main() { extern int i; { int i=20; { const volatile unsigned i=30; printf("%d",i); } printf("%d",i); } printf("%d",i); }