Answer Posted / Ashish Nigam
1. Random Access: Linked lists do not support random access as elements are stored in a sequential manner, which makes finding an element at a specific index slower. 2. Memory Inefficiency: Due to the overhead of storing pointers, linked lists can use more memory than arrays for large datasets.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What sort of serious problems have you experienced, and how have you handled them?
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.
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Can you declare an array without assigning the size of an array?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Write a program for Sorting an Array. Which sorting will you prefer?
