STACKS - Previous Year's Imp MCQs Solved | Data Structures | For All Computer Science Exams | DSA
HTML-код
- Опубликовано: 21 окт 2024
- Stacks & It's implementations are key concepts in the Data Structures/DSA.
Some important questions of DSA under Stack topic we have created in this session for practicing and boosting important concepts for all upcoming exams of Computer Science and Information Technology.
We have discussed all the questions in detail, with conceptual clarity and focussed on application part of the stack data structures which is most important for competitive exam preparations.
If you are also an aspirant for computer science exams like GATE, UGC NET, ISRO, BARC, IT Officers, NIELIT, AFCAT, PGT Computer Science, PGTRB, KVS, NVS, APS, RRB JE CS/IT, Railways, Banking and all other state PSCs for technical posts like Assistant Professor or IT Engineer, then must join our sessions for free and you will get daily MCQs session here, which will improve and enhance your score and marks in the exam.
Stay tuned,
Jai Hind, Jai Bharat.
Thank You.
#Stacks #DataStructures #StackDataStructure #DSAMCQs
"Important MCQs Of DSA"
"Basics Of Stacks & Data Structures "
"DSA Concepts"
Excellent teaching... please upload videos on gate and PSU previous year Questions
Excellent! It is really helpful. please continue the series.
Ur all videos r very useful to us.explanation also good.we expect more mcq videos in computer science.
Bahut achche samjhaya h thank you medam
Really easy to catch the topic.
Sir create one video for expected topic or any guess kind of video for CS NET
EXPLANATION IS SO NICE!
Best teacher evr
Please upload KVS and NVS previous years question discussion
your are best in world........
Ur way of teaching is nice pls upload more videos like this
Good explain it
MCQ on introduction to data structures
Excellent
Very nice explanation
Excellent plz tell arrays
thanks
Very nice sir
Superb sir
Too much good😇
Increase the hardness
Nice 👍👌
Thank you so much sir for a excillent session
Thank you so much sir
Very helful video
Glad it was helpful!
09:10 answer should be last node.
Thanks sir very useful explanation
Always welcome
J'ai shree ganesh😊😢😮😅😢❤🎉
Really useful sir keep rocking
Thank you for the great feedback.. Suganya, keep watching.
Nice explanation sir
Thanks and welcome
Super sir
Good sir
Sir when come trb exam
Please put lot papers for paper 1 and 2 comp.sci
You mean sir Last node will be at top(0) position
Will provide its implementation with code, soon so that the concept would be more clear, Stay Tuned.
Stack
1 question ka hi solution wrong hn in stack FILO so how can you that LIFO is correct answer.
FILO - first in last out
LIFO - last in first out
Question no 9 ka solun ma sir ( A+B )*(C*D-E)*F/G ho ga n sir
Okiee dokiee___Press F
In which tree each node can have zero or two children?
Full binary tree A tree in which each node has exactly zero or two children is called full binary tree. A tree in which the degree of each node is 2 except leaf nodes is called perfect binary tree.
Linked list ke MCQ bhi karva do previous years wale
Already Uploaded, Please Check Previous Videos.
Sir can you attach the PDF in description
350
Sir plzz explain ques 9 again
For q no 8???
First sabse niche nahi hogi kya sir question 8 mein
First Node Will Be Considered As TOP Position Of Stack, Each new element will be added on the first position of the node Order of TC-O(1).
Thanks sir
Q11: why stack size is 3 only
D
A
Sir can u give the ppt
Push
Ques 8 explanation is not clear.
Sir a no 9 that is not e its f
For Question 9 - You can match it with option C.
Jac board
Lifo
Good👍
Thanks for the feedback, Stay tuned for more sessions.
Stack
D
A