Answer Posted / Ravindra Nath Pandey
1. Inefficient for direct random access because elements are not stored in contiguous memory locations.
2. Extra space for pointers is required for each node which can lead to increased memory usage compared to arrays.
3. Insertion and deletion operations are slower due to the need to traverse through the list until the desired position is found.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
What sort of serious problems have you experienced, and how have you handled them?
Can you declare an array without assigning the size of an array?
Write a program for Sorting an Array. Which sorting will you prefer?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
