AMCAT Previous Papers with Solutions - Wikitechy https://www.wikitechy.com/interview-questions/tag/amcat-previous-papers-with-solutions/ Interview Questions Mon, 20 Sep 2021 10:57:41 +0000 en-US hourly 1 https://wordpress.org/?v=7.0 https://www.wikitechy.com/interview-questions/wp-content/uploads/2025/10/cropped-wikitechy-icon-32x32.png AMCAT Previous Papers with Solutions - Wikitechy https://www.wikitechy.com/interview-questions/tag/amcat-previous-papers-with-solutions/ 32 32 Here is an infix notation: ((A+B)*C-(D-E))^(F+G) Choose the correct postfix notation of the above from the given options ? https://www.wikitechy.com/interview-questions/programming/here-is-an-infix-notation-abc-d-efg-choose-the-correct-postfix-notation-of-the-above-from-the-given-options/ https://www.wikitechy.com/interview-questions/programming/here-is-an-infix-notation-abc-d-efg-choose-the-correct-postfix-notation-of-the-above-from-the-given-options/#respond Fri, 27 Aug 2021 00:46:02 +0000 https://www.wikitechy.com/interview-questions/?p=2588

Here is an infix notation: ((A+B)*C-(D-E))^(F+G)
Choose the correct postfix notation of the above from the given options ?

A. AB+CD*E–FG+^

B. AB+C*DE–FG+^

C. AB+C*DE-FG-+^

D. A+BC*DE-FG-+^

Answer : B. AB+C*DE–FG+^

Explanation :

Postfix notation is a notation for writing arithmetic expressions in which the operands appear before their operators.

]]> https://www.wikitechy.com/interview-questions/programming/here-is-an-infix-notation-abc-d-efg-choose-the-correct-postfix-notation-of-the-above-from-the-given-options/feed/ 0 What is the time complexity of adding three matrices of size NXN cell-by-cell ? https://www.wikitechy.com/interview-questions/programming/what-is-the-time-complexity-of-adding-three-matrices-of-size-nxn-cell-by-cell/ https://www.wikitechy.com/interview-questions/programming/what-is-the-time-complexity-of-adding-three-matrices-of-size-nxn-cell-by-cell/#respond Fri, 27 Aug 2021 00:44:12 +0000 https://www.wikitechy.com/interview-questions/?p=2587

What is the time complexity of adding three matrices of size NXN cell-by-cell ?

A. O(N)

B. O(N2)

C. O(N3)

D. None of these

Answer : B. O(N2)

Explanation :

  • Time complexity will be O(n2), because if we add all the elements one by one to other matrics we have to traverse the whole matrix at least 1 time and traversion takes O(n2) times.
  • With this traversion we add 3 elements of location [ i, j ] and storing the result on other matrix at [ i, j ] location.
]]> https://www.wikitechy.com/interview-questions/programming/what-is-the-time-complexity-of-adding-three-matrices-of-size-nxn-cell-by-cell/feed/ 0 Data and function in which area of a class are directly accessible outside the class ? https://www.wikitechy.com/interview-questions/programming/data-and-function-in-which-area-of-a-class-are-directly-accessible-outside-the-class/ https://www.wikitechy.com/interview-questions/programming/data-and-function-in-which-area-of-a-class-are-directly-accessible-outside-the-class/#respond Fri, 27 Aug 2021 00:42:18 +0000 https://www.wikitechy.com/interview-questions/?p=2586

Data and function in which area of a class are directly accessible outside the class ?

A. Public

B. Private

C. Protected

D. None of these

Answer : A. Public

Explanation :

  • Public – The members declared as Public are accessible from outside the Class through an object of the class.
  • Protected – The members declared as Protected are accessible from outside the class but only in a class derived from it.
  • Private – These members are only accessible from within the class. No outside Access is allowed
]]> https://www.wikitechy.com/interview-questions/programming/data-and-function-in-which-area-of-a-class-are-directly-accessible-outside-the-class/feed/ 0 One of the following options is a form of access used to add and remove nodes from a queue ? https://www.wikitechy.com/interview-questions/data-structure/one-of-the-following-options-is-a-form-of-access-used-to-add-and-remove-nodes-from-a-queue/ https://www.wikitechy.com/interview-questions/data-structure/one-of-the-following-options-is-a-form-of-access-used-to-add-and-remove-nodes-from-a-queue/#respond Tue, 13 Jul 2021 10:48:27 +0000 https://www.wikitechy.com/interview-questions/?p=462

One of the following options is a form of access used to add and remove nodes from a queue ?

A. LIFO

B. FIFO

C. Both LIFO and FIFO

D. Recursion

Answer : B. FIFO

Explanation

  • Queues are first in first out.
  • In a FIFO data structure, the first element added to the queue will be the first one to be removed.
]]> https://www.wikitechy.com/interview-questions/data-structure/one-of-the-following-options-is-a-form-of-access-used-to-add-and-remove-nodes-from-a-queue/feed/ 0 If the depth of a tree is 3 levels, then what is the size of the Tree ? https://www.wikitechy.com/interview-questions/data-structure/if-the-depth-of-a-tree-is-3-levels-then-what-is-the-size-of-the-tree/ https://www.wikitechy.com/interview-questions/data-structure/if-the-depth-of-a-tree-is-3-levels-then-what-is-the-size-of-the-tree/#respond Tue, 13 Jul 2021 10:44:37 +0000 https://www.wikitechy.com/interview-questions/?p=460

If the depth of a tree is 3 levels, then what is the size of the Tree ?

A. 2

B. 4

C. 6

D. 8

Answer : D. 8

Explanation :

  • You calculate the size of a tree by using the following formula: size = 2 depth
  • If the depth is 3 levels, then the size of tree is 2 3 = 8
]]> https://www.wikitechy.com/interview-questions/data-structure/if-the-depth-of-a-tree-is-3-levels-then-what-is-the-size-of-the-tree/feed/ 0