# Multiple choice question for engineering

## Set 1

1. When discussing feed mixers, what is the range of manufacturers recommended mixing times?

a) 1-2 minutes

b) 3-6 minutes

c) 10-15 minutes

d) 7-9 minutes

### View Answer

2. The letters FSIS stand for what?

a) Food Service and Inspection Safety

b) Free State Inspection Service

c) Food Sanitation and Inquiry Service

d) Food Safety and Inspection Service

### View Answer

3. What do the letters FARAD stand for?

a) Food Animal Resistance Activity Database

b) Food Animal Residue Avoidance Data

c) Food Animal Resistance Activity Data

d) Food Animal Residue Avoidance Databank

### View Answer

4. What bacterium causes cattle tuberculosis (TB)?

a) Mycobacterium canine

b) Mycobacterium ovius

c) Mycobacterium avious

d) Mycobacterium bovis

### View Answer

5. Oxytocin causes what to happen in a dairy cow?

a) Milk letdown

b) Uterine contractions

c) Milk letdown and urine contraction

d) Pregnancy

### View Answer

6. How frequently should an average cow freshen?

a) Once every 24 months

b) Once every 12 months

c) Once every 20 months

d) Only once in her lifetime

### View Answer

7. What do the letters NRC stand for?

a) National Research Company

b) National Research Council

c) National Research Chapter

d) National Rehabilitation Center

### View Answer

8. When discussing nutrition, what does NPN stand for?

a) Nonprotein nitrogen

b) Normal protein necessities

c) Natural protein nitrogen

d) No protein in nitrogen

### View Answer

9. Corn silage, stored in upright, top-unloading silos, should be chopped at what percent moisture?

a) 72 to 75 percent moisture

b) 82 to 85 percent moisture

c) 92 to 95 percent moisture

d) 62 to 65 percent moisture

### View Answer

## Set 2

1. What does GnRH stand for?

a) Gestation Repression Hormone

b) Genotype Reflection Hormone

c) Goonie Resusitation Hoovermobile

d) Gonadotropin Releasing Hormone

### View Answer

2. What is the average duration of standing heat in cattle?

a) 4 hours

b) 12 hours

c) 70 hours

d) 8 hours

### View Answer

3. What is the approximate time of ovulation in cattle after the beginning of heat?

a) 60 hours

b) 90 hours

c) 30 hours

d) 3 hours

### View Answer

4. What hormone is responsible for maintaining pregnancy?

a) Progesterone

b) Lutalyse

c) Prostaglandin

d) Oxytocin

### View Answer

5. What is the scientific term for birth?

a) Domino

b) Parturition

c) Calving

d) Dystocia

### View Answer

6. In reference to reproduction, what does CL stand for?

a) Cattle Lutalysis

b) Cervix Lymphocyte

c) Compound Luteum

d) Corpus Luteum

### View Answer

7. To the hundredth, how many pounds of milk are in one gallon?

a) 8.52 pounds

b) 8.72 pounds

c) 8.92 pounds

d) 8.62 pounds

### View Answer

8. What pathway in young calves directs milk into the abomasum, bypassing the rumen, reticulum, and omasum?

a) Rumen bypass groove

b) Masticulas passinomis

c) Esophageal groove

d) Rumen passinomis

### View Answer

9. Milk fever is also (scientifically) known as what?

a) Postpartum paresis

b) Mamogenesis

c) Masticular Paresis

d) Parturient paresis

### View Answer

10. What is Parturient paresis caused by?

a) Low blood levels of ionized calcium

b) Low blood levels of ionized sodium

c) Low blood levels of ionized zinc

d) Low blood levels of ionized vitamin-D

### View Answer

11. According to the NRC, what percent calcium should a dry cow ration contain?

a) 1 percent

b) 2 percent

c) 10 percent

d) 39 percent

### View Answer

12. High potassium intake will decrease a cows ability to mobilize what?

a) Bone phosphorus

b) Lymphocytes

c) Bone calcium

d) Immunoglobulins

### View Answer

13. Cows that are at risk of developing ketosis can be fed what vitamin to help prevent ketosis?

a) Niacin

b) Zinc

c) B-complex

d) Vitamin-C

### View Answer

14. Hairy Heel Wart is scientifically known as what?

a) Digital Divide

b) Digital Dermatitis

