## Interview MCQ Set 1

1. __________ is the set of hierarchies from which data is retrieved for a single member.

a) Slicer axis

b) Query axes

c) Dice axis

d) All of the mentioned

### View Answer

2. Point out the correct statement :

a) Only droping the default member is supported in MDX Scripting

b) In the SELECT statement, the FROM clause determines the cube context

c) Very few cube can control how errors within a Multidimensional Expressions (MDX) script are handled

d) None of the mentioned

### View Answer

3. When you include a many-to-many dimension, the following rules apply

a) You must add the intermediary measure group

b) You must add the entire many-to-many dimension

c) You must add the entirety of all dimensions common to the two measure groups involved in the many-to-may relationship

d) All of the mentioned

### View Answer

4. _________ statement is used to write back data to any cell in a cube that aggregates to its parent using the SUM aggregation.

a) UPDATE CUBE

b) DELETE CUBE

c) ALTER CUBE

d) None of the mentioned

### View Answer

5. Point out the wrong statement :

a) A weight expression should be expressed as a decimal value between zero (0) and 1

b) Each UPDATE CUBE allocation should be considered to be atomic for transactional purposes

c) When updated cells overlap, the Update Isolation Level connection string property can be used to enhance performance for UPDATE CUBE

d) None of the mentioned

### View Answer

6. Which of the following scenario demonstrates USE_EQUAL_INCREMENT allocation method ?

a)

<leaf cell value> = <NEW Value> / COUNT(leaf cells that are contained IN <tuple>)

b)

<leaf cell value> = < NEW Value> * Weight_Expression

c)

<leaf cell value> = <leaf cell value> + (<NEW VALUE > - <existing value>) / COUNT(leaf cells contained IN <tuple>)

d)

<leaf cell value> = <leaf cell value> + (<NEW Value> - <existing value>) * Weight_Expression

### View Answer

7. If a weight expression is not specified, the UPDATE CUBE statement implicitly uses the following expression:

a) Weight_Expression =

b) Weight_Expression =

c) Weight_Expression =

d) Weight_Expression =

### View Answer

8. When used on a measure that contains integers, the _________ method can return imprecise results caused by incremental rounding changes.

a) USE_EQUAL_ALLOCATION

b) USE_WEIGHTED_ALLOCATION

c) USE_WEIGHTED_INCREMENT

d) All of the mentioned

### View Answer

9. Which of the following is valid syntax for DRILLTHROUGH statement ?

a)

DRILLTHROUGH[MAXROWSUnsigned_Integer] <MDX SELECT statement> [RETURNSet_of_Attributes_and_Measures [,Set_of_Attributes_and_Measures ...] ]

b)

DRILL[MAXROWSUnsigned_Integer] <MDX SELECT statement> [RETURNSet_of_Attributes_and_Measures [,Set_of_Attributes_and_Measures ...] ]

c)

DRILLTHROUGH[MAXROWSUnsigned_Integer] <MDX SELECT statement>

d) None of the mentioned

### View Answer

10. Which of the following keyword forces a specified set to be evaluated within the current context ?

a) SCOPE

b) CASE

c) EXISTING

d) FREEZE

### View Answer

## Interview MCQ Set 2

AB = BC = CD = 20m

All moment options are given in KN/m and all rotations in rad.

EI is constant.

1. How many deflection unknowns will be there in this case for which we would need equations?

a) 0

b) 1

c) 2

d) 3

### View Answer

2. How many unknowns will be left finally which are non-zero?

a) 0

b) 1

c) 2

d) 3

### View Answer

3. How many total slope deflection equations will be written in this question?

a) 8

b) 6

c) 4

d) 3

### View Answer

4. What will be the FEMAB ?

a) 80

b) -80

c) 0

d) 160

### View Answer

5. Which of the following set of points should be chosen to generate extra equations?

a) A and B

b) B and C

c) C and D

d) D and A

### View Answer

6. What will be one of the extra condition, which we will get if we conserve moment near joint B?

a) mBA + mCA = 0

b) mBA + mCB = 0

c) mBA + mBC = 0

d) mAB + mBC = 0

### View Answer

7. What will be one of the extra condition, which we will get if we conserve moment near joint C?

a) mBA + mCA = 0

b) mBA + mCB = 0

c) mBA + mBC = 0

d) mCD + mCB = 0

### View Answer

8. What will be the value of rotation at point B?

a) 22.2/EI

b) -22.2/EI

c) 0

d) 100/EI

### View Answer

9. What will be the value of rotation at point C?

a) 22.2/EI

b) -22.2/EI

c) 0

d) 100/EI

### View Answer

