TCS Most Frequently Asked Technical Interview Questions
TCS Most Frequently Asked Technical Interview Questions
TCS Most Frequently Asked Technical Interview Questions
1. What is pre-processing in C?
A Pre-processor is a system software (a computer program that is designed to run
on computer’s hardware and application programs). It performs pre-processing of
the High Level Language(HLL). Pre-processing is the first step of the language
processing system. Language processing system translates the high level language
to machine level language or absolute machine code(i.e. to the form that can be
understood by machine).
The pre-processor doesn’t know about the scope rules of C. Pre-processor directives
like #define come into effect as soon as they are seen and remain in effect until the
end of the file that contains them; the program’s block structure is irrelevant
2. What is Linking in C?
The object code is combined with required supporting code to make an executable
program. This step typically involves adding in any libraries that are required.
8 20
/\
2 9
• RDBMS uses a tabular structure where the headers are the column names,
and the rows contain corresponding values
• DBMS does not support the integrity constants
• RDBMS supports the integrity constraints at the schema level
• Examples of DBMS are a file system, XML, Windows Registry, etc.
• Example of RDBMS is MySQL, Oracle, SQL Server, etc.
8. What is bigdata?
Big data is a term that describes the large volume of data – both structured and
unstructured – that inundates a business on a day-to-day basis. But it’s not the
amount of data that’s important. It’s what organizations do with the data that
matters. Big data can be analysed for insights that lead to better decisions and
strategic business moves.
15. Write a program to check whether the given string is a palindrome or not?
#include <stdio.h>
#include <string.h>
int main(){
char string1[20];
int i, length;
int flag = 0;
printf("Enter a string:");
scanf("%s", string1);
length = strlen(string1);
if (flag) {
printf("%s is not a palindrome", string1);
}
TCS Most Frequently asked Technical Interview Questions
else {
printf("%s is a palindrome", string1);
}
return 0;
}
Let us first define a Complete Binary Tree. A complete binary tree is a binary tree in
which every level, except possibly the last, is completely filled, and all nodes are as
far left as possible (Source Wikipedia)
TCS Most Frequently asked Technical Interview Questions
A Binary Heap is a Complete Binary Tree where items are stored in a special order
such that value in a parent node is greater(or smaller) than the values in its two
children nodes. The former is called as max heap and the latter is called min heap.
The heap can be represented by binary tree or array.
• The left and right subtree each must also be a binary search tree.
• There must be no duplicate nodes.
// Driver code
public static void main(String args[])
{
Sum s = new Sum();
System.out.println(s.sum(10, 20));
System.out.println(s.sum(10, 20, 30));
System.out.println(s.sum(10.5, 20.5));
}
}