gs gs121 Abstract Data Types - Queue using Stacks - Quiz No.1

gs gs121 Data Structures and Algorithms Quiz

This quiz belongs to book/course code gs gs121 Data Structures and Algorithms of gs organization. We have 169 quizzes available related to the book/course Data Structures and Algorithms. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Abstract Data Types. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.

NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.

Question 1: A Double-ended queue supports operations such as adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What are the total number of stacks required for this operation?(you can reuse the stack)

Question 2: You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ‘n’ and there are ‘m’ number of variables in this stack. The time complexity of performing deQueue operation is (Using only stack operations like push and pop)(Tightly bound).

O(m)

O(n)

O(m*n)

Data is insufficient

Question 3: Consider you have an array of some random size. You need to perform dequeue operation. You can perform it using stack operation (push and pop) or using queue operations itself (enQueue and Dequeue). The output is guaranteed to be same. Find some differences?

They will have different time complexities

The memory used will not be different

There are chances that output might be different

No differences

Question 4: Consider you have a stack whose elements in it are as follows.
5 4 3 2 << top
Where the top element is 2.
You need to get the following stack
6 5 4 3 2 << top
The operations that needed to be performed are (You can perform only push and pop):

Push(pop()), push(6), push(pop())

Push(pop()), push(6)

Push(pop()), push(pop()), push(6)

Push(6)

Question 5: A double-ended queue supports operations like adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What’s the time complexity of performing addFront and addRear? (Assume ‘m’ to be the size of the stack and ‘n’ to be the number of elements)

O(m) and O(n)

O(1) and O(n)

O(n) and O(1)

O(n) and O(m)

Question 6: Why is implementation of stack operations on queues not feasible for a large dataset (Asssume the number of elements in the stack to be n)?

Because of its time complexity O(n)

Because of its time complexity O(log(n))

Extra memory is not required

There are no problems

Question 7: Consider yourself to be in a planet where the computational power of chips to be slow. You have an array of size 10.You want to perform enqueue some element into this array. But you can perform only push and pop operations .Push and pop operation both take 1 sec respectively. The total time required to perform enQueue operation is?

Question 8: You have two jars, one jar which has 10 rings and the other has none. They are placed one above the other. You want to remove the last ring in the jar. And the second jar is weak and cannot be used to store rings for a long time.

Empty the first jar by removing it one by one from the first jar and placing it into the second jar

Empty the first jar by removing it one by one from the first jar and placing it into the second jar and empty the second jar by placing all the rings into the first jar one by one

NVAEducation

gs gs121 Abstract Data Types - Queue using Stacks - Quiz No.1

gs gs121 Data Structures and Algorithms Quiz

Online Quizzes of gs121 Data Structures and Algorithms

Other DS related online quizzes

Other categories of gs Online Quizzes

Other organizations

Virtual University

Gegasoft

Theme Customizer