10. What will be the value of mAB?

a) 22.2

b) 44.4

c) -44.4

d) -22.2

### View Answer

11. What will be the value of mBA?

a) 22.2

b) 44.4

c) -44.4

d) -22.2

### View Answer

12. What will be the value of mBC?

a) 22.2

b) 44.4

c) -44.4

d) -22.2

### View Answer

13. What will be the value of mCB?

a) 22.2

b) 44.4

c) -44.4

d) -22.2

### View Answer

14. What will be the value of mCD?

a) 22.2

b) 44.4

c) -44.4

d) -22.2

### View Answer

15. What will be the value of mDC?

a) 22.2

b) 44.4

c) -44.4

d) -22.2

### View Answer

## Interview MCQ Set 3

1. What is the output of the following?

x = ['ab', 'cd'] print(len(list(map(list, x))))))

a) 2

b) 4

c) error

d) none of the mentioned

### View Answer

2. What is the output of the following?

x = ['ab', 'cd'] print(list(map(list, x)))

a) [‘a’, ‘b’, ‘c’, ‘d’].

b) [[‘ab’], [‘cd’]].

c) [[‘a’, ‘b’], [‘c’, ‘d’]].

d) none of the mentioned

### View Answer

3. What is the output of the following?

x = [12, 34] print(len(list(map(len, x))))

a) 2

b) 1

c) error

d) none of the mentioned

### View Answer

4. What is the output of the following?

x = [12, 34] print(len(list(map(int, x))))

a) 2

b) 1

c) error

d) none of the mentioned

### View Answer

5. What is the output of the following?

x = [12, 34] print(len(''.join(list(map(int, x)))))

a) 4

b) 2

c) error

d) none of the mentioned

### View Answer

6. What is the output of the following?

x = [12, 34] print(len(''.join(list(map(str, x)))))

a) 4

b) 5

c) 6

d) error

### View Answer

7. What is the output of the following?

x = [12, 34] print(len(' '.join(list(map(int, x)))))

a) 4

b) 5

c) 6

d) error

### View Answer

8. What is the output of the following?

x = [12.1, 34.0] print(len(' '.join(list(map(str, x)))))

a) 6

b) 8

c) 9

d) error

### View Answer

9. What is the output of the following?

x = [12.1, 34.0] print(' '.join(list(map(str, x))))

a) 12 1 34 0

b) 12.1 34

c) 121 340

d) 12.1 34.0

### View Answer

10. What is the output of the following?

x = [[0], [1]] print(len(' '.join(list(map(str, x)))))

a) 2

b) 3

c) 7

d) 8

### View Answer

## Interview MCQ Set 4

1. What is the output of the following?

x = 'abcd' for i in x: print(i) x.upper()

a) a B C D

b) a b c d

c) A B C D

d) error

### View Answer

2. What is the output of the following?

x = 'abcd' for i in x: print(i.upper())

a) a b c d

b) A B C D

c) a B C D

d) error

### View Answer

3. What is the output of the following?

x = 'abcd' for i in range(x): print(i)

a) a b c d

b) 0 1 2 3

c) error

d) none of the mentioned

### View Answer

4. What is the output of the following?

x = 'abcd' for i in range(len(x)): print(i)

a) a b c d

b) 0 1 2 3

c) error

d) 1 2 3 4

### View Answer

5. What is the output of the following?

x = 'abcd' for i in range(len(x)): print(i.upper())

a) a b c d

b) 0 1 2 3

c) error

d) 1 2 3 4

### View Answer

6. What is the output of the following?

x = 'abcd' for i in range(len(x)): i.upper() print (x)

a) a b c d

b) 0 1 2 3

c) error

d) none of the mentioned

### View Answer

7. What is the output of the following?

x = 'abcd' for i in range(len(x)): x[i].upper() print (x)

a) abcd

b) ABCD

c) error

d) none of the mentioned

### View Answer

8. What is the output of the following?

x = 'abcd' for i in range(len(x)): i[x].upper() print (x)

a) abcd

b) ABCD

c) error

d) none of the mentioned

### View Answer

9. What is the output of the following?

x = 'abcd' for i in range(len(x)): x = 'a' print(x)

a) a

b) abcd abcd abcd

c) a a a a

d) none of the mentioned

### View Answer

10. What is the output of the following?

x = 'abcd' for i in range(len(x)): print(x) x = 'a'

a) a

b) abcd abcd abcd abcd

c) a a a a

d) none of the mentioned

### View Answer

## Interview MCQ Set 5

1. Consider the following iterative implementation used to find the length of a linked list:

