# Technical Questions asked in SAP

Views:17606
1. Which of the following is a type of DBMS software?
1. Utilities
2. query Language
3. Report writer
4. All of these
2. Consider the macro definitions:
# define square(x) x*x
and # define square(x) (x*x)
when used in a program statement B = ++ square(C)
1. both macros will produce the same result
2. both macros will not produce same result
3. the second macro definition is not valid
4. the first macro definition is not valid
Explanation: if ++ square(C) is called the first macro gives ++x*x, and second macro gives ++(x*x)
1. Insertion is O(n2)
2. Deletion is O(n)
3. Searching is O(n)
4. All of these
We maintain pointers to the node(s) at the head and tail of the linked list and so performing a traditional insertion to either the front or back of the linked list is an O(1) operation. Random insertion has complexity O(n)
2. Evaluate following expression:
a=3, b=6,c=4,d=2
a=b>c && b-c= a+c
1. 0
2. 1
3. Error
4. None of these
Substituting values we get (((3+6)>4)&&((6-4)<2))|| ((6+2)>=(3+4)) i.e. ((1)&&(0))||(1)= 1
3. The declarations
typedef float height [100];
height men, women;
1. define men and women as 100 element floating point
2. define men and women as 100 floating point variables
3. define height, men and women as floating point variables
4. are illegal
4. Under which of the following Big O notation it is suggested to review design of algorithm?
1. O(n2)
2. O(nlogn)
3. O(n)
4. O(2n)