c) Intraheel laminitis

d) Digital phlegmon

### View Answer

15. Foot Rot is scientifically known as what?

a) Intraheel laminitis

b) Digital Dermatitis

c) Interdigital phlegmon

d) Phlegmon

### View Answer

## Set 3

1. Given a string, you have to find the minimum number of characters to be inserted in the string so that the string becomes a palindrome. Which of the following methods can be used to solve the problem?

a) Greedy algorithm

b) Recursion

c) Dynamic programming

d) Both recursion and dynamic programming

### View Answer

2. In which of the following cases will the number of insertions to form a palindrome be minimum?

a) String of length one

b) String with all same characters

c) Palindromic string

d) All of the mentioned

### View Answer

3. In the worst case, the minimum number of insertions to be made to convert the string into a palindrome is equal to the length of the string.

a) True

b) False

### View Answer

4. Consider the string “efge”. What is the minimum number of insertions required to make the string a palindrome?

a) 0

b) 1

c) 2

d) 3

### View Answer

5. Consider the string “abbccbba”. What is the minimum number of insertions required to make the string a palindrome?

a) 0

b) 1

c) 2

d) 3

### View Answer

6. Which of the following problems can be used to solve the minimum number of insertions to form a palindrome problem?

a) Minimum number of jumps problem

b) Longest common subsequence problem

c) Coin change problem

d) None of the mentioned

### View Answer

7. Consider the following dynamic programming implementation:

#include<stdio.h> #include<string.h> int max(int a, int b) { if(a > b) return a; return b; } int min_ins(char *s) { int len = strlen(s), i, j; int arr[len + 1][len + 1]; char rev[len + 1]; strcpy(rev, s); strrev(rev); for(i = 0;i <= len; i++) arr[i][0] = 0; for(i = 0; i <= len; i++) arr[0][i] = 0; for(i = 1; i <= len; i++) { for(j = 1; j <= len; j++) { if(s[i - 1] == rev[j - 1]) arr[i][j] = arr[i - 1][j - 1] + 1; else arr[i][j] = max(arr[i - 1][j], arr[i][j - 1]); } } return _____________; } int main() { char s[] = "abcda"; int ans = min_ins(s); printf("%d",ans); return 0; }

Which of the following lines should be added to complete the code?

a) arr[len][len].

b) len + arr[len][len].

c) len

d) len – arr[len][len].

### View Answer

8. What is the time complexity of the above dynamic programming implementation of the minimum number of insertions to form a palindrome problem?

a) O(1)

b) O(n)

c) O(n^{2})

d) None of the mentioned

### View Answer

^{2}).

9.What is the space complexity of the above dynamic programming implementation of the minimum number of insertions to form a palindrome problem?

a) O(1)

b) O(n)

c) O(n^{2})

d) None of the mentioned

### View Answer

^{2}).

10. What is the output of the following code?

#include<stdio.h> #include<string.h> int max(int a, int b) { if(a > b) return a; return b; } int min_ins(char *s) { int len = strlen(s), i, j; int arr[len + 1][len + 1]; char rev[len + 1]; strcpy(rev, s); strrev(rev); for(i = 0;i <= len; i++) arr[i][0] = 0; for(i = 0; i <= len; i++) arr[0][i] = 0; for(i = 1; i <= len; i++) { for(j = 1; j <= len; j++) { if(s[i - 1] == rev[j - 1]) arr[i][j] = arr[i - 1][j - 1] + 1; else arr[i][j] = max(arr[i - 1][j], arr[i][j - 1]); } } return len - arr[len][len]; } int main() { char s[] = "abcda"; int ans = min_ins(s); printf("%d",ans); return 0; }

a) 1

b) 2

c) 3

d) 4

### View Answer

11. What is the value stored in arr[2][4] when the following code is executed?

#include<stdio.h> #include<string.h> int max(int a, int b) { if(a > b) return a; return b; } int min_ins(char *s) { int len = strlen(s), i, j; int arr[len + 1][len + 1]; char rev[len + 1]; strcpy(rev, s); strrev(rev); for(i = 0;i <= len; i++) arr[i][0] = 0; for(i = 0; i <= len; i++) arr[0][i] = 0; for(i = 1; i <= len; i++) { for(j = 1; j <= len; j++) { if(s[i - 1] == rev[j - 1]) arr[i][j] = arr[i - 1][j - 1] + 1; else arr[i][j] = max(arr[i - 1][j], arr[i][j - 1]); } } return len - arr[len][len]; } int main() { char s[] = "abcda"; int ans = min_ins(s); printf("%d",ans); return 0; }

