Stacks and Queues Questions for NTT Data with Solutions

Question 1

Time: 00:00:00
Which of the following is the correct postfix format for this infix format  A + B – C + D

-+DC+BA

-+DC+BA

AB+CD+-

AB+CD+-

+BA-+CD

+BA-+CD

None of these

None of these

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

Please login to submit your explanation

Start

Question 2

Time: 00:00:00
Match the following -
Group A             Group B
A. Stacks 1. Matrix Multiplication
B. Queue  2. Fastest Search
C. Arrays 3. FIFO
D. Trees 4. LIFO

A1, B3, C4, D2

A1, B3, C4, D2

A4, B3, C1, D2

A4, B3, C1, D2

A4, B3, C2, D1

A4, B3, C2, D1

A1, B3, C2, D4

A1, B3, C2, D4

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

Please login to submit your explanation

Start

Question 3

Time: 00:00:00
Priya has a box that looks like a stack and she does the following operations on empty box

  • PUSH(8)

  • PUSH(7)

  • POP

  • PUSH(1)

  • PUSH(3)

31_8

31_8

8_1_7

8_1_7

8_1_

8_1_

None of these

None of these

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

Please login to submit your explanation

answer should be 318

Start

Question 4

Time: 00:00:00
Cloe has x number of stacks her father wants her to write a program that can perform as a queue. What will you suggest to her how many stacks must she use?

1

1

2

2

4

4

3

3

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

Please login to submit your explanation

Start

Question 5

Time: 00:00:00
Shalaka wants to implement a priority queue using stacks. What is the minimum number of stacks that she needs to be able to write a code for this

1

1

2

2

3

3

4

4

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

Please login to submit your explanation

Start

Question 6

Time: 00:00:00
These operations can be performed on which type of structure?

Push, Pop, Peek

Queue

Queue

Priority Queue

Priority Queue

Stack

Stack

Both 1 and 2

Both 1 and 2

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

Please login to submit your explanation

Start

Question 7

Time: 00:00:00
Which one of the following is an application of Queue Data Structure?

When a resource is shared among multiple consumers.

When a resource is shared among multiple consumers.

When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes

When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes

Load Balancing

Load Balancing

All the above

All the above

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

Please login to submit your explanation

Start

Question 8

Time: 00:00:00
The retrieval of items in a stack is ……….. operation.

 

push

push

pop

pop

retrieval

retrieval

access

access

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

Please login to submit your explanation

Start

Question 9

Time: 00:00:00
In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.

-1, -1

-1, -1

0, -1

0, -1

0, 0

0, 0

-1, 0

-1, 0

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

Please login to submit your explanation

Start

Question 10

Time: 00:00:00
When new data are to be inserted into a data structure, but there is not available space; this situation is usually called .......

Memory Leak

Memory Leak

Memory Full

Memory Full

OverLeak

OverLeak

Overflow

Overflow

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

Please login to submit your explanation

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"]