Class 12 CS Chapter 9 Back Exercise Solutions Sumita Arora New Syllabus

/ listing12CSSA, Uncategorized / By
17. Consider the following code and show how internally the memory is assigned to these
1. What are data structures ? Name some common data structures.
...
click here for answer
2. Is data structure related to a data type ? Explain.
...
click here for answer
3. What do you understand by linear and non-linear data structures ?
...
click here for answer
4. Name some linear data structures. Is linked list a linear data structure ?
...
click here for answer
5. What is the working principle of data structures stack and queues ?
...
click here for answer
6. What is a linear list data structure ? Name some operations that you can perform on linear lists.
...
click here for answer
7. Suggested situations where you can use these data structures: (i) linear lists , (ii) stacks, (iii) queues.
...
click here for answer
8. What is a list comprehension ? How is it useful ?
...
click here for answer
9. Enlist some advantages of list comprehensions.
...
click here for answer
10. In which situations should you use list comprehensions and in which situations you should not use list comprehensions ?
...
click here for answer
11. What is a nested list ? Give some examples.
...
click here for answer
12. What is a two dimensional list ? How is it related to nested lists ?
...
click here for answer
13. Suggest a situation where you can use a regular two dimensional list.
...
click here for answer
14. What are ragged lists ? How are these different from two dimensional lists ?
...
click here for answer
15. Suggest a situation where you can use ragged list ?
...
click here for answer
16. How are lists internally stored ? How are 2D lists internally stored ?
...
click here for answer