Scribd
Upload
38 views3 pages

Fill in The Blanks

The document provides a chapter assignment on data structures with Python that includes fill-in-the-blank, true/false, and application questions about stacks, queues, and other data structures. Students are asked to identify properties of different data structures like LIFO, FIFO and the terms used for insertions and deletions from stacks and queues. Several questions also involve applying knowledge of data structures to solve problems involving operations on stacks and evaluating postfix expressions.

Uploaded by

Viplav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
38 views3 pages

Fill in The Blanks

The document provides a chapter assignment on data structures with Python that includes fill-in-the-blank, true/false, and application questions about stacks, queues, and other data structures. Students are asked to identify properties of different data structures like LIFO, FIFO and the terms used for insertions and deletions from stacks and queues. Several questions also involve applying knowledge of data structures to solve problems involving operations on stacks and evaluating postfix expressions.

Uploaded by

Viplav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

AMITY INTERNATIONAL SCHOOL, PUSHP VIHAR

ASSIGNMENT – 9
CHAPTER 5: DATA STRUCTURES WITH PYTHON
Subject: Computer Science
Class: XII

Fill in the blanks:


1. The end from which elements are added or deleted is called _________ of a

stack.
2. Trying to add an element to a full stack results in an exception called
__________.
3. Built-in method of list to add an element to the stack. ______________
4. Trying to pop an element from an empty stack results into a special condition
called________ .
5. Queue is an ordered linear data structure, following ___________ strategy.
6. The process of inserting an element in stack is called _________________.
7. The process of removing an element from stack is called ______________.
8. If the elements "A", "B", "C" and "D" are placed in a queue and are deleted one
at a time, in what order will they be removed? ______________________.
9. In a Queue, insertions take place at _____ end.
10.In a queue, deletions take place at _____ end.

True/False:

1. Single ended linear structure is a type of a queue data structure.

2. Reversing a word/line is an application of stack.

3. A queue behaves on the basis of LIFO principle.

4. Stack is a linear data structure.

5. PUSH operation may result in underflow condition.

6. An element from a queue is added from the front end.

7. The append() function inserts an element at the rear end in a queue.

8. A data structure is a logical way of organising data in memory that considers

not only the items stored but also the relationship between the items.
9. Handling the processes of a network printer is the most important application

of queues.
10. A stack behaves on the basis of LIFO principle.
Assertion and Reasoning Based Questions:

(a) A is True but R is False.

(b) A is False but R is True.

(c) Both A and R are True and R is the correct explanation of A.

(d) Both A and R are True but R is not the correct reason of A.

(e) Both A and R are False.

1. Assertion(A): A data structure that contains the value sequentially or linearly is known

as linear data structure.

Reason(R): Lists and tuples are linear data structures.

2. Assertion (A): The major implementation of using a data structure is to manage the

storage of data in the memory efficiently.

Reasoning (R) : Data Structure refers to the way memory is allocated for holding data

using minimum space. It leads to faster data access during the execution of the program.

Application Based Questions

1. Consider the following operation performed on a stack of size 5. Push(1); Pop(); Push(2); Push(3); Pop();
Push(4); Pop(); Pop(); Push(5); After the completion of all operation, the number of elements present in
stack is?
2. What is the value of the postfix expression 6 3 2 4 + – *?

3. The postfix form of A*B+C/D is?

Source Based Questions:


Read the case and answer the following questions.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy