Chapter 4 - Class 11 Computer
Chapter 4 ko document-style printable page me arrange kiya gaya hai taake lists, stacks, queues aur graphs ko board prep ke liye aik hi flow me revise kiya ja sake.
Printable Notes
Yeh page Data Structures chapter ko document format me organize karta hai. Is me notes, solved exercises aur important questions aik printable flow me diye gaye hain taake student bina extra clicks ke revise kar sake.
Data Structures chapter data ko organize aur access karne ke basic models samjhata hai. Lists, stacks, queues, trees aur graphs is chapter ke main anchors hain.
Yeh notes chapter ke concepts ko definition se zyada practical angle se explain karte hain taake student operations aur examples dono samajh sake.
List flexible data structure hai jisme multiple values aik jagah store ki jati hain. Python context me list dynamic hoti hai aur append, insert, remove jaise operations support karti hai.
Stack LIFO principle follow karta hai jab ke queue FIFO. Dono structures operations ke through real-life examples ke sath asani se samjhay ja sakte hain.
Tree hierarchical relations dikhata hai aur graph connected nodes ka network represent karta hai. Yeh dono chapter ke higher-level concepts hain lekin basic definition aur properties paper me enough hoti hain.
Plates ki stack is ka simple example hai. Last rakhi hui plate sab se pehle nikalti hai, isi ko LIFO kehte hain.
Line me kharay log queue ka basic example hain. Pehla banda pehle jata hai, isi ko FIFO bola jata hai.
Solved exercise blocks se operation names aur descriptive answers ko yaad rakhna easy hota hai. Data structures me real-life examples strong marks dilate hain.
Python list me naya item add karne ke liye konsa function use hota hai?
Correct answer: append()
Correct answer 'append()' hai kyun ke yeh list ke end me naya item add karta hai. `insert()` specific position ke liye hota hai, jab ke `remove()` aur `pop()` items nikalte hain.
len() function ka kya kaam hai list me?
Correct answer: List ki length batata hai
Correct answer 'List ki length batata hai' hai kyun ke `len()` total items count karta hai. Yeh item add ya remove nahi karta.
Stack me item remove karne ka operation kya kehlata hai?
Correct answer: Pop
Correct answer 'Pop' hai kyun ke stack me last item nikalne ka operation pop hota hai. `Push` add karne ke liye hota hai.
Queue me item add karne ka operation kya kehlata hai?
Correct answer: Enqueue
Correct answer 'Enqueue' hai kyun ke queue ke end me naya item add karne ko enqueue kehte hain. `Dequeue` remove karne ke liye hota hai.
Python list ka size fixed nahi hota. New items add ya remove kiye ja sakte hain, is liye runtime par data ko flexible tareeqe se manage kiya jata hai.
Stack LIFO principle follow karta hai. Plates ki stack me jo plate sab se last rakhi jati hai, woh sab se pehle nikalti hai. Isi logic ko push aur pop operations se samjhaya jata hai.
Queue FIFO follow karti hai. Naya item end me add hota hai aur pehla item front se remove hota hai. Line me kharay log iski best simple example hain.
Tree hierarchical data structure hai jahan root node top par hoti hai aur us ke neeche children aur levels bante hain. Height structure ki depth ko samjhane me help karti hai.
Graph nodes aur edges ka structure hota hai. Directed graph me edge ki direction hoti hai, jab ke undirected graph me relation dono taraf se same samjha jata hai.
Important questions chapter ke core structures aur un ke operations ko target karte hain. In se short-answer base strong hoti hai.
insert(index, value) list ke specific position par item add karta hai.
Stack ek data structure hai jo LIFO yani Last In First Out principle follow karta hai.
Queue FIFO yani First In First Out principle follow karti hai jahan pehla item pehle remove hota hai.
enqueue() item add karta hai, jab ke dequeue() item remove karta hai.