a) 2

b) 3

c) 4

d) 5

### View Answer

12. What is the output of the following code?

#include<stdio.h> #include<string.h> int max(int a, int b) { if(a > b) return a; return b; } int min_ins(char *s) { int len = strlen(s), i, j; int arr[len + 1][len + 1]; char rev[len + 1]; strcpy(rev, s); strrev(rev); for(i = 0;i <= len; i++) arr[i][0] = 0; for(i = 0; i <= len; i++) arr[0][i] = 0; for(i = 1; i <= len; i++) { for(j = 1; j <= len; j++) { if(s[i - 1] == rev[j - 1]) arr[i][j] = arr[i - 1][j - 1] + 1; else arr[i][j] = max(arr[i - 1][j], arr[i][j - 1]); } } return len - arr[len][len]; } int main() { char s[] = "efgfe"; int ans = min_ins(s); printf("%d",ans); return 0; }

a) 0

b) 2

c) 4

d) 6

### View Answer

## Set 4

1. The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

a) AB+ CD*E – FG /**

b) AB + CD* E – F **G /

c) AB + CD* E – *F *G /

d) AB + CDE * – * F *G /

### View Answer

2. The data structure required to check whether an expression contains balanced parenthesis is?

a) Stack

b) Queue

c) Array

d) Tree

### View Answer

3. What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

a) Linked List

b) Stack

c) Queue

d) Tree

### View Answer

4. The process of accessing data stored in a serial access memory is similar to manipulating data on a ________

a) Heap

b) Binary Tree

c) Array

d) Stack

### View Answer

5. The postfix form of A*B+C/D is?

a) *AB/CD+

b) AB*CD/+

c) A*BC+/D

d) ABCD+/*

### View Answer

6. Which data structure is needed to convert infix notation to postfix notation?

a) Branch

b) Tree

c) Queue

d) Stack

### View Answer

7. The prefix form of A-B/ (C * D ^ E) is?

a) -/*^ACBDE

b) -ABCD*^DE

c) -A/B*C^DE

d) -A/BC*^DE

### View Answer

8. What is the result of the following operation

Top (Push (S, X))

a) X

b) Null

c) S

d) None

### View Answer

9. The prefix form of an infix expression p + q – r * t is?

a) + pq – *rt

b) – +pqr * t

c) – +pq * rt

d) – + * pqrt

### View Answer

10. Which data structure is used for implementing recursion?

a) Queue

b) Stack

c) Array

d) List

### View Answer

## Set 5

1. Express -15 as a 6-bit signed binary number.

a) 001111

b) 101111

c) 101110

d) 001110

### View Answer

2. Which of the following code snippet is used to convert decimal to binary numbers?

a)

public void convertBinary(int num) { int bin[] = new int[50]; int index = 0; while(num > 0) { bin[index++] = num%2; num = num/2; } for(int i = index-1;i >= 0;i--) { System.out.print(bin[i]); } }

b)

public void convertBinary(int num) { int bin[] = new int[50]; int index = 0; while(num > 0) { bin[++index] = num%2; num = num/2; } for(int i = index-1;i >= 0;i--) { System.out.print(bin[i]); } }

c)

public void convertBinary(int num) { int bin[] = new int[50]; int index = 0; while(num > 0) { bin[index++] = num/2; num = num%2; } for(int i = index-1;i >= 0;i--) { System.out.print(bin[i]); } }

d)

public void convertBinary(int num) { int bin[] = new int[50]; int index = 0; while(num > 0) { bin[++index] = num/2; num = num%2; } for(int i = index-1;i >= 0;i--) { System.out.print(bin[i]); } }

### View Answer

3. Which is the predefined method available in Java to convert decimal to binary numbers?

a) toBinaryInteger(int)

b) toBinaryValue(int)

c) toBinaryNumber(int)

d) toBinaryString(int)

### View Answer

4. Using stacks, how to obtain the binary representation of the number?

a)

public void convertBinary(int num) { Stack<Integer> stack = new Stack<Integer>(); while (num != 0) { int digit = num / 2; stack.push(digit); num = num % 2; } System.out.print("nBinary representation is:"); while (!(stack.isEmpty() )) { System.out.print(stack.pop()); } }

b)

public void convertBinary(int num) { Stack<Integer> stack = new Stack<Integer>(); while (num != 0) { int digit = num % 2; stack.push(digit); } System.out.print("nBinary representation is:"); while (!(stack.isEmpty() )) { System.out.print(stack.pop()); } }

c)

public void convertBinary(int num) { Stack<Integer> stack = new Stack<Integer>(); while (num != 0) { int digit = num % 2; stack.push(digit); num = num / 2; } System.out.print("nBinary representation is:"); while (!(stack.isEmpty() )) { System.out.print(stack.pop()); } }

d) None of the above

### View Answer

5. What is the time complexity for converting decimal to binary numbers?

a) O(1)

b) O(n)

c) O(logn)

d) O(nlogn)

### View Answer

6. Write a piece of code which returns true if the string contains balanced parenthesis, false otherwise.

a)

public boolean isBalanced(String exp) { int len = exp.length(); Stack<Integer> stk = new Stack<Integer>(); for(int i = 0; i < len; i++) { char ch = exp.charAt(i); if (ch == '(') stk.push(i); else if (ch == ')') { if(stk.peek() == null) { return false; } stk.pop(); } } return true; }

b)

public boolean isBalanced(String exp) { int len = exp.length(); Stack<Integer> stk = new Stack<Integer>(); for(int i = 0; i < len; i++) { char ch = exp.charAt(i); if (ch == '(') stk.push(i); else if (ch == ')') { if(stk.peek() != null) { return true; } stk.pop(); } } return false; }

c)

public boolean isBalanced(String exp) { int len = exp.length(); Stack<Integer> stk = new Stack<Integer>(); for(int i = 0; i < len; i++) { char ch = exp.charAt(i); if (ch == ')') stk.push(i); else if (ch == '(') { if(stk.peek() == null) { return false; } stk.pop(); } } return true; }

d)

public boolean isBalanced(String exp) { int len = exp.length(); Stack<Integer> stk = new Stack<Integer>(); for(int i = 0; i < len; i++) { char ch = exp.charAt(i); if (ch == '(') stk.push(i); else if (ch == ')') { if(stk.peek() != null) { return false; } stk.pop(); } } return true; }

### View Answer

7. What is the time complexity of the above code?

a) O(logn)

b) O(n)

c) O(1)

d) O(nlogn)

### View Answer

8. For every matching parenthesis, print their indices.

a)

public void dispIndex(String exp) { Stack<Integer> stk = new Stack<Integer>(); for (int i = 0; i < len; i++) { char ch = exp.charAt(i); if (ch == '(') stk.push(i); else if (ch == ')') { try { int p = stk.pop() + 1; System.out.println("')' at index "+(i+1)+" matched with ')' at index "+p); } catch(Exception e) { System.out.println("')' at index "+(i+1)+" is unmatched"); } } } while (!stk.isEmpty() ) System.out.println("'(' at index "+(stk.pop() +1)+" is unmatched"); }

b)

public void dispIndex(String exp) { Stack<Integer> stk = new Stack<Integer>(); for (int i = 0; i < len; i++) { char ch = exp.charAt(i); if (ch == '(') stk.push(i); else if (ch == ')') { try { int p = stk.pop() + 1; System.out.println("')' at index "+(i)+" matched with ')' at index "+p); } catch(Exception e) { System.out.println("')' at index "+(i)+" is unmatched"); } } } while (!stk.isEmpty() ) System.out.println("'(' at index "+(stk.pop() +1)+" is unmatched"); }

c)

public void dispIndex(String exp) { Stack<Integer> stk = new Stack<Integer>(); for (int i = 0; i < len; i++) { char ch = exp.charAt(i); if (ch == ')') stk.push(i); else if (ch == '(') { try { int p = stk.pop() + 1; System.out.println("')' at index "+(i+1)+" matched with ')' at index "+p); } catch(Exception e) { System.out.println("')' at index "+(i+1)+" is unmatched"); } } } while (!stk.isEmpty() ) System.out.println("'(' at index "+(stk.pop() +1)+" is unmatched"); }

d) None of the mentioned