Prepare
- All Platforms
- Programming
- Aptitude
- Syllabus
- Interview Preparation
- Interview Exp.
- Off Campus
- Prime Video
- Prime Mock
PrepInsta Prime
OffCampus
The Job Company
Placement Stats

Prime Video
Prime Mock

⁰

Notifications Mark All Read

No New notification
Login
Get Prime

Wells Fargo Menu

Home
Previous Papers
Aptitude Questions
Verbal Questions
Computer Programming
Logical Reasoning
Syllabus
Off-campus Drive Updates
Get Hiring Updates
Contact us

Wells Fargo Stacks, Queues Problems with Solutions Quiz-1

Question 1

Time: 00:00:00

Each step in the evaluation of an Infix expression refers to the encounter of a token. In the evaluation of the fully parenthesized Infix expression -
((1*2)+4-((7*6)/(8-9)))
Which of the following options shows the contents of the Stack after 7th step

((*)+-(

((1*2)+

((2+

(2+4

Good Job!

Oops!

Report the answer

How to use PrepInsta Quiz

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Currently there is no PrepInsta Explanation. Did you know?

You can also submit your own version of explanations under user explanation section and also view other submitted explanations by other users.

Please login to submit your explanation

You can check your performance of this question after Login/SignupLogin

Start

Question 2

Time: 00:00:00

Consider the given conditions in regards to the circular queue
1) (FRONT = 0) and (REAR =CAPACITY - 1)
2) FRONT = REAR
3)FRONT = CAPACITY-- REAR
Which of the above conditions tests the overflow condition of a circular queue?

Only l

Only2

Only 3

Both l and 2

Both l and 3

Good Job!

Oops!

Report the answer

How to use PrepInsta Quiz

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Currently there is no PrepInsta Explanation. Did you know?

You can also submit your own version of explanations under user explanation section and also view other submitted explanations by other users.

Please login to submit your explanation

You can check your performance of this question after Login/SignupLogin

Start

Question 3

Time: 00:00:00

Group A
A. Indirect Addressing
B. Immediate Addressing
C. Indexed Addressing
D. Autodecrement Addressing

Group B
1. Constant
2. Arrays
3. Loops
4. Pointers

1) A-4.B-3, C-2, D-1

A-3.B-2, C-4, D-1

A-2,B-1,C-4,D-3

A-4,B-1,C-2,D-3

Good Job!

Oops!

Report the answer

How to use PrepInsta Quiz

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Currently there is no PrepInsta Explanation. Did you know?

You can also submit your own version of explanations under user explanation section and also view other submitted explanations by other users.

Please login to submit your explanation

You can check your performance of this question after Login/SignupLogin

Start

Question 4

Time: 00:00:00

Choose the correct answer
Stack is useful for implementing

Radix search

Breadth first search

Recursion

None of these

Good Job!

Oops!

Report the answer

How to use PrepInsta Quiz

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Currently there is no PrepInsta Explanation. Did you know?

You can also submit your own version of explanations under user explanation section and also view other submitted explanations by other users.

Please login to submit your explanation

You can check your performance of this question after Login/SignupLogin

Start

Question 5

Time: 00:00:00

Choose the correct answer
Which of the following data structure may give overflow error, even though the current number of element in it is less than its size?

Queue implemented in a linear array

Queue implemented in a circularly connected array

Stack implemented in a linear array

none of these

Good Job!

Oops!

Report the answer

How to use PrepInsta Quiz

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Queue implemented in linear array

in queue of size 10

1) after inserting 10 element Front = 1 ,Rear = 10
2) then delete 9 element ater this Front = 10 , Rear = 10

array has 9 empty location but can not insert even a 1 new element because at the insertion it cheak Rear==Size of the queue

Please login to submit your explanation

You can check your performance of this question after Login/SignupLogin

Start

Question 6

Time: 00:00:00

Choose the correct answer
A is an empty stack. The following operations are done on it.
PUSH(1)
PUSH(2)
POP
PUSH(5)
PUSH(6)
POP
What will the stack contain after these operations. (Top of the stack is underlined)

