Discussion
In which of the following cases, linked list implementation of sparse matrices consumes the same memory space as the conventional way of storing the entire array?
Answer: C
Conventional way needs storage of m x n
In the case of linked list implementation of sparse matrices, storage needed will be(the number of non-zero entries).
Only in case(c), both the methods need the same storage of 30.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development