Data Structure - 1 : Linear List || Type A || Sumita arora || Class 12 || Computer Science || Solution

Data Structure - 1 : Linear List  || Type A || Sumita Arora || Class 12 || Computer Science || Solution

 

 

Q 1 =What are data structures? Name some common data structures,

Q 2 = Is data structure related to a data type? Explain.

Q 3 = What do you understand by linear and non-linear data structures?

Q 4 = Name some linear data structures. Is linked list a linear data structure?

 

Q5. What is the working principle of data structures stack and queues?




Q6. What is a linear list data structure? Name some operations that you can perform on linear lists.




Q7. Suggested situations where you can use these data structures: (i) linear lists, (ii) stacks, (iii) queues.




Q8. What is a list comprehension? How is it useful?




Q9. Enlist some advantages of list comprehensions.




Q10. In which situations should you use list comprehensions and in which situations you should not use comprehensions?




Q11. What is a nested list? Give some examples.




Q12. What is a two dimensional list? How is it related to nested lists?



Q13. Suggest a situation where you can use a regular two dimensional list.




Q14. What are ragged lists? How are these different from two dimensional lists?




Q15. Suggest a situation where you can use ragged list?




Q16. How are lists internally stored? How are 2D lists internally stored?




Q17. Consider the following code and show how internally the memory is assigned to these

List1 = [2, 3]
List2 = [3, 4, 5]
List3 = [List1, List2]

Assume that the numbers 1..10 are stored in the memory addresses 16000 onwards, each consuming 16 bytes of memory.