I want tcs placement papers of 2004-2009 , its urgent

Answer Posted / satya

no tcs papaers with me... So i too want it.

Is This Answer Correct ?    2 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What is the purpose of clrscr () printf () and getch ()?

570


What is getch?

610


What is a #include preprocessor?

597


What are the types of arrays in c?

606


Explain which of the following operators is incorrect and why? ( >=, <=, <>, ==)

581






What is getch c?

832


Why is c known as a mother language?

707


Write a program to reverse a linked list in c.

613


What is the sizeof () a pointer?

531


What are the back slash character constants or escape sequence charactersavailable in c?

662


You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False 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 ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

2684


Give differences between - new and malloc() , delete and free() ?

588


Here is a neat trick for checking whether two strings are equal

542


Why is this loop always executing once?

588


write a program to input 10 strings and compare without using strcmp() function. If the character of one string matches with the characters of another string , sort them and make it a single string ??? example:- str1="Aakash" st2="Himanshu" str="Uday" output:- Aakashimanshuday (please post the answer as quickly as possible)

1601