Advertisements
Online Mock Tests
Chapters
1: Review of Phython
2: Concept of Object Oriented Programming
3: Classes in Python
4: Inheritance
Unit -2 : Advanced Programming with Python
1: Liner List Manipulation
▶ 2: Stacks & Queues in list
3: Data File Handling
4: Exception Handling & Generate Functions
Unit -3 : Databases Management Systems and SQL
1: Databases Concepts and SQL
2: Structure Query Language
Unit -4 : Introduction to Boolean Algebra
1: Boolean Algebra
2: Boolean Functions and Reduce Forms
Chapter 3: Application of Boolean Logic
Unit -5 : Communication Technologies
Chapter 1: Networking Concepts Part I
Chapter 2: Networking Concepts Part II
Chapter 3: Networking Protocols
Chapter 4: Mobile Telecommunication Technologies, Network Security and Internet Services
![CBSE solutions for कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ chapter 2 - Stacks & Queues in list - Shaalaa.com](/images/computer-science-with-python-english-class-12_6:c0c1e36c6bb846c19fd1bb8caad8e289.jpg "CBSE solutions for कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ chapter 2 - Stacks & Queues in list")
Advertisements
Solutions for Chapter 2: Stacks & Queues in list
Below listed, you can find solutions for Chapter 2 of CBSE CBSE for कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२.
CBSE solutions for कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ 2 Stacks & Queues in list EXERCISE [Page 123]
Expand the following:
LIFO
Expand the following:
FIFO
What is stack?
What is Queue?
What are all operations possible in data structure?
Give one example of infix expression.
Give one example of postfix expression.
Give one example of prefix expression.
Convert (A+B)*C into postfix form.
Evaluate using stack 10, 3,*,30,2,*,-
Converting following Infix expression to Postfix notation:
(A+B)*C+D/E-F
Converting following Infix expression to Postfix notation:
P+Q*(R-S)/T
Converting following Infix expression to Postfix notation:
(True And False) | | (False And True)
Evaluation the following Postfix Expression:
20,8,4,/,2,3,+,*,-
Evaluation the following Postfix Expression:
15,3,2,+,/,7,+,2,*
Evaluation the following Postfix Expression:
False, Not, True, And, True, False, Or, And
Evaluation the following Postfix Expression:
True, False, Not, And, False, True, Or, And
Write the push operation of stack containing names using class.
Write the pop operation of stack containing numbers using class.
Write the insertion operation of queue containing character using class.
Write the deletion operation of a queue containing numbers using a class.
Write any two examples of stack operations.
Write any two examples of pop operation.
Write an algorithm to evaluate a postfix expression.
Write an algorithm to convert infix to postfix.
Write an algorithm to implement push operation.
Write an algorithm to implement pop operation.
Write an algorithm to implement insertion operation of queue.
Write an algorithm to implement deletion operation of queue.
Write a function to push any student's information to stack.
Write a function to add any customer's information to queue.
Solutions for 2: Stacks & Queues in list
CBSE solutions for कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ chapter 2 - Stacks & Queues in list
Shaalaa.com has the CBSE Mathematics कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ CBSE solutions in a manner that help students grasp basic concepts better and faster. The detailed, step-by-step solutions will help you understand the concepts better and clarify any confusion. CBSE solutions for Mathematics कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ CBSE 2 (Stacks & Queues in list) include all questions with answers and detailed explanations. This will clear students' doubts about questions and improve their application skills while preparing for board exams.
Further, we at Shaalaa.com provide such solutions so students can prepare for written exams. CBSE textbook solutions can be a core help for self-study and provide excellent self-help guidance for students.
Concepts covered in कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ chapter 2 Stacks & Queues in list are .
Using CBSE कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ solutions Stacks & Queues in list exercise by students is an easy way to prepare for the exams, as they involve solutions arranged chapter-wise and also page-wise. The questions involved in CBSE Solutions are essential questions that can be asked in the final exam. Maximum CBSE कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ students prefer CBSE Textbook Solutions to score more in exams.
Get the free view of Chapter 2, Stacks & Queues in list कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ additional questions for Mathematics कॉम्प्युटर सायन्स विद पाइथान [इंग्रजी] इयत्ता १२ CBSE, and you can use Shaalaa.com to keep it handy for your exam preparation.