_5_ 6

1 _5_

_5_ 6

_1_ 5

Good Job!

Oops!

Report the answer

How to use PrepInsta Quiz

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Currently there is no PrepInsta Explanation. Did you know?

You can also submit your own version of explanations under user explanation section and also view other submitted explanations by other users.

Please login to submit your explanation

You can check your performance of this question after Login/SignupLogin

Start

Question 7

Time: 00:00:00

A stack is implemented as a linear array A[0…N-1]. Noor writes the following functions for popping
an element from the stack.
function POP( top, N )
{
if(X)
{
top = top - 1
}
else
{
print "Underflow"
}
return top
}
Fill in the condition X

top< N-1

top

top>1

top >= 0

Good Job!

Oops!

Report the answer

How to use PrepInsta Quiz

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Currently there is no PrepInsta Explanation. Did you know?

You can also submit your own version of explanations under user explanation section and also view other submitted explanations by other users.

Please login to submit your explanation

You can check your performance of this question after Login/SignupLogin

Start

Question 8

Time: 00:00:00

How many stack/s need for implementing a queue?

Good Job!

Oops!

Report the answer

How to use PrepInsta Quiz

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Currently there is no PrepInsta Explanation. Did you know?

You can also submit your own version of explanations under user explanation section and also view other submitted explanations by other users.

Please login to submit your explanation

You can check your performance of this question after Login/SignupLogin

Start

Question 9

Time: 00:00:00

Choose the correct answer
A queue is implemented by a linear array of size 10 (and not as a circularly connected array). Front and Rear are represented as an index in the array. To add an element, the rear index is incremented and the element is added. To delete an element, the front index is incremented. The following operations are done on an empty queue.
ADD 1; DELETE; ADD 2; ADD 3; ADD 4; DELETE, DELETE
After this set of operations, what is the maximum capacity of the queue?

None

Good Job!

Oops!

Report the answer

How to use PrepInsta Quiz

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

in queue initially the both Front and Rear assigned by the value -1 means the queue is empty

the size of the queue is 10 (array index no from 0 to 9)

ADD 1 it will increment both Front and Rear (in case of first element)
DELETE deletion of element set the Front and Rear to -1(queue is empty)
ADD 2 Front = 0 ,Rear = 0
ADD 3 Front = 0 ,Rear = 1
ADD 4 Front = 0 ,Rear = 2
DELETE Front = 1 ,Rear = 2
DELETE Front = 2 ,Rear = 2

now the empty location in the queue is 7 so the maximum capacity of queue is b)7

Please login to submit your explanation

You can check your performance of this question after Login/SignupLogin

Start

Question 10

Time: 00:00:00

how many arrays are required to implement a priority queue?

Good Job!

Oops!

Report the answer

How to use PrepInsta Quiz

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Currently there is no PrepInsta Explanation. Did you know?

You can also submit your own version of explanations under user explanation section and also view other submitted explanations by other users.

Please login to submit your explanation

You can check your performance of this question after Login/SignupLogin

Start

["0","40","60","80","100"]

["Need more practice! \r\n \r\n","Keep trying! \r\n \r\n","Not bad! \r\n \r\n","Good work! \r\n \r\n","Perfect! \r\n \r\n"]

Please login to report

Personalized Analytics only Availble for Logged in users

Analytics below shows your performance in various Mocks on PrepInsta

Your average Analytics for this Quiz

Rank

Percentile

Start Preparing

Detailed performance

Completed

0/10

Accuracy

Related Banners

Prepinsta Prime

Get Prepinsta Prime

Get all 200+ courses offered by Prepinsta

Explore Prime or check Course List

Check out our instagram

Never Miss an OffCampus Update

Get OffCampus Updates on Social Media from PrepInsta

Instagram

Get Hiring Updates

Amazon,Google,Delottie & 30+companies are hiring ! Get hiring Updates right in your inbox from PrepInsta

PrepInsta Prime

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others.

Get Prime Course List

PrepInsta Prime

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others.

Get Prime Course List