logic for generating all the combinations of the any number of given letters. ex::::::::: if a,b,c,d are given the o/p should be abcd,dcba,dbac,bcad,................ 4*3*2*1 combinations............2 5380
What is a Genralised LInked List?? Please give a detailed explation of it..1 1780
Explain following declaration int *P(void); and int (*p)(char *a);3 14058
What is external and internal variables What is dynamic memory allocation what is storage classes in C3 11125
can anyone please tell me wat is backlogs... i was looking for the job openings where i read this.. eligibility criteria minimum 70% in degree without backlogs. is that arrear.. if so is it standing arrear or history of arrears... please help me...11 48360
what is the return value (status code) of exit() function.... what the arguments(integer value) passed to it means....
biggest of two no's with out using if condition statement8 7061
difference of two no's with out using - operator7 4747
what is the stackpointer2 2797
Can a binary search tree be used as an index? If yes, how? Explain
Between macros and functions,which is better to use and why?
all c language question
can anyone suggest some site name..where i can get some good data structure puzzles???
Why is it important to memset a variable, immediately after allocating memory to it ?
How to draw the flowchart for structure programs?
What is the difference between declaring a variable by constant keyword and #define ing that variable?
Can you explain what keyboard debouncing is, and where and why we us it? please give some examples
write a c program to calculate sum of digits till it reduces to a single digit using recursion
find out largest elemant of diagonalmatrix
why wipro wase
Write the program that calculates and prints the average of several integers. Assume that the last value read is sentinel 9999.
You have given 2 array. You need to find whether they will
create the same BST or not.
Array1:10 5 20 15 30
Array2:10 20 15 30 5
Array1:10 5 20 15 30
Array2:10 15 20 30 5
One Approach is Pretty Clear by creating BST O(nlogn) then
checking two tree for identical O(N) overall O(nlogn) ..we
need there exist O(N) Time & O(1) Space also without extra
space .Algorithm ??
Posted 3 months ago #
#define true 1
#define false 0
int check(int a1,int a2,int n1,int n2)
//n1 size of array a1 and n2 size of a2
if(n1!=n2) return false;
//n1 and n2 must be same
Write the test cases for checking a variable having value in range -10.0 to +10.0?
In cryptography, you could often break the algorithm if you know what was the original (plain) text that was encoded into the current ciphertext. This is called the plain text attack. In this simple problem, we illustrate the plain text attack on a simple substitution cipher encryption, where you know each letter has been substituted with a different letter from the alphabet but you don’t know what that letter is. You are given the cipherText as the input string to the function getwordSets(). You know that a plain text "AMMUNITION" occurs somewhere in this cipher text. Now, you have to find out which sets of characters corresponds to the encrypted form of the "AMMUNITION". You can assume that the encryption follows simple substitution only. [Hint: You could use the pattern in the "AMMUNITION" like MM occurring twice together to identify this]
Take an MxN matrice from user and then sum upper diagonal in a variable and lower diagonal in a separate variables. Print the result