struct Node { int val; struct Node *next; }*head; int get_len() { struct Node *temp = head->next; int len = 0; while(_____) { len++; temp = temp->next; } return len; }

Which of the following conditions should be checked to complete the above code?

a) temp->next != 0

b) temp == 0

c) temp != 0

d) none of the mentioned

### View Answer

2. What is the output of the following code?

#include<stdio.h> #include<stdlib.h> struct Node { int val; struct Node *next; }*head; int get_len() { struct Node *temp = head->next; int len = 0; while(temp != 0) { len++; temp = temp->next; } return len; } int main() { int arr[10] = {1,2,3,4,5}, n = 5, i; struct Node *temp, *newNode; head = (struct Node*)malloc(sizeof(struct Node)); head->next = 0; temp = head; for(i=0; i<n; i++) { newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->val = arr[i]; newNode->next = 0; temp->next = newNode; temp = temp->next; } int len = get_len(); printf("%d",len); return 0; }

a) 4

b) 5

c) 6

d) 7

### View Answer

3. What is the time complexity of the above iterative implementation used to find the length of a linked list?

a) O(1)

b) O(n)

c) O(n^{2})

d) O(logn)

### View Answer

4. What is the output of the following code?

#include<stdio.h> #include<stdlib.h> struct Node { int val; struct Node *next; }*head; int get_len() { struct Node *temp = head->next; int len = 0; while(temp != 0) { len++; temp = temp->next; } return len; } int main() { int arr[10] = {1,2,3,4,5}, n = 5, i; struct Node *temp, *newNode; head = (struct Node*)malloc(sizeof(struct Node)); head->next = 0; int len = get_len(); printf("%d",len); return 0; }

a) 0

b) Garbage value

c) Compile time error

d) Runtime error

### View Answer

5. Which of the following can be the base case for the recursive implementation used to find the length of linked list?

a) if(current_node == 0) return 1

b) if(current_node->next == 0) return 1

c) if(current_node->next == 0) return 0

d) if(current_node == 0) return 0

### View Answer

6. Which of the following lines should be inserted to complete the following recursive implementation used to find the length of a linked list?

#include<stdio.h> #include<stdlib.h> struct Node { int val; struct Node *next; }*head; int recursive_get_len(struct Node *current_node) { if(current_node == 0) return 0; return _____; } int main() { int arr[10] = {1,2,3,4,5}, n = 5, i; struct Node *temp, *newNode; head = (struct Node*)malloc(sizeof(struct Node)); head->next = 0; temp = head; for(i=0; i<n; i++) { newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->val = arr[i]; newNode->next = 0; temp->next = newNode; temp = temp->next; } int len = recursive_get_len(head->next); printf("%d",len); return 0; }

a) recursive_get_len(current_node)

b) 1 + recursive_get_len(current_node)

c) recursive_get_len(current_node->next)

d) 1 + recursive_get_len(current_node->next)

### View Answer

7. What is the output of the following code?

#include<stdio.h> #include<stdlib.h> struct Node { int val; struct Node *next; }*head; int recursive_get_len(struct Node *current_node) { if(current_node == 0) return 0; return 1 + recursive_get_len(current_node->next); } int main() { int arr[10] = {-1,2,3,-3,4,5,0}, n = 7, i; struct Node *temp, *newNode; head = (struct Node*)malloc(sizeof(struct Node)); head->next = 0; temp = head; for(i=0; i<n; i++) { newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->val = arr[i]; newNode->next = 0; temp->next = newNode; temp = temp->next; } int len = recursive_get_len(head->next); printf("%d",len); return 0; }

a) 6

b) 7

c) 8

d) 9

### View Answer

8. What is the time complexity of the above code used to find the length of a linked list?

a) O(1)

b) O(n)

c) O(n^{2})

d) O(n^{3})

### View Answer

9. What is the output of the following code?

#include<stdio.h> #include<stdlib.h> struct Node { int val; struct Node *next; }*head; int recursive_get_len(struct Node *current_node) { if(current_node == 0) return 0; return 1 + recursive_get_len(current_node->next); } int main() { int arr[10] = {-1,2,3,-3,4,5}, n = 6, i; struct Node *temp, *newNode; head = (struct Node*)malloc(sizeof(struct Node)); head->next = 0; temp = head; for(i=0; i<n; i++) { newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->val = arr[i]; newNode->next = 0; temp->next = newNode; temp = temp->next; } int len = recursive_get_len(head->next); printf("%d",len); return 0; }

a) 5

b) 6

c) 7

d) 8

### View Answer

10. How many times is the function recursive_get_len() called when the above code is executed?

a) 5

b) 6

c) 7

d) 8