DS Internal Lab1

Neha is learning about data structures in her computer science class. What are the main operations of a stack?

• The main operations of a stack are 'push' and 'pop'.

• add and remove

• insert and delete

• enqueue and dequeue

Anika is trying to organize her books using a queue system. How does she implement a queue using an array?

• Anika can only use a stack to implement a queue.

• A queue can be implemented using an array by maintaining an array for storage and using enqueue and dequeue operations to add and remove elements.

• A queue is implemented by simply adding elements without any removal process.

• A queue can be implemented using a linked list with no array involved.

Aarush is organizing his bookshelf and needs to quickly add or remove books. What is the time complexity of push and pop operations in a stack?

• O(1)

• O(n^2)

• O(n)

• O(log n)

Dia is organizing her tasks for the day. She needs to manage her to-do list efficiently. Describe a real-world application of stacks in this scenario.

• Task scheduling

• File storage management

• Data encryption

• Web browser history management.

Aditi has a collection of books and wants to organize them. She decides to use two different methods: a stack and a queue. What is the difference between a stack and a queue?

• A stack can hold only integers, while a queue can hold any data type.

• Both stack and queue use LIFO.

• A stack uses LIFO, while a queue uses FIFO.

• A stack uses FIFO, while a queue uses LIFO.

Krish is trying to organize a line of students for a school event. How can he implement a queue using two stacks?

• Use a single stack and reverse the order of elements for dequeueing.

• Use two stacks: one for enqueueing and one for dequeueing. Transfer elements between stacks as needed.

• Implement a queue using three stacks for better performance.

• Use an array to store elements and manage the queue operations directly.

Krish is working on a project that involves managing tasks in a computer system. He needs to understand the applications of queues in computer science.

• Applications of queues include task scheduling, print job management, breadth-first search, and request handling in web servers.

• File compression techniques

• Data encryption methods

• Image rendering algorithms

Aarush is working on a project that involves using a stack data structure. He wants to know the purpose of the peek operation in a stack.

• To check if the stack is empty.

• To add a new element to the top of the stack.

• To view the top element of the stack without removing it.

• To remove the top element from the stack.

In a classroom, Alisha is trying to organize her notes for studying. What are the advantages of using a stack over a queue for her notes?

• Queues are better for backtracking than stacks

• Stacks are always more memory efficient than queues

• Stacks allow for LIFO access, easier backtracking, and can be more memory efficient.

• Queues allow for LIFO access

Kabir is trying to solve a math problem that involves checking if a given expression has balanced parentheses. How can he do this using a stack?

• Ignore the parentheses and evaluate the expression normally.

• Use a stack to track opening parentheses and ensure they are matched by closing parentheses.

• Count the number of parentheses and check if it's even.

• Use a queue to store the parentheses as they appear.