[Updated] Goldman Sachs Aptitude Test Questions and Answers
Practice List of TCS Digital Coding Questions !!!
Take 50+ FREE!! Online Data Interpretation Mock test to crack any Exams.

Online Aptitude Test for BOA (Bank of America)

67.38K

Tot. Mock Test: 1


Total Qs: 70+

NA
SHSTTON
99
Solv. Corr.
73
Solv. In. Corr.
172
Attempted
0 M:37 S
Avg. Time

51 / 70

What is the output of the following 'C' program ?
#include <stdio.h>
int main()
{
int x=20,y=35; 
x=y++ + x++;
y=++y + ++x;
printf("%d  %d",x,y);
return 0;
}

A22,40

B57,35

C22,37

D57,94

Answer: Option D

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
955
Solv. Corr.
366
Solv. In. Corr.
1321
Attempted
0 M:19 S
Avg. Time

52 / 70

Choose the correct option.

How is Data in a queue accessed


AFirst in First out

BFirst in last out

CLast in First out

DNone of these

Answer: Option A

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
2493
Solv. Corr.
512
Solv. In. Corr.
3005
Attempted
1 M:4 S
Avg. Time

53 / 70

Choose the correct option.

Item in priority queue can jump to the front on the line if they have priority


ATRUE

BFALSE

CNone of these

Answer: Option A

Explanation:

A priority queue is similar to a simple queue in that items are organized in a line and processed sequentially. However, items on a priority queue can jump to the front of the line if they have priority. Priority is a value that is associated with each item placed in the queue.

Submit Your Solution

NA
SHSTTON
2067
Solv. Corr.
788
Solv. In. Corr.
2855
Attempted
0 M:25 S
Avg. Time

54 / 70

Choose the correct option.

The dequeue process removes data from the front of the single ended queue


ATRUE

BFALSE

CNone of these

Answer: Option A

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
442
Solv. Corr.
688
Solv. In. Corr.
1130
Attempted
0 M:55 S
Avg. Time

55 / 70

Choose the correct option.

What Member function places a new node at the end of the linked list?


AaddNode

Bappend Node

CDisplayNode

DStructNode

ENone of these

Answer: Option A

Explanation:

The appendNode() member function places a new node at the end of the linked list. The appendNode() requires an integer representing the current data of the node.

ShortCut By :: Biswajit

a

Submit Your Solution

NA
SHSTTON
1143
Solv. Corr.
1728
Solv. In. Corr.
2871
Attempted
0 M:45 S
Avg. Time

56 / 70

Choose the correct option.

How would you make the middle node of a doubly linked list to the top of the list?
Let assume "X" is the middle node


AX->next->prev = x->prev x->prev->next = x->next x->next = head head->prev=x

Bx->next = head head->prev=x

CX->next->prev=x->next x->prev->next = x->prev x->next = head head->prev=x

DNone of these

Answer: Option A

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
10
Solv. Corr.
51
Solv. In. Corr.
61
Attempted
0 M:0 S
Avg. Time

57 / 70

Find the Output of the below program and choose the correct option.

#include
int main()
{
int to, from, count;
to=10; count= 5; from= 15;
char c;
int n =(count+ 7) / 8;
switch ( count % 8)
{
case 0:
do
{ to++ == from++;
case 7: to++; from++;
case 6: to++ ; from++;
case 5: to++ ; from++;
case 4: to++ ; from++;
case 3: to++ ; from++;
case 2: to++ ; from++;
case 1: to++ ; from++;
} while ( -n > 0 );

}
printf("%d %d",to, from);
}


A11,16

B10,15

C10,20

D15,20

Answer: Option D

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
200
Solv. Corr.
591
Solv. In. Corr.
791
Attempted
0 M:27 S
Avg. Time

58 / 70

Selection sort and quicksort both fall into the same category of sorting algorithms. What is this category?


AO(n log n) sorts

BDivide-and-conquer sorts

CInterchange sorts

DAverage time is quadratic

Answer: Option C

Explanation:

Selection sort is not O(n log n) and not a Divide-conquer sort too and Average time of quicksort is not quadratic.

Submit Your Solution

NA
SHSTTON
22
Solv. Corr.
59
Solv. In. Corr.
81
Attempted
0 M:0 S
Avg. Time

59 / 70

What would be the Output

int i;
for(i=1 ;i<5;i++ );
printf("%d",i);


A1,2,3,4,5

B6

C2,3,4,5,6

D5

ENone of these

Answer: Option D

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
76
Solv. Corr.
29
Solv. In. Corr.
105
Attempted
0 M:0 S
Avg. Time

60 / 70

What would be the Output?

int fun(unsigned int number)
{
if(number <= 1)
return 1;
return number * fun(number - 1 );
}

void main()
{
printf("%d",fun(5));
}


A120

B5

C10

DError

Answer: Option A

Explanation:

Here is no explanation for this answer

Submit Your Solution


Here is the list of questions asked in Online Aptitude Test for BOA (Bank of America) BOA (Bank of America) online arithmetic test. Practice BOA (Bank of America) Written Test Papers with Solutions and take Q4Interview BOA (Bank of America) Online Test Questions to crack BOA (Bank of America) written round test. Overall the level of the BOA (Bank of America) Online Assessment Test is moderate. Only those candidates who clear the written exam will qualify for the next round, so practic all the questions here and take all the free tests before going for final selection process of BOA (Bank of America)