1 Shot and PYQs of Data Structure - Stack in Python | Important Questions Class 12 Computer Science

1 Shot and PYQs of Data Structure - Stack in Python
Important Questions Class 12 Computer Science
Notes:

In this video, we will discuss the 1 shot and PYQs (previous year questions ) and important questions of Data Structure in Python for Class 12 Computer Science

Previous Year Questions
CBSE issued Sample Papers

-------------------------------------------------------------------------------------------------------------------
Follow us On:
-------------------------------------------------------------------------------------------------------------

Rock in Board Series (2022-23)

Join this channel to get access to perks:

Click on this link to visit the online store to buy the customised products.
------------------------------------------------------------------------------------------------------------------------------------

📗 Class 12 Computer Science with Python

✅ Access Channel’s Playlist

✅ LIVE Sessions (2021 – 22)

✅NCERT Solutions Class 12

✅Objective Type Questions (1 Mark Questions Chapterwise)

✅Functions in Python

✅Using Python Libraries:

✅Data Structures: Stack and Queue

✅File Handling:

✅Computer Networks:

✅Interface Python with MYSQL:

✅MYSQL

✅ Programs for Practical File

✅Programming Corner:

✅Output Based Questions:

✅1 Shot Revision Series

✅Important Questions and Previous Year Questions Chapterwise
---------------------------------------------------------------------------------------------------------------------------------
📘 Class 11 Computer Science with Python

📘 NCERT Solutions Class 11

📘 Basics of Python

📘 Flow of Control

📘 String Manipulation

📘 List Manipulation

📘 Dictionaries

📘 Python Modules

[MemoriesUdit]

At 1:42:37, the code is written wrong.
It should be N<len(Lpop).

Btw it's good to see a teacher like you, putting efforts for betterment of students😊

[John-l]

an alternate easy code for 41:00 ..btw nyc session mam
n = [12, 13, 34, 56, 21, 79, 98, 22, 35, 38]

def push(stack, i):
stack.append(i)

def pop(stack):
if len(stack)==0:
print("underflow")
for i in range(0, len(stack)):
print(stack.pop(), end = " ")


stack =[]
for i in n:
if i%2==0:
push(stack, i)

pop(stack)

[_Moonixx_]

Bhai mujhe koi bta do ki yeh infix postfix aa rha h ya nhi....I am confused....

[akshitamukati_ci-]

mam 2:29 pe ye code likh sakte hai exam mai

R={"om":76, "jai":45, "bob":89, "ali":65, "anu":90, "tom":82}
key=[]
def Push(key):
for i in R:
if R[i]>=75:
key.append(i)
def Pop(key):
while key !=[]:
print(key.pop(), end=' ')
Push(key)
Pop(key)

[tekionixkeshavag.]

At 15:28, we can also do
elif ch==3:
print(Stack[::-1])

Mam also please adjust your video so it does not hide the content behind...pls adjust the ppt's content to fit this ...

[tekionixkeshavag.]

At 1:48:27, I think the solution is wrong ... directly we can't access.. it is the case of nested list...

I think this should be right :

def Push_element(L):
for i in range(len(L)):
if L[i][2]=='Goa':
status.append ( [ L [i] [0] , L [i] [1] ] )

def Pop_element(L):
while True:
if len(status)!=0:
print(status.pop())
else:
break
print("Stack is Empty")

status=[ ]
L=[["Gurdas",
Push_element(L)
Pop_element(L)

[rishabkumartripathy]

Mam iss ch se aaise prog. Aate h ??
Ya (A+/B×) k??? At 24:02
Hmare school me statement wala prog. ni kraya gya h

[John-l]

an alternate easy code for 27:00 ..btw nyc session mam
r = {"OM":76, "JAI":89, "RAJ":45, "HANY":100, "RAHUL":18}


def push(stack, name):
stack.append(name)

def pop(stack):
if len(stack) == 0:
print("underflow")
else:
for i in range(0, len(stack)):
print(stack.pop(), end=" ")


stack = []
for i in r:
if r[i]>75:
push(stack, i)

pop(stack)

[nikobellic]

Anyone else regreting to opt cs as optional

[mohammedgandhi]

Stacks
concept ✅
Pyq's and extra questions ✅
All thanks to SWATI MAM🙏

[MR-X]

Mam at 55:55 we can take separate push and pop
Or we merge them

[anirudhnair]

31:20 mam why is there a need to define a push function separately when we can directly append elements into the stack using the following code
R={#GIVEN DICTIONARY}
t={#stack in which elemnts has to be inserted}
def push(R, t)
for k in R:
if R[k].75:
t.append(R)

[kookietata_-klpj]

HUGE thanks to all your efforts ma'am!! Very helpful series for all the CS students..thanks a lott🥰❤

[pushpamrastogi]

Ye stack ka code book ke according krna jruri h kya?

[John-l]

r = {"OM":76, "JAI":89, "RAJ":45, "HANY":100, "RAHUL":18}


def push(stack, name):
stack.append(name)

def pop(stack):
if len(stack) == 0:
print("underflow")
else:
for i in range(0, len(stack)):
print(stack.pop(), end=" ")


stack = []
for i in r:
if r[i]>75:
push(stack, i)

pop(stack)

[Vickyy__.]

Watching this video at @8:30 April 2nd😅😂

[saksham_]

28:30 it's given write program separately but you have written in continuation of one program only

[ridhijindal]

Mam at 39:30 where we stored the value for return.... Like we just printed and called the yunction without storing value in identifier

[NithyaShree-lvmy]

You are the best computer teacher on youtube.. 😊


Also Ma'am, your video blocks the info in the ppt, can you please reduce the sixe of the content in ppt..

[bhaskarpandey]

Mam jo aap live class mein programming ke pyq questions karti ho it is enough or not for board exam because mam playlist bhot questions hai mam please reply