Online Aptitude Test for BOA (Bank of America)
51 / 70
#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
52 / 70
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
53 / 70
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
54 / 70
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
55 / 70
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 :: Biswajita
Submit Your Solution
56 / 70
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
57 / 70
#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
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
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
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)